Dynamic Sensor Selection for Path Coverage

被引:1
|
作者
Shamoun, Simon [1 ]
Abdelzaher, Tarek F. [2 ]
Bar-Noy, Amotz [1 ]
机构
[1] CUNY, New York, NY 10021 USA
[2] Univ Illinois, Urbana, IL USA
来源
ICDCN '19: PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING | 2019年
关键词
path coverage; sensor selection; mobility model; dynamic selection;
D O I
10.1145/3288599.3288627
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We study the problem of dynamically selecting sensors to maximize the number of steps covered on the path of a mobile target. The sensors are selected from those already deployed in a network as the target moves. The total number of sensors selected and rounds of selection are limited according to budget constraints. The variables are which sensors to select, when, and how. The best settings depend on how much is known about the target's path, such as its start and end locations and mobility pattern, which is updated as the target moves. We study how coverage is affected by these parameters, and how much such dynamic selection strategies can improve coverage over sensors selected in advance.
引用
收藏
页码:277 / 281
页数:5
相关论文
共 50 条
  • [21] A Dynamic Path Planning Approach for Multi-Robot Sensor-Based Coverage Considering Energy Constraints
    Yazici, Ahmet
    Kirlik, Gokhan
    Parlaktuna, Osman
    Sipahioglu, Aydin
    2009 IEEE-RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, 2009, : 5930 - +
  • [22] Study on path coverage enhancement algorithm for video sensor networks
    Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing 100876, China
    Tien Tzu Hsueh Pao, 2008, 7 (1291-1296):
  • [23] The Price of Incorrectly Aggregating Coverage Values in Sensor Selection
    Bar-Noy, Amotz
    Johnson, Matthew P.
    Naghibolhosseini, Nooreddin
    Rawitz, Dror
    Shamoun, Simon
    2015 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (DCOSS), 2015, : 98 - 107
  • [24] Computing best coverage path in the presence of obstacles in a sensor field
    Roy, Senjuti Basu
    Das, Gautam
    Das, Sajal
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 577 - +
  • [25] Energy-Efficient Algorithms for Path Coverage in Sensor Networks
    Liu, Zhixiong
    Zhou, Wei
    SENSORS, 2023, 23 (11)
  • [26] Computing Best Coverage Path with Reliability in Wireless Sensor Networks
    Tripathi, Pramod
    2016 SYMPOSIUM ON COLOSSAL DATA ANALYSIS AND NETWORKING (CDAN), 2016,
  • [27] Optimal sensor and path selection for target tracking in wireless sensor networks
    Mansouri, Majdi
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2014, 14 (01): : 128 - 144
  • [28] Joint path planning and sensor subset selection for multistatic sensor networks
    Tharmarasa, R.
    Lang, Tom
    Kirubarajan, T.
    SIGNAL AND DATA PROCESSING OF SMALL TARGETS 2008, 2008, 6969
  • [29] Optimal coverage algorithm of sensor nodes set selection in wireless sensor network
    Jia, Jie
    Chen, Jian
    Chang, Gui-Ran
    Zhao, Lin-Liang
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2007, 28 (11): : 1560 - 1563
  • [30] Energy-Aware Path Selection in Mobile Wireless Sensor Networks: A Dynamic Bayesian Game Approach
    Lin, Chih-kuang
    Kure, Oivind
    2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2009, : 1198 - 1203