期刊文献+

一种基于Dijkstra^+策略的路由空洞算法GEAR^+

The Routing Hole GEAR^+ Algorithm Based on Dijkstra^+ Strategy
下载PDF
导出
摘要 针对无线传感器网络中地理位置和能量路由(GEAR)算法可能产生的路由空洞问题,GEAR算法通过改变自身和邻居节点的代价来解决问题,但同一节点可能会再次遇到同一路由空洞.文中提出了一种基于Dijkstra+策略的路由空洞GEAR+算法可以避免上述问题.仿真分析表明,该算法在平均能量消耗和节点发送数据分组的数量上都优于GEAR算法. In the Wireless Sensing Network (WSN), GeogTaphic and Energy Aware Routing (GEAR) algorithm solved its routing hole problem by changing the cost value of the current routing node and his neighbors. However, the same node may again encounter the identical hole issue. This article proposes a routing hole algorithm named GEAR+ , which is based on Dijkstra + strategy and can avoids suffering the same hole again. Simulation and analysis shows that the GEAR + algo-rithm is superior to the GEAR algorithm in the average consumption of energy and the amout of data packets transmitted by node.
出处 《微电子学与计算机》 CSCD 北大核心 2009年第10期181-184,188,共5页 Microelectronics & Computer
基金 国家自然科学基金项目(602730350) 国防科工委应用基础基金(K1704060511) 江苏省自然科学基金(BK2007074)
关键词 无线传感器网路 DIJKSTRA算法 能量空洞 地理位置路由 WSN Dijkstra algorithm energy hole GEAR
  • 相关文献

参考文献9

  • 1IF Akyildiz, Su W, Sankarasubramaniam Y, et al. Wireless sensor networks, a survey [J ]. Computer Networks, 2002,23 (3) : 393 - 341.
  • 2Li J, Mohapatra P. An analytical model for the energy hole problem in many - to - one sensor networks[ C] // Proceedings of the IEEE Vehicular Technology Conference. Dallas, 2005:2721 - 22725.
  • 3Karp B, Kung H T. GPSR: greedy perimeter stateless routing for wireless networks [ C ]// Proceedings of the Sixth ACM Annual International Conference on Computing and Networking. Boston, MA, 2000. 243 - 254.
  • 4苏威积,赵海,张文波,徐野.基于嵌入式技术的传感器网络无尺度路由算法[J].计算机工程,2006,32(14):87-88. 被引量:3
  • 5Yu Yan, Govindan R, Estrin D. A recursive data dissemination protocol for wireless sensor networks[J ]. geographical and energy - Aware routing, 2001,29 (9) : 39.
  • 6Zhan F B. Three fastest shortest path algorithms on real road networks[J]. Geo-graphic Information and Decision Analysis, 1997,1 (1) : 69 - 82.
  • 7Li Jiandong. Base theory of information network [ M]. Xi' an: Publishing House of Xidian University, 2001:128 - 162.
  • 8杨云,徐佳,李千目,刘凤玉.基于Dijkstra策略的QoS路由多目标算法[J].小型微型计算机系统,2004,25(9):1660-1664. 被引量:4
  • 9屠燕春,郭爱煌.无线传感器网络的路由算法与仿真实现[J].计算机工程,2006,32(22):124-126. 被引量:8

二级参考文献16

  • 1Ten Emerging Technologies That Will Change the World[Z].http://www.techreview.com/articles/emerging0203.asp,2003.
  • 2Krishnan K R,Neidhardt A L,Erramilli A.Scaling Analysis in Traffic Management of Self-similar Processes[C].Proceedings of ITC-15,1997,2:1087-1096.
  • 3Yao Y,Gehrke J.The Cougar Approach to In-network Query Processing in Sensor Networks[J].SIGMOD Record,2002,31 (3):918.
  • 4Elson J.Time Synchronization Services for Wireless Sensor Networks[C].Proceedings of the 15th International Parallel & Distributed Processing Symposium,Los Alamitos,2001.
  • 5Madden S R,Szewczyk R,Franklin M J,et al.Supporting Aggregate Queries over Ad-hoc Wireless Sensor Networks[C].Proceedings of the Workshop on Mobile Computing and Systems Applications,Los Alamitos,2002:49-58.
  • 6Sinha P,Sivakumar R,Bharghavan V.MCEDAR:Multicast Core Extraction Distributed Ad-Hoc Routing[C].Proc.of the Wireless Communications and Networking Conference,New Orlean,LA,1999-09.
  • 7Crawley E, Nair R, Rajagopalan B, Sandick H. A formwork for QoS-based routing in the internet[S]. IETF RFC2386,1998.
  • 8Moy J. OSPF Version 2, Request for Comments 1583, Internic Directory Services [EB/OL]. ftp://ds. internic. net/rfc, March1994.
  • 9Lec W C, Hluchyi M G and Humblet P H. Routing subject to quality of server constraints in integrated communication networks[J].IEEE, Networks, 1995,vol. 9, 46-55.
  • 10Wang Z, Crowcroft J. Quality-of-service for routing supporting multimedia applications[J]. IEEE Journal of Selected Areas in Communications, 1996,14(7) : pp. 1228-1234.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部