Nhat X. Lam
ABSTRACT
Data aggregation has been the focus of many researchers as one of the most important applications in Wireless Sensor Networks. A main issue of data aggregation is how to construct efficient schedules by which data can be aggregated without any interference. The problem of constructing minimum latency data aggregation schedules (MLAS) has been extensively studied in the literature although most of existing works use the graph-based interference model. In this paper, we study the MLAS problem in the more realistic physical model known as Signal-to-Interference-Noise-Ratio (SINR) where few works exist and algorithms that guarantee theoretical performances are scarce [17, 16]. We first derive an © (log n) approximation lower bound for the MLAS problem in the metric SINR model. We also prove the NP-completeness of the decision version of MLAS in the geometric SINR model. This is a significant contribution as these results have not been obtained before for the SINR model. In addition, we propose a constant factor approximation algorithm whose latency is bounded by O(Δ+R) for the dual power model, where Δ is the maximum node degree of a network and R is the network radius. Finally we study the performance of the algorithms through simulation.
- M. K. An, N. X. Lam, D. T. Huynh, and T. N. Nguyen. Minimum data aggregation schedule in wireless sensor networks. In Proc. of 23rd Intern. Conf. on Computer Applications in Industry and Engineering. ISCA, pp. 257--363, Nov. 2010.Google Scholar
- V. Annamalai, S. Gupta, and L. Schwiebert. On tree-based convergecasting in wireless sensor networks. In Wireless Communications and Networking, Vol 3, pp. 1942 -1947, Mar. 2003.Google Scholar
- C. Avin, Z. Lotker, F. Pasquale, and Y.-A. Pignolet. A note on uniform power connectivity in the SINR model. In Algorithmic Aspects of Wireless Sensor Networks, pp. 116--127, 2009. Google ScholarDigital Library
- X. Chen, X. Hu, and J. Zhu. Data gathering schedule for minimal aggregation time in wireless sensor networks. Int. J. Distrib. Sen. Netw., 5:321--337, July 2009. Google ScholarDigital Library
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press and McGraw-Hill, third edition, 2009. Google ScholarDigital Library
- H. Du, X. Hu, and X. Jia. Energy efficient routing and scheduling for real-time data aggregation in WSNs. Comput. Commun., 29:3527--3535, Nov 2006. Google ScholarDigital Library
- U. Feige. A threshold of ln(n) for approximating set cover. Journal of the ACM, 41(5):314--318, 1998. Google ScholarDigital Library
- O. Goussevskaia, Y. A. Oswald, and R. Wattenhofer. Complexity in geometric SINR. In MobiHoc 2007, pp. 100--109, Sep 2007. Google ScholarDigital Library
- O. Goussevskaia, R. Wattenhofer, M. Halldorsson, and E. Welzl. Capacity of arbitrary wireless networks. In INFOCOM 2009, pp. 1872 -1880, April 2009.Google ScholarCross Ref
- J. Grönkvist and A. Hansson. Comparison between graph-based and interference-based STDMA scheduling. In MobiHoc 2001, pp. 255--258, 2001. Google ScholarDigital Library
- P. Gupta, S. Member, and P. R. Kumar. The capacity of wireless networks. IEEE Trans. on Information Theory, 46:388--404, 2000. Google ScholarDigital Library
- S.-H. Huang, P.-J. Wan, J. Deng, and Y. Han. Broadcast scheduling in interference environment. IEEE Trans. on Mobile Computing, 7(11):1338--1348, 2008. Google ScholarDigital Library
- S.-H. Huang, P.-J. Wan, C. Vu, Y. Li, and F. Yao. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In INFOCOM 2007, pp. 366--372, May 2007.Google ScholarDigital Library
- R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations. Plenum Press, pp. 85--103, 1972.Google ScholarCross Ref
- E. Lebhar and Z. Lotker. Unit disk graph and physical interference model: Putting pieces together. In Proc. of 2009 IEEE Intern. Symposium on Parallel & Distributed Processing, pp. 1--8, 2009. Google ScholarDigital Library
- H. Li, Q. S. Hua, C. Wu, and F. C. M. Lau. Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model. In Proc. of 13th ACM Intern. conf. on Modeling, analysis, and simulation of wireless and mobile systems, pp. 360--367, 2010. Google ScholarDigital Library
- X.-Y. Li, X. Xu, S. Wang, S. Tang, G. Dai, J. Zhao, and Y. Qi. Efficient data aggregation in multi-hop wireless sensor networks under physical interference model. In Proc. of 6th IEEE Conf. on Mobile Adhoc and Sensor Systems, pp. 353--362, Oct. 2009.Google Scholar
- C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. ACM, 41(5):286--293, 1994. Google ScholarDigital Library
- P.-J. Wan, K. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In INFOCOM 2002, Vol 3, pp 1597--1604, 2002. Google ScholarDigital Library
- X. Xu, X.-Y. Li, X. Mao, S. Tang, and S. Wang. A delay-efficient algorithm for data aggregation in multihop wireless sensor networks. IEEE Trans. on Parallel and Distributed Systems, 22(1):163 --175, 2011. Google ScholarDigital Library
Index Terms
- Minimum latency data aggregation in the physical interference model
Recommendations
Minimum latency data aggregation in the physical interference model
Data aggregation has been the focus of many researchers as one of the most important applications in Wireless Sensor Networks. A main issue of data aggregation is how to construct efficient schedules by which data can be aggregated without any ...
Aggregation Latency-Energy Tradeoff in Wireless Sensor Networks with Successive Interference Cancellation
Minimizing latency and energy consumption is the prime objective of the design of data aggregation in battery-powered wireless networks. A tradeoff exists between the aggregation latency and the energy consumption, which has been widely studied under ...
The intractability of computing the Hamming distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogously defined.First, we prove that there is a language in AC0 such that both ...
Comments