A Power Efficient Routing Protocol Based on Balanced Tree in Wireless Sensor Networks

Authors:
Hyun-sook Kim;Ki-jun Han
Affiliations:
Kyungpook National University, Korea;Kyungpook National University, Korea
Venue:
DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
Year:
2005

Citing 0
Cited 3

MESTER: minimum energy spanning tree for efficient routing in wireless sensor networks

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
REDRP: reactive energy decisive routing protocol for wireless sensor networks

UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
An efficient grid-based data gathering scheme in wireless sensor networks

UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at each node to prolong the network lifetime.In this paper, we propose a routing protocol based on a balanced tree, called BATR (Balanced Aggregation Tree Routing), which uses near optimal minimal spanning tree for balancing the power consumptions over all nodes.Our key idea is that a near optimal data aggregation can be achieved in terms of network lifetime when power consumption at each node can be nicely balanced. Simulation results show that the BATR can lengten system lifetime as compared with the conventional data aggregation protocols.