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-016-0469-9
Minimizing mobile sensor movements to form a line K-coverage | Peer-to-Peer Networking and Applications Skip to main content

Advertisement

Springer Nature Link
Log in

Minimizing mobile sensor movements to form a line K-coverage

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

Abstract

In wireless sensor networks and social networks, distributed nodes usually form a network with coverage ability for a lot of applications, such as the intrusion detection. In this paper, a new kind of coverage problem with mobile sensors is addressed, named Line K-Coverage. It guarantees that any intruder trajectory line cutting across a region of interest will be detected by at least K sensors. For energy efficiency, we aim to schedule an efficient sensor movement to satisfy the line K-coverage while minimizing the total sensor movements, which is named as LK-MinMovs problem. We firstly construct two time-efficient heuristics named LK-KM and LK-KM+ based on the famous Hungarian algorithm. By sacrificing optimality a little bit, these two algorithms have better time efficiency. Then we propose a pioneering layer-based algorithm LLK-MinMovs to solve LK-MinMovs in polynomial time. Here, we assume that all sensors are initially located in a closed region. We validate its correctness by theoretical analysis. Later, the more general situation are considered that all sensors are allowed to locate outside of the region. We improve LLK-MinMovs algorithm to the general version: GenLLK-MinMovs. More importantly, our GenLLK-MinMovs fixes a critical flaw for MinSum algorithm which was proposed by previous literature to solve line 1-coverage problem. We show the flaw using a counter example. Finally, we validate the efficiency of all our designs by numerical experiments and compare them under different experiment settings.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Choi W, Das SK (2009) Cross: a probabilistic constrained random sensor selection scheme in wireless sensor networks. Perform Eval 66(12):754–772

    Article  Google Scholar 

  2. Boukerche A, Xin F (2007) A voronoi approach for coverage protocols in wireless sensor networks. In: IEEE global telecommunications conference (GLOBECOM), pp 5190–5194

  3. Bai H, Chen X, Li B, Han D (2007) A location-free algorithm of energy-efficient connected coverage for high density wireless sensor networks. Discrete Event Dynamic Systems 17(1):1–21

    Article  MathSciNet  MATH  Google Scholar 

  4. Chizari H, Poston T, Razak SA, Abdullah AH, Salleh S (2014) Local coverage measurement algorithm in GPS-free wireless sensor networks. Ad Hoc Networks 23:1–17

    Article  Google Scholar 

  5. Wang B (2010) Coverage control in sensor networks. Springer, London

    Book  MATH  Google Scholar 

  6. Liang JB, Liu M, Kui XY (2014) A survey of coverage problems in wireless sensor networks. Sensors & Transducers 163(1):240–246

    Google Scholar 

  7. Fan X, Li VOK (2011) The probabilistic maximum coverage problem in social networks. In: IEEE global telecommunications conference (GLOBECOM), 6613(1): 1–5

  8. Zhang P, Chen W, Sun X, Wang Y, Zhang J (2014) Minimizing seed set selection with probabilistic coverage guarantee in a social network. In: ACM international conference on knowledge discovery & data mining (SIGKDD), pp 1306–1315

  9. Dash D, Gupta A, Bishnu A, Nandy SC (2014) Line coverage measures in wireless sensor networks. J Parallel Distrib Comput 74(7):2596–2614

    Article  Google Scholar 

  10. Huang C, Tseng Y (2005) The coverage problem in wireless sensor network. Mobile Network Application 10(4):519–528

    Article  Google Scholar 

  11. Kumar S, Lai TH, Arora A (2005) Barrier coverage with wireless sensors. In: The annual international conference on mobile computing & networking (ICMCN), pp 284–298

  12. Shen C, Cheng W, Liao X, Peng S (2008) Barrier coverage with mobile sensors. In: IEEE international symposium on parallel architectures, algorithms & networks (ISPAN), pp 99–104

  13. Balister P, Zheng Z, Kumar S, Sinha P (2009) Trap coverage: allowing coverage holes of bounded dimeter in wireless sensor network. In: IEEE international conference on computer communications (INFOCOM), pp 136–144

  14. Baumgartner K, Ferrari S (2008) A geometric transversal approach to analyzing track coverage in sensor networks. IEEE Transactions on Computers (TC) 57(8):1113–1128

    Article  MathSciNet  Google Scholar 

  15. Harada J, Shioda S, Saito H (2009) Path coverage properties of randomly deployed sensors with finite data-transmission ranges. Comput Netw 53(7):1014–1026

    Article  MATH  Google Scholar 

  16. Sundhar Ram S, Manjunath D, Iyer SK, Yogeshwaran D (2007) On the path coverage properties of random sensor networks. IEEE Trans Mob Comput 6(5):446–458

    Google Scholar 

  17. Czyzowicz J, Kranakis E, Krizanc D, Lambadaris I, Narayanan L, Opatrny J, Stacho L, Urrutia J, Yazdani M (2010) On minimizing the sum of sensor movements for barrier coverage of a line segment. In: International conference on ad hoc networks & wireless (ADHOC-NOW), 6288: 29–42

  18. Li X, Frey H, Santoro N, Stojmenovic I (2008) Localized sensor self-deployment with coverage guarantee. ACM Mobile Computing & Communications Review 12(2):50–52

    Article  Google Scholar 

  19. Yang SH, Li ML, Wu J (2007) Scan-based movement-assisted sensor deployment methods in wireless sensor networks. IEEE Trans Parallel Distrib Syst 18(8):1108–1121

    Article  Google Scholar 

  20. Zou Y, Chakrabarty K (2005) A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Transactions on Computers (TC) 54(8):978–991

    Article  Google Scholar 

  21. Ahmed A, Yasumoto K, Yamauchi Y, Ito M (2011) Distance and time based node selection for probabilistic coverage in people-centric sensing. IEEE Communications Society Conference on Sensor, Mesh & Ad Hoc Communications and Networks 2011:134–142

    Google Scholar 

  22. Mondal D, Kumar A, Bishnu A, Mukhopadhyaya K, Nandy SC (2011) Measuring the quality of surveillance in a wireless sensor network. Int J Found Comput Sci 22(4):983–998

    Article  MathSciNet  MATH  Google Scholar 

  23. Hesari ME, Kranakis E, Krizanc D, Ponce OM, Narayanan L, Opatrny J, Shende SM (2013) Distributed algorithms for barrier coverage using relocatable sensors. In: ACM symposium on principles of distributed computing (SPDC), pp 383–392

  24. Bar-Noy A, Rawitz D, Terlecky P (2013) Maximizing barrier coverage lifetime with mobile sensors. In: The Annual European Symposium Algorithm (ESA), pp 97–108

  25. Saipulla A, Westphal C, Liu B, Wang J (2013) Barrier coverage with line-based deployed mobile sensors. Ad Hoc Netw 11(4):1381–1391

    Article  Google Scholar 

  26. Li L, Zhang B, Shen X, Zheng J, Yao Z (2011) A study on the weak barrier coverage problem in wireless sensor networks. Computer Networks (CN) 55(3):711–721

    Article  MATH  Google Scholar 

  27. Wang Z, Liao J, Cao Q, Qi H, Wang Z (2013) Achieving k-barrier coverage in hybrid directional sensor networks. IEEE Trans Mob Comput 13(7):1443–1455

    Article  Google Scholar 

  28. Saipulla A, Liu B, Xing G, Fu X, Wang J (2010) Barrier coverage with sensors of limited mobility. In: ACM international symposium on mobile ad hoc networking & computing (MOBIHOC), pp 201–210

  29. Chang WY, Yu KM, So WT, Lin C-T, Lin CY (2011) Target coverage in wireless sensor networks. In: IEEE international conference on mobile ad-hoc & sensor networks (MSN), pp 408–412

  30. Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2:83–97

    Article  MathSciNet  MATH  Google Scholar 

  31. Munkres J (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5(1):32–38

    Article  MathSciNet  MATH  Google Scholar 

  32. Czyzowicz J, Kranakis E, Krizanc D, Lambadaris I, Narayanan L, Opatrny J, Stacho L, Urrutia J, Yazdani M (2009) On minimizing the maximum sensor movement for barrier coverage of a line segment. In: International conference on ad hoc networks & wireless (ADHOC-NOW), 5793: 194–212

  33. Chen DZ, Gu Y, Li J, Wang H (2013) Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Discrete Comput Geom 50(2):374–408

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China

    Yang Wang, Shuang Wu, Xiaofeng Gao, Fan Wu & Guihai Chen

Authors
  1. Yang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofeng Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fan Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Guihai Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaofeng Gao.

Additional information

This work was supported in part by the State Key Development Program for Basic Research of China (973 project 2012CB316201), in part by the Opening Project of Key Lab of Information Network Security of Ministry of Public Security (The Third Research Institute of Ministry of Public Security) Grant number C15602, the Opening Project of Baidu (Grant number 181515P005267), China NSF grant 61422208, 61472252, 61272443 and 61133006, Shanghai Science and Technology fund 15220721300, and in part by CCF-Tencent Open Fund. The opinions, findings, conclusions, and recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies or the government.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y., Wu, S., Gao, X. et al. Minimizing mobile sensor movements to form a line K-coverage. Peer-to-Peer Netw. Appl. 10, 1063–1078 (2017). https://doi.org/10.1007/s12083-016-0469-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-016-0469-9

Keywords

Search

Navigation