The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2001)
Mesa, AZ
Apr. 16, 2001 to Apr. 19, 2001
ISBN: 0-7695-1077-9
pp: 0275
Ranveer Chandra , Cornell University
Venugopalan Ramasubramanian , Cornell University
Kenneth P. Birman , Cornell University
Abstract: In recent years, a number of applications of ad-hoc networks have been proposed. Many of them are based on the availability of a robust and reliable multicast protocol. In this paper, we address the issue of reliability and propose a scalable method to improve packet delivery of multicast routing protocols and decrease the variation in the number of packets received by different nodes. The proposed protocol works in two phases. In the first phase, any suitable protocol is used to multicast a message to the group, while in the second concurrent phase, the gossip protocol tries to recover lost messages. Our proposed gossip protocol is called Anonymous Gossip(AG) since nodes need not know the other group members for gossip to be successful. This is extremely desirable for mobile nodes, that have limited resources, and where the knowledge of group membership is difficult to obtain. As a first step, anonymous gossip is implemented over MAODV without much overhead and its performance is studied. Simulations show that the packet delivery of MAODV is significantly improved and the variation in number of packets delivered is decreased.
Ranveer Chandra, Venugopalan Ramasubramanian, Kenneth P. Birman, "Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 0275, 2001, doi:10.1109/ICDSC.2001.918957
183 ms
(Ver 3.3 (11022016))