Introduction to algorithms
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Sensor deployment strategy for target detection
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
LAD: Localization Anomaly Detection forWireless Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Robomote: enabling mobility in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
XYZ: a motion-enabled, power aware sensor node platform for distributed sensor network applications
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Event-Based Motion Control for Mobile-Sensor Networks
IEEE Pervasive Computing
Trade-offs between mobility and density for coverage in wireless sensor networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Barrier coverage with sensors of limited mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Design and implementation of mobile sink node in SDMA applications
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
A cellular learning automata-based deployment strategy for mobile wireless sensor networks
Journal of Parallel and Distributed Computing
On coverage issues in directional sensor networks: A survey
Ad Hoc Networks
Points of interest coverage with connectivity constraints using wireless mobile sensors
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
A grid-based coverage approach for target tracking in hybrid sensor networks
Journal of Systems and Software
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Deploying mobile nodes for maximal energy matching in WSNs
Wireless Communications & Mobile Computing
Exploiting data fusion to improve the coverage of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Energy efficient k-barrier coverage in limited mobile wireless sensor networks
Computer Communications
Barrier coverage with line-based deployed mobile sensors
Ad Hoc Networks
Coverage enhancement by using the mobility of mobile sensor nodes
Multimedia Tools and Applications
Hi-index | 0.00 |
In this paper, we study the issue of sensor networks deployment using limited mobility sensors. By limited mobility, we mean that the maximum distance that sensors are capable of moving to is limited. Given an initial deployment of limited mobility sensors in a field clustered into multiple regions, our deployment problem is to determine a movement plan for the sensors to minimize the variance in number of sensors among the regions, and simultaneously minimize the sensor movements. Our methodology to solve this problem is to transfer the nonlinear variance/movement minimization problem into a linear optimization problem through appropriate weight assignments to regions. In this methodology, the regions are assigned weights corresponding to the number of sensors needed. During sensor movements across regions, larger weight regions are given higher priority compared to smaller weight regions, while simultaneously ensuring minimum number of sensor movements. Following the above methodology, we propose a set of algorithms to our deployment problem. Our first algorithm is the Optimal Maximum Flow based (OMF) centralized algorithm. Here, the optimal movement plan for sensors is obtained based on determining the minimum cost maximum weighted flow to the regions in the network. We then propose the Simple Peak-Pit based distributed (SPP) algorithm that uses local requests and responses for sensor movements. Using extensive simulations, we demonstrate the effectiveness of our algorithms from the perspective of variance minimization, number of sensor movements and messaging overhead under different initial deployment scenarios.