Home > Research > Publications & Outputs > An efficient algorithm for maintaining consiste...

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

An efficient algorithm for maintaining consistent group membership in ad hoc networks. / Pradhan, P.; Helal, Sumi.

23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003. IEEE, 2003. p. 428-433.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Pradhan, P & Helal, S 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. https://doi.org/10.1109/ICDCSW.2003.1203590

APA

Pradhan, P., & Helal, S. (2003). An efficient algorithm for maintaining consistent group membership in ad hoc networks. In 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003 (pp. 428-433). IEEE. https://doi.org/10.1109/ICDCSW.2003.1203590

Vancouver

Pradhan P, Helal S. An efficient algorithm for maintaining consistent group membership in ad hoc networks. In 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003. IEEE. 2003. p. 428-433 doi: 10.1109/ICDCSW.2003.1203590

Author

Pradhan, P. ; Helal, Sumi. / An efficient algorithm for maintaining consistent group membership in ad hoc networks. 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003. IEEE, 2003. pp. 428-433

Bibtex

@inproceedings{9c2336dd97d84e6a997c57245343bf31,
title = "An efficient algorithm for maintaining consistent group membership in ad hoc networks",
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. {\textcopyright} 2002 IEEE.",
keywords = "Ad hoc networks, Batteries, Change detection algorithms, Intelligent networks, Maintenance, Partitioning algorithms, Power generation, Power system reliability, Protocols, Voting, Algorithms, Mobile ad hoc networks, Network protocols, Signal detection, Solar cells, Telecommunication networks, Frequent disconnection, Group membership protocols, Group membership service, Virtual partitioning, Distributed computer systems",
author = "P. Pradhan and Sumi Helal",
year = "2003",
doi = "10.1109/ICDCSW.2003.1203590",
language = "English",
isbn = "0769519210",
pages = "428--433",
booktitle = "23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003",
publisher = "IEEE",

}

RIS

TY - GEN

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

AU - Pradhan, P.

AU - Helal, Sumi

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Ad hoc networks

KW - Batteries

KW - Change detection algorithms

KW - Intelligent networks

KW - Maintenance

KW - Partitioning algorithms

KW - Power generation

KW - Power system reliability

KW - Protocols

KW - Voting

KW - Algorithms

KW - Mobile ad hoc networks

KW - Network protocols

KW - Signal detection

KW - Solar cells

KW - Telecommunication networks

KW - Frequent disconnection

KW - Group membership protocols

KW - Group membership service

KW - Virtual partitioning

KW - Distributed computer systems

U2 - 10.1109/ICDCSW.2003.1203590

DO - 10.1109/ICDCSW.2003.1203590

M3 - Conference contribution/Paper

SN - 0769519210

SP - 428

EP - 433

BT - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

PB - IEEE

ER -