Bio-inspired power control and channel allocation for cellular networks with D2D communications

With the tremendous increment of traffic in the next generation mobile networks, device to device (D2D) communication is proposed to relieve the traffic burden of the base station and improve the overall network capacity. It supports direct communications between devices and could reuse the resources of cellular users (CUs). Despite the advantages, D2D communications bring great challenges in interference management. In this paper, we study the power control and channel allocation problems in three scenarios: (1) one CU and one D2D pair; (2) one CU and multiple D2D pairs; (3) multiple CUs and multiple D2D pairs. The goal is to coordinate the mutual interferences and maximize the overall network capacity. We derive sufficient conditions to guarantee the efficiency of D2D communications in scenarios with one CU and one D2D pair. We propose the bio-inspired PSO-P power control algorithm for the scenarios with one CU and multiple D2D pairs, and the PSO-CP algorithm for the scenarios with multiple CUs and multiple D2D pairs to jointly assign channels and powers. Simulation results show that the proposed algorithms are efficient in improving the overall network capacity.

     

Sensing error aware delay-optimal channel allocation scheme for cognitive radio networks

Spectrum sensing is not always perfect in practical cognitive radio networks. In this paper, two kinds of sensing errors are considered into the channel allocation scheme. Our work focuses on the cases that the channel availability varies fast during a channel allocation period, in which case the channel dynamics needs to be considered. The sensing errors are modeled to derive the metric of mean delay for each user-channel combination using the vacation queueing model. Further, the optimal resource allocation is determined based on the mean delay metric by bipartite graph matching. The simulation results indicate that the proposed mean delay metric can represent the transmission performance successfully, and the proposed resource allocation scheme is robust to sensing errors.     

蜂窝网络中D2D通信模式选择和信道分配算法

设备到设备(D2D)通信中,不合理的模式选择和信道分配方案会引入干扰,严重时不仅不能体现D2D通信优势,而且还将导致蜂窝用户传输速率下降。针对这一问题,文章提出了一种蜂窝网络中D2D模式选择和信道分配算法。仿真结果表明,新算法能够在有效的平衡蜂窝网络中D2D用户接入率和系统总吞吐量的同时,最小化用户之间的干扰。     

Resource and power allocation for achieving rate fairness in D2D communications overlaying cellular networks

Wireless Networks - This paper presents a novel resource and power allocation scheme for device-to-device (D2D) communications overlaying cellular networks. The proposed scheme is implemented in...     

Distributed fault-tolerant channel allocation for cellular networks

A channel allocation algorithm includes channel acquisition and channel selection algorithms. Most of the previous work concentrates on the channel selection algorithm since early channel acquisition algorithms are centralized and rely on a mobile switching center (MSC) to accomplish channel acquisition. Distributed channel acquisition algorithms have received considerable attention due to their high reliability and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, the borrower fails to borrow channels when it cannot communicate with any interference neighbor. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In existing distributed algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel, the failure rate will be much higher under heavy traffic load. Therefore, previous distributed channel allocation algorithms are not suitable for real-life networks. We first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to nonfault-tolerant channel allocation algorithms. Moreover, our algorithm has low message overhead compared to known distributed channel allocation algorithms, and outperforms them in terms of failure rate under uniform as well as nonuniform traffic distribution     

Resource allocation for NOMA based D2D underlaid cellular networks

This paper puts forward a user clustering and power allocation algorithm for non-orthogonal multiple access (NOMA) based device-to-device (D2D) cellular system. Firstly, an optimization problem aimed at maximizing the sum-rate of the system is constructed. Since the optimization problem is a mixed-integer non-convex optimization, it is decomposed into two subproblems, namely user clustering and power allocation subproblem. In the subproblem of user clustering, the clustering algorithms of cellular user and D2D pair are proposed respectively. In the power allocation subproblem, the gradient assisted binary search (GABS) algorithm and logarithmic approximation in successive convex approximation (SCA) are used to optimize the power of subchannel (SC) and D2D transmitted power respectively. Finally, an efficient joint iterative algorithm is proposed for the original mixed inter non-convex non-deterministic polynomial (NP)-hard problem. The simulation results show that the proposed algorithm can effectively improve the total system rate and the larger the ratio of cellular users (CUs) to total users, the larger the total system rate.     

Performance analysis of a channel allocation scheme for multi‐service mobile cellular networks

