Efficient distributed data scheduling algorithm for data aggregation in wireless sensor networks

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 65; pp. 73 - 83
• Main Authors: Liu, Bing-Hong, Jhang, Jyun-Yu
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier B.V 02.06.2014; Elsevier; Elsevier Sequoia S.A
• Subjects: Algorithms; Applied sciences; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Cost reduction; Data aggregation; Data processing. List processing. Character string processing; Energy; Energy efficiency; Exact sciences and technology; Memory organisation. Data processing; NP-complete problem; Radiocommunications; Route optimization; Scheduling; Scheduling algorithms; Sensors; Software; Software engineering; Studies; Telecommunications; Telecommunications and information theory; Wireless networks; Wireless sensor network; Wireless sensor network; Data aggregation; NP-complete problem; Software development; Data transmission; Routing; Data processing; Scheduling; Aggregation; Distributed algorithm; NP complete problem; Wireless network; Minimum energy; Agile programming; Sensor array; Data structure
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2014.03.003

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.