On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity Cost
Abstract
This article deals with reliable and unreliable mobile sensors having identical sensing radius r, communication radius R, provided that r ≤ R and initially randomly deployed on the plane by dropping them from an aircraft according to general random process. The sensors have to move from their initial random positions to the final destinations to provide greedy path k1-coverage simultaneously with k2-connectivity. In particular, we are interested in assigning the sensing radius r and communication radius R to minimize the time required and the energy consumption of transportation cost for sensors to provide the desired k1-coverage with k2-connectivity. We prove that for both of these optimization problems, the optimal solution is to assign the sensing radius equal to r = k1||E[S]||/2 and the communication radius R = k2||E[S]||/2, where ||E[S]|| is the characteristic of general random process according to which the sensors are deployed. When r< k1||E[S]||/2 or R< k2||E[S]||/ 2, and sensors are reliable, we discover and explain the sharp increase in the time required and the energy consumption in transportation cost to ensure the desired k1-coverage with k2-connectivity.
Recommended Citation
S. K. Das and R. Kapelko, "On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity Cost," ACM Transactions on Sensor Networks, vol. 17, no. 4, article no. 46, Association for Computing Machinery (ACM), Nov 2022.
The definitive version is available at https://doi.org/10.1145/3457408
Department(s)
Computer Science
Keywords and Phrases
Coverage; Energy; Random Process; Sensors; Time
International Standard Serial Number (ISSN)
1550-4867; 1550-4859
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2021 Association for Computing Machinery (ACM), All rights reserved.
Publication Date
01 Nov 2022
Comments
This work of S. K. Das was partially supported by NSF grants CNS-1850851, OAC-1725755, OAC-2104078, and SCC-1952045.