skip to main content
10.1145/984622.984645acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
Article

RoamHBA: maintaining group connectivity in sensor networks

Published:26 April 2004Publication History

ABSTRACT

This paper presents a new group communication scheme, roamingcast, for collaborative information processing in wireless sensor networks. Roamingcast enables efficient communication among a subset of mobile terminals in a collaboration group. Unicast and multicast communication can be considered as special cases of roamingcast in which the subset contains one and all group members, respectively. We propose a Roaming Hub Based Architecture (RoamHBA, pronounced as 'rumba') as one solution to support roaming-cast. We present the distributed construction and dynamic update of a multicast tree, referred as the roaming hub. This roaming hub has the property that an average pair of terminals communicate using the hub with only constant degradation in path length compared to the best possible path. We have developed network layer protocols implementing this mechanism and evaluated their performance in comparison with roaming restricted flooding. We simulated our design using NS-2.

References

  1. J. Liu, M. Chu, J. Liu, J. E. Reich, and F. Zhao, "State-centric programming for sensor and actuator network systems," IEEE Pervasive Computing Magazine, 2003, to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Murat Demirbas, Anish Arora, and Mohamed Gouda, "A pursuer-evader game for sensor networks," in Sixth Symposium on Self-Stabilizing Systems (SSS'03), San Francisco, CA, LNCS 2704. June 2003, pp. 1--16, Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Shin, L. Guibas, and F. Zhao, "Distributed group management for track initiation and maintenance in target localization applications," in IPSN, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J.G. Jetcheva and D.B. Johnson, "Adaptive demand-driven multicast routing in mult-hop wireless ad hoc networks," in Proc. of the ACM Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc), October 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Ji and M.S. Corson, "Differential destination multicast-a manet multicast routing protocol for small groups," in IEEE INFOCOM, April 2001.Google ScholarGoogle Scholar
  6. R. Boivie, N. Feldman, Y. Imai, W. LIvens, D. Ooms, and O. Paridaens, "Explicit multicast (xcast) basic specification. internet draft (work i progress)," in draft-ooms-xcast-basic-spec-04.txt, Internet Engineering Task Force, January 2003.Google ScholarGoogle Scholar
  7. R. Hwang, D. Richards, and P. Winter, "The steiner tree problem," Annals of Discrete Mathematics, 1992.Google ScholarGoogle Scholar
  8. Fred Bauer and Anujan Varma, "Aries: A rearrangeable inexpensive edge-based on-line steiner algorithm," IEEE Journal of Selected Areas in Communications, July 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. F. Bauer and A. Varma, "Distributed algorithms for multicast path setup in data networks," in IEEE GLOBECOM, November 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Kadirire and G. Knight, "Comparison of dynamic multicast routing algorithms for wide-area packet-switched (atm) networks," in IEEE INFOCOM, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Gao and L. Zhang, "Well-separated pair decompositionfor the unit-disk graph metric and its applications," in 35th annual ACM symposium on theory of computing, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Amis and R. Prakash, "Load-balancing clusters in wireless ad hoc networks," in Proc. 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Sinha, R. Sivakumar, and V. Bharghavan, "Enhancing ad hoc routing with dynamic virtual infrastucutes," in IEEE INFOCOM, 2001.Google ScholarGoogle Scholar
  14. J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Comunications, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Das and V. Bharghavan, "Routing in ad hoc networks using minimum connected dominating sets," in ICC'97, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, "Geometric spanner for routing in mobile networks," in MobiHoc, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, and Lixia Zhang, "TTDD: Two-tier Data Dissemination in Large-scale Wireless Sensor Networks," ACM/Kluwer Mobile Networks and Applications (MONET), Special Issue on ACM MOBICOM, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. B. Blum, P. Nagaraddi, A. Wood, T. Abdelzaher, S. Son, and J. Stankovic, "An entity maintenance and connection service for sensor networks," in The First International Conference on Mobile Systems, Applications, and Services (MOBISYS `03), California, May 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. s. Ni, Y. Tseng, Y.Chen, and J. Sheu, "The broadcast storm problem in a mobile ad hoc network," in MOBICOM, August 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. F. Zhao, J. Shin, and J. Reich, "Information-driven dynamic sensor collaboration," IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 61--72, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  21. B. Karp and H. Kung, "Gpsr:greedy perimeter stateless routing for wireless networks," in MobiCom, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Y. Yu, R. Govindan, and D. Estrin, "Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks," Tech. Rep., UCLA/CSD-TR-01-0023, 2001.Google ScholarGoogle Scholar
  23. M. Mauve, J. Widmer, and H. Hartenstein, "A survey on position-based routing in mobile ad hoc networks," IEEE Network Magazine, vol. 15, no. 6, pp. 30--39, November 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Jeffrey Hightower and Gaetano Borriello, "location systems for ubiquitous computing," IEEE Computer, vol. 34, no. 8, pp. 57--667, August 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Andreas Savvides, Chih-Chieh Han, and Mani B. Strivastava, "Dynamic Fine-grained localization in ad-hoc networks of sensors," in Proc. MobiCom, 2001, pp. 166--179. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Andreas Savvides and Mani B. Strivastava, "Distributed Fine-grained localization in ad-hoc networks," IEEE Transactions of Mobile Computing, 2003.Google ScholarGoogle Scholar
  27. A. Ward, A. Jones, and A. Hopper, "A new location technique for the active office," IEEE Personnel Communications, vol. 4, no. 5, pp. 42--47, October 1997.Google ScholarGoogle ScholarCross RefCross Ref
  28. Q. Fang, J. Gao, and L. Guibas, "Locating and bypassing routing holes in sensor networks," in IEEE INFOCOM, March 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. RoamHBA: maintaining group connectivity in sensor networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          IPSN '04: Proceedings of the 3rd international symposium on Information processing in sensor networks
          April 2004
          464 pages
          ISBN:1581138466
          DOI:10.1145/984622

          Copyright © 2004 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 26 April 2004

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate143of593submissions,24%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader