Optimal movement of mobile sensors for barrier coverage of a planar region

Binay Bhattacharya; Mike Burmester; Yuzhuang Hu; Evangelos Kranakis; Qiaosheng Shi; Andreas Wiese

doi:10.1016/j.tcs.2009.07.007

Optimal movement of mobile sensors for barrier coverage of a planar region

Binay Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese

Research output: Contribution to journal › Article › peer-review

86 Scopus citations

Abstract

Intrusion detection, area coverage and border surveillance are important applications of wireless sensor networks today. They can be (and are being) used to monitor large unprotected areas so as to detect intruders as they cross a border or as they penetrate a protected area. We consider the problem of how to optimally move mobile sensors to the fence (perimeter) of a region delimited by a simple polygon in order to detect intruders from either entering its interior or exiting from it. We discuss several related issues and problems, propose two models, provide algorithms and analyze their optimal mobility behavior.

Original language	English
Pages (from-to)	5515-5528
Number of pages	14
Journal	Theoretical Computer Science
Volume	410
Issue number	52
DOIs	https://doi.org/10.1016/j.tcs.2009.07.007
State	Published - 6 Dec 2009
Externally published	Yes

Keywords

Barrier coverage
Circle
Line
Minimize max
Minimize sum
Mobile robots
Optimal movement sensors

Access to Document

10.1016/j.tcs.2009.07.007

Cite this

@article{980b40463c114566a88ace149b3b1503,

title = "Optimal movement of mobile sensors for barrier coverage of a planar region",

abstract = "Intrusion detection, area coverage and border surveillance are important applications of wireless sensor networks today. They can be (and are being) used to monitor large unprotected areas so as to detect intruders as they cross a border or as they penetrate a protected area. We consider the problem of how to optimally move mobile sensors to the fence (perimeter) of a region delimited by a simple polygon in order to detect intruders from either entering its interior or exiting from it. We discuss several related issues and problems, propose two models, provide algorithms and analyze their optimal mobility behavior.",

keywords = "Barrier coverage, Circle, Line, Minimize max, Minimize sum, Mobile robots, Optimal movement sensors",

author = "Binay Bhattacharya and Mike Burmester and Yuzhuang Hu and Evangelos Kranakis and Qiaosheng Shi and Andreas Wiese",

note = "Funding Information: We would like to thank the anonymous reviewers for their valuable feedback, insights and comments. This research was supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) and MITACS (Mathematics of Information Technology and Complex Systems) grants.",

year = "2009",

month = dec,

day = "6",

doi = "10.1016/j.tcs.2009.07.007",

language = "English",

volume = "410",

pages = "5515--5528",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "52",

}

TY - JOUR

T1 - Optimal movement of mobile sensors for barrier coverage of a planar region

AU - Bhattacharya, Binay

AU - Burmester, Mike

AU - Hu, Yuzhuang

AU - Kranakis, Evangelos

AU - Shi, Qiaosheng

AU - Wiese, Andreas

N1 - Funding Information: We would like to thank the anonymous reviewers for their valuable feedback, insights and comments. This research was supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) and MITACS (Mathematics of Information Technology and Complex Systems) grants.

PY - 2009/12/6

Y1 - 2009/12/6

N2 - Intrusion detection, area coverage and border surveillance are important applications of wireless sensor networks today. They can be (and are being) used to monitor large unprotected areas so as to detect intruders as they cross a border or as they penetrate a protected area. We consider the problem of how to optimally move mobile sensors to the fence (perimeter) of a region delimited by a simple polygon in order to detect intruders from either entering its interior or exiting from it. We discuss several related issues and problems, propose two models, provide algorithms and analyze their optimal mobility behavior.

AB - Intrusion detection, area coverage and border surveillance are important applications of wireless sensor networks today. They can be (and are being) used to monitor large unprotected areas so as to detect intruders as they cross a border or as they penetrate a protected area. We consider the problem of how to optimally move mobile sensors to the fence (perimeter) of a region delimited by a simple polygon in order to detect intruders from either entering its interior or exiting from it. We discuss several related issues and problems, propose two models, provide algorithms and analyze their optimal mobility behavior.

KW - Barrier coverage

KW - Circle

KW - Line

KW - Minimize max

KW - Minimize sum

KW - Mobile robots

KW - Optimal movement sensors

UR - http://www.scopus.com/inward/record.url?scp=70350571679&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2009.07.007

DO - 10.1016/j.tcs.2009.07.007

M3 - Article

AN - SCOPUS:70350571679

SN - 0304-3975

VL - 410

SP - 5515

EP - 5528

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 52

ER -

Optimal movement of mobile sensors for barrier coverage of a planar region

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this