{"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.