期刊文献+

传感网络中一种基于蚂蚁算法的分布式数据汇集路由算法 被引量:12

Distributed Data-Centric Routing Algorithm Based on Ant Algorithm for Sensor Networks
下载PDF
导出
摘要 提出了一种传感网络中基于蚂蚁算法的分布式数据汇集路由算法.该算法的基本思想是通过一组称为“蚂蚁”的人工代理寻找到达Sink节点的最优路径,并利用蚂蚁算法的正反馈效应来达到数据汇集的目的.算法不需要网络节点维护全局信息,且数据汇集降低了网络路由开销,因此是一种节约能量的分布式路由算法.理论分析和仿真结果说明了新算法的有效性和可伸缩性. Presented distributed data-centric routing algorithm based on ant algorithm for sensor networks. The basic idea of this algorithm is as follows: some cooperation agents called ants are used to find the optimal route to the Sink. The data aggregation can be achieved by the positive feedback of the ants. The new algorithm is energy efficient and distributed. The analysis and the experimental results show that the algorithm is efficient and scalable.
出处 《小型微型计算机系统》 CSCD 北大核心 2005年第5期788-792,共5页 Journal of Chinese Computer Systems
基金 湖南省自然科学基金 (0 3 JJY3 0 98)资助
关键词 传感网络 蚂蚁算法 路由 sensor networks ant algorithm routing
  • 相关文献

参考文献10

  • 1Agre J, Clare L. An integrated architecture for cooperative sensing networks[J]. Computer, 2000, 33(5):106-108.
  • 2Zhao Y J, Govindan R, and Estrin D. Residual energy scan for monitoring sensor networks[C]In: IEEE Wireless Communications and Networking Conference (WCNC'02), March 2002,1:356-362.
  • 3Intanagonwiwat C, Govindan R, Estrin D. Directed diffusion: a scalable and robust communication paradigm for sensor networks[C]. In:Proc. of ACM MobiCom, Boston, MA, 2000,56-67.
  • 4Marco Dorigo, Vittorio Maniezzo, Alberto Colorni. The ant system: optimization by a colony of cooperating agents [C].IEEE Transactions on System, Man, and Cybernetics-Part B,1996,26(1): 1-13.
  • 5Krishnamachari B, Estrin D, Wicker S. Modelling data-centric routing in wireless sensor networks[C]. In: Proc. of IEEE Infocom, 2002.
  • 6Marco D, Duarte-Melo E, Liu M et al. On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data[C]. In: Proc. of International Workshop on Information Processing in Sensor Networks (IPSN),April 2003.
  • 7Garey M R, Johnson D S. Computers and intractability* a guide to the theory of NPcompleteness[C]. Freeman, San Francisco,1979.
  • 8Andreas Savvides, Chih-Chieh Han, and Mani B. Strivastava,dynamic fine-grained localization in adhoc networks of sensors[C]. In Proc. ACM Mobicom, 2001, 166-179.
  • 9Zhang Su-bing, Liu Ze-min. A QoS routing algorithm based on ant algorithm[C]. In: IEEE International Conference on Communications, 2001,5:1581-1585.
  • 10David Braginskym, Deborah Estrin. Rumor routing algorithm for sensor networks [C]. In: Proceedings of the ACM First Workshop on Sensor Networks and Application (WSNA), Atlanta, GA, Oct. 2003,22-31.

同被引文献73

引证文献12

二级引证文献36

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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