期刊文献+

无线传感器网络自适应并发多路由算法 被引量:4

A Parallel Multi-Path Algorithm for Adaptive Routing in Wireless Sensor Networks
下载PDF
导出
摘要 无线传感器网络地理位置路由算法需要克服本地最小化现象.已有的算法均以"右手规则"为基础来克服这一现象,但是,"右手规则"会损失链路且难以在路由过程中动态调整所选路由,对自适应多路由选择不利.通过深入分析本地最小化现象,发现合理限定贪心算法的选路区域可以克服本地最小化现象,由此提出Clockwise Rule,该规则不损失链路,可动态调整所选路由,耗费低.在此基础上,提出了自适应并发多路由算法APMR(Adaptive Parallel Multi-path Routing).算法是分布式的,可在任意中继节点处动态调整路由策略,优化路由过程.仿真结果表明APMR算法对网络性能有很好的改善. Geographic muting in wireless sensor networks suffers from the local minimum phenomenon. To help packets get out of local minimum phenomenon,the long-known right-hand rule is used, which needs the graphs planarizing. It will lost many links and doesn' t suit adaptive routing. Through studying the local minimum phenomenon deeply, we find out that greedy forwarding in restricting routing regions could deal with the local minimum phenomenon. Based on the observation, a new method Clockwise Rule was proposed, which does not lost any links and more suits adaptive routing. We also proposed an adaptive parallel multipath routing algorithm (APMR) using Clockwise Rule, which can provide various routing strategies and switch these strategies at relay nodes freely. Simulations show that APMR can significantly improve the performance of wireless sensor networks.
出处 《电子学报》 EI CAS CSCD 北大核心 2007年第9期1696-1701,共6页 Acta Electronica Sinica
基金 国家自然科学基金(No.60473052)
关键词 无线传感器网络 自适应多路由 本地最小化现象 地理位置路由 wireless sensor networks adaptive multi-path local minimum phenomenon geographic muting
  • 相关文献

参考文献17

  • 1Kahn JM, Katz RH, Pister KSJ. Next century challenges: Mobile networking for smart dust[A]. Harel Kodesh. Proc of the 5th Annual ACM/IEEE Int'l Conf on Mobile Computing and Networking[C]. Seattle, WA, USA: ACM Press, 1999. 263 - 270.
  • 2Johnson DB, Maltz DA. Dynamic source routing in ad hoc wireless networks [A]. Imielinski T. Mobile Computing [C]. Boston: Kluwer Academic Publishers, 1996. 153- 181.
  • 3Karp B, Kung H T. GPSR: greedy perimeter stateless routing for wireless networks[A]. Raymond Pickholtz. Proc. of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking [C]. Boston: ACM Press, 2000. 243 - 254.
  • 4K Chintalapudi, R Govindan,G Sukhatme,A Dhariwal. Ad-Hoc localization using ranging and sectoring [A]. Victor O K Li. INFOCOM 2004, Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies[C]. Hongkong, China: Institute of Electrical and Electronics Engineers Inc, 2004.2662 - 2672.
  • 5A Savvides, C C Han, M B Strivastava. Dynamic fine grained localization in ad-hoc sensor networks [A]. Christopher Rose. Proceedings of the 7th International Conference on Mobile Computing and Networking (Mobicom 2001) [C]. Rome, Italy:ACM Press,2001. 166-179.
  • 6Qing Fang, Jie Gao, Leonidas Guibas. Locating and bypassing routing holes in sensor networks[A]. Victor O. K. Li. INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies [C], Hongkong, China:Insfitute of Electrical and Electronics Engineers Inc,2004. 2458-2468.
  • 7D S J De Couto, D Aguayo, J Bicket, R Morris. A high-throughput path metric for multi-hop wireless routing[J]. Wireless Networks, 2005,11 (4): 419 - 434.
  • 8TOUSSAINT G. The relative neighborhood graph of a finite planar set [J]. Pattern Recognition, 1980,12(4): 261 - 268.
  • 9A Nasipuri, R Castaneda, S DAS. Performance of multipath routing for on-demand protocols in mobile ad hoc networks [J]. Mobile Networks and Applications, 2001,6 (4) : 339 - 349.
  • 10P Papadimitratos, Z J Hass, E G Sirer. Path set selection in mobile ad hoc networks [A]. Lausanne, Switzerland. ACM Mobihoc 2002[C] .New York: ACM Press,2002. 1- 11.

同被引文献28

引证文献4

二级引证文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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