The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - Oct. (2013 vol.62)
pp: 1932-1944
Weifa Liang , Australian National University, Canberra
Pascal Schweitzer , Institut Mittag-Leffler, Djursholm
Zichuan Xu , Australian National University, Canberra
ABSTRACT
To deploy a wireless sensor network for the purpose of large-scale monitoring, in this paper, we propose a heterogeneous and hierarchical wireless sensor network architecture. The architecture consists of sensor nodes, gateway nodes, and mobile sinks. The sensors transmit their sensing data to the gateway nodes for temporary storage through multihop relays, while the mobile sinks travel along predetermined trajectories to collect data from nearby gateway nodes. Under this paradigm of data gathering, we formulate a novel constrained optimization problem, namely, the capacitated minimum forest (CMF) problem, for the decision version of which we first show NP-completeness. We then devise approximation algorithms and provide upper bounds for their approximation ratios. We finally evaluate the performance of the proposed algorithms through experimental simulation. In our experiments, the approximation ratio delivered by the proposed algorithms is always less than 2. In the case of arbitrary gateway capacities, this contrasts our theoretical results which show that the approximation ratio is at most linear in the number of gateways. Our experiments thus indicate that for realistic inputs, our worst case analysis of the approximation ratio is very conservative. The proposed algorithms are the first approximation algorithms for the CMF problem, and our techniques may be applicable to other constrained optimization problems beyond wireless sensor networks.
INDEX TERMS
Logic gates, Mobile communication, Approximation methods, Approximation algorithms, Vegetation, Wireless sensor networks, Mobile computing, capacitated minimum forest problem, Wireless sensor networks, sink mobility, data gathering, constrained optimization problem
CITATION
Weifa Liang, Pascal Schweitzer, Zichuan Xu, "Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink", IEEE Transactions on Computers, vol.62, no. 10, pp. 1932-1944, Oct. 2013, doi:10.1109/TC.2012.124
REFERENCES
[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, no. 4, pp. 393-422, 2002.
[2] K. Altinkemer and B. Gavish, "Heuristics with Constant Error Guarantees for the Design of Tree Networks," Management Science, vol. 34, no. 3, pp. 331-341, 1988.
[3] 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, no. 6, pp. 831-858, 2008.
[4] F.R.K. Chung and R.L. Graham, "A New Bound for Euclidean Steiner Minimal Trees," Annals of the New York Academy of Sciences, vol. 440, no. 1, pp. 328-346, 1985.
[5] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, third ed. MIT Press, 2009.
[6] M.C. de Souza, C. Duhamel, and C.C. Ribeiro, A GRASP Heuristic for the Capacitated Minimum Spanning Tree Problem Using a Memory-Based Local Search Strategy, pp. 627-657, Kluwer Academic Publishers, 2004.
[7] S. Gao, H. Zhang, and S.K. Das, "Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks," IEEE Trans. Mobile Computing, vol. 10, no. 4, pp. 592-608, Apr. 2011.
[8] E.N. Gilbert and H.O. Pollak, "Steiner Minimal Trees," SIAM J. Applied Math., vol. 16, pp. 1-29, 1968.
[9] M.X. Goemans and D.P. Williamson, "A General Approximation Technique for Constrained Forest Problems," SIAM J. Computing, vol. 24, no. 2, pp. 296-317, 1995.
[10] D. Golovin, M. Faulkner, and A. Krause, "Online Distributed Sensor Selection," Proc. ACM/IEEE Ninth Int'l Conf. Information Processing in Sensor Networks (IPSN), pp. 220-231, 2010.
[11] L. Gouveia, "A Comparison of Directed Formulations for the Capacitated Minimal Spanning Tree Problem," Telecomm. Systems, vol. 1, pp. 51-76, 1993.
[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, no. 2, pp. 265-282, 2005.
[13] A. Kansal, A.A. Somasundara, D.D. Jea, M.B. Srivastava, and D. Estrin, "Intelligent Fluid Infrastructure for Embedded Networks," Proc. Second Int'l Conf. Mobile Systems, Applications, and Services (MobiSys), pp. 111-124, 2004.
[14] W. Liang, "Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 5, no. 4, pp. 377-387, Apr. 2006.
[15] W. Liang, "Constrained Resource Optimization in Wireless Sensor Networks with Mobile Sinks," Proc IEEE Int'l Conf. Computing, Networking and Comm., pp. 559-603, 2012.
[16] W. Liang and J. Luo, "Network Lifetime Maximization in Sensor Networks with Multiple Mobile Sinks," Local Computer Networks, pp. 354-361, 2011.
[17] W. Liang, J. Luo, and X. Xu, "Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks," Proc. IEEE Global Telecomm. Conf. (GLOBECOM), pp. 1-6, 2010.
[18] J. Luo and J.-P. Hubaux, "Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 1735-1746, 2005.
[19] 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, no. 3, pp. 871-884, June 2010.
[20] J. Luo, J. Panchard, M. Piórkowski, M. Grossglauser, and J.-P. Hubaux, "MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks," Proc. IEEE Second Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), pp. 480-497, 2006.
[21] 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, no. 10, pp. 1476-1488, Oct. 2007.
[22] G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher, "An Analysis of Approximations for Maximizing Submodular Set Functions-I," Math. Programming, vol. 14, pp. 265-294, 1978.
[23] T. Nieberg, J. Hurink, and W. Kern, "Approximation Schemes for Wireless Networks," ACM Trans. Algorithms, vol. 4, no. 4, pp. 49:1-49:17, 2008.
[24] C.H. Papadimitriou, "The Complexity of the Capacitated Tree Problem," Networks, vol. 8, pp. 217-230, 1978.
[25] Y. Shi and Y.T. Hou, "Theoretical Results on Base Station Movement Problem for Sensor Network," Proc. IEEE INFOCOM, pp. 376-384, 2008.
[26] A.A. Somasundara, A. Kansal, D. Jea, D. Estrin, and M.B. Srivastava, "Controllably Mobile Infrastructure for Low Energy Embedded Networks," IEEE Trans. Mobile Computing, vol. 5, no. 8, pp. 958-973, Aug. 2006.
[27] R. Sugihara and R.K. Gupta, "Optimizing Energy-Latency Trade-Off in Sensor Networks with Controlled Mobility," Proc. IEEE INFOCOM, pp. 2566-2570, 2009.
[28] Q. Wang, X. Wang, and X. Lin, "Mobility Increases the Connectivity of K-Hop Clustered Wireless Networks," Proc. ACM MOBICOM, pp. 121-132, 2009.
[29] Z.M. Wang, S. Basagni, E. Melachrinoudis, and C. Petrioli, "Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime," Proc. 38th Ann. Hawaii Int'l Conf. System Sciences (HICSS), 2005.
[30] 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, no. 5, pp. 1571-1584, Oct. 2010.
[31] G. Xing, T. Wang, W. Jia, and M. Li, "Rendezvous Design Algorithms for Wireless Sensor Networks with a Mobile Base Station," Proc. ACM MobiHoc, pp. 231-240, 2008.
[32] X. Xu and W. Liang, "Data Quality Maximization in Sensor Networks with a Mobile sink," Proc. IEEE Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), pp. 1-8, 2011.
[33] X. Xu, W. Liang, and T. Wark, "Monitoring Quality Optimization in Wireless Sensor Networks with a Mobile Sink," Proc. 14th Int'l Conf. Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 77-84, 2011.
[34] X. Xu, J. Luo, and Q. Zhang, "Delay Tolerant Event Collection in Sensor Networks with Mobile Sink," Proc. IEEE INFOCOM, pp. 2471-2479, 2010.
[35] 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, no. 9, pp. 1308-1318, Sept. 2010.
49 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool