Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11534310_72 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
dynamic load-balancing tree algorithm,dlbt structure,new routing mechanism,sensor node,dynamic load-balancing tree,wireless sensor network,load balance,dlbt routing,higher load balance,parent node,parent candidate,hot spot,load balancing,shortest path,topology,distributed algorithm,mobile computing,distributed system,dynamic load,sensor array,wireless network,routing,shortest path tree | Wireless network,Key distribution in wireless sensor networks,Computer science,Load balancing (computing),Sensor array,Computer network,Distributed algorithm,Mobile wireless sensor network,Shortest-path tree,Wireless sensor network,Distributed computing | Conference |
Volume | ISSN | ISBN |
3619 | 0302-9743 | 3-540-28102-9 |
Citations | PageRank | References |
13 | 0.70 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tingxin Yan | 1 | 408 | 22.36 |
| Yanzhong Bi | 2 | 101 | 5.62 |
| Sun Limin | 3 | 467 | 65.09 |
| Hongsong Zhu | 4 | 93 | 20.11 |