Distributed Throughput Maximization in Wireless Networks via Random Power Allocation

In this chapter, we explore techniques for capacity estimation and throughput maximization in multi-hop wireless networks. The specific problem we investigate is the following: how can we characterize the set of all feasible end-to-end connection throughput rate vectors which can be supported by the network (i.e., what is the network capacity), and how can we design cross-layer algorithms at the scheduling, routing, and transport layers which are guaranteed to operate the network close to its capacity? We approach this problem from three distinct perspectives which have greatly influenced research in this field: (1) throughput scaling in random geometric graphs whose nodes are distributed uniformly in space, (2) geometric packing and linear programming-based techniques for arbitrary networks, and (3) the dynamic back-pressure scheme based on queueing theoretic principles for achieving network stability. A recurring theme throughout this chapter is the role of geometric insights into the design and analysis of provably good algorithms for multi-hop wireless networks. We also include a brief survey of related developments in the field of cross-layer algorithms for multi-hop wireless networks.

Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorithms for networks with primary- or secondary-interference constraints have been developed. Due to their distributed operation, these algorithms can achieve only a guaranteed fraction of the maximum possible throughput. It was also recently shown that if a set of conditions (known as Local Pooling) is satisfied, simple distributed scheduling algorithms achieve 100% throughput. However, previous work regarding Local Pooling focused mostly on obtaining abstract conditions and on networks with single-hop interference or single-hop traffic. In this paper, we identify several graph classes that satisfy the Local Pooling conditions, thereby enabling the use of such graphs in network design algorithms. Then, we study the multihop implications of Local Pooling. We show that in many cases, as the interference degree increases, the Local Pooling conditions are more likely to hold. Consequently, although increased interference reduces the maximum achievable throughput of the network, it tends to enable distributed algorithms to achieve 100% of this throughput. Regarding multihop traffic, we show that if the network satisfies only the single-hop Local Pooling conditions, distributed joint routing and scheduling algorithms are not guaranteed to achieve maximum throughput. Therefore, we present new conditions for Multihop Local Pooling, under which distributed algorithms achieve 100% throughout. Finally, we identify network topologies in which the conditions hold and discuss the algorithmic implications of the results.

We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O (equation) of the maximum, so that the per-session (end-to-end) delay is O (equation), where Δ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</inf> = max <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</inf> {Δ(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.

The increasing use of relays in wireless communication systems is a driving force to explore innovative techniques that can improve the quality of service as well as enhance the coverage of wireless systems. Orthogonal frequency division multiple access (OFDMA) is widely deployed in broadband wireless systems to effectively combat the frequency selectivity of the wireless fading channel. Wireless relays are used in practical OFDM-based wireless systems such as WiMAX to increase the capacity and diversity order of the system. To fully exploit the benefits of OFDMA, relaying systems require efficient management of resources, including power and subcarriers. The difficulty in resource allocation in a relaying system is the nonconvexity of the optimization problem caused by the inter-relationship of all the resources through the relay station. Therefore, suboptimal and heuristic algorithms are proposed to assign power and subcarriers to the users in the relaying system while maintaining flexible fairness in resource allocation. In this dissertation, we improve the efficiency of subcarrier and power allocation algorithms with flexible fairness in the downlink of an amplify-and-forward (AF) OFDM relaying system. We propose an asymptotically fair subcarrier allocation algorithm that provides flexibility in the fairness index for possible improvement in the total throughput of the system by using a group-based approach. We investigate the problem of power allocation for an AF relaying scheme by considering three different objective functions: average SNR, average BER, and outage probability. The results are presented for various relay locations and different total power in the system. It is shown that the solution to the power allocation problem does not depend on the objective function when the relay is closer to the mobile user for different objective functions. By deriving the capacity of the AF relaying, a new parameter, called cooperation coefficient, is introduced to quantify the cooperation level from the relaying links in the data rate of the the mobile station. Assuming flat power allocation and using the cooperation coefficient parameter, a cooperative subcarrier allocation algorithm is proposed that increases the total throughput of a multi-user OFDM relaying system by approximately 15%. We also propose a two-step solution for subcarrier and power allocation of an AF relaying system. In the first step, the total power is allocated to the users and relays based on the power ratio found for the single-relay system. In the second step, subcarriers are assigned to the users based on the cooperative subcarrier allocation algorithms. Based on our finding, the total throughput of the system improves by 25% using the two-step procedure. By applying the proposed asymptotically fair idea to the two-step subcarrier and power allocation, we maintain a flexible fairness and further increase the total throughput in an OFDM relaying system.

This paper studies the challenge of efficient resource allocation in wireless networks by investigating the potential benefits of cognitive radio networks (CRN) and non‐orthogonal multiple access (NOMA) techniques. Specifically, the purpose of this paper is to explore user pairing and power allocation in a multiuser cooperative CRN‐NOMA network. To achieve the goal, a novel user pairing algorithm with reinforcement learning (RL) is proposed to adaptively select the optimal group for pairing according to the factors such as channel gain, distances, and angles. A user group is consisted of a primary user (PU) and up to three secondary users (SUs). The key findings of this paper highlight the effectiveness of RL in optimizing power allocation while considering various constraints. As a result, significant improvements in network throughput and user fairness are achieved. Compared with the classical power allocation algorithms (i.e., equal power allocation, proportional power allocation, iterative power allocation, and iterative water‐filling power allocation), the proposed power allocation based on RL algorithm and iterative water‐filling power allocation algorithm have better performance in terms of throughput, fairness, spectrum efficiency, and energy efficiency. In addition, compared with the iterative water‐filling power algorithm, the proposed algorithm improves the throughput by 31.71% and obtains twice the spectrum efficiency and energy efficiency. The simulation results consistently show that the proposed method has advantages in enhancing PU capacity. Further advancements in this field of research are encouraged based on the promising outcomes of this study.

The growth in energy consumption followed with global warming provides new topics and issues in communication systems known as green radio. Hence, how to reduce power consumption while meeting system throughput requirement is an urgent task. In this paper, we investigate a new cooperative power allocation scheme for a multi-user orthogonal frequency division multiplex (OFDM) system, in which two coordinated transmission points (CTP) jointly allocate their power to multiple orthogonal subchannels. In order to minimize the overall transmit power consumption while meeting the system total throughput requirement and also each CTP's power constraint, we formulate the objective task into a constrained optimization problem and derived a group of closed form power allocation solutions. The solutions turn out to take the form of traditional water-filling (WF) and also have a cooperative feature. Based on the derived solution, a novel power allocation algorithm with joint minimization power consumption (JMPC-PA) is proposed. Numerical results are presented to verify the optimality of the derived scheme. Considering the flexibility of CTP's category, e.g., base station or relay station, it is known that the derived scheme can be valid for any coordinated networks such as next-generation cellular networks or ad-hoc networks.

This paper investigates the distributed power allocation problem for coordinated multipoint (CoMP) transmissions in distributed antenna systems (DAS). Traditional duality-based optimization techniques cannot be directly applied to this problem, because the non-strict concavity of the CoMP transmission's achievable rate with respect to the transmission power induces that the local power allocation subproblems have non-unique optimum solutions. We propose a distributed power allocation algorithm to resolve this non-strict concavity difficulty. This algorithm only requires local information exchange among neighboring base stations serving the same user, and is thus flexible with respect to network size and topology. The step-size parameters of this algorithm are determined by only local user access relationship (i.e., the number of users served by each antenna), but do not rely on channel coefficients. Therefore, the convergence speed of this algorithm is quite robust to channel fading. We rigorously prove that this algorithm converges to an optimum solution of the power allocation problem. Simulation results are presented to demonstrate the effectiveness of the proposed power allocation algorithm.

We investigate the problem of eavesdropping control in wireless communications networks. When a confidential message is transmitted through a wireless network, there is a potential security breach or 'information leakage' due to the network's susceptibility to eavesdropping. In this work, we quantify the information leakage problem in the context of resource allocation. By limiting the signal to interference and noise ratio (SINR) at the eavesdropper receiver, we develop a cooperative power allocation algorithm to mitigate such security vulnerability. The resulting power allocation algorithm is readily applicable in the physical layer of wireless ad hoc and mesh networks as part of a multi-step security measure.

When the channel measurement update rate is very slow compared to the channel fluctuations, the performance of conventional power control algorithms is greatly reduced. In this paper we introduce novel method to update the transmit power in such extreme situations. We propose to use random power allocation with certain distribution function and then using the channel measurements to update the statistics of this random power rather the power value itself. The truncated inverted exponential distribution is one candidate for the power distribution which is used in this paper. This distribution has one parameter which can be easily updated according to the channel quality. The signal-to-interference and noise ratio (SINR) is used as an indicator for the channel quality. The probability of outage when using the proposed power allocation is also given in mathematical form. Simulations show that, one may improve the average SINR when using the proposed algorithm compared to the conventional distributed power control algorithm.

We consider multi-hop OFDM relaying systems employing either decode-and-forward (DF) or amplify-and-forward (AF) relaying protocols in this paper. We propose adaptive power allocation (PA) algorithms under joint transmit power constraint at source and relays in order to maximize system capacity with channel state information (CSI) known at all nodes. The paring of subcarriers is also discussed. Simulation results show that the proposed adaptive PA algorithms achieve higher system capacity than uniform PA algorithms. If paring techniques are employed, system capacity can be further enhanced.

Energy aware resource control mechanism for improved performance in future green 6G networks

In this article, a novel multiple-input multiple-out (MIMO) transmission scheme, called generalized polarized enhanced spatial modulation (GPESM), is proposed for dual-polarized land mobile satellite (LMS) communications. We first introduce the enhanced spatial modulation (ESM) technique for dual-polarized LMS communications, in which polarization dimension, spatial dimension and multiple signal constellations are used to transmit information and obtain substantial performance gain. Meanwhile, the theoretical upper bound for the average bit error probability (ABEP) of the proposed GPESM scheme is derived. In order to further improve the reliability of the system, we also propose two novel power allocation (PA) algorithms for GPESM system, which are the optimization-driven approximated max-min distance (AMMD)-based PA algorithm and the data-driven deep neural network (DNN)-based PA algorithm. To achieve an enhanced spatial diversity gain, we consider to apply a reconfigurable intelligent surface (RIS) to the GPESM system as a relay to assist in transmitting information. In this way, the user can receive the information transmitted by the satellite on one hand, and the information sent by the satellite via the RIS relay on the other hand. We also extend the above-mentioned two PA algorithms to the RIS-assisted GPESM systems. Our simulation results show that the RIS-assisted GPESM systems are capable of obtaining high bit error rate (BER) performance gain (up to 10 dB) compared to the standard GPESM system and two PA algorithms can further improve the performance to the systems.

Cache is becoming an effective method to improve the transmission rate and reduce the backhaul load. Nevertheless, owing to the limited capacity of backhaul, less power should be allocated to the users whose requested contents do not exist in the local caches to maximize the performance of the caching users. Thus, in this paper, power allocation (PA) is considered to further improve the performance of cache-aided small-cell networks with limited backhaul, where interference alignment is utilized to manage interferences among users. Specially, three PA algorithms are proposed. First, we come up with a PA algorithm to maximize the sum rate of the network, considering the limitation of backhaul. Then, in order to make more users meet their rate requirement, a PA algorithm to minimize the average outage probability is proposed. In addition, in order to further improve the users' experience, a PA algorithm to maximize the average satisfaction of all the users is also designed. Plenty of simulation results are provided to show the effectiveness of the three proposed PA algorithms.

We consider a parallel relay communication network based on the nonorthorgonal amplify-and-forward protocol. We design two optimal power allocation schemes: separate power allocation (SPA) of the relays using the improved water-filling algorithm and joint power allocation (JPA) of the source and relays using convex optimization algorithm. Simulation results show that, in the fading channels with path loss, the proposed JPA and SPA have better mutual information performances than equal power allocation and direct transmission without relay.

Cognitive radio and heterogeneous wireless networks are important candidate techniques for the fifth generation (5G) communication systems. On the other hand, propagation properties of radio channels in a physical layer are exploited to design efficient secure transmission schemes for 5G wireless networks. In this work, a security-aware joint power and subchannel allocation problem based on the inter-network cooperation is investigated at cognitive heterogeneous networks via imperfect spectral sensing. The security-aware joint power and subchannel allocation is subject to constraints in available subchannels, proportional fairness secrecy transmission rates among secondary mobile terminals (MTs), total interference power threshold, and total power for each secondary MT. In order to determine the impact of imperfect spectral sensing to resource allocation, we first represent the interference power at primary base station in terms of the misdetection probability and false alarm probability. Then, the security-aware power and subchannel allocation problem with inter-network cooperation is formulated as a biconvex optimization problem, and an optimal security-aware power and subchannel allocation algorithm is proposed utilizing the dual decomposition method. Compared to the heuristic power and subchannel allocation algorithms, numerical simulation results show that the proposed algorithms improve the total secrecy throughput and guarantee the proportional fairness among different secondary MTs.