An efficient algorithm for maintaining consistent group membership in ad hoc networks

Pradhan, P. and Helal, Sumi (2003) An efficient algorithm for maintaining consistent group membership in ad hoc networks. In: 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003. IEEE, pp. 428-433. ISBN 0769519210

Full text not available from this repository.

Abstract

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. © 2002 IEEE.

Item Type: Contribution in Book/Report/Proceedings
Subjects:
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 90039
Deposited By: ep_importer_pure
Deposited On: 26 Jan 2018 09:30
Refereed?: Yes
Published?: Published
Last Modified: 30 Sep 2019 12:12
URI: https://eprints.lancs.ac.uk/id/eprint/90039

Actions (login required)

View Item View Item