| 查看: 147 | 回复: 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 |
回复此楼» 猜你喜欢
申博发邮件
已经有8人回复
-
各位大神，目前国内有哪些比较好用的逆合成软件？
已经有9人回复
-
国社科系统bug了，是不是要放榜了？
已经有7人回复
-
上海工程技术大学激光智能制造课题组｜2027级博士研究生招生公告
已经有8人回复
-
上海工程技术大学激光智能制造课题组招收博士研究生
已经有8人回复