An Efficient Minimum-Latency Collision-Free Scheduling Algorithm for Data Aggregation in Wireless Sensor Networks

Nguyen, Ngoc‐Tu; Liu, Bing-Hong; Pham, Van-Trung; Liou, Ting-Yan

doi:10.1109/jsyst.2017.2751645

Cited by 84 publications

(43 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ngoc et al [36] have proposed an efficient minimum latency scheduling algorithm for WSN. Here, Independent Set based Scheduling (ISS) algorithm is used.…”

Section: Related Workmentioning

confidence: 99%

Refining Network Lifetime of Wireless Sensor Network Using Energy-Efficient Clustering and DRL-Based Sleep Scheduling

Sinde

Begum

Njau³

et al. 2020

Sensors

View full text Add to dashboard Cite

Over the recent era, Wireless Sensor Network (WSN) has attracted much attention among industrialists and researchers owing to its contribution to numerous applications including military, environmental monitoring and so on. However, reducing the network delay and improving the network lifetime are always big issues in the domain of WSN. To resolve these downsides, we propose an Energy-Efficient Scheduling using the Deep Reinforcement Learning (DRL) (E2S-DRL) algorithm in WSN. E2S-DRL contributes three phases to prolong network lifetime and to reduce network delay that is: the clustering phase, duty-cycling phase and routing phase. E2S-DRL starts with the clustering phase where we reduce the energy consumption incurred during data aggregation. It is achieved through the Zone-based Clustering (ZbC) scheme. In the ZbC scheme, hybrid Particle Swarm Optimization (PSO) and Affinity Propagation (AP) algorithms are utilized. Duty cycling is adopted in the second phase by executing the DRL algorithm, from which, E2S-DRL reduces the energy consumption of individual sensor nodes effectually. The transmission delay is mitigated in the third (routing) phase using Ant Colony Optimization (ACO) and the Firefly Algorithm (FFA). Our work is modeled in Network Simulator 3.26 (NS3). The results are valuable in provisions of upcoming metrics including network lifetime, energy consumption, throughput and delay. From this evaluation, it is proved that our E2S-DRL reduces energy consumption, reduces delays by up to 40% and enhances throughput and network lifetime up to 35% compared to the existing cTDMA, DRA, LDC and iABC methods.

show abstract

“…Ngoc et al [36] have proposed an efficient minimum latency scheduling algorithm for WSN. Here, Independent Set based Scheduling (ISS) algorithm is used.…”

Section: Related Workmentioning

confidence: 99%

Refining Network Lifetime of Wireless Sensor Network Using Energy-Efficient Clustering and DRL-Based Sleep Scheduling

Sinde

Begum

Njau³

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…Many research works have studied to improve the efficiency of data collection for both the centralized WSNs [3], [2] and distributed WSNs [4], [5]. In [6], the authors proposed a chain-based protocol, named PEGASIS to reduce the energy consumption of sensors during data collection process.…”

Section: Related Workmentioning

confidence: 99%

“…It is clear that when the total number of channels ς = 1, the MLCAMDAS-MC problem is equivalent to the MLCAMDAS problem, which implies that the MLCAMDAS problem is a subproblem of the MLCAMDAS-MC problem. Because the MLCAMDAS problem is NP-hard [2], and therefore, the MLCAMDAS-MC problem is also NP-hard. This thus completes the proof.…”

Section: Instance: Given a Graphmentioning

confidence: 99%

“…By the WSN G and its corresponding data-forwarding graph G ζ , the corresponding relative collision graph G r = (V Gr , E Gr , ω Gr , η Gr ) can be constructed to illustrate the collision relation between any data transmission in [2]. In G r , each node v x,y ∈ V Gr represents a possible data transmission from node x to node y in G ζ , that is, an edge (x, y) ∈ G ζ .…”

Section: Extended Relative Collision Graphmentioning

confidence: 99%

See 1 more Smart Citation

Challenges, Designs, and Performances of a Distributed Algorithm for Minimum-Latency of Data-Aggregation in Multi-Channel WSNs

Nguyen

Liu

Chu

et al. 2019

IEEE Trans. Netw. Serv. Manage.

Self Cite

View full text Add to dashboard Cite

In wireless sensor networks (WSNs), the sensed data by sensors need to be gathered, so that one very important application is periodical data collection. There is much effort which aimed at the data collection scheduling algorithm development to minimize the latency. Most of previous works investigating the minimum latency of data collection issue have an ideal assumption that the network is a centralized system, in which the entire network is completely synchronized with full knowledge of components. In addition, most of existing works often assume that any (or no) data in the network are allowed to be aggregated into one packet and the network models are often treated as tree structures. However, in practical, WSNs are more likely to be distributed systems, since each sensor's knowledge is disjointed to each other, and a fixed number of data are allowed to to be aggregated into one packet. This is a formidable motivation for us to investigate the problem of minimum latency for the data aggregation without data collision in the distributed WSNs when the sensors are considered to be assigned the channels and the data are compressed with a flexible aggregation ratio, termed the minimum-latency collision-avoidance multiple-dataaggregation scheduling with multi-channel (MLCAMDAS-MC) problem. A new distributed algorithm, termed the distributed collision-avoidance scheduling (DCAS) algorithm, is proposed to address the MLCAMDAS-MC. Finally, we provide the theoretical analyses of DCAS and conduct extensive simulations to demonstrate the performance of DCAS.Index Terms-Data aggregation, algorithm design and analysis, distributed algorithm, collision free, wireless sensor networs (WSNs). N.T. Nguyen is with the• C1: To guarantee the collision free, every sensor node are not only required to be assigned to time slots, but also need to be set to appropriate channels. Unlike in the centralized system, they can collect overall information of the network and give the time slot and the channel assignment evaluations based on all sensor nodes' information such as the time clock, the packet size, and the

show abstract

“…Additionally, application-driven industrial communication increases the requirements of stringent reliability as well as time efficiency [5]. Within process automation, standards such as WirelessHART, ISA100.11a, and IEEE (Institute of Electrical and Electronics Engineers) 802.15.4e have been operational for nearly a decade, and there exists several researches that address support for emerging applications, such as data aggregation [6], control, and safety [7,8]. All of the above standards employ the Times-Slotted Channel Hopping (TSCH) Medium Access Control (MAC) protocol instead of pure contention-based MAC protocol Carrier-Sense Multiple Access with Collision Avoidance (CSMA/CA).…”

Section: Introductionmentioning

confidence: 99%

Efficient Resource Scheduling for Multipath Retransmission over Industrial WSAN Systems

Wang

Yang

et al. 2019

Sensors

View full text Add to dashboard Cite

With recent adoption of Wireless Sensor-Actuator Networks (WSANs) in industrial automation, wireless control systems have emerged as a frontier of industrial networks. Hence, it has been shown that existing standards and researches concentrate on the reliability and real-time performance of WSANs. The multipath retransmission scheme with multiple channels is a key approach to guarantee the deterministic wireless communication. However, the efficiency of resource scheduling is seldom considered in applications with diverse data sampling rates. In this paper, we propose an efficient resources scheduling algorithm for multipath retransmission in WSANs. The objective of our algorithm is to improve efficiency and schedulability for the use of slot and channel resources. In detail, the proposed algorithm uses the approaches of CCA (clear channel assessment)-Embedded slot and Multiple sinks with Rate Monotonic scheme (CEM-RM) to decrease the number of collisions. We have simulated and implemented our algorithm in hardware and verified its performance in a real industrial environment. The achieved results show that the proposed algorithm significantly improves the schedulability without trading off reliability and real-time performance.

show abstract

An Efficient Minimum-Latency Collision-Free Scheduling Algorithm for Data Aggregation in Wireless Sensor Networks

Cited by 84 publications

References 25 publications

Refining Network Lifetime of Wireless Sensor Network Using Energy-Efficient Clustering and DRL-Based Sleep Scheduling

Refining Network Lifetime of Wireless Sensor Network Using Energy-Efficient Clustering and DRL-Based Sleep Scheduling

Challenges, Designs, and Performances of a Distributed Algorithm for Minimum-Latency of Data-Aggregation in Multi-Channel WSNs

Efficient Resource Scheduling for Multipath Retransmission over Industrial WSAN Systems

Contact Info

Product

Resources

About