Skip to main content
SpringerLink
Log in

Connectivity Based k-Hop Clustering in Wireless Networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and formation algorithm so that a cluster contains all nodes that are at distance at most k hops from the clusterhead. We also describe algorithms for modifying cluster structure in the presence of topological changes. We also proposed an unified framework for most existing and new clustering algorithm where a properly defined weight at each node is the only difference in otherwise the same algorithm. This paper studied node connectivity and node ID as two particular weights, for k=1 and k=2. Finally, we propose a framework for generating random unit graphs with obstacles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.M. Alzoubi, P.J. Wan and O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, in: Proc. IEEE Hawaii Internat. Conf. System Sciences, 2002.

  2. A.D. Amis, R. Prakash, T.H.P. Vuong and D.T. Huynh, Max-min d-cluster formation in wireless ad hoc networks, in: Proc. IEEE INFOCOM, 2000.

  3. S. Banerjee and S. Khuller, A clustering scheme for hierarchical control in multi-hop wireless networks, in: Proc. IEEE INFOCOM, 2001.

  4. S. Basagni, Distributed clustering for ad hoc networks, in: Proc. Internat. Sympos. Parallel Algorithms, Architectures and Networks ISPAN'99, Perth, Australia, June 1999, pp. 310–315.

  5. S. Basagni, Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks, in: Proc. IEEE VTC, September 1999.

  6. S. Basagni, A distributed algorithm for finding a maximal weighted independent set in wireless networks, Telecommunication Systems 18 (2001) 1–3.

    Google Scholar 

  7. C. Bettsetter and R. Krauser, Scenario-based stability analysis of the distributed mobility-adaptive clustering DMAC algorithm, in: Proc. ACM MobiHoc, Long Beach, CA, USA, 2001, pp. 232–241.

  8. M. Chatterjee, S.K. Das and D. Turgut, WCA: A weighted clustering algorithm for mobile ad hoc networks, Cluster Computing 5(2) (2002) 193–204.

    Google Scholar 

  9. G. Chen and I. Stojmenovic, Clustering and routing in wireless ad hoc networks, TR-99-05, SITE, University of Ottawa (June 1999).

  10. A. Ephremides, J.A. Flynn and D.J. Baker, The design and simulation of a mobile radio network with distributed control, IEEE Journal on Selected Areas in Communications 2(1) (1984) 226–237.

    Google Scholar 

  11. A. Ephremides, J.E. Wieselthier and D.J. Baker, A design concept for reliable mobile radio networks with frequency hoping signaling, Proceedings of the IEEE 75 (1987) 56–73.

    Google Scholar 

  12. M. Gerla and J.T.C. Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks 1 (1995) 255–265.

    Google Scholar 

  13. T.C. Hou and T.J. Tsai, An access-based clustering protocol for multihop wireless ad hoc networks, IEEE Journal on Selected Areas in Communications 19(7) (2001) 1201–1210.

    Google Scholar 

  14. F. Kamoun, Design considerations for large computer communication networks, UCLA-ENG-7642, Computer Science Department, UCLA (1976).

    Google Scholar 

  15. F. Kamoun and L. Kleinrock, Stochastic performance evaluation of hierachical routing for large networks, Computer Networks 3 (1979) 337–353.

    Google Scholar 

  16. D. Kim, S. Ha and Y. Choi, k-hop cluster-based dynamic source routing in wireless ad-hoc packet radio networks, in: IEEE VTC, 1998, pp. 224–228.

  17. I. Kleinrock and F. Kamoun, Hierarchical routing for large networks, Computer Networks 1 (1977) 155–174.

    Google Scholar 

  18. P. Krishna, N.N. Vaidya, M. Chatterjee and D.K. Pradhan, A cluster-based approach for routing in dynamic networks, ACM SIGCOMM Computer Communication Review 49 (1997) 49–64.

    Google Scholar 

  19. G. Lauer, Hierarchical routing design for SURAN, in: Proc. ICC, 1986, pp. 93–101.

  20. G. Lauer, Address servers in hierachical networks, in: Proc. ICC, 1988, pp. 443–451.

  21. G. Lauer, Packet-radio routing, in: Routing in Communication Networks, ed. M. Steenstrup (Prentice-Hall, Englewood Cliffs, NJ, 1995).

    Google Scholar 

  22. X.-Y. Li and I. Stojmenovic, Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation, in: Proc. AD-HOC NetwOrks and Wireless (ADHOC-NOW), Fields Institute, Toronto, 2002.

    Google Scholar 

  23. H. Lim and C. Kim, Flooding in wireless ad hoc networks, Computer Communication Journal 24(3-4) (2001) 353–363.

    Google Scholar 

  24. C.R. Lin and M. Gerla, Adaptive clustering for mobile wireless networks, IEEE Journal on Selected Areas in Communications 15(7) (1997) 1265–1275.

    Google Scholar 

  25. A.K. Parekh, Selecting routers in ad hoc wireless networks, in: ITS, 1994.

  26. C.V. Ramamoorthy, A. Bhide and J. Srivastava, Reliable clustering techniques for large mobile packet radio networks, in: Proc. IEEE INFOCOM, 1987, pp. 218–226.

  27. M. Seddigh, J. Solano and I. Stojmenovic, RNG and internal node based broadcasting algorithms for wireless one-to-one networks, ACM Mobile Computing and Communications Review 5(2) (2001) 37–44.

    Google Scholar 

  28. N. Shacham, Organization of dynamic radio networks by overlapping clusters, Performance (1984).

  29. N. Shacham and J.Westcott, Future directions in packet radio architectures and protocols, Proc. IEEE 75(1) (1987) 83–98.

    Google Scholar 

  30. R. Sivakumar, B. Das and V. Bharghavan, Spine routing in ad hoc network, Cluster Computing Journal (1998).

  31. I. Stojmenovic, M. Seddigh and J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, IEEE Transactions on Parallel and Distributed Systems 13(1) (2002) 14–25.

    Google Scholar 

  32. C.K. Toh, Associativity-based routing for ad-hoc mobile networks, Wireless Personal Communications 4 (1997) 103–139.

    Google Scholar 

  33. W.T. Tsai, C.V. Ramamoorthy, W.K. Tsai and O. Nishiguchi, An adaptive hierarchical routing protocol, IEEE Transactions on Communications 38 (1989) 1059–1075.

    Google Scholar 

  34. J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Telecommunication Systems 18 (2001) 1–3.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DISCA, IIMAS, UNAM, Circuito escolar s/n, Ciudad Universitaria, México D.F, 04510, México

    Fabian Garcia Nocetti & Julio Solano Gonzalez

  2. SITE, University of Ottawa, Ottawa, Ontario, K1N 6N5, Canada

    Ivan Stojmenovic

Authors
  1. Fabian Garcia Nocetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julio Solano Gonzalez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ivan Stojmenovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Stojmenovic.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nocetti, F.G., Gonzalez, J.S. & Stojmenovic, I. Connectivity Based k-Hop Clustering in Wireless Networks. Telecommunication Systems 22, 205–220 (2003). https://doi.org/10.1023/A:1023447105713

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023447105713

Search

Navigation