期刊文献+

基于距离和概率的能量相关路由协议 被引量:1

Energy-aware Protocol Based on Distance and Probability
下载PDF
导出
摘要 由于传感器节点只携带能量十分有限的电池,如何最大化网络生命周期是传感器应用必须考虑的问题。提出一个新的能量相关路由算法,即基于概率和距离的能量相关协议EPDRP,该协议在选择下一跳时综合考虑节点位置信息和剩余能量这两个方面。使用NS2对GPSR和EPDRP协议进行了实验分析,结果表明EPDRP获得了更短的路径长度和更少的路由负载,可有效延长无线传感器网络的生命周期。 As the sensor nodes have limited battery resources, how to maximize lifetime of the network is the key con- sideration. We presented a new energy-aware geographic routing algorithm based on probability and distance (EPDRP), which considers both the local position information and remnant energy when choosing next hop. We evaluated the GPSR and EPDRP protocol using NS-2 simulator. Results show that EPDRP obtains lower average hop count than GPSR, reduces the routing protocol overhead and also effectively prolongs the network lifetime.
出处 《计算机科学》 CSCD 北大核心 2015年第10期71-75,共5页 Computer Science
基金 国家自然科学基金资助项目(61070169 61201212) 江苏省自然科学基金资助项目(BK2011376) 江苏省"六大人才高峰"项目(2014-WLW-010) 苏州市融合通信重点实验室(SKLCC2013XX) 江苏省产学研前瞻性项目(BY2012114) 软件新技术与产业化协同创新中心部分资助
关键词 地理路由协议 能量 网络生命周期 Geographic routing protocol,Energy,Network lifetime
  • 相关文献

参考文献22

  • 1Akyildiz F,Su W, Sankarasubramaniam Y,et al. A Survey onSensor Networks[J]. IEEE Communications Magazine.2002,40(80):102-114.
  • 2Patwari N, Hero A O, Perkins M, et al. Relative Location Esti-mation in Wireless Sensor Networks [J], IEEE Transaction onSignal Processing,2003,51(8) :2137-2148.
  • 3Doherty L’Pister K S J,Ghaoui L. Convex Position Estimationin Wireless Sensor Networks[C] // The Twentieth Annual JointConference of the IEEE Computer and Communications Socie-ties. April 2001.
  • 4Karp B, Kung H T. GPSR: Greedy Perimeter Stateless Routingfor Wireless Networks[C] // Proceedings of the Sixth ACM An-nual International Conference on Computing and Networking.Boston, USA, 2000 : 243-254.
  • 5Bose P, Morin P, Stojmenovic I, et al. Routing with GuaranteedDelivery in Ad Hoc Wireless Networks[J], Wireless Networks,2001,7(6):609-616.
  • 6Kuhn F,Wattenhofer R,Zollinger A. Worst-Case Optimal andAverage-Case Efficient Geometric Ad-Hoc Routing [C] // Pro-ceeding of the Fourth ACM International Symposium on MobileAd Hoc Networking and Computing. 2003:267-278.
  • 7Finn G G. Routing and addressing problems in large metropoli-tan-scale internetworks: Technical Report ISI/RR-87-180[R].USC/ISI, March 1987.
  • 8Lin C N, Yuan S A, Chiu S W,et al. ProgressFace: An Algo-rithm to Improve Routing Efficiency of GPSR-Like Routing Pro-tocols in Wireless Ad Hoc Networks[J]. IEEE Transactions onComputers ,2010,59(6):82 2-834.
  • 9Ammari H M,Das S K. Forwarding via checkpoints:Geographicrouting on always-on sensors[J]. Journal of Parallel and Distri-buted Computing,2010,70(7) :719-731.
  • 10Xiang X F,Wang X, Zhou Z H. Self-Adaptive On-Demand Geo-graphic Routing for Mobile Ad Hoc Networks[J]. IEEE Tran-sactions on Mobile Computing, 2012,11(9) : 1572-1586.

同被引文献24

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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