期刊文献+

移动无线传感器网络中的两跳信标交换协议 被引量:3

Two-hop hello protocol for mobile Ad Hoc and sensor networks
在线阅读 下载PDF
导出
摘要 在地理位置路由协议中,周期性信标交换协议(Hello协议)被广泛地用于构建和维护邻居节点表。然而在高度动态的网络环境中,邻居表中会存在很多过期节点,这将导致大量的重传,严重影响路由协议性能。为提高邻居表的准确性,提出一种两跳信标交换协议(T-Hello协议),通过掌握两跳范围内的节点位置信息,节点可以显式地感知邻居节点是否已移出通信范围,以便及时将过期节点从邻居表中删除,而不必等到超时。通过分析各种网络条件(节点密度、交换周期、节点移动速度、通信半径等)对新协议性能的影响,表明对于GPSR协议,T-Hello协议能够缩短过期节点50%左右的存在时间,从而有效地改善了路由效果。 Periodical Hello protocol is widely used in geographic routing protocols to obtain and maintain neighbor table.However in highly dynamic networks,the information stored in the neighbor table is often outdated,causing retransmissions and rerouting that consume bandwidth and increase latency.A new Two-hop Hello protocol(T-Hello) was proposed aiming to improve the accuracy of neighbor table.By exchanging beacon messages within two-hop scope,location information can be obtained even if a neighbor node has moved out of communication range,so that the corresponding entry in neighbor table can be removed explicitly rather than waiting for time out.The impacts of various factors(node density,beacon interval,node speed,transmission radius,et al.) were extensively studied and the conclusion is that the T-Hello protocol can shorten the lifetime of outdated neighbors by 50%,and hereby improve the performance of GPSR protocol significantly.
出处 《计算机应用》 CSCD 北大核心 2010年第A12期3158-3160,3171,共4页 journal of Computer Applications
基金 国家自然科学基金资助项目(60602061 60803131)
关键词 移动无线传感器网络 信标交换协议 邻居节点表 过期节点 两跳信标交换 mobile wireless sensor network hello protocol neighbor table outdated neighbor two-hop beacon
  • 相关文献

参考文献2

二级参考文献21

  • 1张衡阳,李莹莹,刘云辉,王铃.移动无线传感器网络中基于过渡带思想的贪婪转发策略[J].传感技术学报,2007,20(12):2663-2667. 被引量:7
  • 2沈晖,石冰心,邹玲,石坚,周建新.Ad Hoc网中基于熵的长寿分布式QoS路由算法[J].软件学报,2005,16(3):445-452. 被引量:20
  • 3Karp B, Kung H T. GPSR: Greedy perimeter stateless routing for wireless networks [C]//Proc of MOBICOM. New York: ACM, 2000:243-254
  • 4Bose P, Morin P, Stojmenovie I, et al. Routing with guaranteed delivery in Ad Hoc networks[J]. Wireless Networks, 2001, 7(6): 609-616
  • 5Fabian Kuhn, Roger Wattenhofer, Yan Zhong, et al. Geometric ad-hoc routing.- Of theory and practice [C]//Proc of the 23rd ACM Syrup on Principles of Distributed Computing (PODC'03). New York: ACM, 2003:63-72
  • 6Mohamad Shanudin, Mahamod Ismail, Raed. Saqour.Impact of mobility metrics on greedy Ad Hoe networks routing protocol and improvement using angular prediction model [C//Proc of Networks, Jointly held with the 2005 IEEE 7th Malaysia Int Conf on Communication. Piscataway, NJ: IEEE, 2005:1531-2216
  • 7Hong Huang. Adaptive algorithm to mitigate inefficiency in greedy geographical routing [J]. IEEE Communication letters, 2006, 10(3): 150-152
  • 8Ian D Chakeres, Elizabeth M Belding-Royer. The utility of hello messages for determining link connectivity [C] //Proc of the 5th Int Symp on Wireless Personal Multimedia Communications (WPMC). Piscataway, NJ : IEEE, 2002 : 504-508
  • 9Wolfson O, Jiang I., Sistla P, et al. Databases for Tracking Mobile Units in Real Time [G]//LNCS 1540: Proc of the 7th Int Conf on Database Theory (ICDT). Berlin: Springer, 1999:169-186
  • 10Karumanchi G, Muralidharan S, Prakash R. Information dissemination in partitionable mobile Ad Hoc networks [G]// Proc of the IEEE Syrup on Reliable Distributed Systems. Piscataway, NJ: IEEE, 1999:4-13

共引文献17

同被引文献40

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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