This paper presents a new channel allocation scheme, namely the dynamic partition with pre‐emptive priority (DPPP) scheme, for multi‐service mobile cellular networks. The system is modelled by a two‐dimensional Markov process and analysed by the matrix‐analytic method. A pre‐emptive priority (PP) mechanism is employed to guarantee the quality of service (QoS) requirement of the real‐time (RT) traffic at the expense of some degradation of non‐real‐time (NRT) traffic, while the victim buffer compensates the degradation and has no negative impact on the RT traffic. The complete service differentiation between new calls and handoff calls from different traffic classes is achieved by using the dynamic partition (DP) concept with the help of related design parameters. The performance analysis and numerical results show that the DPPP scheme, compared with the existing schemes, is effective and practical in multi‐service environments. Copyright © 2006 John Wiley & Sons, Ltd.     

蜂窝通信网络中的分布式无线信道分配方法

文中提出了一种适用于蜂窝通信网的分布式无线信道分配方法。当网络部署环境中出现干扰后,终端用户通过控制信道,发送反馈信息至基站;基站接收到反馈信息后,对可用信道进行扫频,利用广播帧通知受干扰的终端用户可用信道信息;然后终端用户收到基站发送的广播帧后,根据优先级机制,选择新的信道重新建立与基站的通信,当蜂窝通信网中终端用户受外部干扰而信道中断后,该方法可减少终端用户和基站之间信令的开销。     

Energy‐efficient resource allocation in D2D communications for energy harvesting–enabled NOMA‐based cellular networks

In this paper, we propose an energy‐efficient power control and harvesting time scheduling scheme for resource allocation of the subchannels in a nonorthogonal multiple access (NOMA)–based device‐to‐device (D2D) communications in cellular networks. In these networks, D2D users can communicate by sharing the radio resources assigned to cellular users (CUs). Device‐to‐device users harvest energy from the base station (BS) in the downlink and transmit information to their receivers. Using NOMA, more than one user can access the same frequency‐time resource simultaneously, and the signals of the multiusers can be separated successfully using successive interference cancellation (SIC). In fact, NOMA, unlike orthogonal multiple access (OMA) methods, allows sharing the same frequency resources at the same time by implementing adaptive power allocation. Our aim is to maximize the energy efficiency of the D2D pairs, which is the ratio of the achievable throughput of the D2D pairs to their energy consumption by allocating the proper subchannel of each cell to each device user equipment (DUE), managing their transmission power, and setting the harvesting and transmission time. The constraints of the problem are the quality of service of the CUs, minimum required throughput of the subchannels, and energy harvesting of DUEs. We formulate the problem and propose a low‐complexity iterative algorithm on the basis of the convex optimization method and Karush‐Kuhn‐Tucker conditions to obtain the optimal solution of the problem. Simulation results validate the performance of our proposed algorithm for different values of the system parameters.     

协作D2D异构网络的联合资源分配和功率控制

针对下行协作D2D(Device-to-Device)异构网络中复用蜂窝用户的联合资源分配和功率控制问题,提出了一种量子珊瑚礁优化算法(Quantum Coral Reef Optimization Algorithm,QCROA).首先,构建异构网络模型并推导得到整个网络总吞吐量的数学表达式;其次,基于QCROA算法...     

A new localized channel sharing scheme for cellular networks

Enhancing system capacity while maintaining quality of service is an important issue in wireless cellular networks. In this paper, we present a new localized channel sharing scheme to address this problem. Our basic idea is to allow channels to be shared between adjacent cells. We further propose a fixed channel assignment scheme to maximize channel reuse efficiency while allowing channel sharing. We show that our sharing scheme can also facilitate handoff processing. An important feature of our sharing scheme is that channel management is localized between adjacent cells, and no global coordination or optimization is required, thus making it suitable for implementation. We provide simulation results comparing our scheme with the conventional channel assignment and handoff techniques. We find that our scheme improves system capacity over a broad range of traffic parameters and a variety of quality of service requirements.     

Distributed power allocation and scheduling for parallel channel wireless networks

In this paper we develop distributed approaches for power allocation and scheduling in wireless access networks. We consider a model where users communicate over a set of parallel multi-access fading channels, as in an orthogonal frequency division multiple access (OFDMA) system. At each time, each user must decide which channels to transmit on and how to allocate its power over these channels. We give distributed power allocation and scheduling policies, where each user’s actions depend only on knowledge of their own channel gains. Assuming a collision model for each channel, we characterize an optimal policy which maximizes the system throughput and also give a simpler sub-optimal policy. Both policies are shown to have the optimal scaling behavior in several asymptotic regimes. Xiangping Qin received the B.S. and M.S. degrees in Electrical Engineering from Tsinghua University,China in 1998 and 2000 respectively, and the Ph.D. degree in Electrical Engineering from Northwestern University in 2005. She is currently a senior engineer at Samsung Information Systems America. In 2005/2006, She was a postdoctoral associate in the Department of Electrical and Computer Engineering at Boston University. In 2004, she was an intern on the technical staff of Intel Cooperate Technology Laboratory, Oregon. Her primary research interests include wireless communication and data networks. She is the recipient of aWalter P. Murphy Fellowship for the 2000/2001 academic year from the ECE Department at Northwestern University. Randall A. Berry received the B.S. degree in Electrical Engineering from the University of Missouri-Rolla in 1993 and the M.S. and Ph.D. degrees in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology in 1996 and 2000, respectively. In September 2000, he joined the faculty of Northwestern University, where he is currently an Associate Professor in the Department of Electrical Engineering and Computer Science. In 1998 he was on the technical staff at MIT Lincoln Laboratory in the Advanced Networks Group, where he worked on optical network protocols. His current research interests include wireless communication, data networks and information theory. Dr. Berry is the recipient of a 2003 NSF CAREER award and the 2001-02 best teacher award from the ECE Department at Northwestern. He is currently serving on the editorial board of IEEE Transactions on Wireless Communications and is a guest editor of an upcoming special issue of IEEE Transactions on Information Theory on “Relaying and Cooperation in Networks.”     

An efficient fault-tolerant distributed channel allocation algorithm for cellular networks

A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.     

蜂窝网络中信道分配模型的优化设计与实现

基于基站功率控制的传统信道资源分配模型,采用的帧结构中的两跳链路处于同一时隙中,不能在一帧中完成链路的数据传递,导致系统信道资源分配业务传递滞后。提出基于资源复用的蜂窝网络信道资源分配模型,蜂窝网络采用帧结构向这些通信链路分配时频资源,通过资源复用形式降低蜂窝网络的信道分配资源消耗,在一帧中实现两跳链路的信道分配数据传递。依据扰动的Greedy算法思想,按照带有扰动的信道质量矩阵,实现蜂窝网络信道分配。处于同扇区的两个中继节点间通过动态资源分配方法,按照小区信道的业务情况动态分配信道资源。通过仿真实验分析对比信道分配需求量、阻塞率、收敛性、网络吞吐量、网络节点间通信中断概率五项指标。仿真结果表明,所设计蜂窝网络信道分配模型在对蜂窝网络信道资源进行信道分配过程中,信道资源的使用率增强,分配资源消耗低,信道分配质量提高,具有较高的业务实时性。     

Power allocation and relay selection for network-coded D2D communication underlay heterogeneous cellular networks

Underlay device-to-device (D2D) communication is an attractive technology enabling nearby cellular users to communicate with each other directly in order to increase data rate and spectral efficiency. The current cellular heterogeneous networks consist of macrocell base stations and small cell base stations with different transmit powers and coverage areas. Femtocell is the most popular small cell which is expected to be utilized in dense and ultra-dense scenarios in the future. Network coding in relay-assisted multi-hop communications improves achievable transmission rate and coverage of D2D communications. In this paper, two-hop random linear network coding network in cooperative D2D communication (RLNC-CDC) is considered. We propose to use femtocell base station (FBS) as a relay. We assume that the D2D pair and relay operate in the frequency band which is allocated to femtocell network. Therefore, there would be interference from the relay node and the D2D communication on the femtocell network users. To reduce the interference, the sum of transmit powers of the D2D pair and selected relay FBS should be minimized in a way that the highest transmission rate for the D2D pair is achieved. The constraints on the bounds of transmit powers of the D2D and relay node as well as the minimum required transmission rate for D2D communication are considered and the optimum solution is obtained. Simulation results indicate that the proposed RLNC-CDC achieves higher data rate and smaller outage probability than the direct D2D transmission.     

Deep reinforcement learning-based resource allocation for D2D communications in heterogeneous cellular networks

