scholarly journals Hardware Implementation Study of the Deficit Table Egress Link Scheduling Algorithm

2009 ◽  
Author(s):  
Raúl Martinez ◽  
José M. Claver ◽  
Francisco J. Alfaro ◽  
José L. Sanchez
Keyword(s):  
Hardware Implementation ◽  
Scheduling Algorithm ◽  
Link Scheduling ◽  
Implementation Study

Hardware implementation study of several new egress link scheduling algorithms

2012 ◽  
Vol 72 (8) ◽  
pp. 975-989 ◽  
Author(s):  
Raúl Martínez ◽  
José M. Claver ◽  
Francisco J. Alfaro ◽  
José L. Sánchez
Keyword(s):  
Hardware Implementation ◽  
Scheduling Algorithms ◽  
Link Scheduling ◽  
Implementation Study

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 Shortest Link Scheduling in Wireless Networks Under The Rayleigh Fading Model

2021 ◽  
Author(s):  
Baogui Huang ◽  
Jiguo Yu ◽  
Chunmei Ma ◽  
Fengyin Li ◽  
Guangshun Li
Keyword(s):  
Wireless Networks ◽  
Rayleigh Fading ◽  
Scheduling Algorithm ◽  
Random Variable ◽  
Rayleigh Distribution ◽  
Interference Model ◽  
Link Scheduling ◽  
Signal Power ◽  
Schedule Delay ◽  
Radio Signals

Abstract Many shortest link scheduling algorithms adopt non-fading SINR interference model, which assumes that the received signal power will always remain determinate as long as the transmission power of the corresponding sender is fixed. In fact, because environment always influences the propagation of radio signals, the received signal power is by no means a certain value. Rayleigh fading is a statistical model for radio signals propagation. It assumes that the strength of a signal on a receiver is a random variable, varying with the Rayleigh distribution. This paper proposes a shortest link scheduling algorithm under the Rayleigh fading model (SLSRF). The SLSRF partitions the wireless network area into hexagons and colors the hexagons with 3 different colors such that two neighboring hexagons have different colors. The senders of the links scheduled simultaneously are arranged in hexagons with the same color. The correctness of the SLSRF is proved through theoretical analysis, and the efficiency is illustrated by elaborate simulations. Our simulation results demonstrate that the schedule delay of SLSRF is less than that of some results under the non-fading SINR interference model. Furthermore, we extend the SLSRF to a distributed version, which is suitable for large wireless networks.

A Cost–Effective Hardware Link Scheduling Algorithm for the Multimedia Router (MMR)

2001 ◽  
pp. 358-369 ◽  
Author(s):  
M. B. Caminero ◽  
C. Carrión ◽  
F. J. Quiles ◽  
J. Duato ◽  
S. Yalamanchili
Keyword(s):  
Scheduling Algorithm ◽  
Cost Effective ◽  
Link Scheduling

scholarly journals A Spectrum-Aware Priority-Based Link Scheduling Algorithm for Cognitive Radio Body Area Networks

Sensors ◽  
2019 ◽  
Vol 19 (7) ◽  
pp. 1640 ◽  
Author(s):  
Thien Thi Thanh Le ◽  
Sangman Moh
Keyword(s):  
Cognitive Radio ◽  
High Efficiency ◽  
Scheduling Algorithm ◽  
Healthcare Services ◽  
Body Area Networks ◽  
System Throughput ◽  
Link Scheduling ◽  
Delivery Ratio ◽  
Body Area ◽  
Support Tool

With the development of wireless communication technology, wireless body area networks (WBANs) have become a fundamental support tool in medical applications. In a real hospital scenario, however, the interference between wireless medical devices and WBANs may cause a high packet drop rate and high latency, which is harmful to patients using healthcare services. Nonetheless, cognitive radio is a promising technology for sharing the precious spectrum, which has high efficiency of the wireless resource. Thus, WBANs with cognitive radio capability are also exploited. We propose a spectrum-aware priority-based link scheduling (SPLS) algorithm for cognitive radio body area networks (CRBANs) in a real hospital scenario. In SPLS, three channels are used: DataCh, EDataCh, and CtrlCh for normal data, emergency data, and control messages, respectively. To avoid collision during data transmission, neighboring CRBANs send messages regarding the channel state with CtrlCh before the scheduling. The CRBANs can share DataCh in the time domain for improving the throughput. The SPLS algorithm allows a CRBAN to access idle channels on the licensed and unlicensed spectrum according to the CRBAN traffic. Our simulation results show that the proposed SPLS outperformed the conventional scheme in terms of packet delivery ratio, system throughput, latency, and energy efficiency.

Hardware Implementation of Two-level Scheduling Algorithm in μC/OS-II

2016 ◽  
Vol 10 (4) ◽  
pp. 87-94
Author(s):  
Guangwu Zhang ◽  
Yan Li ◽  
Yidong Chen ◽  
Huaiguo Dong ◽  
Huanhuan Chi ◽  
...  
Keyword(s):  
Hardware Implementation ◽  
Scheduling Algorithm ◽  
Level Scheduling

Link Scheduling Scheme for Multi-Hop Cognitive Radio Ad Hoc Networks

2013 ◽  
Vol 443 ◽  
pp. 430-434
Author(s):  
Chao Li ◽  
Guo Chun Ren ◽  
Cheng Gui Wang ◽  
Yu Bo Wang
Keyword(s):  
Ad Hoc ◽  
Scheduling Algorithm ◽  
Cluster Head ◽  
Link Scheduling ◽  
Destination Node ◽  
Spatial Reuse ◽  
Topology Structure ◽  
Scheduling Scheme ◽  
Simulation Results ◽  
Hoc Networks

In this paper, we propose to apply a centre scheduling algorithm in the CRAHNs with a cluster. In this network, the cluster head assigns time slots to each node so that every node can be fair to transfer data. The scheme schedules the links to the same destination node first, which has the largest topology structure, then another destination node whose topology structure is larger than the rest. The algorithm presented in this paper considers both the fairness and the spatial reuse, and the simulation results show that this algorithm still has a good performance when the topology is so large.

Sign in / Sign up

Export Citation Format

Share Document