Skip to main content

Advertisement

SpringerLink
Log in

Fibonacci tiles strategy for optimal coverage in IoT networks

  • Published:
Annals of Telecommunications Aims and scope Submit manuscript

Abstract

This paper aims to find a minimal set of nodes to optimize coverage, connectivity, and energy-efficiency for 2D and 3D Wireless Sensor Networks (WSN). This issue is denoted as a trinomial problem in our study. We propose using the paving rectangle technique, which provides a minimal number of squares based on Fibonacci’s tiles. Applying this strategy to the area coverage, connectivity, and lifetime can reduce the non-deterministic polynomial time problem (NP-Hard problem). We propose a theoretical framework to model the problem, to show the effectiveness of the method applied to the area coverage, connectivity, and lifetime on heterogeneous WSNs. The simulation results highlight the benefits of using this technique.

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

Similar content being viewed by others

References

  1. Ke WC, Liu BH, Tsai MJ (2007) Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is np-complete. IEEE Trans Comput 56(5):710–715

    Article  MathSciNet  Google Scholar 

  2. Al-Turjman F (2017) Cognitive-node architecture and a deployment strategy for the future wsns. Springer Mob Netw Appl 23(4):940–955. https://doi.org/10.1007/s11036-017-0891-0

    Article  Google Scholar 

  3. Alam SN, Haas ZJ (2015) Coverage and connectivity in three-dimensional networks with random node deployment. Ad Hoc Netw 34:157–169

    Article  Google Scholar 

  4. Alduraibi F, Lasla N, Younis M (2016) Coverage-based node placement optimization in wireless sensor network with linear topology. In: IEEE (ed) IEEE international conference on communications (ICC). IEEE. https://doi.org/10.1109/ICC.2016.7511421

  5. Ammari HM, Das SK (2012) Centralized and clustered k-coverage protocols for wireless sensor networks. IEEE Trans Comput 61(1):118–133. https://doi.org/10.1109/TC.2011.82

    Article  MathSciNet  Google Scholar 

  6. Aurenhammer F (2001) Computational geometry : some easy questions and their recent solutions. J Univ Comput Sci 7:338–354

    MathSciNet  MATH  Google Scholar 

  7. Berglund N (2005) Récréations mathématiques. La suite de fibonacci

  8. Bernard T, Fouchal H (2012) Slot scheduling for wireless sensor networks. J Comput Methods Sci Eng 12(Supplement-1):1–12. https://doi.org/10.3233/JCM-2012-0432

    MathSciNet  Google Scholar 

  9. Boualem A, Ayaida M, Dahmani Y, De Runz C, Maatoug A (2019) New dijkstra front-back algorithm for data routing-scheduling via efficient-energy area coverage in wireless sensor network. In: 15th international wireless communications and mobile computing conference, Tangier Morocco

  10. Boualem A, Ayaida M, De Runz C (2020) Hybrid model approach for wireless sensor networks coverage improvement. In: IEEE (ed) 8th international conference on wireless networks and mobile communications (WINCOM2020). IEEE, Reims, France, pp 1–6

  11. Boualem A, Dahmani Y, Ayaida M, De Runz C (2019) A new fuzzy/evidential approach to address the area coverage problem in mobile wireless sensor networks. In: The 34th ACM/SIGAPP symposium on applied computing (SAC’19). ACM, New York, pp 2430–2433. https://doi.org/10.1145/3297280.3297635

  12. Boualem A, Dahmani Y, De Runz C, Ayaida M (2019) Spiderweb strategy: application for area coverage with mobile sensor nodes in 3d wireless sensor network. Int J Sens Netw (IJSNet) 29(2):121–133

    Article  Google Scholar 

  13. Boualem A, Dahmani Y, Maatoug A (2017) Energetic sleep- scheduling via probabilistic interference k-barrier coverage with truth-table technique in sensor network. In: IEEE (ed) International conference on mathematics and information technology. IEEE, Adrar, Algeria, pp 255–262

  14. Boualem A, Dahmani Y, Maatoug A, De Runz C (2018) Area coverage optimization in wireless sensor network by semi-random deployment. In: 7th international conference on sensor networks (SENSORNETS 2018), Funchal, Madeira, Portugal, pp 85–90

  15. Brousseau BA (1972) The fibonacci quarterly. Off J Fibonacci Assoc 10(3):303–318

    MathSciNet  Google Scholar 

  16. Chang CY, Sheu JP, Chen YC, Chang S (2009) An obstacle-free and power-efficient deployment algorithm for wireless sensor networks. IEEE Trans Syst Man Cybern Syst Hum 39(4):795–806. https://doi.org/10.1109/TSMCA.2009.2014389

    Article  Google Scholar 

  17. Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discret Math 86(1-3):165–177

    Article  MathSciNet  Google Scholar 

  18. Etancelin JM, Fabbri A, Guinand F (2019) MartinRosalie: Dacyclem: a decentralized algorithm for maximizing coverage and lifetime in a mobile wireless sensor network. Ad Hoc Netw Elsevier 87:174–187. https://doi.org/10.1016/j.adhoc.2018.12.008

    Article  Google Scholar 

  19. Farman H, Javed H, Ahmad J, Jan B, Zeeshan M (2016) Grid-based hybrid network deployment approach for energy efficient wireless sensor networks. J Sensors 2016:445–462. https://doi.org/10.1155/2016/2326917

    Article  Google Scholar 

  20. Fouchal H, Francillette Y, Hunel P, Vidot N (2009) A distributed power management optimisation in wireless sensors networks. In: The 34th Annual IEEE conference on local computer networks, LCN 2009, 20-23 October 2009, Zurich, Switzerland, Proceedings. IEEE Computer Society, pp 763–769. https://doi.org/10.1109/LCN.2009.5355031

  21. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. W. H. Freeman & Co., New York

    MATH  Google Scholar 

  22. Guo X, Zhao C, Yang X, Sun C, Li M, Li W, Zhou C (2012) A deterministic sensor node deployment method with target coverage based on grid scan. Chin J Sensors Actuators 25(1):104–109

    Google Scholar 

  23. Gupta H, Zhou Z, Das SR, Gu Q (2003) Connected sensor cover: self-organization of sensor networks for efficient query execution. In: 4th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc 03). ACM, pp 189–200

  24. Huang CF, Tseng YC (2005) A survey of solutions to the coverage problems in wireless sensor networks. J Internet Technol 1(6):1–8

    Google Scholar 

  25. Kalantary M, Meybodi MR (2010) Mobile sensor network deployment using cellular learning automata approach. In: International congress on ultra modern telecommunications and control systems and workshops (ICUMT). IEEE. https://doi.org/10.1109/ICUMT.2010.5676491

  26. Kenyon R (1996) Tiling a rectangle with the fewest squares. J Comb Theory Ser A 76 (2):272–291. https://doi.org/10.1006/jcta.1996.0104, https://www.sciencedirect.com/science/article/pii/S0097316596901041

    Article  MathSciNet  Google Scholar 

  27. Korbi IE, Zeadally S, Jumira O (2013) A chain-based relocation approach to maintain connectivity with a center of interest. In: 15th international conference on computational science and engineering (IEEE 2012), Nicosia, Cyprus. https://doi.org/10.1109/ICCSE.2012.40

  28. Kumar V, Arya S, Ramesh H (2000) Hardness of set cover with intersection. In: 27th int colloquium on automata, languages and programming (ICALP), 1853, pp 624–635

  29. Li J, Zhang B, Cui L (2010) A restricted delaunay tringulation graph based algorithm for self-deployment in mobile sensor networks. J Comput Inf Syst 6(10):3155–3162

    Google Scholar 

  30. Li X, Frey H, Santoro N, Stojmenovic I (2011) Strictly localized sensor self deployment for optimal focused coverage. IEEE Trans Mob Comput 10(11)

  31. Liao WH, Kao Y, Li YS (2011) A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks. Elsevier J Expert Syst Appl 38:12,180–12, 188

    Article  Google Scholar 

  32. Luo J, Wang D, Zhang Q, Luo J, Wang J, Zhang Q (2009) Double mobility: coverage of the sea surface with mobile sensor networks 13(1):52–55

  33. Wu MC (2004) Coverage problem in Wireless Ad Hoc Sensor Networks, chap. Handbook of Sensor Networks, chapter 19, CRC Press, Boca Raton

  34. Mahboubi H, Aghdam AG (2017) Distributed deployment algorithms for coverage improvement in a network of wireless mobile sensors: Relocation by virtual force. IEEE Trans Control Netw Syst 4(4):736–748

    Article  MathSciNet  Google Scholar 

  35. Mahjri I, Dhraief A, Belghith A, Drira K, Mathkour H (2016) A gps-less framework for localization and coverage maintenance in wireless sensor networks. SII Trans Internet Inf Syst 10 (1):96–116. https://doi.org/10.3837/tiis.2016.01.006

    Google Scholar 

  36. Nasri N, Mnasri S, Val T (2019) 3d node deployment strategies prediction in wireless sensors network. Int J Electron. https://doi.org/10.1080/00207217.2019.1687759

  37. Nor Azlina BT, Aziz Ab, Mohemmed AW, Alias MY (2009) A wireless sensor network coverage optimization algorithm based on particle swarm optimization and voronoi diagram. In: IEEE (ed) Proceedings of the 2009 IEEE international conference on networking, sensing and control. IEEE, Okayama, Japan

  38. O’Connor JJ, Robertson EF (1998) Expanded biographies and. Tech. rep., School of Mathematics and Statistics, University of St Andrews Scotland university crest. http://mathshistory.st-andrews.ac.uk/Biographies/Fibonacci.html

  39. Ogawa T, Shinjo T, kitajima S, Hara T, Nishio S (2010) Node control methods to reduce power consumption using push-based broadcast for mobile sensor networks. J Mob Multimed 6(2):114–127

    Google Scholar 

  40. O’Rourke J (1987) Mobile guards, chap. 3. Oxford University Press, Inc, 200 Madison Avenue, New York, p 10016

    Google Scholar 

  41. Sharmin S, Nur FN, Razzaque MA, Rahman MM (2014) Network lifetime aware area coverage for clustered directional sensor networks, discrete mathematics. In: International confence on networking systems and security (NSysS)

  42. Shen X, Chen J, Sun Y (2006) Grid scan: A simple and effective approach for coverage issue in wireless sensor networks. 2006 IEEE Int Conf Commun 8:3480–3484

    Article  Google Scholar 

  43. Shu T, Dsouza KB, Bhargava V, de Silva C (2019) Using geometric centroid of voronoi diagram for coverage and lifetime optimization in mobile wireless sensor networks. In: IEEE canadian conference of electrical and computer engineering (CCECE). https://doi.org/10.1109/CCECE.2019.8861820

  44. Stein S (1974) The degree of knottedness of tangled vortex lines. J Fluid Mech 81:445–462

    Google Scholar 

  45. Sun W, Tang M, Zhang L, Huo Z, Shu L (2020) A survey of using swarm intelligence algorithms in iot. Sensors 20(5). https://doi.org/10.3390/s20051420

  46. Tosun M, Çabuk UC, Akram VK, Dagdeviren O (2020) On connectivity-aware distributed mobility models for area coverage in drone networks. In: International conference on artificial intelligence and applied mathematics in engineering (ICAIAME 2020), Antalya, Turkey

  47. Wang Y, Lederer S, Gao J (2009) Connectivity-based sensor network localization with incremental delaunay refinement method. In: IEEE INFOCOM 2009. https://doi.org/10.1109/INFCOM.2009.5062167. IEEE

  48. Williams R (1979) The geometrical foundation of natural structure: a source book of design, chap. Chap. 2.3, 1st edn. Dover Publications, New York, pp 34–47

    Google Scholar 

  49. Wu CH, Lee KC, Chung YC (2006) A delaunay triangulation based method for wireless sensor network deployment. In: IEEE (ed) 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, pp 253–260

  50. Xiao J, Wang G, Zhang Y, Cheng L (2020) A distributed multi-agent dynamic area coverage algorithm based on reinforcement learning. IEEE Access 8:33,511–33,521

    Article  Google Scholar 

  51. Xie J, Wei D, Huang S, Bu X (2019) A sensor deployment approach using improved virtual force algorithm based on area intensity for multisensor networks. Math Probl Eng: 1–9. https://doi.org/10.1155/2019/8015309

  52. Yang H, Dai F, Cardei M, Wu J, Patterson F (2006) On connected multiple point coverage in wireless sensor networks. Int J Wirel Inf Netw 13(4):289–301

    Article  Google Scholar 

  53. Yu Z, Tang R, Yuan K, Lin H, Qian X, Deng X, Shiyun L (2019) Investigation of parameter effects on virtual-spring-force algorithm for wireless-sensor-network applications. Sensors (Basel) 19(14). https://doi.org/10.3390/s19143082

  54. Zaied M, Ben Amar C, Alimi M (2003) Award a new wavelet based beta function. In: International conference on signal, system and design, SSD03, vol 1, pp 185–191

  55. Zhao X, Cui Y, Guo Z, Hao Z (2020) An energy-efficient coverage enhancement strategy for wireless sensor networks based on a dynamic partition algorithm for cellular grids and an improved vampire bat optimizer. Sensors (Basel) 20(3)

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Ibn Khaldoun University, Tiaret, Algeria

    Adda Boualem

  2. Université de Reims Champagne-Ardenne, CReSTIC, Reims, France

    Hacene Fouchal & Marwane Ayaida

  3. BDTLN, LIFAT, University of Tours, Blois, France

    Cyril De Runz

Authors
  1. Adda Boualem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hacene Fouchal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marwane Ayaida
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cyril De Runz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adda Boualem.

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

Boualem, A., Fouchal, H., Ayaida, M. et al. Fibonacci tiles strategy for optimal coverage in IoT networks. Ann. Telecommun. 77, 331–344 (2022). https://doi.org/10.1007/s12243-021-00890-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12243-021-00890-8

Keywords

Search

Navigation