The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2008 vol.19)
pp: 276-287
Yang Yu , IEEE
ABSTRACT
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a set of source nodes to the sink. This problem is crucial for advanced computation-intensive applications, where traditional "maximum" in-network compression may result in significant computation energy. We investigate a tunable data compression technique that enables effective tradeoffs between the computation and communication costs. We derive the optimal compression strategy for a given data gathering tree and then investigate the performance of different tree structures for networks deployed on a grid topology as well as general graphs. Our analytical results pertaining to the grid topology and simulation results pertaining to the general graphs indicate that the performance of a simple greedy approximation to the Minimal Steiner Tree (MST) provides a constantfactor approximation for the grid topology and good average performance on the general graphs. Although theoretically, a more complicated randomized algorithm offers a poly-logarithmic performance bound, the simple greedy approximation of MST is attractive for practical implementation.
CITATION
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasanna, "Data Gathering with Tunable Compression in Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 2, pp. 276-287, February 2008, doi:10.1109/TPDS.2007.70709
REFERENCES
[1] B. Krishnamachari, D. Estrin, and S. Wicker, “The Impact of Data Aggregation in Wireless Sensor Networks,” Proc. Int'l Workshop Distributed Event-Based Systems (DEBS '02), July 2002.
[2] S. Pattem, B. Krishnamachari, and R. Govindan, “The Impact of Spatial Correlation on Routing with Compression in Wireless Sensor Networks,” Proc. Third Int'l Symp. Information Processing in Sensor Networks (IPSN '04), Apr. 2004.
[3] C.M. Sadler and M. Martonosi, “Data Compression Algorithms for Energy-Constrained Devices in Delay Tolerant Networks,” Proc. Fourth ACM Conf. Embedded Networked Sensor Systems (SenSys '06), Nov. 2006.
[4] J. Acimovic, B. Beferull-Lozano, and R. Cristescu, “Adaptive Distributed Algorithms for Power-Efficient Data Gathering in Sensor Networks,” Proc. IEEE Int'l Symp. Wireless Sensor Networks, June 2005.
[5] K. Barr and K. Asanović, “Energy Aware Lossless Data Compression,” Proc. First Int'l Conf. Mobile Systems, Applications, and Services (MobiSys '03), May 2003.
[6] T. Bell, M. Powell, J. Horlor, and R. Arnold, The Canterbury Corpus, http:/www.cosc.canterbury.ac.nz, 2007.
[7] D. Slepian, and J. Wolf, “Noiseless Coding of Correlated Information Sources,” IEEE Trans. Information Theory, vol. 19, no. 4, pp. 471-480, 1973.
[8] R. Cristescu, B. Beferull-Lozano, and M. Vetterli, “On Network Correlated Data Gathering,” Proc. IEEE INFOCOM '04, Mar. 2004.
[9] A. Kashyap, L.A. Lastras-Montano, C. Xia, and Z. Liu, “Distributed Source Coding in Dense Sensor Networks,” Proc. Data Compression Conf. (DCC '05), pp. 13-22, Mar. 2005.
[10] A. Goel and D. Estrin, “Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk,” Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '03), Jan. 2003.
[11] R. Kanna and S.S. Iyengar, “Game-Theoretic Models for Reliable Path-Length and Energy-Constrained Routing with Data Aggregation in Wireless Sensor Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 6, pp. 1141-1150, Aug. 2004.
[12] B. Awerbuch and Y. Azar, “Buy-at-Bulk Network Design,” Proc. 38th Ann. Symp. Foundations of Computer Science (FOCS '97), pp.542-547, Oct. 1997.
[13] W. Choi and S.K. Das, “A Framework for Energy-Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks,” Proc. First Ann. Int'l Conf. Mobile and Ubiquitous Systems (MobiQuitous '04), pp. 203-212, Aug. 2004.
[14] B. Hong and V.K. Prasanna, “Optimizing a Class of In-Network Processing Applications in Networked Sensor Systems,” Proc. First IEEE Int'l Conf. Mobile Ad Hoc and Sensor Systems (MASS '04), Oct. 2004.
[15] W. Choi and S.K. Das, “A Novel Framework for Energy-Conserving Data Gathering in Wireless Sensor Networks,” Proc. IEEE INFOCOM '05, Mar. 2005.
[16] P. Leone, S.E. Nikoletseas, and J. Rolim, “An Adaptive Blind Algorithm for Energy Balanced Data Propagation in Wireless Sensors Networks,” Proc. IEEE Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), June 2005.
[17] A. Jarry, P. Leone, O. Powell, and J. Rolim, “An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks,” Proc. IEEE Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), June 2006.
[18] H. Luo, J. Luo, Y. Liu, and S.K. Das, “Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Networks,” IEEE Trans. Computers, vol. 55, no. 10, pp. 1286-1299, Oct. 2006.
[19] B.D. Nobel, M. Satyanarayanan, D. Narayanan, J.E. Tilton, J. Flinn, and K.R. Walker, “Agile Application-Aware Adaptation for Mobility,” Proc. 16th ACM Symp. Operating System Principles (SOSP '97), Oct. 1997.
[20] M.D. Corner, B.D. Nobel, and K.M. Wasserman, “Fugue: Time Scales of Adaptation in Mobile Video,” Proc. SPIE Multimedia Computing and Networking Conf., pp. 75-87, Jan. 2001.
[21] Y. Bartal, “Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications,” Proc. 38th Ann. Symp. Foundations of Computer Science (FOCS), 1997.
[22] J. Fakcheroenphol, S. Rao, and K. Talwar, “A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics,” Proc. 35th Ann. ACM Symp. Theory of Computing (STOC '03), June 2003.
[23] V. Rajendran, K. Obraczka, and J.J. Garcia-Luna-Aceves, “Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks,” Proc. First ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), Nov. 2003.
[24] Y. Yu, B. Krishnamachari, and V.K. Prasanna, “Energy-Latency Tradeoffs for Data Gathering in Wireless Sensor Networks,” Proc. IEEE INFOCOM '04, Mar. 2004.
[25] V. Raghunathan, C. Schurgers, S. Park, and M.B. Srivastava, “Energy-Aware Wireless Microsensor Networks,” IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 40-50, Mar. 2002.
[26] Y. Yu, B. Krishnamachari, and V.K. Prasanna, “Energy-Efficient Data Gathering with Tunable Compression in Wireless Sensor Networks,” Technical Report CENG-2004-15, Univ. of Southern Calif., http://halcyon.usc.edu/~yangyu/dataTR_CENG200415.pdf , 2004.
[27] D. Marco, E.J. Duarte-Melo, M. Liu, and D.L. Neuhoff, “On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data,” Proc. Second Int'l Workshop Information Processing in Sensor Networks (IPSN '03), pp.1-16, Apr. 2003.
[28] A. Knoll, “Compression of Bi-Level Images: Compressor Performance Report,” Proc. INFORUM Conf., pp. 23-25, http://www.inforum.cz/inforum2000/prednasky kompresebitona. html, May 2000.
[29] H. Takahashi and A. Matsuyama, “An Approximate Solution for the Steiner Problem in Graphs,” Math. Japonica, vol. 24, no. 6, pp.573-577, 1980.
[30] E.W. Weisstein Square Point Picking, http://mathworld.wolfram. comSquarePointPicking.html , 2007.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool