Energy-efficient lossy data aggregation in wireless sensor networks

Ad-Hoc and Sensor Wireless Networks

Volumn 11, Issue 1-2, 2011, Pages 111-135

  Zhang, Jianhui ^a   Shen, Xingfa ^a   Dai, Guojun ^a   Feng, Yunxia ^a   Tang, Shaojie ^b   Lv, Changping ^a  

^a HANGZHOU DIANZI UNIVERSITY   (China)

^b Illinois Institute of Technology   (United States)

Author keywords

Data loss; wireless sensor networks; Data sampling; Energy efficiency; Lossy data aggregation

Indexed keywords

EID: 78651460542     PISSN: 15519899     EISSN: 15520633     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. Deborah Estrin. Wireless sensor network, part IV:sensor network protocols. Technicalreport, Mobicom, 2002.
2. L. Krishnamachari, D. Estrin, and S. Wicker. The impact of data aggregation in wireless sensor networks. In ICDCS'02, pages 575-578, 2-5 July 2002.
3. Z. Eskandari, M.H. Yaghmaee, and A.H. Mohajerzadeh. Energy efficient spanning tree for data aggregation in wireless sensor networks. In Proceedings of 17th International Conference on Computer Communications and Networks (ICCCN'08), pages 1-5, 3-7 Aug. 2008.
4. P.-J. Wan C.-H. Huang and F. Yao. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In IEEE INFOCOM'07, 2007.
5. Bo Yu, Jianzhong Li, andYingshu Li. Distributed data aggregation scheduling in wireless sensor network. In IEEE INFOCOM'09, 19th-25th April 2009.
6. R. Rajagopalan and P.K. Varshney. Data aggregation techniques in sensor networks: A survey. IEEE Communications Surveys and Tutorials, 8(4):2-17, 2006.
7. Y. Wang, W.Z. Wang, and X.Y. Li. Distributed low-cost backbone formation for wireless ad hoc networks. In ACM Mobicom'05, pages 2-13, 2005.
8. Yingshu Li, My T. Thai, Feng Wang, Chih-WeiYi, Peng-Jun Wan, and Ding-Zhu Du. On greedy construction of connected dominating sets in wireless networks: Research articles. Wirel. Commun. Mob. Comput., 5(8):927-932, 2005.
9. YanWei Wu, Xiang-Yang Li, YunHao Liu, and Wei Lou. Energy-efficient wake-up scheduling for data collection and aggregation. IEEE TPDS, accepted to appear, 2009.
10. XiaoHua Xu, ShiGuangWang, XuFei Mao, ShaoJie Tang, and XiangYang Li. An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks. In FOWANC workshop of ACM Mobihoc, accepted, 2009.
11. L. Wang Z.-Y. Wan P.-J. Wan, C.-H. Huang and X. Jia. Minimum-latency aggregation scheduling in multihop wireless networks. In ACM MOBIHOC 2009, 2009.
12. Yi Hu, Nuo Yu, and Xiaohua Jia. Energy efficient real-time data aggregation in wireless sensor networks. In IWCMC'06, pages 803-808, 2006.
13. Yang Yu, Bhaskar Krishnamachari, and Viktor K. Prasanna. Energy-latency tradeoffs for data gathering in wireless sensor networks. In IEEE INFOCOM'04, 2004.
14. Z. Ye, A.A. Abouzeid, and J. Ai. Optimal policies for distributed data aggregation in ireless sensor networks. IEEE TPDS, (5):1494-1507, 2009.
15. T. He, B.M. Blum, J.A. Stankovic, and T. Abdelzaher. AIDA: Adaptive pplicationindependent data aggregation in wireless sensor networks. ACMTransactions on Embedded Computing Systems (TECS), 3(2):426-457, 2004.
16. YunHao LiuYanWeiWu, Xiang-Yang Li and Wei Lou. Energy-efficient wake-up scheduling for data collection and aggregation. IEEE TPDS, 10 Mar. 2009.
17. Gregory Hartl and Baochun Li. Loss inference in wireless sensor networks based on data aggregation. In IPSN'04, pages 396-404. ACM, 2004.
18. Huang Lee and Abtin Keshavarzian. Towards energy-optimal and reliable data collection via collision-free scheduling in wireless sensor networks. In IEEE INFOCOM'08, pages 2029-2037, 2008.
19. D. Kim,Y. Wu,Y. Li, F. Zou, and D.Z. Du. Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE TPDS, pages 147-157, 2009.
20. D. Li, H. Du, P.J. Wan, X. Gao, Z. Zhang, and W. Wu. Construction of strongly connected dominating sets in asymmetric multihop wireless networks. Theoretical Computer Science, 410(8-10):661-669, 2009.
21. Jie Wu, Mihaela Cardei, Fei Dai, and Shuhui Yang. Extended dominating set and its applications in ad hoc networks using cooperative communication. IEEE TPDS, 17(8):851- 864, 2006.
22. Toshihiro Fujito and Hiroshi Nagamochi. A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Appl. Math., 118(3):199-207, 2002.
23. M. D. Penrose. The longest edge of the random minimal spanning tree. The Annals of Applied Probability, 7(2):340-361, may 1997.
24. Peng-Jun Wan, Khaled M. Alzoubi, and Ophir Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. Mob. Netw. Appl., 9(2):141-149, 2004.
25. Charles Ebeling. An Introduction to Rliablity and Maintainability Engineering. The McGraw-Hill Companies, 1997.
26. OMNeTpp. http://www.omnetpp.org/.
27. Information technology-telecommunication and information exchange between systemslocal and metropolitan area networks-specific requirements-part 11: Wireless lan medium access control (mac) and physical layer (phy) specifications. IEEE Standard, Technical Report., 1999.
28. MICA2 Datasheet. http://www.xbow.com/.
29. MPR/MIB Node Hardware Users Manual. http://www.xbow.com/.
30. A. H. Esfahanian. On the evolution of connectivity algorithms,invited, submitted, Selected Topics in Graph Theory. Cambridge University Press, 2007.
31. A. H. Esfahanian and S. L. Hakimi. On computing the connectivities of graphs and digraphs. Networks, pages 355-366, 1984.
32. Benjamin R. Hamilton, Xiaoli Ma, Qi Zhao, and Jun Xu. ACES: adaptive clock estimation and synchronization using kalman filtering. In ACMMOBICOM'08, pages 152-162, 2008.