Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems

In this paper, we consider a cognitive multi-hop relay secondary user (SU) system sharing the spectrum with some primary users (PU). The transmit power as well as the hop selection of the cognitive relays can be dynamically adapted according to the local (and causal) knowledge of the instantaneous channel state information (CSI) in the multi-hop SU system. We shall determine a low complexity, decentralized algorithm to maximize the average end-to-end throughput of the SU system with dynamic spatial reuse. The problem is challenging due to the decentralized requirement as well as the causality constraint on the knowledge of CSI. Furthermore, the problem belongs to the class of stochastic Network Utility Maximization (NUM) problems which is quite challenging. We exploit the time-scale difference between the PU activity and the CSI fluctuations and decompose the problem into a master problem and subproblems. We derive an asymptotically optimal low complexity solution using divide-and-conquer and illustrate that significant performance gain can be obtained through dynamic hop selection and power control. The worst case complexity and memory requirement of the proposed algorithm is O(M^2) and O(M^3) respectively, where $M$ is the number of SUs

Performance Analysis of Relay Selection Schemes in Multi-Hop Decode-and-Forward Networks

This paper analyses the data rate achieved by various relay selection schemes in a single-user multi-hop relay network with decode-and-forward (DF) relaying. While the single-user relay selection problem is well studied in the literature, research on achievable rate maximization is limited to dual-hop networks and multi-hop networks with a single relay per hop. We fill this important gap by focusing on achievable rate maximization in multi-hop, multi-relay networks. First, we consider optimal relay selection and obtain two approximations to the achievable rate. Next, we consider three existing sub-optimal relay selection strategies namely hop-by-hop, ad-hoc and block-by-block relay selection and obtain exact expressions for the achievable rate under each of these strategies. We also extend the sliding window based relay selection to the DF relay network and derive an approximation to the achievable rate. Further, we investigate the impact of window size in sliding window based relay selection and show that a window size of three is sufficient to achieve most of the possible performance gains. Finally, we extend this analysis to a noise limited multi-user network where the number of available relay nodes is large compared to the number of users and derive approximations to the achievable sum-rate

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Energy-efficient and lifetime aware routing in WSNs

Network lifetime is an important performance metric in Wireless Sensor Networks (WSNs). Transmission Power Control (TPC) is a well-established method to minimise energy consumption in transmission in order to extend node lifetime and, consequently, lead to solutions that help extend network lifetime. The accurate lifetime estimation of sensor nodes is useful for routing to make more energy-efficient decisions and prolong lifetime. This research proposes an Energy-Efficient TPC (EETPC) mechanism using the measured Received Signal Strength (RSS) to calculate the ideal transmission power. This includes the investigation of the impact factors on RSS, such as distance, height above ground, multipath environment, the capability of node, noise and interference, and temperature. Furthermore, a Dynamic Node Lifetime Estimation (DNLE) technique for WSNs is also presented, including the impact factors on node lifetime, such as battery type, model, brand, self-discharge, discharge rate, age, charge cycles, and temperature. In addition, an Energy-Efficient and Lifetime Aware Routing (EELAR) algorithm is designed and developed for prolonging network lifetime in multihop WSNs. The proposed routing algorithm includes transmission power and lifetime metrics for path selection in addition to the Expected Transmission Count (ETX) metric. Both simulation and real hardware testbed experiments are used to verify the effectiveness of the proposed schemes. The simulation experiments run on the AVRORA simulator for two hardware platforms: Mica2 and MicaZ. The testbed experiments run on two real hardware platforms: the N740 NanoSensor and Mica2. The corresponding implementations are on two operating systems: Contiki and TinyOS. The proposed TPC mechanism covers those investigated factors and gives an overall performance better than the existing techniques, i.e. it gives lower packet loss and power consumption rates, while delays do not significantly increase. It can be applied for single-hop with multihoming and multihop networks. Using the DNLE technique, node lifetime can be predicted more accurately, which can be applied for both static and dynamic loads. EELAR gives the best performance on packet loss rate, average node lifetime and network lifetime compared to the other algorithms and no significant difference is found between each algorithm with the packet delay

Radio resource allocation in relay based OFDMA cellular networks

