skip to main content
10.1145/1516241.1516276acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

Connectivity-based clustering with stretching technique in MANETs

Published: 15 February 2009 Publication History

Abstract

In this paper, we propose a multi-hop stretching clustering scheme for MANETs. As the solution of k-hop minimum dominating set, our proposed scheme aims to reduce the number of cluster-heads which are responsible for maintaining the cluster backbone. By considering the intra connectivity, nodes with low communication reliability can join better clusters for better communication quality. We also prove the relationship between intra-connectivity and the remaining staying time of one node in its current cluster. Based on that, the intra-connection degree is taken into account when one mobile node chooses cluster candidates for joining. Next, we apply a stretching technique in clustering to decrease the leaving frequency of cluster-members. Finally, extensive performance evaluation verifies our results under different system settings.

References

[1]
P. Guptar, and P. R. Kumar, "The capacity of Wireless Networks," IEEE Transaction Information Theory, Volume 46, Issue 2, March 2000, pp. 417--427.
[2]
J. Y. Yu, and P. H. J. Chong, "A survey of Clustering schemes for Mobile Ad hoc Networks," IEEE Communication Surveys and Tutorials, Volume 7, Issue 1, 2005, pp. 32--48.
[3]
M. Abolhasan, T. Wysocki, and E. Dutkiewicz, "A review of Routing Protocols for Mobile Ad hoc Networks," Ad Hoc Networks, Volume 2, Number 1, January 2004, pp. 1--22.
[4]
M. Joa-Ng, and I. T. Lu, "A Peer-to-Peer Zone-based Two-level Link State Routing for Mobile Ad hoc Networks," IEEE Journal on Selected Areas in Communications, Volume 17, Issue 8, August 1999, pp. 1415--1425.
[5]
S. Leng, L. Zhang, H. Fu, and J. Yang, "A Novel Location Service Protocol Based on $k$-hop Clustering for Mobile Ad hoc Networks," IEEE Transactions on Vehicular Technology, Volume 56, March 2007, pp. 810--817.
[6]
C. R. Lin, and M. Gerla, "Adaptive Clustering for Mobile Wireless Networks," IEEE Journal on Selected Areas in Communication, Volume 15, Issue 7, September 1997, pp. 1265--1275.
[7]
F. G. Nocetti and J. S. Gonzalez, "Connectivity Based $k$-hop clustering in Wireless Networks," Telecommunication System, Volume 22, 2003, pp. 205--220.
[8]
A. D. Amis, R. Prakash, T. H. P Vuong, and D. T. Huynh, "Max-min d-cluster formation in wireless ad hoc networks," Proc. IEEE INFOCOM, 2000, pp. 32--41.
[9]
M. R. Brust, H. Frey, and S. Rothkugel, "Dynamic multi-hop clustering for mobile hybrid wireless networks," Proceedings of the 2nd international conference on Ubiquitous information management and communication, 2008, pp. 130--135.
[10]
C. C. Chiang, H. K. Wu and W. Liu, "Routing in Clustered Multi-hop, Mobile Wireless Networks with Fading Channel," Proceedings of IEEE SICON, 1997, pp. 197--211.
[11]
T. J. Kwon, M. Gerla, V. K. Varma, M. Barton and T. R. Hsing, "Efficient flooding with Passive Clustering-an overhead-free selective forward mechanism for Ad hoc/Sensor Networks," Proceedings of the IEEE, Volume 91, August 2003, pp. 1210--1220.
[12]
C. C. Shen, C. Srisathapornphat, R. Liu, Z. Huang, C. Jaikaeo, and E. L. Lloyd, "CLTC: A Cluster-based Topology Control Framework for Ad hoc networks," IEEE Transactions on Mobile Computing, Volume 1, January 2004, pp. 18--32.
[13]
K. S. Trivedi, "Probability, Statistics with Reliability, Queuing and Computer Science Applications," Wiley-Interscience, October 2001.

Cited By

View all
  • (2020)Clustering Schemes in MANETs: Performance Evaluation, Open Challenges, and Proposed SolutionsIEEE Access10.1109/ACCESS.2020.29704818(25135-25158)Online publication date: 2020
  • (2011)A new pruning method for efficient broadcasting in ad hoc networksInternational Journal of Mobile Network Design and Innovation10.1504/IJMNDI.2011.0425623:4(209-217)Online publication date: 1-Sep-2011
  • (2010)Efficient multi-hop broadcasting in wireless networks using k-shortest path pruningProceedings of the 11th international conference on Distributed computing and networking10.5555/2018057.2018095(283-294)Online publication date: 3-Jan-2010
  • Show More Cited By

Index Terms

  1. Connectivity-based clustering with stretching technique in MANETs

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
        February 2009
        704 pages
        ISBN:9781605584058
        DOI:10.1145/1516241
        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]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 15 February 2009

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. k-hop dominating set
        2. ad hoc networks
        3. mobility
        4. multi-hop clustering
        5. stability
        6. stretching clustering

        Qualifiers

        • Research-article

        Funding Sources

        Conference

        ICUIMC '09
        Sponsor:

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)2
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 13 Feb 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2020)Clustering Schemes in MANETs: Performance Evaluation, Open Challenges, and Proposed SolutionsIEEE Access10.1109/ACCESS.2020.29704818(25135-25158)Online publication date: 2020
        • (2011)A new pruning method for efficient broadcasting in ad hoc networksInternational Journal of Mobile Network Design and Innovation10.1504/IJMNDI.2011.0425623:4(209-217)Online publication date: 1-Sep-2011
        • (2010)Efficient multi-hop broadcasting in wireless networks using k-shortest path pruningProceedings of the 11th international conference on Distributed computing and networking10.5555/2018057.2018095(283-294)Online publication date: 3-Jan-2010
        • (2010)Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path PruningDistributed Computing and Networking10.1007/978-3-642-11322-2_30(283-294)Online publication date: 2010

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media