Efficient distributed data scheduling algorithm for data aggregation in wireless sensor networks |
| |
| Affiliation: | 1. School of Mechanics & Civil Engineering, China University of Mining & Technology, Xuzhou 221116, China;2. State Key Laboratory for Geomechanics & Deep Underground Engineering, China University of Mining & Technology, Xuzhou 221116, China;1. School of Electrical and Electronic Engineering, Harbin University of Science and Technology, Harbin 150080, China;2. School of Electrical and Information Engineering, The University of Sydney, Camperdown 2006, Australia;3. Country Garden Center, 1 Country Garden Road, Beijiao Town, Shunde District, Foshan, Guangdong 528312, China;1. State Key Laboratory of Metastable Materials Science and Technology, Key Laboratory of Applied Chemistry, Hebei Key Laboratory of Heavy Metal Deep-Remediation in Water and Resource Reuse, Nano-biotechnology Key Lab of Hebei Province, Yanshan University, Qinhuangdao 066004, China;2. Hebei University of Environmental Engineering, Qinhuangdao 066102, China |
| |
| Abstract: | With the rapid development of applications for wireless sensor networks, efficient data aggregation methods are becoming increasingly emphasized. Many researchers have studied the problem of reporting data with minimum energy cost when data is allowed to be aggregated many times. However, some aggregation functions used to aggregate multiple data into one packet are unrepeatable; that is, every data is aggregated only at most once. This problem motivated us to study reporting data with minimum energy cost subject to that a fixed number of data are allowed to be aggregated into one packet and every data is aggregated at most once. In this paper, we propose novel data aggregation and routing structures for reporting generated data. With the structures, we study the problem of scheduling data to nodes in the networks for data aggregation such that the energy cost of reporting data is minimized, termed MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. In addition, we show that MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING is NP-complete. Furthermore, a distributed data scheduling algorithm is proposed accordingly. Simulations show that the proposed algorithm provides a good solution for MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. |
| |
| Keywords: | Wireless sensor network Data aggregation NP-complete problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
