This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline. Using optimization and stochastic network theory we propose a framework to model the quality of service (QoS) requirements under delay constraints. The model allows for fairly general arrival models with heterogeneous constraints. The framework results in an optimal scheduling algorithm which fairly allocates data rates to all flows while meeting long-term delay demands. We also prove that under a simplified scenario our solution translates into a greedy strategy that makes optimal decisions with low complexity.
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in designing architectures for fair resource allocation to meet long-term throughput demands. However, to the best of our knowledge, strict packet delay deadlines were not considered in this framework previously. In this paper, we propose a model for incorporating the quality of service (QoS) requirements of packets with deadlines in the optimization framework. The sol…
In this work, we propose a novel joint client scheduling and resource block (RB) allocation policy to minimize the loss of accuracy in federated learning (FL) over wireless compared to a centralized training-based solution, under imperfect channel state information (CSI). First, the problem is cast as a stochastic optimization problem over a predefined training duration and solved using the Lyapunov optimization framework. In order to learn and track the wireless channel, a Gaussian process regression (GPR)-based channel prediction method is leveraged and incorporated into the scheduling decis…
In this paper, we study how to determine concurrent transmissions and the transmission power level of each link to maximize spectrum efficiency and minimize energy consumption in a wireless ad hoc network. The optimal joint transmission packet scheduling and power control strategy are determined when the node density goes to infinity and the network area is unbounded. Based on the asymptotic analysis, we determine the fundamental capacity limits of a wireless network, subject to an energy consumption constraint. We propose a scheduling and transmission power control mechanism to approach the o…
In ad hoc networks, the scheduling of route-request packets should be different from that of message packets, because during transmission of message packets the location of the destination is known whereas in route discovery this is not known in most of the cases. The router has to depend upon the last known location, if any, of the destination to determine the center and radius of the circle that embeds all possible current position of the destination. Route-request packets generated from the source are directed towards this circle i.e., directional route discovery can be applied. Otherwise, …
We study the minimum latency broadcast scheduling (MLBS) problem in Single-Radio Multi-Channel (SR-MC) wireless ad-hoc networks (WANETs), which are modeled by Unit Disk Graphs. Nodes with this capability have their fixed reception channels, but can switch their transmission channels to communicate with their neighbors. The single-radio and multi-channel model prevents existing algorithms for single-channel networks achieving good performance. First, the common assumption that one transmission reaches all the neighboring nodes does not hold naturally. Second, the multi-channel dimension provide…
Cognitive radio networks (CRNs) is the next generation of wireless communication. This type of network requires efficent spectrum allocation methods. This paper presents a new meta-heuristic evolutionary method for solving the channel allocation problem in an ad hoc network context. The suggested method is based on a graph-theoretic model and seeks a solution for the spectrum allocation problem in a clustered ad hoc network topology.The method is referred to as imperialist competitive algorithm (ICA)and provides a scheme for allocating the available channels to cluster heads maximizing spectru…
We consider scheduling and resource allocation in long-term evolution (LTE) networks across voice over LTE (VoLTE) and best-effort data users. The difference between these two is that VoLTE users get scheduling priority to receive their required quality of service. As we show, strict priority causes data services to suffer. We propose new scheduling and resource allocation algorithms to maximize the sum- or proportional fair (PF) throughout amongst data users while meeting VoLTE demands. Essentially, we use VoLTE as an example application with both a guaranteed bit-rate and strict application-…
Quality of Service (QoS) is now regarded as a requirement for all networks in managing resources like bandwidth and avoidance of network impairments like packet loss, jitter, and delay. Media transfer or streaming would be virtually impossible if QoS parameters were not used even if the streaming protocols were perfectly designed. QoS Scheduling classes help in network traffic optimization and the priority management of packets. This paper presents an analysis of QoS scheduling classes using video traffic in a MANET. The main objective was to identify a scheduling class that provides better Qo…
In this paper, we study the resource allocation and user scheduling algorithm for minimizing the energy cost of data transmission in the context of OFDMA collaborative mobile cloud (CMC) with simultaneous wireless information and power transfer (SWIPT) receivers. The CMC, which consists of several collaborating MTs offers one potential solution for downlink content distribution and for the energy consumption reduction at the terminal side. Meanwhile, as RF signal can carry both information and energy simultaneously, the induced SWIPT has gained much attention for energy efficiency design of mo…
Nowadays the radio interface of several standards is enhanced with advanced technologies such as OFDMA and extension technology such as relay. By using those promising transmission technology for the next generation wireless communications, scheduling problem becomes more crucial and challenging. In our work, we aim to maximize the overall system capacity while selecting the most suitable relay station under fairness constraint among both users and relay station by proposing a Gap- based scheduling. This one considers the channel state information and the unbalanced rate capacity of the two ho…
This paper focuses on an essential task of the enhanced NodeB eNodeB element in LTE architecture, the Radio Resource Manager RRM, which aims to accept or reject requests for connection to the network based on some constraints and ensuring optimal distribution of radio resources between Users Equipments UEs. Its main functionalities include Admission Control AC and Packet Scheduling PS. This paper will center mainly on the PS part of the RRM task, which performs the radio resource allocation in both uplink and downlink directions. Several approaches and algorithms have been proposed in the lite…
This paper 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 ones comply with standards specifications for fifth-generation (5G) and beyond 5G communications, and have low…
Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome this problem, we propose a new algorithm for STDMA link scheduling based on a graph model of the network as well as SINR computations. The performance of our algorithm is evaluated in terms of spatial reuse and computational complexity. Simulation results demonstrate that our algo…
A Mobile Ad hoc network (MANET) consists of nodes which use multi-hop communication to establish connection between nodes. Traditional infrastructure based systems use a centralized architecture for address allocation. However, this is not possible in Ad hoc networks due to their dynamic structure. Many schemes have been proposed to solve this problem, but most of them use network-wide broadcasts to ensure the availability of a new address. This becomes extremely difficult as network size grows. In this paper, we propose an address allocation algorithm which avoids network-wide broadcasts to a…
Traditional ad-hoc network packet scheduling schemes cannot fulfill the requirements of proximity-based ad-hoc social networks (ASNETs) and they do not behave properly in congested environments. To address this issue, we propose a user popularity-based packet scheduling scheme for congestion control in ASNETs called Pop-aware. The proposed algorithm exploits social popularity of sender nodes to prioritize all incoming flows. Pop-aware also provides fairness of service received by each flow. We evaluate the performance of Pop-aware through a series of simulations. In comparison with some existi…
Software-defined networking (SDN) provides an agile and programmable way to optimize radio access networks via a control-data plane separation. Nevertheless, reaping the benefits of wireless SDN hinges on making optimal use of the limited wireless fronthaul capacity. In this work, the problem of fronthaul-aware resource allocation and user scheduling is studied. To this end, a two-timescale fronthaul-aware SDN control mechanism is proposed in which the controller maximizes the time-averaged network throughput by enforcing a coarse correlated equilibrium in the long timescale. Subsequently, lev…
This letter studies the power allocation and scheduling problem in two-cell distributed interference subtraction system. Through the interference is cancelled at one receiver side and the analysis of objective function monotony, our key result is the decoupling of power allocation and scheduling without loss of optimality. Simulation exhibits the significant gains of our proposed algorithm over open-loop power allocation with non-cooperation proportional fair scheduling.
Time Slotted Channel Hopping (TSCH) behavioural mode has been introduced in IEEE 802.15.4e standard to address the ultra-high reliability and ultra-low power communication requirements of Industrial Internet of Things (IIoT) networks. Scheduling the packet transmissions in IIoT networks is a difficult task owing to the limited resources and dynamic topology. In this paper, we propose a phasic policy gradient (PPG) based TSCH schedule learning algorithm. The proposed PPG based scheduling algorithm overcomes the drawbacks of totally distributed and totally centralized deep reinforcement learning…
In distributed computing frameworks like MapReduce, Spark, and Dyrad, a coflow is a set of flows transferring data between two stages of a job. The job cannot start its next stage unless all flows in the coflow finish. To improve the execution performance of such a job, it is crucial to reduce the completion time of a coflow which can contribute more than 50% of the job completion time. While several schedulers have been proposed, we observe that routing, as a factor greatly impacting the Coflow Completion Time (CCT), has not been well considered. In this paper, we focus on the coflow scheduli…
Spectrum is a scarce commodity, and considering the spectrum scarcity faced by the wireless-based service providers led to high congestion levels. Technical inefficiencies from pooled spectrum (this is nothing but the "common carrier principle" adopted in oil/gas/electricity pipelines/networks.), since all ad hoc networks share a common pool of channels, exhausting the available channels will force ad hoc networks to block the services. Researchers found that cognitive radio (CR) technology may resolve the spectrum scarcity. CR network proved to next generation wireless communication system th…
Packet transmission scheduling on multi-hop wireless sensor networks with 3-egress gateway linear topology is studied. Each node generates a data packet in every one cycle period and forwards it bounded for either of gateways at edges. We focus on centrally-managed Time Division Multiple Access (TDMA)-based slot allocations and provide the design of a packet transmission scheduling framework with static time-slot allocation and basic redundant transmission to reduce and recover packet losses. We proposed three general path models, which would represent all possible variations of this topology,…
We investigate the fair channel assignment and access design problem for cognitive radio ad hoc network in this paper. In particular, we consider a scenario where ad hoc network nodes have hardware constraints which allow them to access at most one channel at any time. We investigate a fair channel allocation problem where each node is allocated a subset of channels which are sensed and accessed periodically by their owners by using a MAC protocol. Toward this end, we analyze the complexity of the optimal brute-force search algorithm which finds the optimal solution for this NP-hard problem. W…
It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. In this work, we design a joint scheduling and channel probing algorithm by considering the overhead of obtaining the channel state information. We adopt a correlated and non-stationary channel model, which is more realistic than those used in the lite…
Topology-Aware Cooperative Beam-Hopping Scheduling for Efficient Resource Allocation in LEO Satellite Systems
Tiangong University（天津工业大学）；Beijing University of Posts and Telecommunications（北京邮电大学）；Beijing Normal-Hong Kong Baptist University Zhuhai（北京师范大学-香港浸会大学联合国际学院）
In this paper, the concept of Machine Learning (ML) is introduced to the Orthogonal Frequency Division Multiple Access-based (OFDMA-based) scheduler. Similar to the impact of the Channel Quality Indicator (CQI) on the scheduler in the Long Term Evolution (LTE), ML is utilized to provide the scheduler with pertinent information about the User Equipment (UE) traffic patterns, demands, Quality of Service (QoS) requirements, instantaneous user throughput and other network conditions. An adaptive ML-based framework is proposed in order to optimize the LTE scheduler operation. The proposed technique…
A Survey on Task Allocation and Scheduling in Robotic Network Systems
C4-Cloud Computing Competence Center（C4云计算能力中心）；Universidade da Beira Interior（贝拉内瓦大学）；Computer Science and Communication Research Centre-(CIIC)（计算机科学与通信研究中心）；Escola Superior de Tecnologia e Gestão（技术与管理高等学院）；Instituto Politécnico de Leiria（莱里亚理工学院）；NOVA LINCS（NOVA LINCS（里斯本新大学计算机科学系实验室））
Software-defined networking (SDN) is the concept of decoupling the control and data planes to create a flexible and agile network, assisted by a central controller. However, the performance of SDN highly depends on the limitations in the fronthaul which are inadequately discussed in the existing literature. In this paper, a fronthaul-aware software-defined resource allocation mechanism is proposed for 5G wireless networks with in-band wireless fronthaul constraints. Considering the fronthaul capacity, the controller maximizes the time-averaged network throughput by enforcing a coarse correlate…
Transparent topology is common in many mobile ad hoc networks (MANETs) such as vehicle ad hoc networks (VANETs), unmanned aerial vehicle (UAV) ad hoc networks, and wireless sensor networks due to their decentralization and mobility nature. There are many existing works on distributed scheduling scheme design for topology-transparent MANETs. Most of them focus on delay-unconstrained settings. However, with the proliferation of real-time applications over wireless communications, it becomes more and more important to support delay-constrained traffic in MANETs. In such applications, each packet …
The IEEE 802.11ad WiFi amendment enables short-range multi-gigabit communications in the unlicensed 60~GHz spectrum, unlocking new interesting applications such as wireless Augmented and Virtual Reality. The characteristics of the mmWave band and directional communications allow increasing the system throughput by scheduling pairs of nodes with low cross-interfering channels in the same time-frequency slot. On the other hand, this requires significantly more signaling overhead. Furthermore, IEEE 802.11ad introduces a hybrid MAC characterized by two different channel access mechanisms: contenti…
Uplink configured Grant allocation has been introduced in 3rd Generation Partnership Project New Radio Release 15. This is beneficial in supporting Ultra-Reliable and Low Latency Communication for industrial communication, a key Fifth Generation mobile communication usage scenario. This scheduling mechanism enables a user with periodic traffic to transmits its data readily and bypasses the control signaling entailed to scheduling requests and scheduling grants and provides low latency access. To facilitate ultra-reliable communication, the scheduling mechanism can allow users to transmit conse…
In this paper we examine the problem of designing and allocating transmission sequences to users in a mobile ad hoc network that has no spatial boundary. A basic tenet of the transmission sequence approach for addressing media access control is that under normal operating conditions, there is no feedback triggered re-transmission. This obviously is a major departure from the Slotted-ALOHA or CSMA type approaches. While these solutions enjoy excellent throughput performance, a fundamental drawback is that they are based on feedback information. For systems without naturally defined central cont…
Cloud-based computing infrastructure provides an efficient means to support real-time processing workloads, e.g., virtualized base station processing, and collaborative video conferencing. This paper addresses resource allocation for a computing system with multiple resources supporting heterogeneous soft real-time applications subject to Quality of Service (QoS) constraints on failures to meet processing deadlines. We develop a general outer bound on the feasible QoS region for non-clairvoyant resource allocation policies, and an inner bound for a natural class of policies based on dynamicall…
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety and comfort in the future. When many vehicles want to access data through roadside unit, data scheduling become an important issue. In this paper, we identify some challenges in roadside based data access. To address these challenges we first review some existing scheduling schemes. We then propose a priority scheduling and finally show that using this idea can increase QOS compare to previous algorithms.
Cellular networks provide communication for different applications. Some applications have strict and very short latency requirements, while others require high bandwidth with varying priorities. The challenge of satisfying the requirements grows in congested traffic where some packets might miss their deadlines. Unfortunately, we prove that the problem is NP-Hard. To overcome this, we propose a new scheduling policy for packets with multiple priorities, latency requirements, and strict deadlines. To alleviate the complexity, our solution incorporates a novel time domain relaxation solved by l…
In this paper, we present a novel application of matrix game theory for optimization of link scheduling in wireless ad-hoc networks. Optimum scheduling is achieved by soft coloring of network graphs. Conventional coloring schemes are based on assignment of one color to each region or equivalently each link is member of just one partial topology. These algorithms based on coloring are not optimal when links are not activated with the same rate. Soft coloring, introduced in this paper, solves this problem and provide optimal solution for any requested link usage rate. To define the game model fo…
Scheduling plays a pivotal role in multi-user wireless communications, since the quality of service of various users largely depends upon the allocated radio resources. In this paper, we propose a novel scheduling algorithm with contiguous frequency-domain resource allocation (FDRA) based on deep reinforcement learning (DRL) that jointly selects users and allocates resource blocks (RBs). The scheduling problem is modeled as a Markov decision process, and a DRL agent determines which user and how many consecutive RBs for that user should be scheduled at each RB allocation step. The state space,…
With the increasing number of base stations (BSs) and network densification in 5G, interference management using link scheduling and power control are vital for better utilization of radio resources. However, the complexity of solving link scheduling and the power control problem grows exponentially with the number of BS. Due to high computation time, previous methods are useful for research purposes but impractical for real time usage. In this paper we propose to use deep neural networks (DNNs) to approximate optimal link scheduling and power control for the case with multiple small cells. A …
We study the problem of user-scheduling and resource allocation in distributed multi-user, multiple-input multiple-output (MIMO) networks implementing user-centric clustering and non-coherent transmission. We formulate a weighted sum-rate maximization problem which can provide user proportional fairness. As in this setup, users can be served by many transmitters, user scheduling is particularly difficult. To solve this issue, we use block coordinate descent, fractional programming, and compressive sensing to construct an algorithm that performs user-scheduling and beamforming. Our results show…
5G mobile networks are expected to provide pervasive high speed wireless connectivity, to support increasingly resource intensive user applications. Network hyper-densification therefore becomes necessary, though connecting to the Internet tens of thousands of base stations is non-trivial, especially in urban scenarios where optical fibre is difficult and costly to deploy. The millimetre wave (mm-wave) spectrum is a promising candidate for inexpensive multi-Gbps wireless backhauling, but exploiting this band for effective multi-hop data communications is challenging. In particular, resource al…
To achieve high-speed (giga-bit) connectivity for short-range wireless multimedia applications, the millimeter-wave (mmWave) wireless personal area networks with directional antennas are gaining increased interest. Due to the use of directional antennas and mmWave communications, the probability of non-interfering transmissions increases in a localized region. Network throughput can be increased immensely by the concurrent time allocation of non-interfering transmissions. The problem of finding optimum time allocation for concurrent transmissions is an NP-hard problem. In this paper, we propos…
We suggest and analyze algorithms for routing in multi-hop wireless ad-hoc networks that exploit mutual information accumulation as the physical layer transmission scheme, and are capable of routing multiple packet streams (commodities) when only the average channel state information is present and that only locally. The proposed algorithms are modifications of the Diversity Backpressure (DIVBAR) algorithm, under which the packet whose commodity has the largest "backpressure metric" is chosen to be transmitted and is forwarded through the link with the largest differential backlog (queue lengt…
In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We …
University of Pennsylvania（宾夕法尼亚大学）；Intel Labs（英特尔实验室）
We consider optimal resource allocation problems under asynchronous wireless network setting. Without explicit model knowledge, we design an unsupervised learning method based on Aggregation Graph Neural Networks (Agg-GNNs). Depending on the localized aggregated information structure on each network node, the method can be learned globally and asynchronously while implemented locally. We capture the asynchrony by modeling the activation pattern as a characteristic of each node and train a policy-based resource allocation method. We also propose a permutation invariance property which indicates…
Hitachi (China) Research & Development Cooperation（日立（中国）研发有限公司）
In federated learning (FL), devices contribute to the global training by uploading their local model updates via wireless channels. Due to limited computation and communication resources, device scheduling is crucial to the convergence rate of FL. In this paper, we propose a joint device scheduling and resource allocation policy to maximize the model accuracy within a given total training time budget for latency constrained wireless FL. A lower bound on the reciprocal of the training performance loss, in terms of the number of training rounds and the number of scheduled devices per round, is d…
In this paper, we consider the problem of joint user scheduling and dynamic pilot allocation in a Time-Division Duplex (TDD) based Massive MIMO network under varying traffic condition. One of the main problems with Massive MIMO systems is that the number of available orthogonal pilot signals is limited, and the dynamic allocation of these signals to different users is crucially needed to utilize the full benefit of these systems. In addition, pilot signals are radio resource control (RRC) configured in practice, and hence the frequent reconfiguration causes high signaling overhead and is costl…
Network slicing and resource allocation play pivotal roles in software-defined network (SDN)/network function virtualization (NFV)-assisted 5G networks. In 5G communications, the traffic rate is high, necessitating high data rates and low latency. Deep learning is a potential solution for overcoming these constraints. Secure slicing avoids resource wastage; however, DDoS attackers can exploit the sliced network. Therefore, we focused on secure slicing with resource allocation under massive network traffic. Traffic-aware scheduling is proposed for secure slicing and resource allocation over SDN…
In this paper we present matrix game-theoretic models for joint routing, network coding, and scheduling problem. First routing and network coding are modeled by using a new approach based on compressed topology matrix that takes into account the inherent multicast gain of the network. The scheduling is optimized by a new approach called network graph soft coloring. Soft graph coloring is designed by switching between different components of a wireless network graph, which we refer to as graph fractals, with appropriate usage rates. The network components, represented by graph fractals, are a n…
This paper addresses the problem of energy-efficient resource allocation in the downlink of a cellular OFDMA system. Three definitions of the energy efficiency are considered for system design, accounting for both the radiated and the circuit power. User scheduling and power allocation are optimized across a cluster of coordinated base stations with a constraint on the maximum transmit power (either per subcarrier or per base station). The asymptotic noise-limited regime is discussed as a special case. %The performance of both an isolated and a non-isolated cluster of coordinated base stations…
Consider the problem of joint uplink scheduling and power allocation. Being inherent to almost any wireless system, this resource allocation problem has received extensive attention. Yet, most common techniques either adopt classical power control, in which mobile stations are received with the same Signal-to-Interference-plus-Noise Ratio, or use centralized schemes, in which base stations coordinate their allocations. In this work, we suggest a novel scheduling approach in which each base station, besides allocating the time and frequency according to given constraints, also manages its uplin…
