1 / 20

Anonymous Gossip Improving Multicast Reliability in Mobile Ad Hoc Networks

This research paper discusses the use of anonymous gossip protocol to enhance the reliability of multicast communication in mobile ad hoc networks. It presents a simulation-based analysis of the protocol's performance, highlighting its benefits in terms of packet delivery, scalability, and applicability to different network types.

pinto
Download Presentation

Anonymous Gossip Improving Multicast Reliability in Mobile Ad Hoc Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Anonymous GossipImproving Multicast Reliability in Mobile Ad Hoc Networks Ranveer Chandra Ramasubramanian Venugopalan Ken Birman Dept. of Computer Science, Cornell University.

  2. Introduction • Mobile ad hoc network • wireless mobile devices capable of direct peer to peer communication. • deployable without fixed infrastructure. • Harsh working conditions • low bandwidth connections. • restricted power supply.

  3. Multicast in Ad Hoc Networks • Applications of ad hoc networks. • disaster relief and rescue missions. • military coordination. • sensor networks. • Multicast is inevitable! • On demand multicast routing protocols. • MAODV, AMRIS. (tree based) • ODMRP, MCEDAR. (mesh based)

  4. Reliable Multicast! • Messages not delivered to some members of the group. • mobility and congestion. • transient partitions. • maintenance of multicast structure. • No attempt to recover lost messages.

  5. Multicast Protocol Classical Gossip Probabilistic Reliability = + Classical Gossip • Works in background with multicast protocol. • Members “gossip” randomly with other members to recover lost messages. • Probabilistic reliability guarantees. • see “Epidemic Algorithms…”, Demers et al. • see “Bimodal Multicast…”, Birman et al.

  6. Classical Gossip S D

  7. Our Protocol Anonymous Gossip Classical Gossip • Members should have complete or partial knowledge of other group members. • Impracticable in ad-hoc networks. • no organized hierarchies. • increased volatility in membership.

  8. Anonymous Gossip • No knowledge of group membership is necessary. • Uses underlying multicast structure to direct gossip requests. • Each node chooses a random neighbor to forward gossip requests. • Gossip replies are sent back directly.

  9. Anonymous Gossip S D

  10. Gossip with members discovered in earlier rounds of anonymous gossip. Optimization I:Informed Gossip • Circuitous gossip paths discovered. • Multicast structure may be broken. • Unicast gossip requests as well as replies. • Gossip across virtual partitions.

  11. D Informed Gossip S

  12. High probability: gossip with nearer members. Low probability: gossip with distant members. Optimization II:Gossip with Locality • Gossip with nearer members. • receive gossip replies faster. • reduce traffic overhead. • Gossip with distant members. • recover from regional losses.

  13. Informed Gossip  AG: The Complete Protocol Anonymous Gossip locality Multicast Protocol

  14. Simulation • MAODV: underlying multicast protocol. • GloMoSim: network simulator. • Random waypoint: mobility model. • Every third node is a group member. • Node 1 sends 2201 packets over 440s. • 10 runs with different seeds.

  15. Packet Delivery vs. Transmission Range.

  16. Packet Delivery vs. Max Speed

  17. Packet Delivery vs. Number of nodes.

  18. Goodput Ratio of AG

  19. Analysis • Increases packet delivery of MAODV. • Smoothens variation in packet delivery at different nodes. • Scalable with size of network. • Can work with unidirectional links. • Extra message overhead. • Latency in recovering lost messages.

  20. Conclusions • AG improves performance significantly. • Can be applied to tree based and mesh based on-demand multicast protocols. • Can be applied in wire line networks.

More Related