Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Maximum flow-life curve for a wireless ad hoc network
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimal base station placement in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
IEEE/ACM Transactions on Networking (TON)
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
In-Network Computations of Machine-to-Machine Communications for Wireless Robotics
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
The benefits of using a mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limits and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing some theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon two key intermediate results. In the first result, we show that a time-dependent joint base station movement and flow routing problem can be transformed into a location-dependent problem. In the second result, we show that, for (1 - ε) optimality, the infinite possible locations for base station movement can be reduced to a finite set of locations via several constructive steps [i.e., discretization of energy cost through a geometric sequence, division of a disk into a finite number of subareas, and representation of each subarea with a fictitious cost point (FCP)]. Subsequently, for each FCP, we can obtain the optimal sojourn time for the base station (as well as the corresponding location-dependent flow routing) via a simple linear program. We prove that the proposed solution can guarantee the achieved network lifetime is at least (1 - ε) of the maximum (unknown) network lifetime, where ε can be made arbitrarily small depending on the required precision.