A Comparative Study of Gossip based Multicast Routing Protocols for Wireless Ad Hoc Network

P. Latha, R. Ramachandran
{"title":"A Comparative Study of Gossip based Multicast Routing Protocols for Wireless Ad Hoc Network","authors":"P. Latha, R. Ramachandran","doi":"10.1109/ISAHUC.2006.4290639","DOIUrl":null,"url":null,"abstract":"Multicast routing protocols for mobile adhoc networks has the inability to handle high priority traffic, poor response to network congestion, excessive processing of control information, sub optimal error recovery and retransmission procedures. Gossip is well matched to the needs of ad-hoc networks since it is a controlledform of flooding. Messages are propagated through the network without congesting the wireless medium and are independent of topology. Gossip based approach forwards a message with some probability to reduce the overhead of routing protocols. Gossip protocols are characterized by each node probabilistically choosing to exchange information with another node. Gossip has also been considered as a scalable broadcast solution in wireless network and widely used for distributed protocol design. We analyze in this paper the performance comparison of various gossip protocols viz Anonymous gossip and Route driven gossip for wireless adhoc network that exhibit various topological and mobility characteristics.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"121 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAHUC.2006.4290639","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Multicast routing protocols for mobile adhoc networks has the inability to handle high priority traffic, poor response to network congestion, excessive processing of control information, sub optimal error recovery and retransmission procedures. Gossip is well matched to the needs of ad-hoc networks since it is a controlledform of flooding. Messages are propagated through the network without congesting the wireless medium and are independent of topology. Gossip based approach forwards a message with some probability to reduce the overhead of routing protocols. Gossip protocols are characterized by each node probabilistically choosing to exchange information with another node. Gossip has also been considered as a scalable broadcast solution in wireless network and widely used for distributed protocol design. We analyze in this paper the performance comparison of various gossip protocols viz Anonymous gossip and Route driven gossip for wireless adhoc network that exhibit various topological and mobility characteristics.
无线Ad Hoc网络中基于八卦的组播路由协议比较研究
针对移动自组织网络的组播路由协议存在着无法处理高优先级流量、对网络拥塞响应差、控制信息处理过多、错误恢复和重传过程次优等问题。八卦很好地满足了ad-hoc网络的需求,因为它是一种可控的泛滥形式。消息通过网络传播而不阻塞无线介质,并且与拓扑无关。基于八卦的方法以一定的概率转发消息,以减少路由协议的开销。八卦协议的特点是每个节点概率地选择与另一个节点交换信息。在无线网络中,Gossip也被认为是一种可扩展的广播解决方案,广泛用于分布式协议设计。本文分析了具有不同拓扑和移动性特征的无线自组网中各种八卦协议的性能比较,即匿名八卦和路由驱动八卦。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信