Relying on safe distance to achieve strong partitionable group membership in ad hoc networks

被引:22
作者
Huang, QF
Julien, C
Roman, GC
机构
[1] Palo Alto Res Ctr PARC Inc, Palo Alto, CA 94304 USA
[2] Washington Univ, Dept Comp Sci & Engn, St Louis, MO 63130 USA
基金
美国国家科学基金会;
关键词
mobility; ad hoc network; group membership; consistency;
D O I
10.1109/TMC.2004.14
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Such views are important because they simplify both the programming and verification tasks. We argue that preventing the occurrence of unannounced disconnection is essential to constructing and maintaining a consistent view in the ad hoc mobile environment. In this light, we provide the specification for a partitionable group membership service supporting ad hoc mobile applications and propose a protocol for implementing the service. A unique property of this partitionable group membership is that messages sent between group members are guaranteed to be delivered successfully, given appropriate system assumptions. This property is preserved over time despite movement and frequent disconnections. The protocol splits and merges groups and maintains a logical connectivity graph based on a notion of safe distance. An implementation of the protocol in Java is available for testing. This work is used in an implementation of LIME, a middleware for mobility that supports transparent sharing of data in both wired and ad hoc wireless environments.
引用
收藏
页码:192 / 205
页数:14
相关论文
共 32 条
  • [1] THE TOTEM SINGLE-RING ORDERING AND MEMBERSHIP PROTOCOL
    AMIR, Y
    MOSER, LE
    MELLIARSMITH, PM
    AGARWAL, DA
    CIARFELLA, P
    [J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1995, 13 (04): : 311 - 342
  • [2] Amir Y, 1992, P 22 ANN INT S FAULT, P76
  • [3] ANCEAUME E, 1995, 951534 INRIA
  • [4] [Anonymous], P ACM MOBIHOC 01 OCT
  • [5] [Anonymous], INT TRANSP SYST ROAD
  • [6] Group communication in partitionable systems:: Specification and algorithms
    Babaoglu, Ö
    Davoli, R
    Montresor, A
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2001, 27 (04) : 308 - 336
  • [7] THE PROCESS GROUP-APPROACH TO RELIABLE DISTRIBUTED COMPUTING
    BIRMAN, KP
    [J]. COMMUNICATIONS OF THE ACM, 1993, 36 (12) : 37 - &
  • [8] Chandra T. D., 1996, Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, P322, DOI 10.1145/248052.248120
  • [9] Group communication specifications: A comprehensive study
    Chockler, GV
    Keidar, I
    Vitenberg, R
    [J]. ACM COMPUTING SURVEYS, 2001, 33 (04) : 427 - 469
  • [10] Group, majority, and strict agreement in timed asynchronous distributed systems
    Cristian, F
    [J]. PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL SYMPOSIUM ON FAULT-TOLERANT COMPUTING, 1996, : 178 - 187