Anonymous Gossip: improving multicast reliability in mobile ad-hocnetworks
Chandra, R.
Ramasubramanian, V.
Birman, K.
Dept. of Comput. Sci., Cornell Univ., Ithaca, NY ;
This paper appears in: Distributed Computing Systems, 2001. 21st International Conference on.
Publication Date: Apr 2001
On page(s): 275-283
Meeting Date: 04/16/2001 - 04/19/2001
Location: Mesa, AZ, USA
ISBN: 0-7695-1077-9
References Cited: 18
INSPEC Accession Number: 6940057
Digital Object Identifier: 10.1109/ICDSC.2001.918957
Current Version Published: 2002-08-07
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. 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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
