Probability based dynamic load-balancing tree algorithm for wireless sensor networks

Authors:
Tingxin Yan;Yanzhong Bi;Limin Sun;Hongsong Zhu
Affiliations:
Institute of Software, Chinese Academy of Science, Beijing, P.R.China;Institute of Software, Chinese Academy of Science, Beijing, P.R.China;Institute of Software, Chinese Academy of Science, Beijing, P.R.China;Institute of Software, Chinese Academy of Science, Beijing, P.R.China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 8
Cited 6

Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks

WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Parametric probabilistic sensor network routing

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks

LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information

Proceedings of the 1st international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading

Adjustable convergecast tree protocol for wireless sensor networks

Computer Communications
Minimum-hot-spot query trees for wireless sensor networks

Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Cross layer load balanced forwarding schemes for video sensor networks

Ad Hoc Networks
Maximizing network lifetime online by localized probabilistic load balancing

ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement

Journal of Computer and System Sciences
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Load balance can reduce hot spots, maintain network connectivity and prolong lifetime of wireless sensor networks. In large scale and randomly deployed wireless sensor networks, the energy consumption is sharply uneven among sensor nodes. We propose a new routing mechanism to achieve load balance through constructing a dynamic load-balancing tree (DLBT) in wireless sensor networks. The DLBT structure is a tree-like topology with a critical character that one node may have more than one candidates of parent node. DLBT achieves load balance by adjusting the forwarding probability to each parent candidate according to its traffic burden. We also provide a distributed algorithm to construct and maintain the DLBT structure. Simulation results show that our DLBT routing provides much higher load balance than the shortest path tree mechanism.