Skip to main content

Advertisement

SpringerLink
Log in

DMCSC: a fully distributed multi-coloring approach for scalable communication in synchronous broadcast networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Message collisions and conflicts on the level of communication channels are among the main factors of energy loss problem in large-scale restrained resource wireless networks. Several works addressing message collisions and conflicts has been proposed in the literature. Most of these works propose a centralized approach which is not always suitable especially in large scale Low-power and Lossy Networks (LLN). On the other hand, fully distributed solutions are more suited for LLN context, but mostly use a probabilistic approach that does not always guaranty a collision and conflict free communication. In this paper, we present a new solution ensuring collision and conflict free communication for any network topology. Our algorithm is fully distributed and allows to allocate communication channels using a graph coloring approach. At the end of the coloring process, we always achieve collision and conflict free communication regardless the network topology and its size. Moreover, our coloring approach is itself collision and conflict-free which significantly reduces energy loss during communication channels allocation. To evaluate the performance of our algorithm, we have conducted simulations on Omnet++ and have shown through the simulation results that our protocol outperforms existing works in several criteria.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

References

  1. Kumar A, Sharma S, Singh A, Alwadain A, Choi B, Manual-Brenosa J, Ortega-Mansilla A, Goyal N (2021) Revolutionary strategies analysis and proposed system for future infrastructure in Internet of Things. Sustainability. https://doi.org/10.3390/su14010071

    Article  Google Scholar 

  2. Goyal N, Kumar A, Popli R et al (2022) Priority based data gathering using multiple mobile sinks in cluster based UWSNs for oil pipeline leakage detection. Cluster Comput 25:1341–1354

    Article  Google Scholar 

  3. Attiya H, Welch J (2004) Distributed Computing: Fundamentals, Simulations and Advanced Topics, (2d Edition), Wiley-Interscience, 414 pages

  4. Shao C, Park H, Roh H, Lee W, Kim H (2020) PolarScout: Wi-Fi Interference-Resilient ZigBee Communication via Shell-Shaping. IEEE/ACM Transactions on Networking

  5. Goyal N, Kumar A, Popli R et al (2022) Priority based data gathering using multiple mobile sinks in cluster based UWSNs for oil pipeline leakage detection. Cluster Comput 25:1341–1354

    Article  Google Scholar 

  6. Barenboim LL, Elkin K (2014) Distributed graph coloring, fundamental and recent developments, Morgan & Claypool Publishers

  7. Blair J, Manne F (2009) An efficient self-stabilizing distance-2 coloring algorithm. Proc 16th Colloquium on Structural Information and Communication Complexity (SIROCCO’10), pp 237-251

  8. Halldórsson M, Kuhn F, Maus Y (2020) Distance-2 Coloring in the CONGEST Model. In Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC ’20), New York, USA, 233–242

  9. Herman T, Tixeuil S (2004) A distributed TDMA slot assignment algorithm for wireless sensor networks. Proc. Int’l Workshop on Algorithmic Aspects of Wireless Sensor Networks, pp 45-58

  10. Jemili I, Ghrab D, Belghith A, Derbel B, Dhraief A (2013) Collision aware coloring algorithm for wireless sensor networks. In Proc 9th Int’l Wireless Communication and Mobile Computing Conference (IWCMC’13), pages 1546-1553

  11. Mahfoudh S, Chalhoub G, Minet P, Misson M, Amdouni I (2010) Node coloring and color conflict detection in wireless sensor networks. Future Internet 2(4):469

    Article  Google Scholar 

  12. Rhee I, Warrier A, Min J, Xu L (2009) Drand: Distributed randomized TDMA scheduling for wireless ad-hoc networks. IEEE Trans Mobile Comput 8:1384–1396

    Article  Google Scholar 

  13. Li Y, Zhang X, Zeng J, Wan Y, Ma F (2017) A distributed TDMA scheduling algorithm based on energy-topology factor in Internet of Things. IEEE Access 5:10757–10768

    Article  Google Scholar 

  14. Batta MS, Aliouat Z, Harous S (2019) A distributed weight-based TDMA scheduling algorithm for latency improvement in IoT. 2019 IEEE 10th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON). IEEE

  15. Lakhlef H, Bourgeois J, Harous S, Myoupo J (2015) Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks. In CIT 2015, The 15th IEEE Int. Conf. on Computer and Information Technology, Liverpool, UK, pages 9299

  16. Lakhlef H, Raynal M, Taïani F (2019) Vertex coloring with communication constraints in synchronous broadcast networks. IEEE Trans Parallel Distrib Syst 30(7):1672–1686

    Article  MATH  Google Scholar 

  17. Bouabdallah A, Lakhlef H, Raynal M, Taani F (2017) Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks. IEEE AINA, The 31st IEEE International Conference on Advanced Information Networking and Applications 399-406

  18. Zhang X, Hong J, Zhang L, Shan X, Li V O (2007) CC-TDMA: Coloring-and coding-based multi-channel TDMA scheduling for wireless ad hoc networks. IEEE Wireless Communications and Networking Conference (WCNC)

  19. Narayanan L (2002) Channel assignment and graph multicoloring. Handbook of wireless networks and mobile computing, Wiley, ISBN: 0-471-41902-8

  20. Chipara O, Lu C, Stankovic J, Roman G-C (2011) Dynamic conflict-free transmission scheduling for sensor network queries. IEEE Trans Mobile Comput 10(5):734–748

    Article  Google Scholar 

  21. Raychaudhuri A (1994) Further results on T-coloring and frequency assignment problems. SIAM J Discrete Math 7(4):605–613

    Article  MathSciNet  MATH  Google Scholar 

  22. Chung K-M, Pettie S, Su H-H (2014) Distributed Algorithms for the Lovász Local Lemma and Graph Coloring. In: Proc. 33th ACM Symposium Principles of Distributed Computing

  23. Hugh Hind K, Molloy M, Reed B (1997) Colouring a graph frugally. Combinatorica 17(4):469–482

    Article  MathSciNet  MATH  Google Scholar 

  24. Molloy M, Bruce R (2002) Graph colouring and the probabilistic method. Vol. 23. Springer (Algorithms and combinatorics)

  25. Molloy M, Reed B (2010) Asymptotically optimal frugal colouring. J Comb Theory Ser B100(2):226–246

    Article  MathSciNet  MATH  Google Scholar 

  26. Kang RJ, Müller Frugal T (2011) Acyclic and star colourings of graphs. Discret Appl Math 159(16):1806–1814

    Article  MathSciNet  MATH  Google Scholar 

  27. Raynal M (2013) Distributed algorithms for message-passing systems. Springer, 500 pages, ISBN 978-3-642-38122-5

  28. https://omnetpp.org/

Download references

Author information

Authors and Affiliations

  1. INSA Hauts-de-France, CNRS, UMR 8201- LAMIH, Université polytechnique de Hauts-de-France, Valenciennes, France

    Youcef Imine & Hicham Lakhlef

  2. Heudiasyc UMR 7253, Universite de technologie de Compiegne, CNRS, Sorbonne universites, CS 60319, 60203, Compiègne, France

    Youcef Imine & Hicham Lakhlef

  3. IRISA, Université de Rennes, Rennes, France

    Michel Raynal & François Taïani

Authors
  1. Youcef Imine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hicham Lakhlef
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. François Taïani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Youcef Imine.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Imine, Y., Lakhlef, H., Raynal, M. et al. DMCSC: a fully distributed multi-coloring approach for scalable communication in synchronous broadcast networks. J Supercomput 79, 788–813 (2023). https://doi.org/10.1007/s11227-022-04700-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04700-3

Keywords

Search

Navigation