The full text of this article


Spatial-Temporal relation-based Energy-Efficient Reliable routing protocol in wireless sensor networks
by Min Chen, Taekyoung Kwon, Shiwen Mao, Victor C.M. Leung
International Journal of Sensor Networks (IJSNET), Vol. 5, No. 3, 2009


Abstract: Delivering sensory data to the sink reliably in Wireless Sensor Networks (WSNs) calls for a scalable, energy-efficient and error-resilient routing solution. In this paper, a Spatial-Temporal relation-based Energy-Efficient Reliable (STEER) routing protocol is proposed to achieve the above goals. As opposed to the next-hop-selection-first, data-relay-next approach, which is typical in traditional routing protocols in WSNs, STEER reverses these two steps. In STEER, each data packet is relayed by broadcasting, and, among the neighbours (closer to the sink) that receive the data, one next-hop node will be elected. In so doing, eligibility as a next hop is evaluated by temporal gradient, which is similar to backoff for channel access in IEEE 802.11 systems. The value of temporal gradient is determined locally by the spatial information of each neighbour. To quantify the temporal gradient systematically, a spatial-temporal mapping function is proposed. Comprehensive simulations show that STEER performs well to provide efficient and robust routing in highly unreliable WSNs.

Online publication date: Mon, 08-Jun-2009


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email