Building Ring-Like Overlays on Wireless Ad Hoc and Sensor Networks

In this paper, we discuss distributed algorithms to construct ring-like overlays over a subset of scattered nodes in a static, random wireless ad hoc and sensor network (WASN). A ring-like overlay consists of a unidirectional ring plus side paths or loops, in which the given subset of nodes may appear multiple times. Different from a Hamiltonian cycle, a ring-like overlay is easier to construct and more efficient to operate. Yet, it can support many useful control operations in WASN such as mutual exclusion, clock synchronization, and cluster management. Compared with other topologies, a ring-like overlay allows conflict-free two-way communications, supports node ordering, and provides cost-free status feedbacks of operations. In this paper, we first present a distributed algorithm to construct a proximity-aware ring-like overlay in WASN. We then show optimization techniques to adapt the primitive overlays to meet the various application requirements.

[1]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[2]  Antony Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM 2006.

[3]  Stephen B. Wicker,et al.  Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[4]  Mukesh Singhal,et al.  A reliable multicast algorithm for mobile ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[5]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[6]  Bella Bose,et al.  Fault-Tolerant Ring Embedding in de Bruijn Networks , 1993, IEEE Trans. Computers.

[7]  Guy Louchard,et al.  A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs , 2004, CAAN.

[8]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[9]  Sung-Ju Lee,et al.  On-Demand Multicast Routing Protocol (ODMRP) for Ad-Hoc Networks , 2002 .

[10]  Prasant Mohapatra,et al.  Efficient overlay multicast for mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[11]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[12]  David E. Culler,et al.  Flush: a reliable bulk transport protocol for multihop wireless networks , 2007, SenSys '07.

[13]  H. Baraka,et al.  ReMHoc: a reliable multicast protocol for wireless mobile multihop ad hoc networks , 2004, First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004..

[14]  William Yurcik,et al.  VRing: a case for building application-layer multicast rings (rather than trees) , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[15]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[16]  Wuu Yang,et al.  RICA: a ring-based information collection architecture in wireless sensor networks , 2006, Int. J. Sens. Networks.

[17]  Qun Li,et al.  Global Clock Synchronization in Sensor Networks , 2006, IEEE Trans. Computers.

[18]  Alan M. Frieze,et al.  An algorithm for finding Hamilton cycles in random graphs , 1985, STOC '85.

[19]  Wanjiun Liao,et al.  Family ACK tree (FAT): supporting reliable multicast in mobile ad hoc networks , 2003, IEEE Trans. Veh. Technol..

[20]  Franca Delmastro.  From Pastry to CrossROAD: CROSS-layer ring overlay for ad hoc networks , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[21]  Achour Mostéfaoui,et al.  A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms , 1994, IEEE Trans. Parallel Distributed Syst..

[22]  Roberto Baldoni,et al.  A distributed mutual exclusion algorithm for mobile ad-hoc networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[23]  Muneeb Ali,et al.  CSN: a network protocol for serving dynamic queries in large-scale wireless sensor networks , 2004, Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004..

[24]  J. J. Garcia-Luna-Aceves,et al.  The core-assisted mesh protocol , 1999, IEEE J. Sel. Areas Commun..

[25]  Chung-Ta King,et al.  Development of a long-lived, real-time automatic weather station based on WSN , 2008, SenSys '08.

[26]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[27]  Chung-Ta King,et al.  Wireless Sensor Networks for Debris Flow Observation , 2008, Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[28]  Sung-Ju Lee,et al.  A reliable, congestion-control led multicast transport protocol in multimedia multi-hop networks , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[29]  Gen-Huey Chen,et al.  Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs , 1999, IEEE Trans. Parallel Distributed Syst..