PhDAdding relay stations (RS) between the base station (BS) and the mobile stations (MS) in a cellular system can extend network coverage, overcome multi-path fading and increase the capacity of the system. This thesis considers the radio resource allocation scheme in relay based cellular networks to ensure high-speed and reliable communication. The goal of this research is to investigate user fairness, system throughput and power consumption in wireless relay networks through considering how best to manage the radio resource. This thesis proposes a two-hop proportional fairness (THPF) scheduling scheme fair allocation, which is considered both in the first time subslot between direct link users and relay stations, and the second time subslot among relay link users. A load based relay selection algorithm is also proposed for a fair resource allocation. The transmission mode (direct transmission mode or relay transmission mode) of each user will be adjusted based on the load of the transmission node. Power allocation is very important for resource efficiency and system performance improvement and this thesis proposes a two-hop power allocation algorithm for energy efficiency, which adjusts the transmission power of the BS and RSs to make the data rate on the two hop links of one RS match each other. The power allocation problem of multiple cells with inter-cell interference is studied. A new multi-cell power allocation scheme is proposed from non-cooperative game theory; this coordinates the inter-cell interference and operates in a distributed manner. The utility function can be designed for throughput improvement and user fairness respectively. Finally, the proposed algorithms in this thesis are combined, and the system performance is evaluated. The joint radio resource allocation algorithm can achieve a very good tradeoff between throughput and user fairness, and also can significantly improve energy efficiency

Design methods for optimal resource allocation in wireless networks

Wireless communications have seen remarkable progress over the past two decades and perceived tremendous success due to their agile nature and capability to provide fast and ubiquitous internet access. Maturation of 3G wireless network services, development of smart-phones and other broadband mobile computing devices however have motivated researchers to design wireless networks with increased capacity and coverage, therefore un-leaching the wireless broadband capabilities. In this thesis, we address two very important design aspects of wireless networks, namely, interference management and control through optimal cross-layer design and channel fading mitigation through relay-assisted cooperative communications. For the former, we address, in the context of wireless network design, the problem of optimally partitioning the spectrum into a set of non-overlapping channels with non uniform spectrum widths and we model the combinatorially complex problem of joint routing, link scheduling, and spectrum allocation as an optimization problem. We use column generation decomposition technique (which decomposes the original problem into a master and a pricing subproblem) for solving the problem optimally. We also propose several sub-optimal methods for efficiently solving the pricing subproblems. For the latter problem, we study the joint problem of relay selection and power allocation in both wireless unicast and multicast cooperative cellular networks. We employ convex optimization technique to model this complex optimization problem and use branch and bound technique to solve it optimally. We also present sub-optimal methods to reduce the problem complexity and solve it more efficiently

Joint relay selection and resource allocation for energy-efficient D2D cooperative communications using matching theory

Device-to-device (D2D) cooperative relay can improve network coverage and throughput by assisting users with inferior channel conditions to implement multi-hop transmissions. Due to the limited battery capacity of handheld equipment, energy efficiency is an important issue to be optimized. Considering the two-hop D2D relay communication scenario, this paper focuses on how to maximize the energy efficiency while guaranteeing the quality of service (QoS) requirements of both cellular and D2D links by jointly optimizing relay selection, spectrum allocation and power control. Since the four-dimensional matching involved in the joint optimization problem is NP-hard, a pricing-based two-stage matching algorithm is proposed to reduce dimensionality and provide a tractable solution. In the first stage, the spectrum resources reused by relay-to-receiver links are determined by a two-dimensional matching. Then, a three-dimensional matching is conducted to match users, relays and the spectrum resources reused by transmitter-to-relay links. In the process of preference establishment of the second stage, the optimal transmit power is solved to guarantee that the D2D link has the maximized energy efficiency. Simulation results show that the proposed algorithm not only has a good performance on energy efficiency, but also enhances the average number of served users compared to the case without any relay

Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and asynchronous space-time coded cooperative diversity schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function, we show that the proposed independent coding based distributed delay diversity and asynchronous space-time coded cooperative diversity schemes achieve the same performance as the synchronous space-time coded approach which requires an accurate symbol-level timing synchronization to ensure signals arriving at the destination from different relay nodes are perfectly synchronized. This demonstrates diversity order is maintained even at the presence of asynchronism between relay node. Moreover, when all relay nodes succeed in decoding the source information, the asynchronous space-time coded approach is capable of achieving better DM-tradeoff than synchronous schemes and performs equivalently to transmitting information through a parallel fading channel as far as the DM-tradeoff is concerned. Our results suggest the benefits of fully exploiting the space-time degrees of freedom in multiple antenna systems by employing asynchronous space-time codes even in a frequency flat fading channel. In addition, it is shown asynchronous space-time coded systems are able to achieve higher mutual information than synchronous space-time coded systems for any finite signal-to-noise-ratio (SNR) when properly selected baseband waveforms are employed