On Minimizing the Maximum Sensor Movement to Construct a Horizontal Barrier

被引：0

作者：

Zhang, Xiaoyun ^{[1
]}

Qiao, Daji ^{[1
]}

机构：

[1] Iowa State Univ, Ames, IA 50011 USA

来源：

2017 IEEE 36TH INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC) | 2017年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Barrier coverage is an important application of sensor networks to prevent intruders from crossing the protected region. In this paper, we study the problem of building a strong horizontal barrier with mobile sensors while minimizing the maximum sensor moving distance. An efficient binary-search based scheme is proposed to optimize the barrier location and sensors' final positions along the barrier. Performance and efficiency of our scheme are evaluated using simulation results.

引用

页数：8

共 16 条

[1]

Benkoczi R., 2016, INT S ALG EXP SENS S, P95

[2]

Benkoczi R., 2015, LNCS, V9536, P98, DOI DOI 10.1007/978-3-319-28472-98

[3]

Bhattacharya B, 2008, LECT NOTES COMPUT SC, V5165, P103

[4] Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain [J].

Chen, Danny Z. ;

Gu, Yan ;

Li, Jian ;

Wang, Haitao .

DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 50 (02) :374-408

[5]

Czyzowicz J., 2010, AD HOC MOBILE WIRELE

[6]

Czyzowicz J., 2009, AD HOC MOBILE WIRELE

[7] Complexity of barrier coverage with relocatable sensors in the plane [J].

Dobrev, Stefan ;

Durocher, Stephane ;

Eftekhari, Mohsen ;

Georgiou, Konstantinos ;

Kranakis, Evangelos ;

Krizanc, Danny ;

Narayanan, Lata ;

Opatrny, Jaroslav ;

Shende, Sunil ;

Urrutia, Jorge .

THEORETICAL COMPUTER SCIENCE, 2015, 579 :64-73

[8]

Kumar S., 2005, P ACM MOBICOM SEPT

[9]

Li S, 2015, INT CONF ASIC

[10]

Liu B., 2008, P ACM MOBIHOC MAY

← 1 2 →