scholarly journals A distributed scheduling algorithm for real-time (D-SAR) industrial wireless sensor and actuator networks

2012 ◽  
Author(s):  
Pouria Zand ◽  
Supriyo Chatterjea ◽  
Jeroen Ketema ◽  
Paul Havinga
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Distributed Scheduling ◽  
Wireless Sensor

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

1999 ◽  
Vol 58 (1) ◽  
pp. 1-25
Author(s):  
Sarit Mukherjee ◽  
Debanjan Saha ◽  
Manas C. Saksena ◽  
Satish K. Tripathi
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Distributed Scheduling

scholarly journals Improvising Reliability and Security in Multiple Relay Network using Optimal Scheduling

2019 ◽  
Vol 8 (2) ◽  
pp. 1243-1248
Keyword(s):  
Real Time ◽  
Random Network ◽  
Scheduling Algorithm ◽  
Data Communication ◽  
Attack Detection ◽  
Relay Network ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Priority Scheduling ◽  
Byzantine Attacks

In the real-time scenario involving wireless sensor networks, the data forwarding and data gathering procedures are taking place from the remote environment. With the involvement of heterogeneous architecture and multi-hop data transmission paths, there lies a serious threat for secured data communication. There may be chances of data attacks either from the inside intruder or from the external intruder. The problem of data flow attack by adding malicious information, viz. Data injection attack and outside arbitrary attack, viz. Byzantine attacks are found to be more dangerous and cause vulnerability for the wireless sensor network. So improving the reliability and security in multi-relay networks is very much essential. In this work, the practical approach of detecting data injection and Byzantine attacks using the proposed method of random network coding is performed. Then, as improvisation measure, the priority scheduling algorithm is implemented to effectively schedule the data transfer. Real-time packets with highest priority in the distribution queue are placed first in the processing mechanism. The remaining packets are arranged based on the position of the sensor nodes and are placed in separate queues. Least priority packets can obstruct the dispensation of their direct higher precedence packets after waitlisted for a certain number of time frames. Simulation results using the NS2 environment show that using the priority scheduling algorithm has good performance values in terms of the packet delivery ratio, throughput and delay. Also, the attack detection metrics such as false positive ratio and detection ratio are also improved when using the priority scheduling algorithm. Thus an improvised priority algorithm for an uplink scheduler in WSN is implemented to increase the performance and detection metrics.

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

Electronics ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 683
Author(s):  
Gohar Ali ◽  
Fernando Moreira ◽  
Omar Alfandi ◽  
Babar Shah ◽  
Mohammed Ilyas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Time Frame ◽  
Acceptance Rate ◽  
Wireless Sensor ◽  
Schedule Length ◽  
Cluster Scheduling ◽  
Empty Time

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.

Sign in / Sign up

Export Citation Format

Share Document