On Maintaining Group Membership Data in Ad Hoc Networks

Authors

Gruia-Catalin Roman, Washington University in St Louis
Qingfeng Huang, Washington University in St. Louis
Ali Hazemi, Washington University in St. Louis

Document Type

Technical Report

Department

Computer Science and Engineering

Publication Date

2000-01-01

Filename

WUCS-00-26.PDF

Technical Report Number

WUCS-00-26

Abstract

The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Essential to constructing a consistent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose an algorithm that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this algorithm are its reliance on location information and a conservative notion of logical connectivity that creates the illusion of announced disconnection. Analysis of movement patterns and delays is used to anticipate physical disconnections before they can impact application results.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7D50K6D

Recommended Citation

Roman, Gruia-Catalin; Huang, Qingfeng; and Hazemi, Ali, "On Maintaining Group Membership Data in Ad Hoc Networks" Report Number: WUCS-00-26 (2000). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/291