Algorithms for Communication Scheduling in Data Gathering Network with Data Compression
- 127 Downloads
We consider a communication scheduling problem that arises within wireless sensor networks, where data is accumulated by the sensors and transferred directly to a central base station. One may choose to compress the data collected by a sensor, to decrease the data size for transmission, but the cost of compression must be considered. The goal is to designate a subset of sensors to compress their collected data, and then to determine a data transmission order for all the sensors, such that the total compression cost is minimized subject to a bounded data transmission completion time (a.k.a. makespan). A recent result confirms the NP-hardness for this problem, even in the special case where data compression is free. Here we first design a pseudo-polynomial time exact algorithm, articulated within a dynamic programming scheme. This algorithm also solves a variant with the complementary optimization goal—to minimize the makespan while constraining the total compression cost within a given budget. Our second result consists of a bi-factor \((1 + \epsilon , 2)\)-approximation for the problem, where \((1 + \epsilon )\) refers to the compression cost and 2 refers to the makespan, and a 2-approximation for the variant. Lastly, we apply a sparsing technique to the dynamic programming exact algorithm, to achieve a dual fully polynomial time approximation scheme for the problem and a usual fully polynomial time approximation scheme for the variant.
KeywordsWireless sensor network Data compression Scheduling Approximation algorithm FPTAS Dual FPTAS
W.L. was supported by China Scholarship Council (Grant No. 201408330402), the K. C. Wong Magna Fund in the Ningbo University, and the Ningbo Natural Science Foundation (2016A610078). W.L., Y.X., B.G., R.G. and G.L. were supported by NSERC. W.T. was supported by the FY16 Startup Funding from the Georgia Southern University.
- 7.Choi, K., Robertazzi, T.G.: Divisible load scheduling in wireless sensor networks with information utility. In: Proceedings of the 2008 IEEE International Performance, Computing and Communications Conference, pp. 9–17 (2008)Google Scholar
- 14.Kimura, N., Latifi, S.: A survey on data compression in wireless sensor networks. In: Proceedings of the 2005 International Conference on Information Technology: Coding and Computing, pp. 8–13 (2005)Google Scholar
- 15.Kumar, S., Chauhan, S.: A survey on scheduling algorithms for wireless sensor networks. Int. J. Comput. Appl. 20, 7–13 (2011)Google Scholar
- 16.Luo, C., Wu, F., Sun, J., Chen, C.W.: Compressive data gathering for large-scale wireless sensor networks. In: Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, pp. 145–156 (2009)Google Scholar
- 20.Tauhidul, I.M.: Approximation Algorithms for Minimum Knapsack Problem. Master’s thesis, University of Lethbridge (2009)Google Scholar
- 21.Wang, J., Tang, S., Yin, B., Li, X.Y.: Data gathering in wireless sensor networks through intelligent compressive sensing. In: INFOCOM 2012, pp. 603–611 (2012)Google Scholar
- 24.Xu, L., Wang, Y., Wang, Y.: Major coefficients recovery: a compressed data gathering scheme for wireless sensor network. In: Global Telecommunications Conference (GLOBECOM 2011), pp. 1–5 (2011)Google Scholar