期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种贪婪地理路由协议的改进算法 被引量：7

An improved algorithm of greedy geographic routing protocol
下载PDF
导出
摘要 贪婪转发策略广泛应用于无线传感网络(WSNs)的地理路由协议中,但是,该协议存在数据包丢失严重以及在遭遇路由空洞时路由效率低下的不足。为此,提出一种贪婪地理路由协议的改进算法,记为GPSR-I算法。GPSR-I算法在选择下一跳转发节点时,利用节点离目的节点距离、方向以及节点密度信息计算度量值,然后依据该度量值决策下一跳转发节点。仿真数据表明,与GPSR相比,GPSR-I算法能够有效降低平均端到端传输时延、路由开销,并提高了数据包传输率。 The greedy forwarding strategy is widely used in geographic routing protocol of wireless sensor networks（WSNs）. Since the protocol has the problem of low routing efficiency in cases of routing void and serious packet loss,an improved algorithm of greedy perimeter stateless routing（GPSR-I） is proposed. The distance and direction from the target node and node density information are used to calculate the measurements when the GPSR-I algorithm is used to select the next-hop forwarding node,and then the next-hop forwarding node is determined. The simulation results show that,in comparison with the GPSR algorithm,the GPSR-I algorithm can effectively reduce the average end-to-end transmission delay and routing overhead,and improve the packet transmission rate.
作者 孙磊 张和伟 冯铁军 郭继联
机构地区 枣庄学院计算机系 枣庄科技职业学院电气工程系
出处 《现代电子技术》 北大核心 2016年第11期16-20,共5页 Modern Electronics Technique
基金 国家自然科学基金(61462069)
关键词 无线传感网 路由 GPSR 度量值 贪婪转发 WSNs routing GPSR measurements greedy forwarding
分类号 TN915.04 [电子电信—通信与信息系统]
  • 相关文献

参考文献15

  • 1MISRA S,KRISHNA P V,SARITHA V.LACAV:an energyefficient channel assignment mechanism for vehicular Ad Hoc networks[J].Journal of supercomputing,2012,62(3):1241-1262.
  • 2罗四维,侯孟书,周益民.一种新的基于能量消耗速率模型的分簇路由协议[J].计算机科学,2012,39(6):47-50. 被引量：9
  • 3BANERJEE I,CHANAK P,RAHAMAN H,et al.Effective fault detection and routing scheme for wireless sensor networks[J].Computers&electrical engineering,2014,40(2):291-306.
  • 4SEADA K,HELMY A,GOVINDAN R.On the effect of localization errors on geographic face routing in sensor networks[C]//Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks.[S.l.]:ACM,2004:71-80.
  • 5LEE S,BHATTACHARJEE B,BANERJEE S.Efficient geographic routing in multi-hop wireless networks[C]//Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing.[S.l.]:ACM,2005:230-241.
  • 6NAUMOV V,BAUMANN R,GROSS T.An evaluation of intervehicle Ad Hoc networks based on realistic vehicular traces[C]//Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing.[S.l.]:ACM,2006:108-111.
  • 7KERMARREC A M,TAN G.Greedy geographic routing in large-scale sensor networks:a minimum network decomposition approach[C]//Proceedings of the Eleventh ACM International Symposium on Mobile Ad Hoc Networking and Computing.[S.l.]:ACM,2010:161-170.
  • 8YU Y,GOVINDAN R,ESTRIN D.Geographical and energy aware routing:a recursive data dissemination protocol for wireless sensor networks[R].Los Angeles:UCLA Computer Science Department,2011:36-42.
  • 9LI Yujun,YANG Y,LU Xianliang.Rules of designing routing metrics for greedy,face,and combined greedy-face routing[J].IEEE transactions on mobile computing,2010,9(4):582-595.
  • 10KUHN F,WATTENHOFER R,ZHANG Y,et al.GeometricAd-Hoc routing:of theory and practice[C]//Proceedings ofthe Twenty-second Annual Symposium on Principles of Dis-tributed Computing.[S.l.]:ACM,2003:63-72.

二级参考文献13

  • 1Estrin D, Sayeed A, Mani S. Wireless Sensor Networks[C]ffthe Eighth Annual International Conference on Mobile Computing and Networking(MobiCom). 2002(1) :IV-5.
  • 2Kwon T, Gerla M. Clustering with power control[-C ff Proc. MILCOM. Atlantic City, NJ, 1999 (2).
  • 3Heinzelman W,Chandrakasan A, Balakrishnan H. Energy-effi cient routing protocols for wireless mictxsensor networks[-C// Proe. 33rd Hawaii Int. Conf. System Sciences (HICSS). Maui, HI,2000(2).
  • 4Handy M J, Haase M, Timmermann D. Low Energy Adaptive Clustering Hierarchy vrith Deterministic Cluster-Head Selection [C]//IEEE Conference on Mobile and Wireless Communications Networks. Stock-holm, Sweden, Sept. 2002 : 368-372.
  • 5Younis O,Fahmy S. HEED: A Hybrid, Energy-Efficient, Dis- tributed Clustering Approach for Ad hoc Sensor Networks[J]. IEEE Trans. Mobile Computing, 2004 (1) : 366-379.
  • 6Ye M, Li C, Chen G, et al. EECS. An Energy Efficient Clustering Scheme in Wireless Sensor Networks ECJ//Performance, Com- puting, and Communications Conference (IPCCC), 24th IEEE International. 2005 : 535-540.
  • 7Abusaimeh H, Yang Shuang-hua. Dynamic Cluster Head for Li- fetime Efficiency in WSNFJ. International Journal of Automa- tion and Computing, 2009,6(1) : 48-54.
  • 8Sire I, Choi K, Kwon K, et al. Energy Efficient Cluster header Selection Algorithm in WSN EC // Proceedings of the Interna- tional Conference on Complex, Intelligent and Software Inten- sive Systems, CISIS. 2009 . 584-587.
  • 9Heinzelman W,Chandrakasan A,Balakrishnan H. An applica- tion-specific protocol architecture for wireless microsensor net- works[J]. IEEE Transactions on Wireless Communications, 2002(1) . 660-670.
  • 10Rappaport T. Wireless Communications: Principles Practice I-M]. Englewood Cliffs, NJ Prentice-Hall, 19 9 6.

共引文献8

同被引文献43

引证文献7

二级引证文献28

现代电子技术
2016年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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