Computing an Optimal Path with the Minimum Number of Distinct Sensors

被引：0

作者：

Fan, Chenglin ^{[1
]}

Yang, Qing ^{[1
]}

Zhu, Binhai ^{[1
]}

机构：

[1] Montana State Univ, Dept Comp Sci, Bozeman, MT 59717 USA

来源：

WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS | 2015年 / 9204卷

关键词：

BARRIER COVERAGE;

D O I：

10.1007/978-3-319-21837-3_11

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Wireless sensors can be deployed in boundary regions to replace human in intruder detection. Given a deployment of such a wireless sensor network, we present a method to compute a path crossing the minimum number of distinct sensors from a source to a destination. Then, we propose the selfish path problem, in which the intruder is always getting more closer to the destination, and we design a greedy algorithm for this problem. We implement these algorithms and compare the number of sensors crossed by a random path, a line segment path, a selfish path, and two paths generated by Dijkstra's algorithm and an adapted Bellman-Ford algorithm. Some important empirical results are obtained.

引用

页码：104 / 113

页数：10

共 50 条

[31] Research on optimal number of servers for cloud computing centers
Liu, Xiaodong
Wang, Miao
ICIC Express Letters, Part B: Applications, 2015, 6 (12): : 3361 - 3365
[32] On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Dumitrescu, Adrian
Toth, Csaba D.
PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1114 - +
[33] An Optimal Algorithm for Computing the Largest Number of Red Nodes
Zhu, Daxin
Wang, Xiaodong
PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING FOR MECHANICS AND MATERIALS, 2015, 21 : 1134 - 1139
[34] On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Dumitrescu, Adrian
Toth, Csaba D.
COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (02): : 203 - 224
[35] On the Minimum Number of Distinct Eigenvalues in the Problem for a Tree Formed by Stieltjes Strings
V. N. Pivovarchik
Ukrainian Mathematical Journal, 2020, 72 : 149 - 156
[36] On the Minimum Number of Distinct Eigenvalues in the Problem for a Tree Formed by Stieltjes Strings
Pivovarchik, V. N.
UKRAINIAN MATHEMATICAL JOURNAL, 2020, 72 (01) : 149 - 156
[37] Generalizations of the Strong Arnold Property and the minimum number of distinct eigenvalues of a graph
Barrett, Wayne
Fallat, Shaun
Hall, H. Tracy
Hogben, Leslie
Lin, Jephian C. -H.
Shader, Bryan L.
ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (02):
[38] A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
Levene, Rupert H.
Oblak, Polona
Smigoc, Helena
LINEAR ALGEBRA AND ITS APPLICATIONS, 2019, 564 : 236 - 263
[39] On Minimum Number of Wireless Sensors Required for Reliable Binary Source Estimation
Razi, Abolfazl
Yasami, Keyvan
Abedi, Ali
2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2011, : 1852 - 1857
[40] Estimating Bradykinesia in Parkinson's Disease with a Minimum Number of Wearable Sensors
Daneault, Jean-Francois
Lee, Sunghoon I.
Golabchi, Fatemeh N.
Patel, Shyamal
Shih, Ludy C.
Paganoni, Sabrina
Bonato, Paolo
2017 IEEE/ACM SECOND INTERNATIONAL CONFERENCE ON CONNECTED HEALTH - APPLICATIONS, SYSTEMS AND ENGINEERING TECHNOLOGIES (CHASE), 2017, : 264 - 265

← 1 2 3 4 5 →