| 查看: 132 | 回复: 0 | ||
| 当前主题已经存档。 | ||
[资源]
Energy equivalence routing in wireless sensor networks
|
||
|
Energy equivalence routing in wireless sensor networks Wei Dinga,*, S.S. Iyengara, Rajgopal Kannana, William Rummlerb aDepartment of Computer Science, 298 Coates Hall, Louisiana State University, Baton Rouge LA 70803, USA bDepartment of Computer Science, Rochester Institute of Technology, USA Received 19 August 2003; revised 28 April 2004; accepted 12 May 2004 Available online 4 June 2004 Abstract Energy is a critical resource in wireless sensor networks. In this paper, we propose a new approach to maintain network wide energy equivalence and maximize network lifetime. Compared to existing protocols, our approach emphasizes on route maintenance instead of route finding. This means no critical nodes would become the bottleneck of network lifetime. A reroute request packet is sent out from sinks periodically. When the packet reaches a path node, Common Neighbor Switching (CNS) algorithm checks energy difference between the node and its neighbors outside the routing tree. If the difference goes beyond a threshold, double neighbor switching is performed. Two pathrerouting algorithms, namely, Shortest Rerouting (EERS) and Longest Rerouting (EERL), are also presented to show that neighbor switching is better than path rerouting. Simulation results show that CNS outperforms Directed Diffusion in more than 90% cases, while EERS and EERL show only blurry and conditional advantage over directed diffusion. q 2004 Elsevier B.V. All rights reserved. Keywords: Energy equivalence routing; Neighbor switching; Path rerouting; Directed diffusion |
回复此楼» 猜你喜欢
航天502所 高瑛珂博士 婚内征婚 欺骗女性开房
已经有26人回复
-
26/27申博
已经有4人回复
-
地球科学部D01口青年基金，最低几A几B几C才能有几率中呀。
已经有4人回复
-
博士申请
已经有5人回复