Welcome to the InfoSci Platform
Reference Hub2
Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks

Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks

Dhruvi Patel, Arunita Jaekel
Copyright: © 2021 |Volume: 13 |Issue: 1 |Pages: 13
ISSN: 1941-8663|EISSN: 1941-8671|EISBN13: 9781799860563|DOI: 10.4018/IJITN.2021010104
Cite Article Cite Article

MLA

Patel, Dhruvi, and Arunita Jaekel. "Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks." IJITN vol.13, no.1 2021: pp.36-48. http://doi.org/10.4018/IJITN.2021010104

APA

Patel, D. & Jaekel, A. (2021). Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks. International Journal of Interdisciplinary Telecommunications and Networking (IJITN), 13(1), 36-48. http://doi.org/10.4018/IJITN.2021010104

Chicago

Patel, Dhruvi, and Arunita Jaekel. "Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks," International Journal of Interdisciplinary Telecommunications and Networking (IJITN) 13, no.1: 36-48. http://doi.org/10.4018/IJITN.2021010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Wireless sensor networks (WSN) consist of sensor nodes that detect relevant events in their vicinity and relay this information for further analysis. Considerable work has been done in the area of sensor node placement to ensure adequate coverage of the area of interest. However, in many applications it may not be possible to accurately place individual sensor nodes. In such cases, imprecise placement can result in regions, referred to as coverage holes, that are not monitored by any sensor node. The use of mobile nodes that can ‘visit' such uncovered regions after deployment has been proposed in the literature as an effective way to maintain adequate coverage. In this paper, the authors propose a novel integer linear programming (ILP) formulation that determines the paths the mobile node(s) should take to realize the specified level of coverage in the shortest time. The authors also present a heuristic algorithm that can be used for larger networks.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.