Constructing minimum energy mobile wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
Handoff in wireless mobile networks
Handbook of wireless networks and mobile computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Mobility helps security in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Congestion, Dilation, and Energy in Radio Networks
Theory of Computing Systems
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
CoCoA: Coordinated Cooperative Localization for Mobile Multi-Robot Ad Hoc Networks
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Energy Optimization under Informed Mobility
IEEE Transactions on Parallel and Distributed Systems
A survey on wireless multimedia sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Collaborative path planning for event search and exploration in mixed sensor networks
International Journal of Robotics Research
| Hi-index | 0.00 |
In this paper, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless communication, e.g. caused by a multimedia application like video surveillance. This robot is connected to radio base station(s), and moves with constant speed from a given starting point on the plane to a target point. The task is to find the best path such that the energy consumption for mobility and the communication is optimized. This is motivated by the fact that the energy consumption of radio devices increases polynomially (at least to the power of two) with the transmission distance. We introduce efficient approximation algorithms to find the optimal path given the starting point, the target point and the position of the radio stations. We exemplify the influence of the communication cost by a starting scenario with one radio station. We study the performance of the proposed algorithm in simulation, compare it with the scenario without applying our approach, and present the results.