Constrained Resource Optimization in Large-Scale Wireless Sensor Networks with Mobile Sinks

Abstract

[1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless sensor networks: a survey. Computer Networks, Vol. 38, pp. 393–422, 2002.
http://dx.doi.org/10.1016/S1389-1286(01)00302-4

[2] S. Basagni, A. Carosi, E. Melachrinoudis, C. Petrioli, and Z. M. Wang. Controlled sink mobility for prolonging wireless sensor networks lifetime. Wireless Networks, Vol. 14, pp.831–858, 2008.
http://dx.doi.org/10.1007/s11276-007-0017-x

[3] C. Buragohain, D. Agrawal, and S. Suri. Power aware routing for sensor databases. Proc. INFOCOM’05, IEEE, 2005.

[4] J-H Chang and L. Tassiulas. Energy conserving routing in wireless ad hoc networks. Proc. INFOCOM’00, IEEE, 2000.

[5] T. H. Cormen, C. E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. 3rd Ed., MIT Press, 2009.

[6] A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. Proc. of VLDB, pp. 588–599, 2004.
http://dx.doi.org/10.1016/B978-012088469-8/50053-X

[7] N. Garg. A 3 factor approximation algorithm for the minimum tree spanning k vertices. Proc of 37th Symp. on Foundations of Computer Science (FOCS’96), IEEE, pp. 302–309, 1996.

[8] S. R. Gandham, M. Dawande, R. Prakask, and S. Venkatesan. Energy efficient schemes for wireless sensor networks with multiple mobile base stations. Proc. of Globecom’03, IEEE, 2003.

[9] D. Golovin, M. Faulkner and A. Krause. Online distributed sensor selection. Proc of IPSN’10, ACM, pp. 220–231, 2010.

[10] D. S. Johnson, M. Minkoff, and S. Philips. The prize collecting Steiner tree problem: theory and practice. Proc of SODA’00, ACM-SIAM, pp.760-769, 2000.

[11] O. Jerew and W. Liang. Prolonging network lifetime through the use of mobile station in wireless sensor networks. Proc. 7th Intl Conf. on Advances in Mobile Computing and Multimedia (MoMM), ACM, 2009.

[12] R. Jothi and B. Raghavachari. Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Trans. Algorithms, Vol. 1, pp.265–282, 2005.
http://dx.doi.org/10.1145/1103963.1103967

[13] Y. Kotidis. Snapshot queries: towards data-centric sensor networks. Proc. ICDE’05, IEEE, 2005.

[14] W. Liang. Constructing minimum-energy broadcast trees in wireless ad hoc networks. Proc. of MobiHoc’02, ACM, pp.112– 122, 2002.

[15] W. Liang. Approximate Minimum-energy multicasting in wireless ad hoc networks. IEEE Trans. Mobile Computing, Vol. 5, pp. 377–387, 2006.
http://dx.doi.org/10.1109/TMC.2006.1599406

[16] W. Liang, R. Brent, Y. Xu, and Q. Wang. Minimum-energy all-toall multicasting in wireless ad hoc networks. IEEE Trans.Wireless Communications, Vol.8, pp.5490–5499, 2009.
http://dx.doi.org/10.1109/TWC.2009.070602

[17] W. Liang and Y. Liu. Online data gathering for maximizing network lifetime in sensor networks. IEEE Trans. Mobile Computing, Vol. 6, pp. 2-11, 2007.
http://dx.doi.org/10.1109/TMC.2007.250667

[18] W. Liang, J. Luo, and X. Xu. Prolonging network lifetime via a controlled mobile sink in wireless sensor networks. Proc of GLOBECOM’10, IEEE, 2010.

[19] W. Liang, Y. Xu, J. Shi, and J. Luo. Aggregate node placement for maximizing network lifetime in sensor networks. Journal of Wireless Communications and Mobile Computing, Vol.12, pp. 219–235, 2012.
http://dx.doi.org/10.1002/wcm.952

[20] J. Luo and J-P Hubaux. Joint mobility and routing for lifetime elongation in wireless sensor networks. Proc of INFOCOM’05, IEEE, 2005.

[21] J. Luo and J-P Hubaux. Joint sink mobility and routing to maximize the lifetime of wireless sensor networks: the case of constrained mobility. IEEE/ACM Trans. Networking, Vol.18, pp. 871–884, 2010.
http://dx.doi.org/10.1109/TNET.2009.2033472

[22] J. Luo, J. Panchard, M. Piorkowski, M. Grossblauser, and J-P Hubaux. Mobiroute: routing towards a mobile sink for improving lifetime in sensor networks. Proc of DCOSS’06, LNCS, Vol. 4026, pp. 480–497,2006.

[23] M. Ma and Y. Yang. SenCar: an energy-efficient data gathering mechanism for large scale multihop sensor networks. IEEE Trans. Parallel and Distributed Systems, Vol. 18, pp. 1476-1488, 2007.
http://dx.doi.org/10.1109/TPDS.2007.1070

[24] S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. TinyDB: An acquisitional query processing system for sensor networks. ACM Trans. on Database Systems, Vol. 30, pp. 122– 173, 2005.
http://dx.doi.org/10.1145/1061318.1061322

[25] T. Nieberg, J. Hurink, and W. Kern. Approximation schemes for wireless networks. ACM Transactions on Algorithms, Vol. 4, Article 49, 2008.
http://dx.doi.org/10.1145/1383369.1383380

[26] Y. Perl and S. R. Schach. Max-min tree partitioning. J. the ACM, Vol.28, pp.5–15, 1981.
http://dx.doi.org/10.1145/322234.322236

[27] C. H. Papadimitriou. The complexity of the capacitated tree problem. Networks, Vol. 8, pp.217–230, 1978.
http://dx.doi.org/10.1002/net.3230080306

[28] L. Qiu, R. Chandra, K. Jian, and M. Mahdian. Optimizing the placement of integration points in multi-hop wireless sensor networks. Intl Conf. on Network Protocols (ICNP), 2004.

[29] Y. Shi and Y. T. Hou. Theoretical results on base station movement problem for sensor network. Proc. IEEE INFOCOM’08, pp. 376-384, 2008.

[30] A. A. Somasundara, A. Kansal, D. D. Jea, D. Estrin, and M. B. Srivastava. Controllably mobile infrastructure for low energy embedded networks. IEEE Trans. Mobile Computing, Vol. 5, pp. 958–973, 2006.
http://dx.doi.org/10.1109/TMC.2006.109

[31] R. Sugihara and R. K. Gupta. Optimizing energy-latency tradeoff in sensor networks with controlled mobility. Proc. of INFOCOM’ 09, IEEE, 2009.

[32] S. Tang, J. Yuan, X Y Li, Y. Liu, G. Chen, M. Gu, J. Zhao, G. Dai. DAWN: energy efficient data aggregation in WSN with mobile sinks. Proc. of IWQoS, IEEE, pp.1–9, 2010.

[33] Z. M. Wang, S. Basagni, E. Melachrinoudis, and C. Petrioli. Exploiting sink mobility for maximizing sensor networks lifetime. Proc. of HICSS’05, IEEE, 2005.

[34] Q. Wang, X. Wang, and X. Lin. Mobility increases the connectivity of K-hop clustered wireless networks. Proc of MobiCom’09, ACM, pp.121–131, 2009.

[35] Y. Wu, Z. Mao, S. Fahmy, and N. B. Shroff. Constructing maximum-lifetime data gathering forests in sensor networks. IEEE/ACM Trans. Networking, Vol. 18, pp 1571–1.25584, 2010.

[36] G. Xing, T. Wang, W. Jia, and M. Li. Rendezvous design algorithms for wireless sensor networks with a mobile base station. Proc. of MobiHoc’08, ACM, pp.231–240, 2008.

[37] X. Xu, J. Luo, and Q. Zhang. Delay tolerant event collection in sensor networks with mobile sink. Proc. of INFOCOM’10, IEEE, 2010.

[38] X. Xu and W. Liang. Monitoring quality optimization in wireless sensor networks with a mobile sink. Proc of 14th International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), ACM, pp.77–84, 2011.

[39] X. Xu, W. Liang, and T. Wark. Data quality maximization in sensor networks with a mobile sink. Proc. of DCOSS’11, IEEE, 2011.

[40] Y. Yun and Y. Xia. Maximizing the lifetime of wireless sensor networks with mobile sink in delay-tolerant applications. IEEE Trans. Mobile Computing, Vol. 9, pp.1308–1.25318, 2010.

[41] M. Zhao, M. Ma and Y. Yang. Efficient data gathering with mobile collectors and space-division multiple access techniques in wireless sensor networks. IEEE Trans. Computers, Vol. 60, pp.400–415, 2010.
http://dx.doi.org/10.1109/TC.2010.140