|
|
Virtual force-field based energy efficient geo-routing in
wireless sensor network |
GAO Qing,LI Shan-ping,YANG Zhao-hui |
College of Computer Science and Technology,Zhejiang University,Hangzhou 310027,China |
|
|
Abstract Existing geographic routing algorithms exhaust nodes on the boundary of holes earlier than nodes on other locations in wireless sensor network (WSN), which in turn makes the network even worse. A geographic routing algorithm was proposed based on virtual force-field model to solve the problem. Regarded the information of holes, locations of relay nodes and destination node as parameters, a relay node obtaines a force-field vector by using the forcefield model. Then the node makes greedy forwarding according to the direction vector. Under the guidance of the model, packets bypass holes before they reach the boundary nodes of holes. The geo-routing distributes energy consumption of nodes evenly in the whole network. Simulation results show that the algorithm outperforms existing geo-routing algorithms in lifetime and delivery ratio, and has a similar transmission delay with other algorithms. The virtual force-field model evenly consumes nodes energy in the whole network and improves energy efficiency of the WSN.
|
Published: 22 February 2012
|
|
基于虚拟场的能量高效传感器网络地理路由
针对现有的无线传感器网络(WSN)地理位置路由在遇到空洞时,集中使用空洞边缘节点转发而导致能量迅速耗尽的问题,提出利用虚拟场模型均衡节点能量消耗的路由算法.传输节点根据虚拟场模型,采用空洞信息、自身位置及目的节点位置作为参数,计算当前位置的虚拟场矢量.根据此矢量方向进行贪婪路由选择.受虚拟场模型的引导,数据传输路径在未遇到空洞时已提前开始绕行,路由能耗不再集中于空洞边缘,而是更均匀地分布于全网.实验表明,该算法在网络生命周期和数据包投递率方面明显优于现有的地理位置路由,在传输延迟方面两者接近,验证了虚拟场模型具有平衡节点能量消耗、提高能源利用率的效果.
|
|
[1] CHEN D, VARSHNEY P K. A survey of void handling techniques for geographic routing in wireless networks [J]. IEEE of Communications Surveys and Tutorials, 2007, 9(1): 50-67.
[2] TAKAGI H, KLEINROCK L. Optimal transmission ranges for randomly distributed packet radio terminals [J]. IEEE Transactions on Communications, 2002, 32(3): 246-257.
[3] 陈友荣, 俞立, 董齐, 等. 基于近邻算法的无线传感器网络功率控制 [J]. 浙江大学学报:工学版, 2010, 44(7): 1321-1326.
CHEN Yourong, YU Li, DONG Qi, et al. Power control in wireless sensor network based on nearest neighbor algorithm [J]. Journal of Zhejiang University: Engineering Science, 2010, 44(7): 1321-1326.
[4] 董芳, 仇佩亮. 无线传感器网络角度随机路由协议 [J]. 浙江大学学报:工学版, 2009, 43(4): 621-625.
DONG Fang, QIU Peiliang. Angle random routing protocol for wireless sensor network [J]. Journal of Zhejiang University: Engineering Science, 2009, 43(4): 621-625.
[5] FANG Q, GAO J, GUIBAS L J. Locating and bypassing holes in sensor networks [J]. Mobile Networks and Applications, 2006, 11(2): 187-200.
[6] MAUVE M, WIDMER A, HARTENSTEIN H. A survey on positionbased routing in mobile ad hoc networks [J]. IEEE Network, 2001, 15(6): 30-39.
[7] KARP B, KUNG H T. GPSR: greedy perimeter stateless routing for wireless networks [C]∥ Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. New York:ACM, 2000: 243-254.
[8] 梁小满. 贪婪周边无状态路由协议的改进算法 [J]. 传感技术学报, 2009, 22(7): 1024-1028.
LIANG Xiaoman. Improved GPSR algorithm [J]. Chinese Journal of Sensors and Actuators, 2009, 22(7): 1024-1028.
[9] LENDERS V, MAY M, PLATTNER B. Densitybased vs. proximitybased anycast routing for mobile networks [C]∥ IEEE INFOCOM. Barcelona: IEEE, 2006.
[10] LENDERS V. Fieldbased routing and its application to wireless ad hoc networks [D]. Zurich: Swissfederal Institute of Technology, 2006.
[11] NA J, SOROKER D, KIM C. Greedy geographic routing using dynamic potential field for wireless ad hoc networks [J]. IEEE Communications Letters, 2007, 11(3): 243-245.
[12] JUNG S, KSERAWI M, LEE D, et al. Distributed potential field based routing and autonomous load balancing for wireless mesh networks [J]. IEEE Communications Letters, 2009,13(6): 429-431.
[13] ALSUWAIYEL M. Algorithms design techniques and analysis [M]. 北京:电子工业出版社, 2003: 474-478.
[14] 唐勇, 周明天. 基于传输范围覆盖的无线传感器网络广播算法 [J]. 小型微型计算机系统, 2008, 29(2): 204-207.
TANG Yong, ZHOU Mingtian. Transmission range coverage based broadcasting in wireless sensor networks [J]. Journal of Chinese Computer Systems, 2008, 29(2): 204-207.
[15] 丁弋, 刘利. 多边形顶点匹配优化算法 [J]. 浙江大学学报:工学版,2007, 41(9): 1532-1540.
DING Yi, LIU Li. Optimal vertex matching algorithm for polygonal shapes [J]. Journal of Zhejiang University: Engineering Science, 2007, 41(9): 1532-1540. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|