On TDMA scheduling in wireless sensor networks

Bakshi, Mahesh; Jaumard, Brigitte; Kaddour, Mejdi; Narayanan, Lata

doi:10.1109/ccece.2016.7726639

Cited by 6 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheduling algorithms use one of two interference models for evaluation; the protocol model depending on a graphing approach or the physical model depending on the Signal-to-Interference-plus-Noise-Ratio (SINR) as discussed in [25], [31].…”

Section: A Tdma Scheduling Optimizationmentioning

confidence: 99%

“…When a node possesses a time-slot, only this time-slot is for this node, and many time-slots are assigned to nodes with high priority to transmit without switching delays. M. Bakshi et al [25] Proposed an optimum converge-cast schedule in a WSN. They used the SINR model of interference and a TDMA -MAC protocol.…”

Section: A Tdma Scheduling Optimizationmentioning

confidence: 99%

“…Designing efficient approaches to schedule TDMA transmissions in multi-hop WSNs is an NP-complete problem [22]- [25]. Meta-heuristic optimization algorithms are the most reliable techniques to find near-optimal scheduling that achieve minimum latency for critical WSNs [26] [27].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Modified Particle Swarm Optimization Approach for Latency of Wireless Sensor Networks

Elrefaei¹,

Yahya²,

Shaat³

et al. 2021

IJACSA

View full text Add to dashboard Cite

In time-sensitive applications, such as detecting environmental and individual nuclear radiation exposure, wireless sensor networks are employed.. Such application requires timely detection of radiation levels so that appropriate emergency measures are applied to protect people and the environment from radiation hazards. In these networks, collision and interference in communication between sensor nodes cause more end-to-end delay and reduce the network's performance. A time-division multiple-access (TDMA) media access control protocol guarantees minimum latency and low power consumption. It also overcomes the problem of interference. TDMA scheduling problem determines the minimum length conflict-free assignment of slots in a TDMA frame where each node or link is activated at least once. This paper proposes a meta-heuristic centralized contention-free approach based on TDMA, a modified particle swarm optimization. This approach realizes the TDMA scheduling more efficiently compared with other existing algorithms. Extensive simulations were performed to evaluate the modified approach. The simulation results prove that the proposed scheduling algorithm has a better performance in wireless sensor networks than the interference degree leaves order algorithm and interference degree remaining leaves order algorithm. The results demonstrate also that integrating the proposed algorithm in TDMA protocols significantly optimizes the communication latency reduction and increases the network reliability.

show abstract

Section: A Tdma Scheduling Optimizationmentioning

confidence: 99%

Section: A Tdma Scheduling Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

A Modified Particle Swarm Optimization Approach for Latency of Wireless Sensor Networks

Elrefaei¹,

Yahya²,

Shaat³

et al. 2021

IJACSA

View full text Add to dashboard Cite

show abstract

“…The real-time query scheduling algorithm [3] assumes a pre-given routing tree for different scheduling strategies by considering the trade-offs between prioritization and throughput. The problem with TDMA scheduling for flat wireless sensor networks (WSNs) is that they are not scalable to the large networks, and have less slot reuse due to global view of the network [4] or large message exchanges. Hence, they lack in performance metrics like delay which is not efficient for real-time communication.…”

Section: Introductionmentioning

confidence: 99%

A New Intra-Cluster Scheduling Scheme for Real-Time Flows in Wireless Sensor Networks

et al. 2020

View full text Add to dashboard Cite

Real-time flows using time division multiple access (TDMA) scheduling in cluster-based wireless sensor networks try to schedule more flows per time frame to minimize the schedule length to meet the deadline. The problem with the previously used cluster-based scheduling algorithm is that intra-cluster scheduling does not consider that the clusters may have internal or outgoing flows. Thus, intra-cluster scheduling algorithms do not utilize their empty time-slots and thus increase schedule length. In this paper, we propose a new intra-cluster scheduling algorithm by considering that clusters may have having internal or outgoing flows. Thus, intra-cluster scheduling algorithms do not differentiate the intra-cluster time slots and utilize their empty time slots. The objective is to schedule more flows per time frame, to reduce schedule length and improve the acceptance rate of flows. Simulation results show that the acceptance rate of the proposed scheme has a higher performance than the previous scheme.

show abstract

“…Traditional studies on MAC mostly focused on a collision channel detection scheme where only one user is permitted to send its data at a time, such as carrier sense multiple access (CSMA) [ 1 , 2 ]. However, it is inefficient in checking channels status frequently, which results in serious user latency when a network consists of a great number of users.…”

Section: Introductionmentioning

confidence: 99%

Implementation of a Cross-Layer Sensing Medium-Access Control Scheme

Han

et al. 2017

Sensors

View full text Add to dashboard Cite

In this paper, compressed sensing (CS) theory is utilized in a medium-access control (MAC) scheme for wireless sensor networks (WSNs). We propose a new, cross-layer compressed sensing medium-access control (CL CS-MAC) scheme, combining the physical layer and data link layer, where the wireless transmission in physical layer is considered as a compress process of requested packets in a data link layer according to compressed sensing (CS) theory. We first introduced using compressive complex requests to identify the exact active sensor nodes, which makes the scheme more efficient. Moreover, because the reconstruction process is executed in a complex field of a physical layer, where no bit and frame synchronizations are needed, the asynchronous and random requests scheme can be implemented without synchronization payload. We set up a testbed based on software-defined radio (SDR) to implement the proposed CL CS-MAC scheme practically and to demonstrate the validation. For large-scale WSNs, the simulation results show that the proposed CL CS-MAC scheme provides higher throughput and robustness than the carrier sense multiple access (CSMA) and compressed sensing medium-access control (CS-MAC) schemes.

show abstract

On TDMA scheduling in wireless sensor networks

Cited by 6 publications

References 16 publications

A Modified Particle Swarm Optimization Approach for Latency of Wireless Sensor Networks

A Modified Particle Swarm Optimization Approach for Latency of Wireless Sensor Networks

A New Intra-Cluster Scheduling Scheme for Real-Time Flows in Wireless Sensor Networks

Implementation of a Cross-Layer Sensing Medium-Access Control Scheme

Contact Info

Product

Resources

About