An online energy-efficient routing protocol with traffic load prospects in wireless sensor networks
by Jun Liu, Xiaoyan Hong
International Journal of Sensor Networks (IJSNET), Vol. 5, No. 3, 2009

Abstract: In wireless sensor networks, many routing algorithms are designed to implement energy-efficient mechanisms. Among those, some focus on maximising an important performance index called network lifetime, which is the number of messages successfully delivered in the network before a failure. In this paper, we propose a new online algorithm taking the goal of prolonging network lifetime. When making routing decisions, our algorithm, named Traffic-Aware Energy Efficient (TAEE) routing protocol, utilises prospective traffic load information for further load balance, in addition to power-related metrics used in an enhanced cost function in calculating least cost paths. An algorithm for automatic parameter adaption is also described. To better accommodate to large-scale sensor networks, we further introduce a random grouping scheme which enables hierarchical TAEE routing to run within and cross the dynamically formed groups to reduce computation and routing overhead, while maintaining global energy efficiency. Our simulation shows that compared with the leading power-aware Max-min ZpMIN protocol, the TAEE protocol generates better performance in terms of network lifetime without jeopardising network capacity.

Online publication date: Mon, 08-Jun-2009

The full text of this article 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