iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s12083-018-0653-1
An algorithm for calculating coverage rate of WSNs based on geometry decomposition approach | Peer-to-Peer Networking and Applications Skip to main content
Log in

An algorithm for calculating coverage rate of WSNs based on geometry decomposition approach

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Coverage rate is an important parameter in WSNs, which the higher the coverage rate, the better the ability of the network to fulfill its monitoring function. Aiming at the shortcoming of the great error in the calculation for network coverage rate, we propose an algorithm for calculating coverage rate based on geometry decomposition approach (CRGD), a kind of accurate calculating method. Against the random WSNs in non-border area, it segments the irregular coverage region into several regular bows and triangles by geometry decomposition approach, which areas can be calculated conveniently. Then, it accumulates the areas and gets the coverage rate finally. According to the experimental results and analysis, CRGD’s precision can be over 99%, which make the algorithm meet the requirements of practical application satisfactorily.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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. Yang QQ, He SB, Li JK, Chen JM, Sun YX (2015) Energy-Efficient Probabilistic Area Coverage in Wireless Sensor. IEEE Trans Veh Technol 61(1):367–377

    Article  Google Scholar 

  2. He SB, Shin DH, Chen JM et al (2016) Full-View Area Coverage in Camera Sensor Networks: Dimension Reduction and Near-Optimal Solutions. IEEE Trans Veh Technol 65(9):7448–7461

    Article  Google Scholar 

  3. Duan XM, Zhao CC, He SB, Cheng P, Zhang JS (2017) Distributed Algorithms to Compute Walrasian Equilibrium in Mobile Crowdsensing. IEEE Trans Ind Electron 64(5):4048–4057

    Article  Google Scholar 

  4. S. Parikh, V. M. Vokkarane, L. Xing, et al. Node-replacement Policies to Maintain Threshold-coverage in Wireless Sensor Networks. In: 16th International Conference on Computer Communications and Networks. Honolulu, United states: Institute of Electrical and Electronics Engineers Inc., 2007: 760-765.

  5. B. Gu. Research on Optimal Coverage Problem of Regular Region in WSN, Computer Technology and Development, 2013, 23(1): 107-111.

  6. Zhang HH, Jennifer CH (2005) Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Ad Hoc Sensor Wirel Netw 1(2):89–104

    Google Scholar 

  7. Y. Zou, C. Krishnendu, Sensor Deployment and Target Localization Based on Virtual Forces, In: Proceedings of 22nd Annual Joint Conference of the IEEE Computer and Communications Societies. San Francisco, USA: Institute of Electrical and Electronics Engineers Inc., 2003: 1293-1303.

  8. Li M, Shi WR (2011) Virtual Force-directed Differential Evolution Algorithm based Coverage-enhancing Algorithm for Heterogeneous Mobile Sensor Networks. Chin J Sci Instrum 32(5):1043–1050

    Article  Google Scholar 

  9. Wang R, Liu GZ (2009) Wireless Sensor Network Deployment based on Fish-swarm Optimization Algorithm. Journal of Vibration and Shock 28(2):8–11

    Google Scholar 

  10. Wang X, Wang S, Ma JJ (2007) Dynamic Sensor Deployment Strategy Based on Virtual Force-Directed Particle Swarm Optimization in Wireless Sensor Networks. Acta Electron Sin 35(11):2038–2042

    Google Scholar 

  11. Hu JW, Liang Y, Wang R (2008) Node Deployment with Arbitrary Coverage Percentage in Wireless Sensor Networks. Acta Automat Sin 34(12):1497–1507

    Article  Google Scholar 

  12. Liu Y (2011) Wireless Sensor Network Deployment Based on Genetic Algorithm and Simulated Annealing Algorithm. Computer. Simulation 28(50):171–174

    Google Scholar 

  13. Wang HJ, Zhang XL, Lyu HL (2017) Optimized Strategy of Sensor Coverage based on Geometry Coverage Algorithm. Application Research of Computers 34(8):2478–2482

    Google Scholar 

  14. Wang JK (2013) Wireless Sensor Nodes’ Coverage Research Based on C++, Chengdu: Master's degree thesis of Chengdu University of. Technology:12–24

  15. X.J. LI, J.X. CHEN, An Improved Algorithm for Computing the Area of Union of Circles, 2014 International Conference on Information Technology and Management Engineering, 2014[C]. Hong Kong: DEStech Publications, 2014:31-38

Download references

Acknowledgements

The research presented in this paper is supported by National Natural Science Foundation of China(61371177), Major Scientific and Technological Special Project of Shandong Province(2015ZDXX0201B04), the Space Support Technology Fund Projects(Grant No.2014-HT-HGD10), and the Fundamental Research Funds for the Central Universities (Grant No.HIT.NSRIF.201723).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Song Jia.

Additional information

This article is part of the Topical Collection: Special Issue on Network Coverage

Guest Editors: Shibo He, Dong-Hoon Shin, and Yuanchao Shu

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hui, X., Bailing, W., Jia, S. et al. An algorithm for calculating coverage rate of WSNs based on geometry decomposition approach. Peer-to-Peer Netw. Appl. 12, 568–576 (2019). https://doi.org/10.1007/s12083-018-0653-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-018-0653-1

Keywords

Navigation