Device-to-Device (D2D) communication-enabled Heterogeneous Cellular Networks (HCNs) have been a promising technology for satisfying the growing demands of smart mobile devices in fifth-generation mobile networks. The introduction of Millimeter Wave (mm-wave) communications into D2D-enabled HCNs allows higher system capacity and user data rates to be achieved. However, interference among cellular and D2D links remains severe due to spectrum sharing. In this paper, to guarantee user Quality of Service (QoS) requirements and effectively manage the interference among users, we focus on investigating the joint optimization problem of mode selection and channel allocation in D2D-enabled HCNs with mm-wave and cellular bands. The optimization problem is formulated as the maximization of the system sum-rate under QoS constraints of both cellular and D2D users in HCNs. To solve it, a distributed multiagent deep Q-network algorithm is proposed, where the reward function is redefined according to the optimization objective. In addition, to reduce signaling overhead, a partial information sharing strategy that does not observe global information is proposed for D2D agents to select the optimal mode and channel through learning. Simulation results illustrate that the proposed joint optimization algorithm possesses good convergence and achieves better system performance compared with other existing schemes.     

A dynamic channel assignment scheme for clustered multihop cellular networks

Whereas cellular systems have traditionally adopted single‐hop transmissions between the mobile station (MS) and the base station (BS), researchers expect multihop transmission to be utilised in the future. Cellular systems present several challenges, such as channel assignment, which are exacerbated by multimedia service traffic and an increasing number of subscribers. Recently, a clustered multihop cellular network (cMCN) architecture that complements traditional cellular systems has been proposed and studied using fixed channel assignment (FCA). However, the performance of FCA is limited when the traffic pattern varies in a service area. This paper proposes the use of dedicated information ports (DIPs) as clusterheads in cMCN, followed by a multihop dynamic channel assignment (mDCA) scheme. The mDCA works by assigning channels based on information about interference in surrounding cells. Two different channel searching strategies are developed and evaluated. Through computer simulation, we show that the proposed mDCA is able to achieve a significantly improved capacity which is maintained when the number of system channels is increased. Finally, issues regarding the implementation of the mDCA and future work on this topic are discussed. Copyright © 2007 John Wiley & Sons, Ltd.     

A distributed adaptive guard channel reservation scheme for cellular networks

In this paper, a distributed adaptive guard channel reservation (DAGCR) scheme is proposed to give priority to handoff calls. This scheme is built upon the concept of guard channels and it uses an adaptive algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality‐of‐service (QoS) parameters used are the new and handoff call blockings. Simulation studies are performed to compare the present algorithm with the static guard channel policy. Simulation results show that this proposed algorithm guarantees the handoff call blocking probability to remain below the targeted threshold up to a substantially high offered load with a minimal blocking to new calls up to a moderate offered load and also shows significantly high channel utilization in all offered load conditions. This scheme is examined over a wide range of offered load. Thus, it seems the proposed scheme is very useful in controlling the blocking performances in wireless cellular networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Uplink resource allocation and power control for D2D communications underlaying multi-cell mobile networks

Proximity user equipments (UEs) in mobile networks may be communicated directly without passing their traffic through the base station by using device-to-device (D2D) communications. This can be done using the underlaying approach in which the D2D-UEs (DEs) are allowed to use the same resources allocated for cellular UEs (CEs), which can enhance the spectral efficiency. However, if the resource allocation for DEs is not designed appropriately, it would generate harmful interference on CEs communications. Therefore, this paper addresses a resource allocation and power control problems for D2D communications underlaying multi-cell mobile networks with the consideration of the inter-cell and intra-cell interferences. The problem is formulated to maximise the network performance in terms of achieved throughput while ensuring the quality-of-service (QoS) constraints for CEs and DEs. A two-step algorithm is proposed in which the admission control is performed firstly to determine the set of possible D2D connections and their CE partners that achieve the minimum QoS demands. Then, the optimal power for each permissible DE and its possible partners in different cells are allocated to maximise the network throughput. Simulation results illustrate that the suggested algorithm can remarkably enhance the performance of the network in terms of throughput gain and access rate.     

Joint TAS/SC and power allocation for IAF relaying D2D cooperative networks

In this paper, the outage probability (OP) performance of multiple-relay-based incremental amplify-and-forward relaying device-to-device networks with transmit antenna selection (TAS) over N-Nakagami fading channels is investigated. The exact closed-form expressions for OP of the optimal and suboptimal TAS schemes are derived. The power allocation problem is formulated for performance optimization. Then the OP performance under different conditions is evaluated through numerical simulations to verify the analysis. The simulation results showed that optimal TAS scheme has a better OP performance than suboptimal TAS scheme, but the performance gap between the optimal and suboptimal schemes diminishes by increasing the number of antennas at the source; the fading coefficient, the number of cascaded components, the relative geometrical gain, the number of antennas, and the power-allocation parameter have an important influence on the OP performance.