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
相关论文
共 50 条
  • [1] Partitionable group membership for Mobile Ad hoc Networks
    Lim, L.
    Conan, D.
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (08) : 2708 - 2721
  • [2] Maximal group membership in ad hoc networks
    Filali, Mamoun
    Issarny, Valrie
    Mauran, Philippe
    Padiou, Grard
    Queinnec, Philippe
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2006, 3911 : 51 - 58
  • [3] Consistent group membership in ad hoc networks
    Roman, GC
    Huang, QF
    Hazemi, A
    [J]. PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, 2001, : 381 - 388
  • [4] Localized group membership service for ad hoc networks
    Briesemeister, L
    Hommel, G
    [J]. 2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS OF THE WORKSHOPS, 2002, : 94 - 100
  • [5] Secure Group Communication with Dynamic Membership Change in Ad Hoc Networks
    Kim, Heeyoul
    [J]. KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2011, 5 (09): : 1668 - 1683
  • [6] An efficient algorithm for maintaining consistent group membership in ad hoc networks
    Pradhan, P
    Helal, A
    [J]. 23RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, 2003, : 428 - 433
  • [7] Partitionable Mobile File System over Ad-Hoc Networks
    Yu, Weider D.
    Chen, Yan
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2006, 6 (7B): : 113 - 126
  • [8] Safe Routing in Ad Hoc Networks
    Seder, Lovro
    Ilic, Zeljko
    Kos, Mladen
    [J]. AUTOMATIKA, 2011, 52 (03) : 269 - 278
  • [9] ON IMPROVING THE ROBUSTNESS OF PARTITIONABLE INTERNET-BASED MOBILE AD HOC NETWORKS
    Lim, Sunho
    Chae, Soo-Hoan
    [J]. COMPUTING AND INFORMATICS, 2011, 30 (03) : 429 - 446
  • [10] Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks
    Wang, KH
    Li, BC
    [J]. IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 1089 - 1098