Skip to main content
SpringerLink
Log in

Distributed Self-Stabilizing Capacitated Maximal Independent Set Construction in Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Wireless sensor networks (WSNs) are composed of a large number of wireless self-organized sensor nodes connected through a wireless decentralized distributed network without the aid of a predefined infrastructure. Fault-tolerance and power management are fundamental challenges in WSNs. A WSN is self-stabilizing if it can initially start at any state and obtain a legitimate state in a finite time without any external intervention. Self-stabilization is an important method for providing fault-tolerance in WSNs. Maximal independent set (MIS) is an extensively used structure for many important applications such as clustering (Randhawa and Jain in Wirel Personal Commun 97(3):3355, 2017. https://doi.org/10.1007/s11277-017-4674-5) and routing (Attea et al. in Wirel Personal Commun 81(2):819, 2015. https://doi.org/10.1007/s11277-014-2159-3; Lipiński in Wirel Personal Commun 101(1):251, 2018. https://doi.org/10.1007/s11277-018-5686-5) in WSNs. The capacitated MIS (CapMIS) problem is an extension of MIS in that each node has a capacity that determines the number of nodes it may dominate. In this paper, we propose a distributed self-stabilizing capacitated maximal independent set algorithm (CapMIS) in order to reduce energy consumption and support load balancing in WSNs. To the best of our knowledge, this is the first algorithm in this manner. The algorithm is validated through theoretical analysis as well as testbed implementations and simulations.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Randhawa, S., & Jain, S. (2017). Data aggregation in wireless sensor networks: Previous research, current status and future directions. Wireless Personal Communications, 97(3), 3355. https://doi.org/10.1007/s11277-017-4674-5.

    Article  Google Scholar 

  2. Attea, B. A., Khalil, E. A., Ozdemir, S., & Yildiz, O. (2015). A multi-objective disjoint set covers for reliable lifetime maximization of wireless sensor networks. Wireless Personal Communications, 81(2), 819. https://doi.org/10.1007/s11277-014-2159-3.

    Article  Google Scholar 

  3. Lipiński, Z. (2018). Routing algorithm for maximizing lifetime of wireless sensor network for broadcast transmission. Wireless Personal Communications, 101(1), 251. https://doi.org/10.1007/s11277-018-5686-5.

    Article  Google Scholar 

  4. Rashid, B., & Rehmani, M. H. (2016). Applications of wireless sensor networks for urban areas: A survey. Journal of Network and Computer Applications, 60, 192. https://doi.org/10.1016/j.jnca.2015.09.008.

    Article  Google Scholar 

  5. Jain, B., Brar, G., Malhotra, J., & Rani, S. (2017). A novel approach for smart cities in convergence to wireless sensor networks. Sustainable Cities and Society, 35, 440. https://doi.org/10.1016/j.scs.2017.08.005.

    Article  Google Scholar 

  6. Ramson, S. R. J. & Moni, D. J. (2017) In 2017 international conference on innovations in electrical, electronics, instrumentation and media technology (ICEEIMT), pp. 325–329. https://doi.org/10.1109/ICIEEIMT.2017.8116858

  7. Henry, E., Adamchuk, V., Stanhope, T., Buddle, C., & Rindlaub, N. (2019). Precision apiculture: Development of a wireless sensor network for honeybee hives. Computers and Electronics in Agriculture, 156, 138. https://doi.org/10.1016/j.compag.2018.11.001.

    Article  Google Scholar 

  8. Erciyes, K. (2013). Distributed graph algorithms for computer networks. New York: Springer.

    Book  Google Scholar 

  9. Akyildiz, I. F., Melodia, T., & Chowdhury, K. R. (2007). A survey on wireless multimedia sensor networks. Computer Networks, 51(4), 921.

    Article  Google Scholar 

  10. Singh, S. P., & Sharma, S. (2015). A survey on cluster based routing protocols in wireless sensor networks. Procedia Computer Science, 45, 687. https://doi.org/10.1016/j.procs.2015.03.133.

    Article  Google Scholar 

  11. Rostami, A. S., Badkoobe, M., Mohanna, F., keshavarz, H., Hosseinabadi, A. A. R., & Sangaiah, A. K. (2018). Survey on clustering in heterogeneous and homogeneous wireless sensor networks. The Journal of Supercomputing, 74(1), 277.

    Article  Google Scholar 

  12. Dijkstra, E. W. (1974). Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11), 643.

    Article  Google Scholar 

  13. Karp, R. M., & Wigderson, A. (1985). A fast parallel algorithm for the maximal independent set problem. Journal of the ACM, 32(4), 762. https://doi.org/10.1145/4221.4226.

    Article  MathSciNet  MATH  Google Scholar 

  14. Alon, N., Babai, L., & Itai, A. (1986). A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7(4), 567. https://doi.org/10.1016/0196-6774(86)90019-2.

    Article  MathSciNet  MATH  Google Scholar 

  15. Luby, M. (1986). A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4), 1036. https://doi.org/10.1137/0215074.

    Article  MathSciNet  MATH  Google Scholar 

  16. Goldberg, M. & Spencer, T. (1987). In 28th annual symposium on foundations of computer science (sfcs 1987), pp. 161–165. https://doi.org/10.1109/SFCS.1987.2.

  17. Łuczak, T., & Szymańska, E. (1997). A parallel randomized algorithm for finding a maximal independent set in a linear hypergraph. Journal of Algorithms, 25(2), 311. https://doi.org/10.1006/jagm.1997.0884.

    Article  MathSciNet  MATH  Google Scholar 

  18. Blelloch, G. E., Fineman, J. T. & Shun, J. (2012). In Proceedings of the twenty-fourth annual ACM symposium on parallelism in algorithms and architectures (ACM, New York, NY, USA, 2012), SPAA ’12, pp. 308–317. https://doi.org/10.1145/2312005.2312058.

  19. Fischer, M. & Noever, A. (2018). In Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2018), SODA ’18, pp. 2152–2160.

  20. Kuhn, F., Moscibroda, T., Nieberg, T. & Wattenhofer R. (2005). In DISC.

  21. Schneider, J. & Wattenhofer, R. (2008). In Proceedings of the twenty-seventh ACM symposium on principles of distributed computing (ACM, New York, NY, USA, 2008), PODC ’08, pp. 35–44. https://doi.org/10.1145/1400751.1400758.

  22. Linial, N. (1992). Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1), 193. https://doi.org/10.1137/0221015.

    Article  MathSciNet  MATH  Google Scholar 

  23. Scott, A., Jeavons, P., & Xu, L. (2013). In Proceedings of the 2013 ACM symposium on principles of distributed computing (ACM, New York, NY, USA), PODC ’13, pp. 147–156. https://doi.org/10.1145/2484239.2484247.

  24. Ghaffari, M. (2017). In Proceedings of the ACM symposium on principles of distributed computing (ACM, New York, NY, USA), PODC ’17, pp. 141–149. https://doi.org/10.1145/3087801.3087830.

  25. Guellati, N., & Kheddouci, H. (2010). A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. Journal of Parallel and Distributed Computing, 70(4), 406.

    Article  Google Scholar 

  26. Shukla, S. K., Rosenkrantz, D. J., Ravi, S. S., S, N. & Shukla, E.K. (1995). In Proceedings of the second workshop on self-stabilizing systems, pp. 7–1.

  27. Hedetniemi, S. M., Hedetniemi, S. T., Jacobs, D. P., & Srimani, P. K. (2003). Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Computers & Mathematics with Applications, 46(5–6), 805.

    Article  MathSciNet  Google Scholar 

  28. Lin, J. C., & Huang, T. C. (2003). An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set. IEEE Transactions on Parallel and Distributed Systems, 14(8), 742.

    Article  Google Scholar 

  29. Shi, Z., Goddard, W., & Hedetniemi, S. T. (2004). An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Information Processing Letters, 91(2), 77.

    Article  MathSciNet  Google Scholar 

  30. Ikeda, M., Kamei, S. & Kakugawa, H. (2002). In Proceedings 3rd international conference on parallel and distributed computing, applications and technologies

  31. Goddard, W., Hedetniemi, S., Jacobs, D. & Srimani, P. (2003). In Proceedings of parallel and distributed processing symposium, pp. 14.

  32. Turau, V. (2007). Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Information Processing Letters, 103(3), 88.

    Article  MathSciNet  Google Scholar 

  33. Arapoglu, O., Akram, V. K., & Dagdeviren, O. (2019). An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks. Computer Standards and Interfaces, 62, 32.

    Article  Google Scholar 

  34. Kuhn, F., & Moscibroda, T. (2010). Distributed approximation of capacitated dominating sets. Theory of Computing Systems, 47(4), 811. https://doi.org/10.1007/s00224-010-9271-x.

    Article  MathSciNet  MATH  Google Scholar 

  35. Shang, W., & Wang, X. (2011). Discrete mathematics. Algorithms and Applications, 03(01), 9.

    Google Scholar 

  36. Kao, M. J., Liao, C. S., & Lee, D. T. (2011). Capacitated domination problem. Algorithmica, 60(2), 274.

    Article  MathSciNet  Google Scholar 

  37. Cygan, M., Pilipczuk, M., & Wojtaszczyk, J. O. (2011). Capacitated domination faster than O(\(2^{n}\)). Information Processing Letters, 111, 1099.

    Article  MathSciNet  Google Scholar 

  38. Pradhan, D. (2012). Algorithmic aspects of k-tuple total domination in graphs. Information Processing Letters, 112(21), 816.

    Article  MathSciNet  Google Scholar 

  39. Potluri, A., & Singh, A. (2013). Metaheuristic algorithms for computing capacitated dominating set with uniform and variable capacities. Swarm and Evolutionary Computation, 13, 22.

    Article  Google Scholar 

  40. Liedloff, M., Todinca, I., & Villanger, Y. (2014). Solving capacitated dominating set by using covering by subsets and maximum matching. Discrete Applied Mathematics, 168, 60.

    Article  MathSciNet  Google Scholar 

  41. Kao, M. J., Chen, H. L., & Lee, D. T. (2015). Capacitated domination: Problem complexity and approximation algorithms. Algorithmica, 72(1), 1.

    Article  MathSciNet  Google Scholar 

  42. Li, R., Hu, S., Zhao, P., Zhou, Y., & Yin, M. (2017). A novel local search algorithm for the minimum capacitated dominating set. Journal of the Operational Research Society, 69(6), 849–863.

    Article  Google Scholar 

  43. Chuzhoy, J. & Naor, J.S. (2002). in The 43rd annual IEEE symposium on foundations of computer science, 2002. Proceedings. pp. 481–489. https://doi.org/10.1109/SFCS.2002.1181972.

  44. Guha, S., Hassin, R., Khuller, S., & Or, E. (2003). Capacitated vertex covering. Journal of Algorithms, 48(1), 257. https://doi.org/10.1016/S0196-6774(03)00053-1. Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms.

    Article  MathSciNet  MATH  Google Scholar 

  45. Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., & Srinivasan, A. (2006). An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences, 72(1), 16. https://doi.org/10.1016/j.jcss.2005.06.004.

    Article  MathSciNet  MATH  Google Scholar 

  46. Kao, M. J., Shiau, J. Y., Lin, C. C., & Lee, D. (2019). Tight approximation for partial vertex cover with hard capacities. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2019.01.027.

  47. Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990). Unit disk graphs. Discrete Mathematics, 86(1), 165. https://doi.org/10.1016/0012-365X(90)90358-O.

    Article  MathSciNet  MATH  Google Scholar 

  48. Inc. M. Iris datasheet. http://www.memsic.com/userfiles/files/Datasheets/WSN/IRIS_Datasheet.pdf. Accessed 1 Sept 2019.

  49. Karl, H., & Willig, A. (2005). Protocols and architectures for wireless sensor networks. New York: Wiley.

    Book  Google Scholar 

  50. Datta, A. K., Larmore, L. L., Devismes, S., Heurtefeux, K., & Rivierre, Y. (2013). Self-stabilizing small k-dominating sets. International Journal of Networking and Computing, 3, 116. https://doi.org/10.15803/ijnc.3.1_116.

    Article  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank TUBITAK (Scientific and Technical Research Council of Turkey) for the project grant (Project Number 215E115).

Author information

Authors and Affiliations

  1. International Computer Institute, Ege University, Izmir, Turkey

    Ozkan Arapoglu & Orhan Dagdeviren

Authors
  1. Ozkan Arapoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Orhan Dagdeviren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ozkan Arapoglu.

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

Arapoglu, O., Dagdeviren, O. Distributed Self-Stabilizing Capacitated Maximal Independent Set Construction in Wireless Sensor Networks. Wireless Pers Commun 114, 3271–3293 (2020). https://doi.org/10.1007/s11277-020-07528-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-07528-3

Keywords

Search

Navigation