TY - GEN
T1 - Improving coverage performance in sensor networks by using mobile sensors
AU - Zhang, Ming
AU - Du, Xiaojiang
AU - Nygard, Kendall
PY - 2005
Y1 - 2005
N2 - Sensor networks hold the promise of facilitating large-scale, real-time data processing in complex environments. Most existing researches on sensor networks consider networks where all sensors are static nodes. We propose to improve sensor network performance by deploying a small number of mobile sensors in addition to a large number of static sensors. In this paper, we present a distributed solution that utilizes a small number of mobile sensors to improve coverage performance in sensor networks. The distributed solution includes distributed schemes for: 1) determining the boundary of a coverage hole; 2) determining the number and locations of mobile sensors for covering a hole; and 3) calling mobile sensors. We design simulation experiments to evaluate the performance of three algorithms that determine the number and locations of mobile sensors for covering a hole. Our experiments show that the Integer Linear Programming algorithm achieves the best results with the cost of high computation requirement, while the other two heuristic algorithms achieve good sub-optimal results with small computation requirement.
AB - Sensor networks hold the promise of facilitating large-scale, real-time data processing in complex environments. Most existing researches on sensor networks consider networks where all sensors are static nodes. We propose to improve sensor network performance by deploying a small number of mobile sensors in addition to a large number of static sensors. In this paper, we present a distributed solution that utilizes a small number of mobile sensors to improve coverage performance in sensor networks. The distributed solution includes distributed schemes for: 1) determining the boundary of a coverage hole; 2) determining the number and locations of mobile sensors for covering a hole; and 3) calling mobile sensors. We design simulation experiments to evaluate the performance of three algorithms that determine the number and locations of mobile sensors for covering a hole. Our experiments show that the Integer Linear Programming algorithm achieves the best results with the cost of high computation requirement, while the other two heuristic algorithms achieve good sub-optimal results with small computation requirement.
UR - http://www.scopus.com/inward/record.url?scp=33847372941&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33847372941&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2005.1606170
DO - 10.1109/MILCOM.2005.1606170
M3 - Conference contribution
AN - SCOPUS:33847372941
SN - 0780393937
SN - 9780780393936
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - MILCOM 2005
T2 - MILCOM 2005: Military Communications Conference 2005
Y2 - 17 October 2005 through 20 October 2005
ER -