A fairness adaptive TDMA scheduling algorithm for wireless sensor networks with unreliable links

2012 ◽  
Vol 27 (10) ◽  
pp. 1535-1552 ◽  
Author(s):  
Zhiqi Wang ◽  
Fengqi Yu ◽  
Jian Tian ◽  
Zusheng Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Tdma Scheduling ◽  
Unreliable Links

scholarly journals Top-Down TDMA Scheduling Algorithm in Wireless Sensor Networks

2016 ◽  
Vol 4 (1) ◽  
pp. 41-45
Author(s):  
Ho-Ting Wu ◽  
◽  
Chih-Ching Chen ◽  
Kai-Wei Ke ◽  
Song-Ferng Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Top Down ◽  
Tdma Scheduling

TDMA scheduling algorithm for multi-sink wireless sensor networks

2013 ◽  
Vol 32 (2) ◽  
pp. 363-366
Author(s):  
Haiping LI ◽  
Jian-lin MAO ◽  
Bin ZHANG ◽  
Bo CHEN
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Tdma Scheduling

scholarly journals A New TDMA Scheduling Algorithm for Data Collection over Tree-Based Routing in Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-7 ◽  
Author(s):  
Vahid Zibakalam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Ad Hoc ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Wireless Sensor ◽  
Original Network ◽  
Time Duration ◽  
Tdma Scheduling

Data collection is one of the most important tasks in Wireless Sensor Networks (WSNs) where a set of sensors measure properties of a phenomenon of interest and send their data to the sink. Minimizing the delay of the data collection is important for applications in which certain actions based on deadline are needed, such as event-based and mission-critical applications. Time Division Multiple Access (TDMA) scheduling algorithms are widely used for quick delivery of data with the objective of minimizing the time duration of delivering data to the sink, that is, minimizing the delay. In this paper, we propose a new centralized TDMA scheduling algorithm that is based on nodes congestion for general ad hoc networks. In the proposed algorithm, the scheduling is obtained using colouring of the original network. Colouring the original network is accomplished based on congestion degree of nodes. The simulation results indicate that the performance of our algorithm is better than that of node-based and level-based scheduling algorithms. We will also show that the performance of our proposed algorithm depends on the distribution of the nodes across the network.

Sign in / Sign up

Export Citation Format

Share Document