Minimum latency data aggregation in the physical interference model

Computer Communications

Volumn 35, Issue 18, 2012, Pages 2175-2186

  An, Min Kyung ^a   Lam, Nhat X ^a   Huynh, Dung T ^a   Nguyen, Trac N ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

Approximation algorithm; Data aggregation; Inapproximability; NP hardness; Signal to interference noise ratio

Indexed keywords

APPROXIMATION LOWER BOUNDS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DATA AGGREGATION; DECISION VERSION; DUAL POWER; GRAPH-BASED; INAPPROXIMABILITY; INTERFERENCE MODELS; NODE DEGREE; NP-HARDNESS; REALISTIC PHYSICAL MODEL; SIGNAL TO INTERFERENCES;

APPROXIMATION ALGORITHMS; HARDNESS; MULTIUSER DETECTION; SIGNAL DETECTION;

SPURIOUS SIGNAL NOISE;

EID: 84867573034     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2012.08.015     Document Type: Article

References (28)

1. V. Annamalai, S. Gupta, L. Schwiebert, On tree-based convergecasting in wireless sensor networks, in: Wireless Communications and Networking, vol. 3, 2003, pp. 1942-1947.
2. S.-H. Huang, P.-J. Wan, C. Vu, Y. Li, F. Yao, Nearly constant approximation for data aggregation scheduling in wireless sensor networks, in: INFOCOM 2007, 2007, pp. 366-372. (Pubitemid 47334250)
3. X. Chen, X. Hu, and J. Zhu Data gathering schedule for minimal aggregation time in wireless sensor networks International Journal of Distributed Sensor Networks 5 2009 321 337
4. B. Yu, J. Li, Y. Li, Distributed data aggregation scheduling in wireless sensor networks, in: INFOCOM, 2009, pp. 2159-2167.
5. X. Xu, S. Wang, X. Mao, S. Tang, P. Xu, X.-Y. Li, Efficient data aggregation in multi-hop WSNs, in: GLOBECOM, 2009, pp. 1-6.
6. P.-J. Wan, S.C.-H. Huang, L. Wang, Z. Wan, X. Jia, Minimum-latency aggregation scheduling in multihop wireless networks, in: MobiHoc, 2009, pp. 185-194.
7. M.K. An, N.X. Lam, D.T. Huynh, and T.N. Nguyen Minimum data aggregation schedule in wireless sensor networks International Journal of Computers and their Applications (IJCA) 18 4 2011 254 262
8. 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 Transactions on Parallel and Distributed Systems 22 1 2011 163 175
9. X.-Y. Li, X. Xu, S. Wang, S. Tang, G. Dai, J. Zhao, Y. Qi, Efficient data aggregation in multi-hop wireless sensor networks under physical interference model, in: MASS, 2009, pp. 353-362.
10. H. Li, Q.S. Hua, C. Wu, F.C.M. Lau, Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model, in: MSWiM, 2010, pp. 360-367.
11. M.M. Halldórsson, P. Mitra, Wireless connectivity and capacity, in: SODA, 2012, pp. 516-526.
12. N. Hobbs, Y. Wang, Q.-S. Hua, D. Yu, F.C.M. Lau, Deterministic distributed data aggregation under the SINR model, in: TAMC, 2012, pp. 385-399.
13. C. Avin, Z. Lotker, F. Pasquale, Y.-A. Pignolet, A note on uniform power connectivity in the SINR model, in: Algorithmic Aspects of Wireless Sensor Networks, 2009, pp. 116-127.
14. O. Goussevskaia, Y.A. Oswald, R. Wattenhofer, Complexity in geometric SINR, in: MobiHoc, 2007, pp. 100-109.
15. O. Goussevskaia, R. Wattenhofer, M. Halldorsson, E. Welzl, Capacity of arbitrary wireless networks, in: INFOCOM, 2009, pp. 1872-1880.
16. J. Grönkvist, A. Hansson, Comparison between graph-based and interference-based STDMA scheduling, in: MobiHoc, 2001, pp. 255-258.
17. E. Lebhar, Z. Lotker, Unit disk graph and physical interference model: putting pieces together, in: IPDPS, 2009, pp. 1-8.
18. S.-H. Huang, P.-J. Wan, J. Deng, and Y. Han Broadcast scheduling in interference environment IEEE Transactions on Mobile Computing 7 11 2008 1338 1348
19. P.-J. Wan, L. Wang, O. Frieder, Fast group communications in multihop wireless networks subject to physical interference, in: MASS, 2009, pp. 526-533.
20. M.K. An, N.X. Lam, D.T. Huynh, T.N. Nguyen, Minimum latency gossiping in wireless sensor networks, in: Proceedings of the 2012 International Conference on Wireless Networks (ICWN), 2012.
21. P. Gupta, and P.R. Kumar The capacity of wireless networks IEEE Transactions on Information Theory 46 2000 388 404
22. U. Feige A threshold of ln(n) for approximating set cover Journal of the ACM 41 5 1998 314 318
23. C. Lund, and M. Yannakakis On the hardness of approximating minimization problems Journal of the ACM 41 5 1994 286 293 (Pubitemid 23668768)
24. R. Karp Reducibility among combinatorial problems R. Miller, J. Thatcher, Complexity of Computer Computations 1972 Plenum Press 85 103
25. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms third ed. 2009 MIT Press and McGraw-Hill
26. P.-J. Wan, K. Alzoubi, O. Frieder, Distributed construction of connected dominating set in wireless Ad Hoc networks, in: INFOCOM, vol. 3, 2002, pp. 1597-1604.
27. P.-J. Wan, C.-W. Yi, X. Jia, and D. Kim Approximation algorithms for conflict-free channel assignment in wireless Ad Hoc networks Wireless Communications and Mobile Computing 6 2006 201 211
28. Z. Chen, C. Qiao, J. Xu, T. Lee, A constant approximation algorithm for interference aware broadcast in wireless networks, in: INFOCOM, 2007, pp. 740-748. (Pubitemid 47334292)