scholarly journals Distributed Shortest Link Scheduling Algorithms With Constant Time Complexity in IoT Under Rayleigh Fading

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 103245-103255
Author(s):  
Kan Yu ◽  
Jiguo Yu ◽  
Anming Dong ◽  
Guangshun Li
Keyword(s):  
Time Complexity ◽  
Rayleigh Fading ◽  
Scheduling Algorithms ◽  
Constant Time ◽  
Link Scheduling

Localized and distributed link scheduling algorithms in IoT under rayleigh fading

2019 ◽  
Vol 151 ◽  
pp. 232-244 ◽  
Author(s):  
Kan Yu ◽  
Yinglong Wang ◽  
Jiguo Yu ◽  
Dongxiao Yu ◽  
Xiuzhen Cheng ◽  
...  
Keyword(s):  
Rayleigh Fading ◽  
Scheduling Algorithms ◽  
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 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.

Limitations of current wireless link scheduling algorithms

2020 ◽  
Vol 840 ◽  
pp. 154-165
Author(s):  
Magnús M. Halldórsson ◽  
Christian Konrad ◽  
Tigran Tonoyan
Keyword(s):  
Scheduling Algorithms ◽  
Link Scheduling ◽  
Wireless Link

scholarly journals A method for estimating existence of pairwise STM transaction conflicts

2018 ◽  
Vol 232 ◽  
pp. 04037
Author(s):  
Miroslav Popovic ◽  
Branislav Kordic ◽  
Marko Popovic ◽  
Ilija Basicevic
Keyword(s):  
System Performance ◽  
Time Complexity ◽  
Scheduling Algorithms ◽  
False Positives ◽  
New Method ◽  
False Negatives ◽  
Transaction Scheduling ◽  
Data Races ◽  
Cost Of Time ◽  
The Cost

STM transaction schedulers were introduced to improve system performance. However, designing online transaction scheduling algorithms is challenging because at the same time they should: (i) introduce minimal scheduling overhead, (ii) minimize the resulting makespan, and (iii) minimize contention in the resulting schedule. In our previous work we developed the online transaction scheduler architecture and the four scheduling algorithms, named RR, ETLB, AC, and AAC (listed in increasing order of their quality), for scheduling transactions on the Python STM. Both AC and AAC use Bernstein conditions to check for pairwise data races between transactions, at the cost of time complexity that is proportional to the product of the sizes of transaction’s read and write sets, which may be significant. In this paper we propose a method for estimating existence of pairwise transaction conflicts whose time complexity is Θ(1). We validate this method by analysing the resulting transaction schedules for the three benchmark workloads, named RDW, CFW, and WDW. The result of this analysis is positive and encouraging – AAC using the new method produces the same result as when using Bernstein conditions. The limitation of the new method is that it may have false reports, both false negatives and false positives.

scholarly journals Efficient Link Scheduling in Wireless Networks Under Rayleigh-Fading and Multiuser Interference

2020 ◽  
Vol 19 (8) ◽  
pp. 5621-5634 ◽  
Author(s):  
Jiguo Yu ◽  
Kan Yu ◽  
Dongxiao Yu ◽  
Weifeng Lv ◽  
Xiuzhen Cheng ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Rayleigh Fading ◽  
Link Scheduling ◽  
Multiuser Interference

Shortest Link Scheduling Algorithms in Wireless Networks Under the SINR Model

2017 ◽  
Vol 66 (3) ◽  
pp. 2643-2657 ◽  
Author(s):  
Jiguo Yu ◽  
Baogui Huang ◽  
Xiuzhen Cheng ◽  
Mohammed Atiquzzaman
Keyword(s):  
Wireless Networks ◽  
Scheduling Algorithms ◽  
Link Scheduling ◽  
Sinr Model

Taxi Intelligent Dispatch System Based on GPS

2013 ◽  
Vol 742 ◽  
pp. 463-468
Author(s):  
Zhong Min Yao ◽  
Zhao Peng Long ◽  
Qiang Li
Keyword(s):  
Mobile Phones ◽  
Time Complexity ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Positioning System ◽  
Traffic Jam ◽  
Gps Positioning ◽  
Dispatch System ◽  
Intelligent Scheduling

GPS positioning system is installed in taxis and most mobile phones support GPS positioning function at present. GPS phones are used in the taxi to achieving intelligent scheduling based on this basis. The taxi intelligent dispatch system based on GPS is proposed, improve the traditional Dijkstra scheduling algorithms by setting taxi maximum reasonable scheduling range, experimental results show that improved algorithms reduce the time complexity and improve scheduling efficiency. Meanwhile the traffic jam information can be sent to the dispatch center and make scheduling algorithm more reasonable by combined with above information.

Sign in / Sign up

Export Citation Format

Share Document