期刊文献+

自组织网络洪泛方式的一种改进算法 被引量:2

An Improved Algorithm for Flooding in Ad Hoc Networks
下载PDF
导出
摘要 自组织网络路由协议的研究一直是无线网络的研究热点之一.而以洪泛方式的广播算法无疑比较适合于节点不断移动的自组织网络.但是传统的洪泛算法容易引起路由风暴的问题.本文基于小世纪现象,在保证路由成功率的前提下,将洪泛报文控制在一定的范围之内,从而减少控制报文的数量.仿真结果显示,改进后的洪泛算法具有较低的路由负载和能量消耗. The study of routing protocols is one of the hotspots in mobile Ad Hoc networks. To the mobile characteristic, the broadcast based on flooding is more suitable than others. The flooding algorithm brings the problem of routing storm at the same time. Under the precondition of guaranteeing the routing success ratio, the small world phenomenon (SWP) is used to control the flooding messages within a range. Because of reducing the numbers of control messages, the simulation results show that the modified flooding algorithm has a lower routing load and better energy consumption than the traditional flooding.
出处 《河南师范大学学报(自然科学版)》 CAS CSCD 北大核心 2009年第6期46-48,共3页 Journal of Henan Normal University(Natural Science Edition)
基金 河南省教育厅自然科学基金(2009B520016) 河南师范大学青年科学基金(2008qk06)
关键词 广播 洪泛 自组织网络 小世界现象 broadcast flooding Ad Hoc Networks SWP
  • 相关文献

参考文献7

  • 1RFC3561. Ad Hoe On-Demand Distance Vector (AODV) Routing[S].
  • 2Joseph Macker , Ian Chakeres . Mobile Ad-hoc Networks (manet)[EB/OL]. [-2008-10-13]. http://www, ietf. org/html, charters/ma- net-charter, html.
  • 3Matthias Grossglauser, David N. C. Tse. Mobility increases the capacity of ad hoe wireless networks[C]. IEEE/ACM Transactions on Networking (TON), IEEE Press Piscataway, N J, 2002.
  • 4Tseng Yu-Chee,Ni Sze-Yao,Chen YuhNJ,Shyan,et al. The Broadcast Storm Problem in a Mobile Ad Hoc Network[J]. ACM Wireless Networks,2002,8(2) :153-167.
  • 5付玉娟,蔡焕杰,张旭东.基于图论和列队竞争算法的环状管网优化设计[J].灌溉排水学报,2008,27(4):81-84. 被引量:5
  • 6张娟,刘美琪,袁超.基于P2P和流媒体技术的校园网直播系统的设计[J].河南农业大学学报,2008,42(2):236-239. 被引量:8
  • 7Li Layuan, Li Chunlin. A QoS-guaranteed multicast routing protocol[J]. ComputerCommunications, 2004,27(1) : 59- 69.

二级参考文献12

共引文献11

同被引文献19

  • 1LUA E K,CROWCROFT J,PIAS M,et al.A survey and comparison of peer-to-peer overlay network schemes[J].IEEE Communications Surveys and Tutorials.2005,7:72-93.
  • 2STOICA I,MORRIS R,LIBEN-NOWELL D,et al.Chord:A scalable peer-to-peer lookup protocol for Internet applications[J].IEEE/ACM Transactions on Networking.2003,11(1):17-32.
  • 3RATNASAMY S,FRANCIS P,HANDLEY M,et al.A scalable content-addressable network[C].San Diego,CA,United states:Association for Computing Machinery,2001,31:161-172.
  • 4ROWSTRON A I T,DRUSCHEL P.Pastry:Scalable,decentralized object location,and routing for large-scale peer-to-peer systems[C].Springer-Verlag,2001,329-350.
  • 5ZHAO B Y,HUANG L,STRIBLING J,et al.Tapestry:A resilient global-scale overlay for service deployment[J].IEEE Journal on Selected Areas in Communications.2004,22(1):41-53.
  • 6LIANG J,KUMAR R,ROSS K W.The FastTrack overlay:A measurement study[J].Computer Networks.2006,50(6):842-858.
  • 7CLARKE I,SANDBERG O,WILEY B,et al.Freenet:A distributed anonymous information storage and retrieval system[M].Berlin:Springer-Verlag,200046-66.
  • 8RUSSELL S,NORVIG P.Artificial intelligence:A modern approach (3rd Edition)[M].Upper Saddle River,New Jersey 07458:Prentice Hall,2009:1152.
  • 9LV Q,CAO P,COHEN E,et al.Search and replication in unstructured peer-to-peer networks[C].Marina Del Rey,CA,United states:Association for Computing Machinery,2002.
  • 10KALOGERAKI V,GUNOPULOS D,ZEINALIPOUR-YAZTI D.A local search mechanism for peer-to-peer networks[C].McLean,Virginia,USA:ACM New York,NY,USA,2002:300-307.

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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