research-article

Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks

Authors:

Olivier Flauzac,

Bachar Salim Haggar,

Ibrahima NiangAuthors Info & Claims

ICUIMC '13: Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication

Article No.: 38, Pages 1 - 10

https://doi.org/10.1145/2448556.2448594

Published: 17 January 2013 Publication History

Abstract

Most Ad Hoc networks use communications based on diffusion that are typically expensive and may cause network saturation. In order to optimize these communications, one approach is to structure networks into clusters. In this paper, we present a self-stabilizing asynchronous distributed algorithm that builds non-overlapping k-hops clusters. Our approach does not require any initialization. It is based only on information from neighboring nodes with periodic messages exchange. Starting from an arbitrary configuration, the network converges to a stable state after a finite number of steps. We prove that the stabilization is reached after at most n + 2 transitions and uses at most n * log(2n + k + 3) memory space, where n is the number of network nodes. Using the OMNeT++ simulator, we performed an evaluation of the proposed algorithm.

References

[1]

H. Attiya and J. Welch. Distributed computing: fundamentals, simulations, and advanced topics. Wiley series on parallel and distributed computing. 2004.

Digital Library

[2]

H. Baala, O. Flauzac, J. Gaber, M. Bui, and T. El-Ghazawi. A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. Journal of Parallel and Distributed Computing, pages 97--104, 2003.

Digital Library

[3]

L. Blin, M. G. Potop-Butucaru, and S. Rovedakis. Self-stabilizing minimum degree spanning tree within one from the optimal degree. Journal of Parallel and Distributed Computing, pages 438--449, 2011.

Digital Library

[4]

E. Caron, A. K. Datta, B. Depardon, and L. L. Larmore. A self-stabilizing k-clustering algorithm for weighted graphs. J. Parallel Distrib. Comput., pages 1159--1173, 2010.

Digital Library

[5]

O. Dagdeviren and K. Erciyes. A hierarchical leader election protocol for mobile ad hoc networks. In M. Bubak, G. van Albada, J. Dongarra, and P. Sloot, editors, Computational Science - ICCS 2008, Lecture Notes in Computer Science, pages 509--518. 2008.

Digital Library

[6]

A. Datta, L. Larmore, and P. Vemula. Self-stabilizing leader election in optimal space. In S. Kulkarni and A. Schiper, editors, Stabilization, Safety, and Security of Distributed Systems, pages 109--123. 2008.

Digital Library

[7]

A. K. Datta, S. Devismes, and L. L. Larmore. A self-stabilizing o(n)-round k-clustering algorithm. In Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems, SRDS '09, pages 147--155. IEEE Computer Society, 2009.

Digital Library

[8]

E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, pages 643--644, 1974.

Digital Library

[9]

O. Flauzac, B. S. Haggar, and F. Nolot. Self-stabilizing clustering algorithm for ad hoc networks. Wireless and Mobile Communications, International Conference on, pages 24--29, 2009.

Digital Library

[10]

C. Johnen and L. Nguyen. Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks. In Algorithmic Aspects of Wireless Sensor Networks, pages 83--94. 2006.

Digital Library

[11]

C. Johnen and L. Nguyen. Self-stabilizing construction of bounded size clusters. Parallel and Distributed Processing with Applications, International Symposium on, pages 43--50, 2008.

Digital Library

[12]

C. Johnen and L. H. Nguyen. Robust self-stabilizing weight-based clustering algorithm. Theoretical Computer Science, pages 581--594, 2009.

Digital Library

[13]

I. Lavallée. Self-stabilizing distributed spanning tree and leader election algorithm. Self-stabilizing distributed spanning tree and leader election algorithm, ACIS Int. J Comp. Inf. Sci., pages 119--125, June 2000.

Digital Library

[14]

N. Mitton, A. Busson, and E. Fleury. Self-organization in large scale ad hoc networks. 2004.

[15]

N. Mitton, E. Fleury, I. Guerin Lassous, and S. Tixeuil. Self-stabilization in self-organized multihop wireless networks. In Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09, ICDCSW '05, pages 909--915, 2005.

Digital Library

[16]

G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2000.

Digital Library

Cited By

Ba MFall AHaggar B(2023)Hybrid Resource Scheduling Algorithms in Heterogeneous Distributed Computing: a Comparative Study and Further Enhancements2023 International Conference on IT Innovation and Knowledge Discovery (ITIKD)10.1109/ITIKD56332.2023.10100280(1-6)Online publication date: 8-Mar-2023
https://doi.org/10.1109/ITIKD56332.2023.10100280
Narwaria AMazumdar A(2023)Software-Defined Wireless Sensor Network: A Comprehensive SurveyJournal of Network and Computer Applications10.1016/j.jnca.2023.103636215(103636)Online publication date: Jun-2023
https://doi.org/10.1016/j.jnca.2023.103636
Mari JGabillon A(2023)The MauMe network - A LoRa multi-hop collaborative protocol and low-cost implementation exampleComputer Standards & Interfaces10.1016/j.csi.2023.10373386:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.csi.2023.103733
Show More Cited By

