The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2009 vol.20)
pp: 1553-1566
Amit Banerjee , National Tsing Hua University, Hsinchu
Chung-Ta King , National Tsing Hua University, Hsinchu
ABSTRACT
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.
INDEX TERMS
Ad hoc networks, distributed algorithm, overlay, ring, wireless sensor networks.
CITATION
Amit Banerjee, Chung-Ta King, "Building Ring-Like Overlays on Wireless Ad Hoc and Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 11, pp. 1553-1566, November 2009, doi:10.1109/TPDS.2008.257
REFERENCES
[1] A. Sobeih, H. Baraka, and A. Fahmy, “ReMHoc: A Reliable Multicast Protocol for Wireless Mobile Multihop Ad Hoc Networks,” Proc. Consumer Comm. and Networking Conf. (CCNC), 2004.
[2] A. Sobeih, W. Yurcik, and J.C. Hou, “VRing: A Case for Building Application-Layer Multicast Rings (Rather Than Trees),” Proc. 12th Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '04), pp. 437-446, 2004.
[3] B. Bollobás, T.I. Fenner, and A.M. Frieze, “An Algorithm for Finding Hamilton Cycles in Random Graphs,” Proc. 17th Ann. ACM Symp. Theory of Computing (STOC '85), pp. 430-439, 1985.
[4] B. Krishnamachari, R. Bejar, and S. Wicker, “Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-Hop Wireless Networks,” Proc. 35th Ann. Hawaii Int'l Conf. System Sciences (HICSS), 2002.
[5] C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad Hoc Networks,” Proc. Wireless Comm. and Networking (WCNC'03), Mar. 2003.
[6] C.E. Perkins, E.M. Royer, and S.R. Das, “Ad Hoc on Demand Distance Vector (AODV) Routing,” IETF Internet Draft, 1998.
[7] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance Vector (DSDV) for Mobile Computers,” ACM SIGCOMM Computer Comm. Rev., pp. 234-244, Aug. 1994.
[8] C.J. Liu, H.C. Lee, J. Yang, J.T. Huang, Y.M. Fang, B.J. Lee, and C.T. King, “Development of a Long-Lived, Real-time Automatic Weather Station Based on WSN,” Proc. Sixth ACM Conf. Embedded Networked Sensor Systems (SenSys '08), poster, Nov. 2008.
[9] E. Levy, G. Louchard, and J. Petit, “A Distributed Algorithm to Find Hamiltonian Cycles in G(n, p) Random Graphs (2000),” Proc. Workshop Combinatorial and Algorithmic Aspects of Networking (CAAN), 2004.
[10] E. Royer and C.E. Perkins, “Multicast Operation of the Ad-Hoc On-Demand Distance Vector Routing Protocol,” Proc. ACM MobiCom '99, pp. 207-218, Aug. 1999.
[11] F. Delmastro, “From Pastry to CrossROAD: CROSS-Layer Ring Overlay for AD Hoc Networks,” Proc. Third Int'l Conf. Pervasive Computing and Comm. Workshops (PerCom '05), pp. 60-64, 2005.
[12] GloMoSim, http://pcl.cs.ucla.edu/projectglomosim/, 2008.
[13] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, Feb. 2003.
[14] J.J. Garcia-Luna-Aceves and E.L. Madruga, “The Core Assisted Mesh Protocol,” IEEE J. Selected Areas in Comm., special issue on ad hoc networks, vol. 17, no. 8, pp. 1380-1394, Aug. 1999.
[15] J.M. Helary, A. Mostefaoui, and M. Raynal, “A General Scheme for Token and Tree Based Distributed Mutual Exclusion Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1185-1196, Nov. 1994.
[16] K. Raymond, “A Tree-Based Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, no.1, pp. 61-77, Feb. 1989.
[17] K. Tang, K. Obraczka, S.J. Lee, and M. Gerla, “A Reliable, Congestion-Controlled Multicast Transport Protocol in Multimedia Multi-Hop Networks,” Proc. Fifth Int'l Symp. Wireless Personal Multimedia Comm. (WPMC '02), pp. 252-256, 2002.
[18] M. Ali and Z.A. Uzmi, “CSN: A Network Protocol for Serving Dynamic Queries in Large-Scale Wireless Sensor Networks,” Proc. Comm. Networks and Services Research (CNSR '04), pp. 165-174, May 2004.
[19] M. Caesar, M. Castro, E.B. Nightingale, G. O'Shea, and A. Rowstron, “Virtual Ring Routing: Network Routing Inspired by DHTs,” Proc. ACM SIGCOMM '06, pp. 351-362, 2006.
[20] M. Gerla, S.J. Lee, and W. Su, “On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks,” internet draft, draft-ietf-manet-odmrp-02.txt, 2000.
[21] P.H. Chou, Y.C. Chung, C.T. King, M.J. Tsai, B.J. Lee, and T.Y. Chou, “Wireless Sensor Networks for Debris Flow Observation,” Proc. Second Int'l Conf. Urban Disaster Reduction (ICUDR '07), Nov. 2007.
[22] Q. Li and D. Rus, “Global Clock Synchronization in Sensor Networks,” IEEE Trans. Computers, vol. 55, no. 2, pp. 214-226, Feb. 2006.
[23] R.A. Rowley and B. Bose, “Fault-Tolerant Ring Embedding in de Bruijn Networks,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1480-1486, Dec. 1993.
[24] R. Baldoni, A. Virgillito, and R. Petrassi, “A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks,” Proc. Seventh IEEE Symp. Computers and Comm. (ISCC '02), pp. 539-545, 2002.
[25] S. Kim, R. Fonseca, P. Dutta, A. Tavakoli, D. Culler, P. Levis, S. Shenker, and I. Stoica, “Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks,” Proc. Fifth Int'l Conf. Embedded Networked Sensor Systems (SenSys '07), pp. 351-365, 2007.
[26] S. Lindsey and C.S. Raghavendra, “PEGASIS: Power Efficient Gathering in Sensor Information Systems,” Proc. IEEE Aerospace Conf., pp. 1125-1130, 2002.
[27] S.Y. Hsieh, G.H. Chen, and C.W. Ho, “Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 223-237, Mar. 1999.
[28] S.C. Huang, R.H. Jan, and W. Yang, “RICA: A Ring-Based Information Collection Architecture in Wireless Sensor Networks,” Int'l J. Sensor Networks, vol. 1, nos. 3/4, pp. 190-199, Jan. 2006.
[29] T. Gopalsamy, M. Singhal, D. Panda, and P. Sadayappan, “A Reliable Multicast Algorithm for Mobile Ad Hoc Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '02), pp. 563-570, July 2002.
[30] V. Rajendran, Y. Yi, K. Obraczka, S.J. Lee, K. Tang, and M. Gerla, “Reliable, Adaptive, Congestion-Controlled Ad Hoc Multicast Transport Protocol: Combining Source-Based and Local Recovery,” Univ. of Califoria, Santa Cruz, technical report, 2003.
[31] W. Liao and M.Y. Jiang, “Family ACK Tree (FAT): Supporting Reliable Multicast in Mobile Ad-Hoc Networks,” IEEE Trans. Vehicular Technology, vol. 52, no. 6, pp. 1675-1685, Nov. 2003.
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool