TY - GEN
T1 - Leveraging knowledge for path exposure
AU - Shamoun, Simon
AU - Mei, Jie
AU - Abdelzaher, Tarek F.
AU - Bar-Noy, Amotz
N1 - Funding Information:
Research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-09-2-0053. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on.
Publisher Copyright:
© 2018 IEEE.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2018/10/25
Y1 - 2018/10/25
N2 - We study how knowledge of a moving object's path can be used to select sensors in a network that maximize the coverage of its path. We propose a mobility model that combines the shortest path between two points with random movement. Given the mobility model, we have different knowledge levels in terms of knowing nothing, the start, destination, movement model, and the whole path. We present a framework to assign weights to points on the movement grid based on the knowledge level and to greedily select sensors to maximize weighted coverage of the grid. We show in simulations of random movement that knowing more information generally has better performance, but for certain levels of knowledge, this decreases as the randomness increases. We also find that it is possible to obtain the maximum coverage by assuming the target follows the shortest path when the randomness is below a certain threshold. We verified these results on real human mobility traces.
AB - We study how knowledge of a moving object's path can be used to select sensors in a network that maximize the coverage of its path. We propose a mobility model that combines the shortest path between two points with random movement. Given the mobility model, we have different knowledge levels in terms of knowing nothing, the start, destination, movement model, and the whole path. We present a framework to assign weights to points on the movement grid based on the knowledge level and to greedily select sensors to maximize weighted coverage of the grid. We show in simulations of random movement that knowing more information generally has better performance, but for certain levels of knowledge, this decreases as the randomness increases. We also find that it is possible to obtain the maximum coverage by assuming the target follows the shortest path when the randomness is below a certain threshold. We verified these results on real human mobility traces.
KW - mobility model
KW - path coverage
KW - path exposure
KW - sensor coverage
KW - sensor selection
UR - http://www.scopus.com/inward/record.url?scp=85057136437&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85057136437&partnerID=8YFLogxK
U2 - 10.1109/DCOSS.2018.00021
DO - 10.1109/DCOSS.2018.00021
M3 - Conference contribution
AN - SCOPUS:85057136437
T3 - Proceedings - 14th Annual International Conference on Distributed Computing in Sensor Systems, DCOSS 2018
SP - 103
EP - 110
BT - Proceedings - 14th Annual International Conference on Distributed Computing in Sensor Systems, DCOSS 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 14th Annual International Conference on Distributed Computing in Sensor Systems, DCOSS 2018
Y2 - 18 June 2018 through 19 June 2018
ER -