The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2012 vol.23)
pp: 52-60
Minsu Huang , University of North Carolina at Charlotte, Charlotte
Shaojie Tang , Illinois Institute of Technology, Chicago
Yu Wang , University of North Carolina at Charlotte, Charlotte
Data collection is a fundamental function provided by wireless sensor networks. How to efficiently collect sensing data from all sensor nodes is critical to the performance of sensor networks. In this paper, we aim to understand the theoretical limits of data collection in a TDMA-based sensor network in terms of possible and achievable maximum capacity. Previously, the study of data collection capacity has concentrated on large-scale random networks. However, in most of the practical sensor applications, the sensor network is not uniformly deployed and the number of sensors may not be as huge as in theory. Therefore, it is necessary to study the capacity of data collection in an arbitrary network. In this paper, we first derive the upper and lower bounds for data collection capacity in arbitrary networks under protocol interference and disk graph models. We show that a simple BFS tree-based method can lead to order-optimal performance for any arbitrary sensor networks. We then study the capacity bounds of data collection under a general graph model, where two nearby nodes may be unable to communicate due to barriers or path fading, and discuss performance implications. Finally, we provide discussions on the design of data collection under a physical interference model or a Gaussian channel model.
Capacity, data collection, arbitrary networks, wireless sensor networks.
Minsu Huang, Shaojie Tang, Yu Wang, "Capacity of Data Collection in Arbitrary Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 1, pp. 52-60, January 2012, doi:10.1109/TPDS.2011.96
[1] E.J. Duarte-Melo and M. Liu, “Data-Gathering Wireless Sensor Networks: Organization and Capacity,” Computer Networks, vol. 43, pp. 519-537, 2003.
[2] 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. Int'l Workshop Information Processing in Sensor Networks, 2003.
[3] H. El Gamal, “On the Scaling Laws of Dense Wireless Sensor Networks: The Data Gathering Channel,” IEEE Trans. Information Theory, vol. 51, no. 3, pp. 1229-1234, Mar. 2005.
[4] R. Zheng and R.J. Barton, “Toward Optimal Data Aggregation in Random Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2007.
[5] B. Liu, D. Towsley, and A. Swami, “Data Gathering Capacity of Large Scale Multihop Wireless Networks,” Proc. IEEE Fifth Int'l Mobile Ad Hoc and Sensor Systems (MASS), 2008.
[6] S. Chen, Y. Wang, X.-Y. Li, and X. Shi, “Capacity of Data Collection in Randomly-Deployed Wireless Sensor Networks,” Wireless Networks, vol. 17, no. 2, pp. 305-318, Feb. 2011.
[7] S. Chen, S. Tang, M. Huang, and Y. Wang, “Capacity of Data Collection in Arbitrary Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2010.
[8] X.-Y. Li, J. Zhao, Y.W. Wu, S.J. Tang, X.H. Xu, and X.F. Mao, “Broadcast Capacity for Wireless Ad Hoc Networks,” Proc. IEEE Fifth Int'l Mobile Ad Hoc and Sensor Systems (MASS), 2008.
[9] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[10] M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Ad-Hoc Wireless Networks,” Proc. IEEE INFOCOM, 2001.
[11] B. Liu, P. Thiran, and D. Towsley, “Capacity of a Wireless Ad Hoc Network with Infrastructure,” Proc. ACM MobiHoc, 2007.
[12] M. Franceschetti, O. Dousse, D.N.C. Tse, and P. Thiran, “Closing the Gap in the Capacity of Wireless Networks via Percolation Theory,” IEEE Trans. Information Theory, vol. 53, no. 3, pp. 1009-1018, Mar. 2007.
[13] A. Keshavarz-Haddad and R.H. Riedi, “Bounds for the Capacity of Wireless Multihop Networks Imposed by Topology and Demand,” Proc. ACM MobiHoc, 2007.
[14] X.-Y. Li, S.-J. Tang, and O. Frieder, “Multicast Capacity for Large Scale Wireless Ad Hoc Networks,” Proc. ACM MobiCom, 2007.
[15] S. Shakkottai, X. Liu, and R. Srikant, “The Multicast Capacity of Large Multihop Wireless Networks,” Proc. ACM MobiHoc, 2007.
[16] A. Keshavarz-Haddad, V. Ribeiro, and R. Riedi, “Broadcast Capacity in Multihop Wireless Networks,” Proc. MobiCom, 2006.
[17] B. Tavli, “Broadcast Capacity of Wireless Networks,” IEEE Comm. Letters, vol. 10, pp. 68-69, Feb. 2006.
[18] R.J. Barton and R. Zheng, “Order-Optimal Data Aggregation in Wireless Sensor Networks Using Cooperative Time-Reversal Communication,” Proc. Ann. Conf. Information Sciences and Systems, 2006.
[19] V. Bonifaci, P. Korteweg, A. Marchetti-Spaccamela, and L. Stougie, “An Approximation Algorithm for the Wireless Gathering Problem,” Operations Research Letters, vol. 36, pp. 605-608, 2008.
[20] T. Moscibroda, “The Worst-Case Capacity of Wireless Sensor Networks,” Proc. Sixth Int'l Symp. ACM Information Processing in Sensor Networks (IPSN), 2007.
[21] X.-Y. Li, Y. Wang, and Y. Wang, “Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks,” IEEE Trans. Computers, vol. 60, no. 3, pp. 386-399, Mar. 2011.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool