Resource Allocation Algorithm Design Research Articles

An endogenous intelligent architecture for wireless communication networks

AbstractThe challenges posed by the future wireless communication network, which will be a huge system with more complex structures, diverse functions, and massive communication ends, will be addressed by intelligent wireless communication technologies. These technologies are playing an increasingly important role in network architecture, computing architecture, resource allocation algorithm design, etc., thanks to the rapid development of artificial intelligence technologies, particularly the deep learning technologies, and their extensive application in various domains. In this paper, an endogenous intelligent architecture is developed to effectively clarify and understand in-depth the relationship among the factors by constructing wireless knowledge graph for the air interface transmission, the core network, as well as the network environment, and so on. Furthermore, the knowledge graph simultaneously reveals the structure and operation mechanism of the whole wireless communication networks. Cause tracing, intelligent optimization, and performance evaluation are sequentially implemented based on the knowledge graph, thus forming a complete closed-loop for endogenous intelligent wireless communication networks.

Retraction Note: Resource allocation algorithm design of high quality of service based on chaotic neural network in wireless communication technology

Retraction Note: Resource allocation algorithm design of high quality of service based on chaotic neural network in wireless communication technology

Robust and Secure Resource Allocation for ISAC Systems: A Novel Optimization Framework for Variable-Length Snapshots

In this paper, we investigate the robust resource allocation design for secure communication in an integrated sensing and communication (ISAC) system. A multi-antenna dual-functional radar-communication (DFRC) base station (BS) serves multiple single-antenna legitimate users and senses for targets simultaneously, where already identified targets are treated as potential single-antenna eavesdroppers. The DFRC BS scans a sector with a sequence of dedicated beams, and the ISAC system takes a snapshot of the environment during the transmission of each beam. Based on the sensing information, the DFRC BS can acquire the channel state information (CSI) of the potential eavesdroppers. Different from existing works that focused on the resource allocation design for a single snapshot, in this paper, we propose a novel optimization framework that jointly optimizes the communication and sensing resources over a sequence of snapshots with adjustable durations. Besides, artificial noise (AN) is exploited by the BS for joint sensing and physical layer security provisioning. To this end, we jointly optimize the duration of each snapshot, the beamforming vector, and the covariance matrix of the AN for maximization of the system sum secrecy rate over a sequence of snapshots while guaranteeing a minimum required average achievable rate and a maximum information leakage constraint for each legitimate user. The resource allocation algorithm design is formulated as a non-convex optimization problem, where we account for the imperfect CSI of both the legitimate users and the potential eavesdroppers. To make the problem tractable, we derive a bound for the uncertainty region of the potential eavesdroppers’ small-scale fading based on a safe approximation, which facilitates the development of a block coordinate descent-based iterative algorithm for obtaining an efficient suboptimal solution. Simulation results illustrate that the proposed scheme can significantly enhance the physical layer security of ISAC systems compared to three baseline schemes. Moreover, compared to the conventional multi-stage approach for ISAC system design, the proposed approach based on variable-length snapshots not only facilitates a highly-directional offline sensing beam design but also allows us to flexibly prioritize communication or sensing depending on the application scenario.

Optimal Resource Allocation Design for Large IRS-Assisted SWIPT Systems: A Scalable Optimization Framework

In this paper, we study the optimal resource allocation algorithm design for large intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) systems. To facilitate efficient system design for large IRSs, instead of jointly optimizing all the IRS elements, we partition the IRS into several tiles and employ a scalable optimization framework comprising an offline design stage and an online optimization stage. In the offline stage, the IRS elements of each tile are jointly designed to support a set of different phase shift configurations, referred to as transmission modes, while the best transmission mode is selected from the set for each tile in the online stage. Given a transmission mode set, we aim to minimize the total base station (BS) transmit power by jointly optimizing the beamforming and the transmission mode selection policy taking into account the quality-of-service requirements of information decoding and non-linear energy harvesting receivers, respectively. Although the resource allocation algorithm design is formulated as a non-convex combinatorial optimization problem, we solve it optimally by applying the branch-and-bound (BnB) approach which entails a high computational complexity. To strike a balance between optimality and computational complexity, we also develop an efficient suboptimal algorithm capitalizing on the penalty method and successive convex approximation. Our simulation results show that the proposed designs enable considerable power savings compared to several baseline schemes. Moreover, our results reveal that by properly adjusting the numbers of tiles and transmission modes, the proposed scalable optimization framework indeed facilitates online design for large IRSs. Besides, our results confirm that the advocated physics-based model and scalable optimization framework enable a flexible trade-off between performance and complexity, which is vital for realizing the performance gains promised by large IRS-assisted communication systems in practice.

Online Teaching Wireless Video Stream Resource Dynamic Allocation Method considering Node Ability

At present, wireless network technology is advancing rapidly, and intelligent equipment is gradually popularized, which rapidly developed the mobile streaming media business. All kinds of mobile video applications have enriched people’s lives by carrying huge traffic randomly. Wireless networks (WNs) are facing an unprecedented burden, which allocates very important wireless video resources. Similarly, in WNs, the network status is dynamic and the terminal is heterogeneous, which causes the traditional video transmission system to fail to meet the needs of users. Hence, Scalable Video Coding (SVC) has been introduced in the video transmission system to achieve bit rate adaptation. However, in a strictly hierarchical traditional computer network, the wireless resource allocation strategy usually takes throughput as the only way to optimize the target, and it is terrible to make more optimizations for scalable video transmission. This article proposed a cross-layer design to enable information to be transmitted between the wireless base station and the video server to achieve joint optimization. To improve users’ satisfaction with video services, the wireless resource allocation problem and the video stream scheduling problem are jointly considered, which keep the optimization space larger. Based on the proposed architecture, we further study the design of wireless resource allocation algorithms and rate-adaptive algorithms for the scenario of multiuser transmission of scalable video in the Long-Term Evolution (LTE) downlink. Experimental outcomes have shown substantial performance enhancement of the proposed work.

Optimal Resource Allocation for Multi-User OFDMA-URLLC MEC Systems

In this paper, we study resource allocation algorithm design for multi-user orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) in mobile edge computing (MEC) systems. To meet the stringent end-to-end delay and reliability requirements of URLLC MEC systems, we propose joint uplink-downlink resource allocation and finite blocklength transmission. Furthermore, we employ a partial time overlap between the uplink and downlink frames to minimize the end-to-end delay, which introduces a new time causality constraint. The proposed resource allocation algorithm is formulated as an optimization problem for minimization of the total weighted power consumption of the network under a constraint on the number of URLLC user bits computed within the maximum allowable computation time, i.e., the end-to-end delay of a computation task. Despite the non-convexity of the formulated optimization problem, we develop a globally optimal solution using a branch-and-bound approach based on discrete monotonic optimization theory. The branch-and-bound algorithm minimizes an upper bound on the total power consumption until convergence to the globally optimal value. Furthermore, to strike a balance between computational complexity and performance, we propose two efficient suboptimal algorithms based on successive convex approximation and second-order cone techniques. Our simulation results reveal that the proposed resource allocation algorithm design facilitates URLLC in MEC systems, and yields significant power savings compared to three baseline schemes. Moreover, our simulation results show that the proposed suboptimal algorithms offer different trade-offs between performance and complexity and attain a close-to-optimal performance at comparatively low complexity.

Research and design of resource allocation algorithm in wireless communication system

Although communication has been a topic of research since the 1960s, the last decade or so has seen a boom in research in this area. This is mainly due to the influence of several comprehensive factors, such as spectrum, power. We research the method Integer Fractional Frequency (IFR) and Fractional Frequency Reuse (FFR). We research some equations in a wireless system. And we calculate the capacity under different channel numbers. We also research the optimal power in a cell system, and the best suitable user number in the system. In a real environment, such a method can optimize the system capacity or performance and we can use a suitable model.

Resource Allocation for Multi-User Downlink MISO OFDMA-URLLC Systems

This article considers the resource allocation algorithm design for downlink multiple-input single-output (MISO) orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) systems. To meet the stringent delay requirements of URLLC, short packet transmission is adopted and taken into account for resource allocation algorithm design. The resource allocation is optimized for maximization of the weighted system sum throughput subject to quality-of-service (QoS) constraints regarding the URLLC users’ number of transmitted bits, packet error probability, and delay. Despite the non-convexity of the resulting optimization problem, the optimal solution is found via monotonic optimization. The corresponding optimal resource allocation policy can serve as a performance upper bound for sub-optimal low-complexity solutions. We develop such a low-complexity sub-optimal resource allocation algorithm based on successive convex approximation and difference of convex programming. Our simulation results reveal the importance of using multiple antennas for reducing the latency and improving the reliability of URLLC systems. Moreover, the proposed sub-optimal algorithm is shown to closely approach the performance of the proposed optimal algorithm and outperforms two baseline schemes by a considerable margin, especially when the users have heterogeneous delay requirements. Finally, conventional resource allocation designs based on Shannon’s capacity formula are shown to be not applicable in MISO OFDMA-URLLC systems as they are not able to guarantee the users’ delay constraints.

Multiuser MISO UAV Communications in Uncertain Environments With No-Fly Zones: Robust Trajectory and Resource Allocation Design

In this paper, we investigate robust resource allocation algorithm design for multiuser downlink multiple-input single-output (MISO) unmanned aerial vehicle (UAV) communication systems, where we account for the various uncertainties that are unavoidable in such systems and, if left unattended, may severely degrade system performance. We jointly optimize the two-dimensional (2-D) trajectory and the transmit beamforming vector of the UAV for minimization of the total power consumption. The algorithm design is formulated as a non-convex optimization problem taking into account the imperfect knowledge of the angle of departure (AoD) caused by UAV jittering, user location uncertainty, wind speed uncertainty, and polygonal no-fly zones (NFZs). Despite the non-convexity of the optimization problem, we solve it optimally by employing monotonic optimization theory and semidefinite programming relaxation which yields the optimal 2-D trajectory and beamforming policy. Since the developed optimal resource allocation algorithm entails a high computational complexity, we also propose a suboptimal iterative low-complexity scheme based on successive convex approximation to strike a balance between optimality and computational complexity. Our simulation results reveal not only the significant power savings enabled by the proposed algorithms compared to two baseline schemes, but also confirm their robustness with respect to UAV jittering, wind speed uncertainty, and user location uncertainty. Moreover, our results unveil that the joint presence of wind speed uncertainty and NFZs has a considerable impact on the UAV trajectory. Nevertheless, by counteracting the wind speed uncertainty with the proposed robust design, we can simultaneously minimize the total UAV power consumption and ensure a secure trajectory that does not trespass any NFZ.

Optimal 3D-Trajectory Design and Resource Allocation for Solar-Powered UAV Communication Systems

In this paper, we investigate the resource allocation algorithm design for multicarrier solar-powered unmanned aerial vehicle (UAV) communication systems. In particular, the UAV is powered by the solar energy enabling sustainable communication services to multiple ground users. We study the joint design of the 3D aerial trajectory and the wireless resource allocation for maximization of the system sum throughput over a given time period. As a performance benchmark, we first consider an off-line resource allocation design assuming non-causal knowledge of the channel gains. The algorithm design is formulated as a mixed-integer non-convex optimization problem taking into account the aerodynamic power consumption, solar energy harvesting, a finite energy storage capacity, and the quality-of-service requirements of the users. Despite the non-convexity of the optimization problem, we solve it optimally by applying monotonic optimization to obtain the optimal 3D-trajectory and the optimal power and subcarrier allocation policy. Subsequently, we focus on the online algorithm design that only requires real-time and statistical knowledge of the channel gains. The optimal online resource allocation algorithm is motivated by the off-line scheme and entails a high computational complexity. Hence, we also propose a low-complexity iterative suboptimal online scheme based on the successive convex approximation. Our simulation results reveal that both the proposed online schemes closely approach the performance of the benchmark off-line scheme and substantially outperform two baseline schemes. Furthermore, our results unveil the tradeoff between solar energy harvesting and power-efficient communication. In particular, the solar-powered UAV first climbs up to a high altitude to harvest a sufficient amount of solar energy and then descends again to a lower altitude to reduce the path loss of the communication links to the users it serves.

Energy-Efficient and Secure Resource Allocation for Multiple-Antenna NOMA With Wireless Power Transfer

Non-orthogonal multiple access (NOMA) is considered as one of the promising techniques for providing high data rates in the fifth generation mobile communication. By applying successive interference cancellation schemes and superposition coding at the NOMA receiver, multiple users can be multiplexed on the same subchannel. In this paper, we investigate resource allocation algorithm design for an OFDM-based NOMA system empowered by wireless power transfer (WPT). In the considered system, users who need to transmit data can only be powered by the WPT. With the consideration of an existing eavesdropper, the objective is to obtain secure and energy efficient transmission among multiple users by optimizing time, power and subchannel allocation. Moreover, we also take into consideration for the practical case that the statistics of the channel state information of the eavesdropper is not available. In order to address the optimization problem and its high computational complexity, we propose an iterative algorithm with guaranteed convergence to deliver an upper bound and a suboptimal solution in more general cases. For some special cases, we identify the optimality condition that ensures the global optimum in our algorithm. Extensive simulation studies demonstrate the competitiveness and effectiveness of the proposed algorithmic solution over conventional OFDMA systems as well as over other existing NOMA resource allocation schemes.

OFDM 시스템에서 스케일러블 비디오 전송을 위한 자원할당 알고리즘

본 논문은 직교 주파수 다중 접속(OFDM, Orthogonal Frequency Division Multiplexing) 시스템에서 스케일러블 비디오를 전송하기 위한 자원할당 방법을 제안한다. 제한된 시스템 자원에서 제안된 자원할당 방법은 스케일러블 계층 간의 강한 의존성 및 전송 채널의 다양성을 이용하여 비트 율 왜곡을 최소화하도록 설계된다. 우선적으로 스케일러블 비디오의 계층적 예측구조에 기반하여 각 계층에 대한 에러전파 가중치를 계산한다. 전송된 비디오의 화질 저하를 최소화하기 위해서, 계층기반 에러전파 가중치 및 채널의 상태를 이용하여 OFDM 시스템의 자원할당 알고리즘이 수행된다. 제안된 자원할당 알고리즘은 계층기반 가중치 정보를 고려하지 않은 TDMA 자원할당 알고리즘과 비교하여 1.5~3.0dB의 성능향상 결과를 나타내었다.

Robust and Secure Resource Allocation for Full-Duplex MISO Multicarrier NOMA Systems

In this paper, we study the resource allocation algorithm design for multiple-input single-output (MISO) multicarrier non-orthogonal multiple access (MC-NOMA) systems, in which a full-duplex base station serves multiple half-duplex uplink and downlink users on the same subcarrier simultaneously. The resource allocation is optimized for maximization of the weighted system throughput while the information leakage is constrained and artificial noise is injected to guarantee secure communication in the presence of multiple potential eavesdroppers. To this end, we formulate a robust non-convex optimization problem taking into account the imperfect channel state information of the eavesdropping channels and the quality-of-service requirements of the legitimate users. Despite the non-convexity of the optimization problem, we solve it optimally by applying monotonic optimization which yields the optimal beamforming, artificial noise design, subcarrier allocation, and power allocation policy. The optimal resource allocation policy serves as a performance benchmark since the corresponding monotonic optimization-based algorithm entails a high computational complexity. Hence, we also develop a low-complexity suboptimal resource allocation algorithm which converges to a locally optimal solution. Our simulation results reveal that the performance of the suboptimal algorithm closely approaches that of the optimal algorithm. Besides, the proposed optimal MISO NOMA system can not only ensure downlink and uplink communication security simultaneously but also provides a significant system secrecy rate improvement compared with the traditional MISO orthogonal multiple access systems and two other baseline schemes.

Power-Efficient and Secure WPCNs With Hardware Impairments and Non-Linear EH Circuit

In this paper, we design a robust resource allocation algorithm for a wireless-powered communication network (WPCN) taking into account residual hardware impairments (HWIs) at the transceivers, the imperfectness of the channel state information, and the non-linearity of practical radio frequency energy harvesting circuits. In order to ensure power-efficient secure communication, physical layer security techniques are exploited to deliberately degrade the channel quality of a multiple-antenna eavesdropper. The resource allocation algorithm design is formulated as a non-convex optimization problem for minimization of the total power consumption in the network, while guaranteeing the quality of service of the information receivers in terms of secrecy rate. The globally optimal solution of the optimization problem is obtained via a 2-D search and semidefinite programming relaxation. To strike a balance between computational complexity and system performance, a low-complexity iterative suboptimal resource allocation algorithm is also proposed. Numerical results demonstrate that both the proposed optimal and suboptimal schemes can significantly reduce the total system power consumption required for guaranteeing secure communication, and unveil the impact of HWIs on the system performance: 1) residual HWIs create a system performance bottleneck in WPCN in the high transmit/receive power regimes; 2) increasing the number of transmit antennas can effectively reduce the power consumption of wireless power transfer and alleviate the performance degradation due to residual HWIs; and 3) imperfect CSI exacerbates the impact of residual HWIs, which increases the power consumption of both wireless power and wireless information transfer.

RETRACTED ARTICLE: Resource allocation algorithm design of high quality of service based on chaotic neural network in wireless communication technology

With the rapid development of broadband wireless technology and the wide demand of multimedia mobile services, various broadband mobile multimedia services are coming into being. However, the limited radio resources do not adequately guarantee the quality of service requirements for these multimedia mobile services. In this paper, the improved chaotic neural network technology is applied to three typical broadband wireless communication systems. Through the theoretical analysis and the simulation, the proposed algorithm can make full use of the chaotic neural power to search the optimal solution, which can achieve the purpose of further optimizing the wireless resources. At the same time, it also make the positive attempt to promote cross-disciplinary integration.

Optimal Resource Allocation for Power-Efficient MC-NOMA With Imperfect Channel State Information

In this paper, we study power-efficient resource allocation for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The resource allocation algorithm design is formulated as a non-convex optimization problem which jointly designs the power allocation, rate allocation, user scheduling, and successive interference cancellation (SIC) decoding policy for minimizing the total transmit power. The proposed framework takes into account the imperfection of channel state information at transmitter (CSIT) and quality of service (QoS) requirements of users. To facilitate the design of optimal SIC decoding policy on each subcarrier, we define a channel-to-noise ratio outage threshold. Subsequently, the considered non-convex optimization problem is recast as a generalized linear multiplicative programming problem, for which a globally optimal solution is obtained via employing the branch-and-bound approach. The optimal resource allocation policy serves as a system performance benchmark due to its high computational complexity. To strike a balance between system performance and computational complexity, we propose a suboptimal iterative resource allocation algorithm based on difference of convex programming. Simulation results demonstrate that the suboptimal scheme achieves a close-to-optimal performance. Also, both proposed schemes provide significant transmit power savings than that of conventional orthogonal multiple access (OMA) schemes.

Distributed optimal in-network resource allocation algorithm design via a control theoretic approach

In this paper, we consider an in-network optimal resource allocation problem with multiple demand equations. We propose a novel distributed continuous-time algorithm that solves the problem over strongly connected and weight-balanced digraph network topologies when the local cost functions are strongly convex. We also discuss the extension of our convergence guarantees to dynamically changing topologies. Finally, we show that if the network is an undirected connected graph, we can guarantee stability and convergence of our algorithm for problems involving local convex functions. This convergence guarantee is to a point in the set of minimizers of our optimal resource allocation problem. The design and analysis of our algorithm are carried out using a control theoretic approach. We demonstrate our results through a numerical example.

Optimal Joint Power and Subcarrier Allocation for Full-Duplex Multicarrier Non-Orthogonal Multiple Access Systems

In this paper, we investigate resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems employing a full-duplex (FD) base station for serving multiple half-duplex (HD) downlink and uplink users simultaneously. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the maximization of the weighted sum system throughput. We apply monotonic optimization to develop an optimal joint power and subcarrier allocation policy. The optimal resource allocation policy serves as a system performance benchmark due to its high computational complexity. Furthermore, a suboptimal iterative scheme based on successive convex approximation is proposed to strike a balance between computational complexity and optimality. Our simulation results reveal that the proposed suboptimal algorithm achieves a close-to-optimal performance. In addition, FD MC-NOMA systems employing the proposed resource allocation algorithms provide a substantial system throughput improvement compared with conventional HD multicarrier orthogonal multiple access (MC-OMA) systems and other baseline schemes. In addition, our results unveil that FD MC-NOMA systems enable a fairer resource allocation compared with traditional HD MC-OMA systems.

Robust Layered Transmission in Secure MISO Multiuser Unicast Cognitive Radio Systems

This paper studies robust resource allocation algorithm design for a multiuser multiple-input single-output (MISO) cognitive radio (CR) downlink communication network. We focus on a secondary system which provides unicast secure wireless layered video information to multiple single-antenna secondary receivers. The resource allocation algorithm design is formulated as a non-convex optimization problem for minimization of the total transmit power at the secondary transmitter. The proposed framework takes into account a quality of service (QoS) requirement regarding video communication secrecy in the secondary system, the imperfection of the channel state information (CSI) of potential eavesdroppers (primary receivers) at the secondary transmitter, and a limit for the maximum tolerable received interference power at the primary receivers. Thereby, the proposed problem formulation exploits the self-protecting architecture of layered transmission and artificial noise generation to ensure communication secrecy. Semidefinite programming (SDP) relaxation is employed to derive a resource allocation algorithm which finds the global optimal solution to the formulated problem. Simulation results demonstrate significant transmit power savings and robustness against CSI imperfection for the proposed resource allocation algorithm for layered transmission compared to baseline schemes with traditional single-layer transmission.

Multi-Objective Optimization for Robust Power Efficient and Secure Full-Duplex Wireless Communication Systems

In this paper, we investigate the power efficient resource allocation algorithm design for secure multiuser wireless communication systems employing a full-duplex (FD) base station (BS) for serving multiple half-duplex (HD) downlink (DL) and uplink (UL) users simultaneously. We propose a multi-objective optimization framework to study two conflicting yet desirable design objectives, i.e., total DL transmit power minimization and total UL transmit power minimization. To this end, the weighed Tchebycheff method is adopted to formulate the resource allocation algorithm design as a multi-objective optimization problem (MOOP). The considered MOOP takes into account the quality-of-service (QoS) requirements of all legitimate users for guaranteeing secure DL and UL transmission in the presence of potential eavesdroppers. Thereby, secure UL transmission is enabled by the FD BS and would not be possible with an HD BS. The imperfectness of the channel state information of the eavesdropping channels and the inter-user interference channels is incorporated for robust resource allocation algorithm design. Although the considered MOOP is non-convex, we solve it optimally by semidefinite programming (SDP) relaxation. Simulation results not only unveil the trade-off between the total DL transmit power and the total UL transmit power, but also confirm the robustness of the proposed algorithm against potential eavesdroppers.