A load balancing algorithm based on probabilistic multi-tree for wireless sensor networks

To extend the lifetime of a large wireless sensor network, it is important to spread the inevitable energy consumption (loads) across the network, and thus reduce hot spots. This article introduces a two-step solution to this issue based on the AODV tier allocation with multiple paths to disperse loads from hot spots. After the allocation, paths for nodes to transmit data back to the sink are decided through a probabilistic approach. By computer simulation, it is shown with various indexes that the performance of the proposed algorithm is better than that of deterministic approaches after network deployment, and an appropriate state can be reached in reasonable time.

[1]  Don Towsley,et al.  On the Coverage and Detectability of Large-scale Wireless Sensor Networks , 2003 .

[2]  Ming-Syan Chen,et al.  Exploring Application-Level Semantics for Data Compression , 2011, IEEE Transactions on Knowledge and Data Engineering.

[3]  Francesca Cuomo,et al.  Routing in ZigBee: Benefits from Exploiting the IEEE 802.15.4 Association Tree , 2007, 2007 IEEE International Conference on Communications.

[4]  Viktor K. Prasanna,et al.  Data Gathering with Tunable Compression in Sensor Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[5]  Chwan-Lu Tseng,et al.  A GSM-based remote wireless automatic monitoring system for field information: A case study for ecological monitoring of the oriental fruit fly, Bactrocera dorsalis (Hendel) , 2008 .

[6]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Rizos Sakellariou,et al.  Compile-time minimisation of load imbalance in loop nests , 1997, ICS '97.

[8]  Richard Han,et al.  A node-centric load balancing algorithm for wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[9]  Peng Ran,et al.  ZigBee Routing Selection Strategy Based on Data Services and Energy-Balanced ZigBee Routing , 2006, 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06).

[10]  Young-Chon Kim,et al.  A Node-Grade Based AODV Routing Protocol for Wireless Sensor Network , 2010, 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing.

[11]  Peng Jiang,et al.  Design of a Water Environment Monitoring System Based on Wireless Sensor Networks , 2009, Sensors.

[12]  Yi-Jing Chu,et al.  The first order load-balanced algorithm with static fixing scheme for centralized WSN system in outdoor environmental monitoring , 2009, 2009 IEEE Sensors.

[13]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[14]  H. T. Kung,et al.  Load-balancing routing for wireless access networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.