Data collection is one of the most important operations in applications of wireless sensor networks (WSNs). In many emerging WSN applications, it is urgent to achieve a guarantee for the latency involved in collecting data. Many researchers have studied collecting data in WSNs with minimum latency but without data collision while assuming that any (or no) data are allowed to be aggregated into one packet. In addition, tree structures are often used for solutions. However, in some cases, a fixed number of data are allowed to be aggregated into one packet. This motivates us to study the problem of minimizing the latency for data aggregation without data collision in WSNs when a fixed number of data are allowed to be aggregated into one packet, termed the minimum-latency collision-avoidance multiple-data-aggregation scheduling (MLCAMDAS) problem. The MLCAMDAS problem is shown to be NP-complete here. In addition, a nontree-based method, termed the independent-set-based collision-avoidance scheduling (ISBCAS) algorithm, is proposed accordingly. The ISBCAS is demonstrated via simulations to have good performance.
Bibliographical noteFunding Information:
Manuscript received August 12, 2016; revised March 31, 2017 and July 4, 2017; accepted September 9, 2017. Date of publication September 26, 2017; date of current version August 23, 2018. This work was supported by the Ministry of Science and Technology under Grant MOST 105-2221-E-151-023 and Grant MOST 106-2221-E-151-001. (Corresponding author: Bing-Hong Liu.) N.-T. Nguyen is with the Department of Mechanical and Aerospace Engineering, Missouri University of Science and Technology, Rolla, MO 65409 USA (e-mail: firstname.lastname@example.org).
© 2018 IEEE.
- Algorithm design and analysis
- Collision Avoidance
- Computer simulation
- Wireless sensor networks (WSNs)