The Minimal Exposure Path in Mobile Wireless Sensor Network

Lili Zhang, Xiaoqiang Chen, Jianxi Fan, Dajin Wang, Cheng Kuan Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Target traversing is an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target's moving paths. The minimal exposure path problem is to find a path among sensors so that the target's total exposure to the sensors is minimized. Most existing traversal algorithms ensure the target to stay as far as possible from static sensors. In this paper, we take into account the situation where there are moving sensors as well. We propose an effective algorithm based on tangent to not only stay as far as possible from static sensors, but also avoid mobile sensors. Simulations show that the proposed algorithms can solve the traversal path with mobile sensors' patrolling in wireless sensor networks.

Original languageEnglish
Title of host publicationProceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015
EditorsHong Shen, Hong Shen, Yingpeng Sang, Haiping Huang
PublisherIEEE Computer Society
Pages73-79
Number of pages7
ISBN (Electronic)9781467391177
DOIs
StatePublished - 19 Jan 2016
Event7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015 - Nanjing, China
Duration: 12 Dec 201514 Dec 2015

Publication series

NameProceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP
Volume2016-January
ISSN (Print)2168-3034
ISSN (Electronic)2168-3042

Other

Other7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015
CountryChina
CityNanjing
Period12/12/1514/12/15

Fingerprint

Wireless sensor networks
Sensors

Keywords

  • Voronoi diagram
  • cautioning point
  • exposure
  • minimal exposure path

Cite this

Zhang, L., Chen, X., Fan, J., Wang, D., & Lin, C. K. (2016). The Minimal Exposure Path in Mobile Wireless Sensor Network. In H. Shen, H. Shen, Y. Sang, & H. Huang (Eds.), Proceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015 (pp. 73-79). [7387304] (Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP; Vol. 2016-January). IEEE Computer Society. https://doi.org/10.1109/PAAP.2015.24
Zhang, Lili ; Chen, Xiaoqiang ; Fan, Jianxi ; Wang, Dajin ; Lin, Cheng Kuan. / The Minimal Exposure Path in Mobile Wireless Sensor Network. Proceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015. editor / Hong Shen ; Hong Shen ; Yingpeng Sang ; Haiping Huang. IEEE Computer Society, 2016. pp. 73-79 (Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP).
@inproceedings{fb498f331bcc41598e91b7c9ffa42124,
title = "The Minimal Exposure Path in Mobile Wireless Sensor Network",
abstract = "Target traversing is an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target's moving paths. The minimal exposure path problem is to find a path among sensors so that the target's total exposure to the sensors is minimized. Most existing traversal algorithms ensure the target to stay as far as possible from static sensors. In this paper, we take into account the situation where there are moving sensors as well. We propose an effective algorithm based on tangent to not only stay as far as possible from static sensors, but also avoid mobile sensors. Simulations show that the proposed algorithms can solve the traversal path with mobile sensors' patrolling in wireless sensor networks.",
keywords = "Voronoi diagram, cautioning point, exposure, minimal exposure path",
author = "Lili Zhang and Xiaoqiang Chen and Jianxi Fan and Dajin Wang and Lin, {Cheng Kuan}",
year = "2016",
month = "1",
day = "19",
doi = "10.1109/PAAP.2015.24",
language = "English",
series = "Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP",
publisher = "IEEE Computer Society",
pages = "73--79",
editor = "Hong Shen and Hong Shen and Yingpeng Sang and Haiping Huang",
booktitle = "Proceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015",

}

Zhang, L, Chen, X, Fan, J, Wang, D & Lin, CK 2016, The Minimal Exposure Path in Mobile Wireless Sensor Network. in H Shen, H Shen, Y Sang & H Huang (eds), Proceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015., 7387304, Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP, vol. 2016-January, IEEE Computer Society, pp. 73-79, 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015, Nanjing, China, 12/12/15. https://doi.org/10.1109/PAAP.2015.24

The Minimal Exposure Path in Mobile Wireless Sensor Network. / Zhang, Lili; Chen, Xiaoqiang; Fan, Jianxi; Wang, Dajin; Lin, Cheng Kuan.

Proceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015. ed. / Hong Shen; Hong Shen; Yingpeng Sang; Haiping Huang. IEEE Computer Society, 2016. p. 73-79 7387304 (Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP; Vol. 2016-January).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - The Minimal Exposure Path in Mobile Wireless Sensor Network

AU - Zhang, Lili

AU - Chen, Xiaoqiang

AU - Fan, Jianxi

AU - Wang, Dajin

AU - Lin, Cheng Kuan

PY - 2016/1/19

Y1 - 2016/1/19

N2 - Target traversing is an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target's moving paths. The minimal exposure path problem is to find a path among sensors so that the target's total exposure to the sensors is minimized. Most existing traversal algorithms ensure the target to stay as far as possible from static sensors. In this paper, we take into account the situation where there are moving sensors as well. We propose an effective algorithm based on tangent to not only stay as far as possible from static sensors, but also avoid mobile sensors. Simulations show that the proposed algorithms can solve the traversal path with mobile sensors' patrolling in wireless sensor networks.

AB - Target traversing is an important research topic in wireless sensor networks. Most works in this area consider the coverage issues of the target's moving paths. The minimal exposure path problem is to find a path among sensors so that the target's total exposure to the sensors is minimized. Most existing traversal algorithms ensure the target to stay as far as possible from static sensors. In this paper, we take into account the situation where there are moving sensors as well. We propose an effective algorithm based on tangent to not only stay as far as possible from static sensors, but also avoid mobile sensors. Simulations show that the proposed algorithms can solve the traversal path with mobile sensors' patrolling in wireless sensor networks.

KW - Voronoi diagram

KW - cautioning point

KW - exposure

KW - minimal exposure path

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

U2 - 10.1109/PAAP.2015.24

DO - 10.1109/PAAP.2015.24

M3 - Conference contribution

AN - SCOPUS:84962243950

T3 - Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP

SP - 73

EP - 79

BT - Proceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015

A2 - Shen, Hong

A2 - Shen, Hong

A2 - Sang, Yingpeng

A2 - Huang, Haiping

PB - IEEE Computer Society

ER -

Zhang L, Chen X, Fan J, Wang D, Lin CK. The Minimal Exposure Path in Mobile Wireless Sensor Network. In Shen H, Shen H, Sang Y, Huang H, editors, Proceedings - 7th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2015. IEEE Computer Society. 2016. p. 73-79. 7387304. (Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP). https://doi.org/10.1109/PAAP.2015.24