Index Terms

Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
1. General and reference
  1. Cross-computing tools and techniques
    1. Performance
2. Networks
  1. Network protocols
  2. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

A weight-based clustering multicast routing protocol for mobile ad hoc networks

In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, multicasting ...
A cluster based mobility prediction scheme for ad hoc networks

The ad hoc networks are completely autonomous wireless networks where all the users are mobile. These networks do not work on any infrastructure and the mobiles communicate either directly or via other nodes of the network by establishing routes. These ...
Improving broadcast performance by traffic isolation in wireless ad hoc networks: Research Articles

In this paper we propose a new broadcasting algorithm. In the proposed method we significantly reduce the broadcast overhead and also improve the broadcast delivery ratio in mobile networks. A novel traffic isolation method has been used which reduces ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICUIMC '13: Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication

January 2013

772 pages

ISBN:9781450319584

DOI:10.1145/2448556

Copyright © 2013 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]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing
SKKU: SUNGKYUNKWAN UNIVERSITY

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 January 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conseil Régional Champagne Ardenne
European Regional Development Fund

Conference

ICUIMC '13

Sponsor:

SIGAPP
SKKU

ICUIMC '13: The 7th International Conference on Ubiquitous Information Management and Communication

January 17 - 19, 2013

Kota Kinabalu, Malaysia

Acceptance Rates

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
119
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ba MFall AHaggar B(2023)Hybrid Resource Scheduling Algorithms in Heterogeneous Distributed Computing: a Comparative Study and Further Enhancements2023 International Conference on IT Innovation and Knowledge Discovery (ITIKD)10.1109/ITIKD56332.2023.10100280(1-6)Online publication date: 8-Mar-2023
https://doi.org/10.1109/ITIKD56332.2023.10100280
Narwaria AMazumdar A(2023)Software-Defined Wireless Sensor Network: A Comprehensive SurveyJournal of Network and Computer Applications10.1016/j.jnca.2023.103636215(103636)Online publication date: Jun-2023
https://doi.org/10.1016/j.jnca.2023.103636
Mari JGabillon A(2023)The MauMe network - A LoRa multi-hop collaborative protocol and low-cost implementation exampleComputer Standards & Interfaces10.1016/j.csi.2023.10373386:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.csi.2023.103733
Flauzac OJavier Gonzalez Santamaria CNolot FWoungang I(2020)An SDN approach to route massive data flows of sensor networksInternational Journal of Communication Systems10.1002/dac.430933:7Online publication date: 6-Jan-2020
https://doi.org/10.1002/dac.4309
Ndiaye MHancke GAbu-Mahfouz A(2017)Software Defined Networking for Improved Wireless Sensor Network Management: A SurveySensors10.3390/s1705103117:5(1031)Online publication date: 4-May-2017
https://doi.org/10.3390/s17051031
Gonzalez CCharfadine SFlauzac ONolot F(2016)SDN-based security framework for the IoT in distributed grid2016 International Multidisciplinary Conference on Computer and Energy Science (SpliTech)10.1109/SpliTech.2016.7555946(1-5)Online publication date: Jul-2016
https://doi.org/10.1109/SpliTech.2016.7555946
Gonzalez CFlauzac ONolot FJara A(2016)A Novel Distributed SDN-Secured Architecture for the IoT2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)10.1109/DCOSS.2016.22(244-249)Online publication date: May-2016
https://doi.org/10.1109/DCOSS.2016.22
Flauzac OGonzalez CNolot F(2016)Developing a Distributed Software Defined Networking Testbed for IoTProcedia Computer Science10.1016/j.procs.2016.04.15183(680-684)Online publication date: 2016
https://doi.org/10.1016/j.procs.2016.04.151
Benaouda NMostefai M(2015)A New Two-Level Clustering Scheme for Partitioning in Distributed Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks10.1155/2015/43504811:5(435048)Online publication date: Jan-2015
https://doi.org/10.1155/2015/435048
Olivier FCarlos GFlorent N(2015)SDN Based Architecture for Clustered WSN2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing10.1109/IMIS.2015.52(342-347)Online publication date: Jul-2015
https://doi.org/10.1109/IMIS.2015.52

View Options

Get Access

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents