Trade-offs Between Mobility And Density For Coverage In Wireless Sensor Networks

Abstract

In this paper, we study the coverage problem for hybrid networks which comprise both static and mobile sensors. We consider mobile sensors with limited mobility, i.e., they can move only once over a short distance. Such mobiles are simple and cheap compared to sophisticated mobile robots. In conventional static sensor networks, for a random deployment, the sensor density should increase as <i>O</i>(log <i>L</i> + <i>k</i> log log <i>L</i>) to provide <i>k</i>-coverage in a network with a size of <i>L</i>. As an alternative, an all mobile sensor network can provide <i>k</i>-coverage over the field with a constant density of <i>O</i>(<i>k</i>), independent of network size <i>L</i>. We show that the maximum distance that any mobile sensor will have to move is <i>O</i>(1 over √<i>k</i> log ^{3 over 4} (<i>kL</i>)). We then propose a hybrid network structure, comprising static sensors and a small fraction of <i>O</i>(1 over √(<i>k</i>)) of mobile sensors. For this network structure, we prove that <i>k</i>-coverage is achievable with a constant sensor density of <i>O</i>(<i>k</i>), independent of network size <i>L</i>. Furthermore, for this hybrid structure, we prove that the maximum distance which any mobile sensor has to move is bounded as <i>O</i>(log^{3 over 4}<i>L</i>). We then propose a distributed relocation algorithm, where each mobile sensor only requires local information in order to optimally relocate itself and characterize the algorithm's computational complexity and message overhead. Finally, we verify our analysis via extensive numerical evaluations.