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

Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks

Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
原文传递
导出
摘要 Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor scalability or the void problem. In this paper, we propose a new geographic routing protocol, SBFR （Scoped Bellman-Ford Routing）, for large dynamic wireless sensor networks. The basic idea is that each node keeps a view scope of the network by computing distance vectors using the distributed Bellman- Ford method, and maintains a cost for routing to the sink. When forwarding a packet, a node picks the node with minimum cost in its routing table as a temporary landmark. While achieving good sealability, it also solves the void problem in an efficient manner through the combination of Bellman-Ford routing and cost-based geographic routing. Analytical and simulation results show that SBFR outperforms other routing protocols not only because of its robustness and scalability but also its practicality and simplicity. Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor scalability or the void problem. In this paper, we propose a new geographic routing protocol, SBFR （Scoped Bellman-Ford Routing）, for large dynamic wireless sensor networks. The basic idea is that each node keeps a view scope of the network by computing distance vectors using the distributed Bellman- Ford method, and maintains a cost for routing to the sink. When forwarding a packet, a node picks the node with minimum cost in its routing table as a temporary landmark. While achieving good sealability, it also solves the void problem in an efficient manner through the combination of Bellman-Ford routing and cost-based geographic routing. Analytical and simulation results show that SBFR outperforms other routing protocols not only because of its robustness and scalability but also its practicality and simplicity.
作者 张学 洪爵 陆桑璐 谢立 曹建农
机构地区 State Key Laboratory for Novel Software Technology Department of Electrical Engineering Department of Computing
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2008年第6期944-956,共13页 计算机科学技术学报（英文版）
基金 partially supported by the National High-Tech Research and Development 863 Program of China under Grant No. 2006AA01Z199 the National Natural Science Foundation of China under Grant Nos. 90718031 and 60721002 the National Basic Research 973 Program of China under Grant No. 2006CB303000.
关键词 Bellman-Ford geographic routing SCALABILITY void （hole） wireless sensor network Bellman-Ford, geographic routing, scalability, void （hole）, wireless sensor network
分类号 TN929.5 [电子电信—通信与信息系统] TP212.9 [自动化与计算机技术—检测技术与自动化装置]
  • 相关文献

参考文献42

  • 1Heinzelman W, Kulik J, Balakrishnan H. Adaptive protocols for information dissemination in wireless sensor networks. In Proc. the A CM International Conference on Mobile Computing and Networking (MobiCom), Seattle, Washington, USA, 1999, pp. 174-185.
  • 2Intanagonwiwat C, Govindan R, Estrin D. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proc. the ACM International Conference on Mobile Computing and Networking ( MobiCom), Boston, Massachusetts, USA, 2000, pp.56-67.
  • 3Braginsky D, Estrin D. Rumor routing algorithm for sensor networks. In Proc. the ACM International Workshop on Sensor Networks and Applications ( WSNA), Atlanta, Georgia, USA, 2002, pp.22-31.
  • 4Schurgers C, Srivastava M B. Energy efficient routing in wire-less sensor networks. In Proc. the MILCOM on Communications for Network-Centric Operations: Creating the Information Force, Washington DC, USA, 2001, pp.357-361.
  • 5Ye F, Chen A, Lu S, Zhang L. A scalable solution to minimum cost forwarding in large sensor networks. In Proc. the IEEE International Conference on Computer Communications and Networks (ICCCN), Scottsdale, Arizona, USA, 2001, pp.304 309.
  • 6Servetto S, Barrenechea G. Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. In Proc. the ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), Atlanta, Georgia, USA, 2002, pp.12-21.
  • 7Karp B, Kung H T. Greedy perimeter stateless routing for wireless networks. In Proc. the ACM International Conference on Mobile Computing and Networking (MobiCom), Boston, Massachusetts, USA, 2000, pp.243-254,
  • 8Sanchez J A, Marln-Perez R, Ruiz P M. Beacon-less geographic routing in real wireless sensor networks. Journal of Computer Science and Technology, 2008, 23(3): 438-450.
  • 9Xing Guoliang, Lu Chenyang, Pless Robert, Huang Qingfeng. Impact of sensing coverage on greedy geographic routing algorithms. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(4): 348-360.
  • 10Chen D, Varshney P K. On-demand geographic forwarding for data delivery in wireless sensor networks. Computer Communications, 2007, 30(14/15): 2954-2967.
Journal of Computer Science & Technology
2008年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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