Theoretical Results on Base Station Movement Problem for Sensor Network

The benefits of using 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 limit and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing theoretical results regarding the optimal movement of a mobile base station. Our main result hinges upon a novel transformation of the joint base station movement and flow routing problem from time domain to space domain. Based on this transformation, we first show that if the base station is allowed to be present only on a set of pre-defined points, then we can find the optimal time span for the base station on each of these points so that the overall network lifetime is maximized. Based on this finding, we show that when the location of the base station is un-constrained (i.e., can move to any point in the two-dimensional plane), we can develop an approximation algorithm for the joint mobile base station location and flow routing problem such that the network lifetime is guaranteed to be at least (1-epsiv) of the maximum network lifetime, where epsiv can be made arbitrarily small depending on required precision.

[1]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[2]  Peter Desnoyers,et al.  TSAR: a two tier sensor storage architecture using interval skip graphs , 2005, SenSys '05.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Joseph S. B. Mitchell,et al.  Approximation algorithms for location problems in sensor networks. , 2005 .

[5]  Kemal Akkaya,et al.  Base-station repositioning for optimized performance of sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[6]  Leonidas J. Guibas,et al.  Apply geometric duality to energy-efficient non-local phenomenon awareness using sensor networks , 2004, IEEE Wireless Communications.

[7]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[8]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[9]  Jun Luo,et al.  Joint mobility and routing for lifetime elongation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[12]  Hanif D. Sherali,et al.  Rate allocation in wireless sensor networks with network lifetime requirement , 2004, MobiHoc '04.

[13]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Qi Zhang,et al.  Maximum flow-life curve for a wireless ad hoc network , 2001, MobiHoc '01.

[15]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[16]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

[18]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[19]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[20]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[21]  Emanuel Melachrinoudis,et al.  Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[22]  Gaurav S. Sukhatme,et al.  Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[23]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[24]  리우 젠,et al.  Maximum lifetime routing in wireless ad hoc networks , 2002 .

[25]  Emanuel Melachrinoudis,et al.  A New MILP Formulation and Distributed Protocols for Wireless Sensor Networks Lifetime Maximization , 2006, 2006 IEEE International Conference on Communications.

[26]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[27]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).