Optimizing downlink coordinated multipoint (CoMP) performance through advanced scheduling algorithms enhances V2X communication technology, enabling efficient resource allocation, minimizing interference, and maximizi...
详细信息
Optimizing downlink coordinated multipoint (CoMP) performance through advanced scheduling algorithms enhances V2X communication technology, enabling efficient resource allocation, minimizing interference, and maximizing data rates for reliable and synchronized communication between vehicles and infrastructure. In this paper, several scheduling algorithms were compared, including support vector machine (SVM) linear, SVM Radial Basis Function (RBF), SVM Sigmoid, Deep Neural Networks (DNN), Convolutional Neural Networks (CNN), and Graph Convolutional Networks (GCN). The performance metrics used in this comparison included CoMP decision, throughput, and cell edge throughput. The results showed that the out-rated GCN algorithm had the best-triggering composition for 5G radio networks, outperforming the other algorithms in terms of CoMP decision accuracy and overall throughput. In particular, the GCN algorithm demonstrated significant improvements in cell edge throughput, which is critical for ensuring reliable communication in areas with weaker signal strength. The reported results proves that the integration of advanced scheduling algorithms in the downlink CoMP framework enhances the efficiency of V2X communication, enabling optimized resource allocation, interference mitigation, and maximized throughput, thereby improving system efficiency, reducing latency, and ensuring reliable and seamless information exchange for connected vehicles, smart cities, and industrial automation.
In this work, different heuristic and optimization algorithms are proposed for downstream wavelength scheduling in ring-based WDM-PON mobile backhaul networks, where optical networking units (ONUs) are integrated with...
详细信息
In this work, different heuristic and optimization algorithms are proposed for downstream wavelength scheduling in ring-based WDM-PON mobile backhaul networks, where optical networking units (ONUs) are integrated with base stations (BSs). The main objective of this work is to improve the time delay of the packet delivery from the infrastructure to the end-users for both fixed and wireless traffic. This is achieved through dynamic wavelength scheduling and sharing techniques in a converged ring-based WDM-PON access architecture by taking into account the priorities of the data sent and also the cooperation area for mobile users between adjacent ONUs/BSs. Further, an integer linear program (ILP) was developed for wavelength selection, to be used as a benchmark when comparing with the two proposed algorithms. All heuristic algorithms and the optimization algorithm are examined under different traffic load and queue size scenarios to ascertain the network's performance in terms of maximum packet delivery delay.
Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wirel...
详细信息
Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wireless broadcast network where a basestation (BS) is updating many users on random information arrivals under a transmission capacity constraint. For the offline case when the arrival statistics are known to the BS, we develop a structural MDP scheduling algorithm and an index scheduling algorithm, leveraging Markov decision process (MDP) techniques and the Whittle's methodology for restless bandits. By exploring optimal structural results, we not only reduce the computational complexity of the MDP-based algorithm, but also simplify deriving a closed form of the Whittle index. Moreover, for the online case, we develop an MDP-based online scheduling algorithm and an index-based online scheduling algorithm. Both the structural MDP scheduling algorithm and the MDP-based online scheduling algorithm asymptotically minimize the average age, while the index scheduling algorithm minimizes the average age when the information arrival rates for all users are the same. Finally, the algorithms are validated via extensive numerical studies.
It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case per...
详细信息
It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case performance of this distributed, greedy scheduling algorithm is analyzed.
As a key element in cloud computing, with the increasing uncertainty and complexity, task scheduling becomes more and more import. How to perform cloud scheduling effectively while safeguarding the data and informatio...
详细信息
This letter proposes three novel resource and user scheduling algorithms with contiguous frequency-domain resource allocation (FDRA) for wireless communications systems. The first proposed algorithm jointly schedules ...
详细信息
This letter proposes three novel resource and user scheduling algorithms with contiguous frequency-domain resource allocation (FDRA) for wireless communications systems. The first proposed algorithm jointly schedules users and resources selected adaptively from both ends of the bandwidth part (BWP), while the second and third ones apply disjoint user and resource selection with either single-end or dual-end BWP strategies. Distinct from existing contiguous FDRA approaches, the proposed schemes comply with standards specifications for fifth-generation (5G) and beyond 5G communications, and have lower computational complexity hence are more practical. Simulation results show that all of the proposed algorithms can achieve near-optimal performance in terms of throughput and packet loss rate for low to moderate traffic load, and the first one can still perform relatively well even with a large number of users.
In this article, we are discussing various aspects of CPU scheduling. We first introduce the concept of CPU scheduling, different types of schedulers and the typical terminology used in relation to processes. Scheduli...
详细信息
This research presents the performance of Round Robin, Proportional Fair and Maximum Throughput scheduling techniques for 5G NSA mobile networks. The tests run considering a variable and increasing number of users usi...
详细信息
作者：
Roy, ArghyadipBiswas, NilanjanIit
Mehta Family School of Data Science and Artificial Intelligence Assam Guwahati781039 India Nit
Ece Department West Bengal Durgapur713209 India
With the advent of Mobile Edge Computing (MEC), the arriving tasks in an Internet of Things (IoT) network can be executed locally or at an MEC server. A Constrained Markov Decision Process (CMDP) formulation can captu...
详细信息
This paper contains the analysis of VM load balancing scheduling algorithms discussing its advantages, disadvantages along with applications. As the Industry shifts towards adapting cloud technologies, it is important...
详细信息
暂无评论