loading...
An Efficient Algorithm for Maintaining Consistent Group Membership in Ad Hoc Networks
Providence, Rhode Island, USA May 19-May 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2003.120359023rd International Conference on Dist ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Pushkar Pradhan, Abdelsalam (Sumi) Helal, "An Efficient Algorithm for Maintaining Consistent Group Membership in Ad Hoc Networks," Distributed Computing Systems Workshops, International Conference on, pp. 428, 23rd International Conference on Distributed Computing Systems Workshops (ICDCSW'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/ICDCSW.2003.1203590,
author = {Pushkar Pradhan and Abdelsalam (Sumi) Helal},
title = {An Efficient Algorithm for Maintaining Consistent Group Membership in Ad Hoc Networks},
journal ={Distributed Computing Systems Workshops, International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1921-0},
pages = {428},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2003.1203590},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Distributed Computing Systems Workshops, International Conference on
TI - An Efficient Algorithm for Maintaining Consistent Group Membership in Ad Hoc Networks
SN - 0-7695-1921-0
SP
EP
A1 - Pushkar Pradhan,
A1 - Abdelsalam (Sumi) Helal,
PY - 2003
KW - hoc groups
KW - group maintenance
KW - view synchronization
VL - 0
JA - Distributed Computing Systems Workshops, International Conference on
ER -
 
Pushkar Pradhan, University of Florida
Abdelsalam (Sumi) Helal, University of Florida
Designing a reliable group membership algorithm for mobile ad hoc networks is a non-trivial task since we must deal with limited device power, possibilities of frequent disconnections and network partitions. The function of the group membership service is to maintain a consistent group view across all members of the group. Only then can we say that the group membership service is reliable. Reliable group membership protocols in distributed systems (e.g., the virtual partitioning (VP) algorithm) make free use of aborts as a tactic to ensure the reliability of group formation. We present a group membership algorithm based on VP that minimizes message exchanges and thus reduces the power spent in transmission by detecting and eliminating superfluous aborts.
Index Terms:
hoc groups, group maintenance, view synchronization
Citation:
Pushkar Pradhan, Abdelsalam (Sumi) Helal, "An Efficient Algorithm for Maintaining Consistent Group Membership in Ad Hoc Networks," icdcsw, pp.428, 23rd International Conference on Distributed Computing Systems Workshops (ICDCSW'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.