Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Robomote: enabling mobility in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Simple movement control algorithm for bi-connectivity in robotic sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Energy efficient mobile routing in actuator and sensor networks with connectivity preservation
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Hi-index | 0.00 |
The paper addresses mobility control routing in robotic sensor wireless networks, where either mobile sensors or mobile actuators assist in wireless data intensive transmissions from sensors. Given a communication request between a source destination pair, the problem is to find a route and move each node on the route to its desired location, such that total transmission power is minimized. We study the optimal number of hops and optimal distance of adjacent nodes on the route. We propose OHCR algorithm that is based on the optimal number of hops on the route. We further propose MPoPR algorithm that minimizes transmission power over progress. After finding an initial path, strategies of move in rounds and move directly are both considered to move nodes to desirable locations. Extensive simulations are conducted to evaluate our proposed routing algorithms.