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

一种解决GEAR路由空洞问题的新方案 被引量：2

A novel program on resolving the problem of GEAR routing hole
在线阅读 下载PDF
导出
摘要 无线传感器网络中的GEAR路由协议在解决路由空洞问题时,会出现短暂路由环现象,使分组转发跳数增大,浪费更多的网络能量。基于反馈避免的思想提出一种改进的GEAR路由算法,当转发节点发现自身为空洞节点时,便向其邻节点广播hole信息,在分组转发时,邻节点将该节点标记为空洞节点,转发节点修改自身的综合代价,从而绕开该空洞节点,有效地解决短暂路由环问题。仿真结果表明:改进的路由算法能减少分组转发跳数,节省网络能量,克服了GEAR路由协议的弊端。 In wireless sensor networks,there exists routing loop phenomenon while utilizing GEAR routing protocol to solve the routing hole problem,resulting in more hop counts for packets relaying and waste more network energy.An improved GEAR routing algorithm is presented.Transmitting node broadcasts messages of hole to neighbor nodes while it is a routing hole-node.The neighbor nodes mark the hole nodes and transmitting nodes change the cost value itself,so the impact of hole nodes are avoided and routing loop problem is solved effectively.Simulation results show that the improved routing can reduce hop count for packets relaying,save the network energy consuming,and overcome the drawback of GEAR routing protocol.
作者 蒋阳 孙柳林 袁敏 陈碧云
机构地区 重庆大学通信工程学院
出处 《传感器与微系统》 CSCD 北大核心 2011年第4期44-47,50,共5页 Transducer and Microsystem Technologies
基金 "211工程"三期建设计划资助项目(S-09102) 国家"863"计划资助项目(2008AA01Z202)
关键词 无线传感器网络 GEAR路由协议 路由空洞 路由环 wireless sensor networks（WSNs） GEAR routing protocol routing hole routing loop
分类号 TP393.1 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献12

  • 1Holger Karl, Andreas Willing.无线传感器网络协议与体系结构[M].邱天爽,唐洪,李婷,等译.北京:电子工业出版社,2007.
  • 2Yu Y, Govindan R, Estrin D. Geographical and energy-aware rou- ting: A recursive data dissemination protocol for wireless sensor networks[ R ]. UCLA Computer Science Department, Tech, Rep : UCLA-CSD TR-01-0023,2001.
  • 3Jafari A M, Sklorz A, Lang W. Target-oriented routing algorithm based on sequential coordinates for autonomous wireless sensor networks [ J ]. Journal of Networks ,2009,4 (8) :421 -427.
  • 4Kuhn F, Wattenhofer R, Zhong Y, et al. Geometric Ad routing : Theory and practice [ C ]//Proc of the 23rd ACM Symposium on Principles of Distributed Computing ( PODC'03 ), Boston, 2003 : 63 -72.
  • 5Li Q, Rus D. Sending messages to mobile users in disconnected Ad Hoc wireless networks[ C ]//Proc of ACM MOBICOM, Orlan- do .2000:44 -55.
  • 6Stojmenovic I, Lin Xu. Loop-free hybrid single-path flooding rou- ting algorithms with guaranted delivery for wireless networks[ J ]. IEEE Trans on Parallel and Distributed Systems,2001,12:1023 - 1032.
  • 7Chen Shigang, Fan Guangbin, Cui Junhong. Avoid in geographic routing for data aggregation in sensor networks [ J ]. International Journal of Ad Hoc and Ubiquitous Computing, 2006, 1 ( 4 ) : 169 -178.
  • 8Fang Qing, Gao Jie, Guibas L J. Location and by passing routing holes in sensor networks [ J]. Mobile Networks and Applications, 2006,11 : 187 -200.
  • 9He T, Stankovic J A, Lu C Y, et al. SPEED : A stateless protocol for real-time communication in sensor networks [ C ]//Proc of In- ternational Conference on Distributed Computing Systems, Rhode.Island, USA ,2003.
  • 10Karp B, Kung H T. GPSR: Greedy perimeter stateless routing for wireless networks[ C]ffProe of the 6th Annual International Con- ference on Mobile Computing and Networks, New York, USA: ACM Press,2000:243 -254.

二级参考文献6

  • 1Akyildiz I F, Su W, Sankarasubramaniam Y, et al. A survey on sensor networks [ J ]. IEEE Communication Magazine, 2002, 40 (8) :102 -114.
  • 2Stoleru R, Stankovic J A. Probability grid:A location estimation scheme for wireless sensor networks [ C ]//IEEE SECON 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Networks,2004.
  • 3Cheng Z, Perillo M, Heinzelman W. General network lifetime and cost models for vealuating sensor network deployment strategies[ J ]. IEEE Transactions on Mobile Computing,2008 3(4) :484-497.
  • 4Chang J H ,Tassiulas L. Maximum lifetime routing in wireless sensot networks[J]. IEEE Trans Netw,2004,12(4) :609-619.
  • 5Dagher J C, Marcellin M W, Neifeld M A. A theory for maximizing the lifetime of sensor networks [ J ]. IEEE Transactions on Communications, 2007,55 (2) :323 -332.
  • 6Gandham S,Dawande M,Prakash R,et al. Energy-efficient schemes for wireless sensor networks with multiple mobile base stations[ C ]// Kero TEF, ed. Proe of the IEEE GLOBECOM. Washington : IEEE Computer Society,2003:377 -381.

共引文献21

同被引文献19

  • 1崔莉,鞠海玲,苗勇,李天璞,刘巍,赵泽.无线传感器网络研究进展[J].计算机研究与发展,2005,42(1):163-174. 被引量：731
  • 2Al-Karaki J N, Karml A E. Routing techniques in wireless sensor networks : a survey [ J ]. IEEE Personal Communica -tions ,2004,11 (6) :6-28.
  • 3Yu Y, Govindan R, Estrin D. Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks[R]. [s. l.]: UCLA,2001.
  • 4Xu Y, Heidemann J, Estrin D. Geography Informed Energy Conservation for Ad hoc Routing[ C ]//Proceedings of the 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking. [ s. l. ]: [ s. n. ] ,2001.
  • 5郑军、张宝贤.无线传感器网络技术[M].北京:机械工业出版社.2012.
  • 6田乐,谢东亮,任彪,张雷,程时端.无线传感器网络贪婪转发策略中的路由空洞问题[J].电子与信息学报,2007,29(12):2996-3000. 被引量：9
  • 7Ahmed N, Kanhere SS, Jha S. The holes problem in wireless sensor networks: A survey[J]. ACM SIGMO- BILE Mobile Computing and Communications Review Archive, 2005,9(2) : 4-18.
  • 8Stojmenovic I, Lin X. Loop-Free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks[J]. IEEE Trans. on Parallel and Distributed System, 2001,12 (10) : 1023-1032.
  • 9Huang H. Adaptive algorithm to mitigate inefficiency in greedy geographical routingFJ. IEEE Communica- tion Letters, 2006,10(3) : 150-152.
  • 10Karp B, Kung HT. GPSR: Greedy perimeter stateless routing for wireless networks[C//Proc, of the MOBI- COM. Boston: ACM,2000:243-254.

引证文献2

二级引证文献2

传感器与微系统
2011年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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