We consider a minimum span channel allocation problem (MS -CAP) to overcome spectrum scarcity and facilitate the efficiency of unmanned aerial vehicle (UAV)-enabled wireless networks. Basically, the MSCAP minimizes th...
详细信息
We consider a minimum span channel allocation problem (MS -CAP) to overcome spectrum scarcity and facilitate the efficiency of unmanned aerial vehicle (UAV)-enabled wireless networks. Basically, the MSCAP minimizes the difference between the maximum and minimum used frequency, i.e., the required total bandwidth, while guaranteeing the quality -of -service (QoS) requirements for each wireless link in the network. The conventional optimal minimum span channel allocation (MS -CA) scheme is based on a centralized approach, assuming that global network information is available at the central controller. In practice, however, this may not be feasible for dynamic environments like UAV-enabled wireless networks since the real-time exchange of network information and channel allocation results with dynamically moving UAVs is formidable. Hence, we propose a novel practical MS -CA algorithm based on distributed multi -agent reinforcement learning (MARL), where each agent independently learns its best strategy with its local observations. To the best of our knowledge, the proposed technique is the first work of designing a distributed MARL for the MS -CAP for multi-UAV-enabled wireless networks in the literature. Numerical results reveal that the proposed distributed MS -CA technique can efficiently save the required total bandwidth while ensuring the QoS requirements of each link, represented by the signal -to -interference plus noise ratio (SINR) threshold, even in dynamic wireless networks. It validates the applicability of the proposed distributed MS -CA framework to dynamic networks.
Considering a tandem network of queues (each representing the buffer in a router) our objective is to allow each individual queue to dynamically control its own parameters (in this paper the buffer size) using only in...
详细信息
ISBN:
(纸本)9781424456383
Considering a tandem network of queues (each representing the buffer in a router) our objective is to allow each individual queue to dynamically control its own parameters (in this paper the buffer size) using only information available locally and from neighboring nodes. For each node we adopt control approaches that are based on Infinitesimal Perturbation Analysis (IPA) estimates of certain performance measures. In this family of approaches we investigate collaboration schemes that can lead us to global optimal (or near optimal) solutions. The contribution of the paper is the design of a simple protocol that allows neighboring nodes to collaboratively exchange information in order to converge to a global optimal solution.
Based on the available power line structure, a PLC network is configured as a multiple cells network, including several adjacent access and in-home cells. In a PLC cell, the users are not moving but their statuses and...
详细信息
ISBN:
(纸本)9781424437917
Based on the available power line structure, a PLC network is configured as a multiple cells network, including several adjacent access and in-home cells. In a PLC cell, the users are not moving but their statuses and traffic demands are changing during the run-time. These cells may interference with each other;therefore, each cell has a fixed amount of transmission capacity for its transmissions. The transmission capacity is defined as a set of channels. Since the active users and traffic demands in each cell are variable, the users in different cells may get different amount of resource for their transmission. This situation leads to the problem of unfairness between users. Furthermore, when the cells are not interfering, they can use the same channels for their parallel transmissions. The overall multi-cell structure may also change dynamically due to the activation and deactivation of some cells, which requires a method for rearranging the allocated channels between the working cells. Therefore, a method which allows the dynamic sharing of the transmission capacity between the cells is required. In this paper, we propose a negotiation strategy to allow the cells to cooperate and dynamically share the channels in a distributed fashion. The negotiation strategy is based on two procedures, seizing the channels if they are free and releasing channels if a cell has more channels per user than its neighbors. The proposal is analyzed and several aspects are discussed in this paper.
We consider distributeddynamic slot and power allocation for the downlink of a TD/SDMA broadband wireless packet network with multiple access ports and adaptive antennas. The still open issue for packet multicell SDM...
详细信息
ISBN:
(纸本)0780383443
We consider distributeddynamic slot and power allocation for the downlink of a TD/SDMA broadband wireless packet network with multiple access ports and adaptive antennas. The still open issue for packet multicell SDMA is how to manage the intercell interference, which is very difficult to predict in an uncoordinated environment, due to packet access and downlink beamforming. For this reason, doing distributedallocation efficiently as well as improving the performance by means of power control results in a very hard task. We propose a greedy SDMA algorithm exploiting the power shaping technique, which is based on a static preallocation of the transmit power to each slot of the frame. This permits to obtain a partial predictability of intercell interference, allowing different levels of estimated intercell interference and available power for each slot. We show that our greedy SDMA algorithm with power shaping increases system capacity with respect to the same algorithm without power shaping and reduces the performance gap with respect to a greedy centralized strategy thus limiting the need of coordination among cells. Both centralized and distributed algorithms are compared, as reference, to the baseline case of random allocation, previously proposed for packet access.
暂无评论