Fast Randomized STDMA Link Scheduling

2009 ◽  
pp. 15-24 ◽  
Author(s):  
Sergio Gomez ◽  
Oriol Gras ◽  
Vasilis Friderikos
Keyword(s):  
Link Scheduling

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

scholarly journals Minimum-Time Link Scheduling for Emptying Wireless Systems: Solution Characterization and Algorithmic Framework

2014 ◽  
Vol 60 (2) ◽  
pp. 1083-1100 ◽  
Author(s):  
Vangelis Angelakis ◽  
Anthony Ephremides ◽  
Qing He ◽  
Di Yuan
Keyword(s):  
Wireless Systems ◽  
Minimum Time ◽  
Link Scheduling ◽  
Algorithmic Framework

scholarly journals Efficient Link Scheduling Solutions for the Internet of Things Under Rayleigh Fading

2021 ◽  
pp. 1-14
Author(s):  
Kan Yu ◽  
Jiguo Yu ◽  
Xiuzhen Cheng ◽  
Dongxiao Yu ◽  
Anming Dong
Keyword(s):  
Internet Of Things ◽  
Rayleigh Fading ◽  
Link Scheduling ◽  
The Internet ◽  
The Internet Of Things

Distributed Link Scheduling Under SINR Model in Multihop Wireless Networks

2014 ◽  
Vol 22 (4) ◽  
pp. 1204-1217 ◽  
Author(s):  
Jin-Ghoo Choi ◽  
Changhee Joo ◽  
Junshan Zhang ◽  
Ness B. Shroff
Keyword(s):  
Wireless Networks ◽  
Multihop Wireless Networks ◽  
Link Scheduling ◽  
Multihop Wireless ◽  
Sinr Model

Fast Link Scheduling Policies for Persistent Data Ferrying

2016 ◽  
Vol 13 (12) ◽  
pp. 433-449 ◽  
Author(s):  
Anthony J. Carfang ◽  
Eric W. Frew
Keyword(s):  
Link Scheduling ◽  
Scheduling Policies ◽  
Persistent Data
Sign in / Sign up

Export Citation Format

Share Document