Skip to main content
SpringerLink
Log in

Efficient meta-heuristic approaches in solving minimal exposure path problem for heterogeneous wireless multimedia sensor networks in internet of things

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

One of the well-known methods for evaluating Heterogeneous wireless multimedia sensor networks (HWMSNs) in Internet of Things have drawn attention of the research community because this type of networks possesses great advantages of both coverage and performance. One of the most fundamental issues in HWMSNs is the barrier coverage problem which evaluates the surveillance capability of the network systems, especially those designed for security purposes. Among multiple approaches to solve this issue, finding the minimal exposure path (MEP), which corresponds to the worst-case coverage of the network is the most popular and efficient way. However, the MEP problem in HWMSNs (hereinafter heterogeneous multimedia MEP or HM-MEP) is specifically complex and challenging with the unique features of the HWMSNs. Thus, the problem is then converted into numerical functional extreme with high dimension, non-differential and non-linearity. Adapting to these features, two efficient meta-heuristic algorithms, Hybrid Evolutionary Algorithm (HEA) and Gravitation Particle Swarm Optimization (GPSO) are proposed for solving the problem. The HEA is a hybrid evolutionary algorithm in combination with local search while the GPSO is a novel particle swarm optimization based on the gravity force theory. Experimental results on extensive instances indicate that the proposed algorithms are suitable for the HM-MEP problem and perform well in term of both solution accuracy and computation time compared to existing approaches.

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. Adriaens J, Megerian S, Potkonjak M (2006) Optimal worst-case coverage of directional field-of-view sensor networks. SECON pp 336–345

  2. Ai J, Abouzeid AA (2006) Coverage by directional sensors in randomly deployed wireless sensor networks. J Comb Optim 11(1):21–41

    Article  MathSciNet  Google Scholar 

  3. Akyildiz IF, Melodia T, Chowdhury KR (2007) A survey on wireless multimedia sensor networks. Comput Netw 51(4):921–960

    Article  Google Scholar 

  4. Arfken G, Weber HJ, Harris F (2013) Mathematical methods for physicists, 7th edn. Acadamic Press, Orlando

    MATH  Google Scholar 

  5. Binh HTT, Binh NTM, Hoang NH, Tu PA (2016) Heuristic algorithm for finding maximal breach path in wireless sensor network with omnidirectional sensors. In: Humanitarian technology conference (IEEE R10-HTC), pp 1–6

  6. Binh HTT, Binh NTM, Ngoc NH, Ly DTH, Nghia ND (2018) Efficient approximation approaches to minimal exposure path problem in probabilistic coverage model for wireless sensor networks. Appl Soft Comput 76:726–743

    Article  Google Scholar 

  7. Binh NTM, Thang CM, Nghia ND, Binh HTT (2017) Genetic algorithm for solving minimal exposure path problem in mobile sensor networks. IEEE Symposium Series on Computational Intelligence (SSCI), pp 1–8

  8. Clouqueur T, Phipatanasuphorn V, Ramanathan P, Saluja KK (2003) Sensor deployment strategy for detection of targets traversing a region. Mobile Netw Appl 8(4):453–461

    Article  Google Scholar 

  9. Costal D, Guedes LA (2010) The coverage problem in video-based wireless sensor networks: A survey. Sensors 10(9):8215–8247

    Article  Google Scholar 

  10. Djidjev HN (2010) Approximation algorithms for computing minimum exposure paths in a sensor field. ACM Trans Sensor Netw (TOSN) 7(3):23

    Google Scholar 

  11. Guvensan MA, Yavuz AG (2011) On coverage issues in directional sensor networks: A survey. Ad Hoc Netw 9(7):1238–1255

    Article  Google Scholar 

  12. Liu L, Song Y, Zhang H, Ma H, Vasilakos AV (2015) Physarum optimization: A biology-inspired algorithm for the steiner tree problem in networks. IEEE Trans Comput 64(3):818–831

    Article  MathSciNet  Google Scholar 

  13. Liu L, Zhang X, Ma H (2013) Percolation theory-based exposure-path prevention for wireless sensor networks coverage in internet of things. IEEE Sensors J 13(1—10):3625–3636

    Article  Google Scholar 

  14. Liu L, Zhang X, Ma H (2014) Minimal exposure path algorithms for directional sensor networks. Wirel Commun Mob Comput 14(1—10):979–994

    Article  Google Scholar 

  15. Luigi A, Iera A, Morabi G (2010) The internet of things: A survey. Comput Netw 54(15):2787–2805

    Article  Google Scholar 

  16. Ma H, Liu Y (2005) On coverage problems of directional sensor networks. International Conference on Mobile Ad-Hoc and Sensor Networks, pp 721–731

  17. Ma H, Liu Y (2007) Some problems of directional sensor networks. Int J Sensor Netw 2(1–2):44–52

    Article  Google Scholar 

  18. Megerian S, Koushanfar F, Potkonjak M, Srivastava M (2003) Minimal and maximal exposure path algorithms for wireless embedded sensor networks. Proceedings of the 1st international conference on Embedded networked sensor systems. ACM, pp 40–50

  19. Megerian S, Koushanfar F, Potkonjak M, Srivastava M (2005) Worst and best-case coverage in sensor networks. IEEE Trans Mobile Comput 4(1):84–92

    Article  Google Scholar 

  20. Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava MB (2001) Coverage problems in wireless ad-hoc sensor networks. In: Proc IEEE Infocom pp 1380–1387

  21. Meguerdichian S, Koushanfar F, Qu G (2001) Exposure in wireless ad-hoc sensor networks. ACM, Proceedings of the 7th annual international conference on Mobile computing and networking, pp 139–150

  22. Miao Y, Wang Y, Jing–Xuan W (2015) Hybrid particle swarm algorithm for minimum exposure path problem in heterogeneous wireless sensor network. Int J Wirel Mob Comput 8(1):74–81

    Article  Google Scholar 

  23. Nakisa B, Rastgoo MN (2014) A survey: Particle swarm optimization based algorithms to solve premature convergence problem. J Comput Sci 10(9):1758–1765

    Article  Google Scholar 

  24. Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) Gsa: A gravitational search algorithm. Inform Sci 179(13):2232–2248

    Article  Google Scholar 

  25. Schutz B (2003) Gravity from the ground up. Cambridge University Press, Cambridge

    Book  Google Scholar 

  26. Song Y, Liu L, Ma H, Vasilakos AV (2014) A biology-based algorithm to minimal exposure problem of wireless sensor networks. IEEE Trans Netw Service Manag 11(1—3):417– 430

    Article  Google Scholar 

  27. Sun Y, Luo H, Das SK (2012) A trust-based framework for fault-tolerant data aggregation in wireless multimedia sensor networks. IEEE Trans Dependable Secure Comput 9(6): 785–797

    Article  Google Scholar 

  28. Veltri G, Huang Q, Qu G, Potkonjak M (2002) Exposure in wireless sensor networks: theory and practical solutions. Wirel Netw 8(5):443–454

    Article  Google Scholar 

  29. Wang B (2011) Coverage problems in sensor networks: A survey. ACM Comput Surveys (CSUR) 43(1-12):32

    Google Scholar 

  30. Ye M, Wang Y, Dai C, Wang X (2016) A hybrid genetic algorithm for the minimum exposure path problem of wireless sensor networks based on a numerical functional extreme model. IEEE Trans Veh Technol 65 (1—10):8644–8657

    Article  Google Scholar 

Download references

Acknowledgements

This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.02-2017.316.

Author information

Authors and Affiliations

  1. Hanoi University of Industry, Hanoi, Vietnam

    Nguyen Thi My Binh

  2. Hanoi University of Science and Technology, Hanoi, Vietnam

    Huynh Thi Thanh Binh & Nguyen Van Linh

  3. University of Technology Sydney, Sydney, Australia

    Shui Yu

Authors
  1. Nguyen Thi My Binh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huynh Thi Thanh Binh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nguyen Van Linh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shui Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Huynh Thi Thanh Binh.

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

Binh, N.T.M., Binh, H.T.T., Van Linh, N. et al. Efficient meta-heuristic approaches in solving minimal exposure path problem for heterogeneous wireless multimedia sensor networks in internet of things. Appl Intell 50, 1889–1907 (2020). https://doi.org/10.1007/s10489-019-01628-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-019-01628-9

Keywords

Search

Navigation