2,696 research outputs found

    Throughput Maximization for Mobile Relaying Systems

    Full text link
    This paper studies a novel mobile relaying technique, where relays of high mobility are employed to assist the communications from source to destination. By exploiting the predictable channel variations introduced by relay mobility, we study the throughput maximization problem in a mobile relaying system via dynamic rate and power allocations at the source and relay. An optimization problem is formulated for a finite time horizon, subject to an information-causality constraint, which results from the data buffering employed at the relay. It is found that the optimal power allocations across the different time slots follow a "stair-case" water filling (WF) structure, with non-increasing and non-decreasing water levels at the source and relay, respectively. For the special case where the relay moves unidirectionally from source to destination, the optimal power allocations reduce to the conventional WF with constant water levels. Numerical results show that with appropriate trajectory design, mobile relaying is able to achieve tremendous throughput gain over the conventional static relaying.Comment: submitted for possible conference publicatio

    Joint Resource Optimization for Multicell Networks with Wireless Energy Harvesting Relays

    Get PDF
    This paper first considers a multicell network deployment where the base station (BS) of each cell communicates with its cell-edge user with the assistance of an amplify-and-forward (AF) relay node. Equipped with a power splitter and a wireless energy harvester, the self-sustaining relay scavenges radio frequency (RF) energy from the received signals to process and forward the information. Our aim is to develop a resource allocation scheme that jointly optimizes (i) BS transmit powers, (ii) received power splitting factors for energy harvesting and information processing at the relays, and (iii) relay transmit powers. In the face of strong intercell interference and limited radio resources, we formulate three highly-nonconvex problems with the objectives of sum-rate maximization, max-min throughput fairness and sum-power minimization. To solve such challenging problems, we propose to apply the successive convex approximation (SCA) approach and devise iterative algorithms based on geometric programming and difference-of-convex-functions programming. The proposed algorithms transform the nonconvex problems into a sequence of convex problems, each of which is solved very efficiently by the interior-point method. We prove that our algorithms converge to the locally optimal solutions that satisfy the Karush-Kuhn-Tucker conditions of the original nonconvex problems. We then extend our results to the case of decode-and-forward (DF) relaying with variable timeslot durations. We show that our resource allocation solutions in this case offer better throughput than that of the AF counterpart with equal timeslot durations, albeit at a higher computational complexity. Numerical results confirm that the proposed joint optimization solutions substantially improve the network performance, compared with cases where the radio resource parameters are individually optimized

    Performance Analysis of Network-Assisted Two-Hop D2D Communications

    Full text link
    Network-assisted single-hop device-to-device (D2D) communication can increase the spectral and energy efficiency of cellular networks by taking advantage of the proximity, reuse, and hop gains when radio resources are properly managed between the cellular and D2D layers. In this paper we argue that D2D technology can be used to further increase the spectral and energy efficiency if the key D2D radio resource management algorithms are suitably extended to support network assisted multi-hop D2D communications. Specifically, we propose a novel, distributed utility maximizing D2D power control (PC) scheme that is able to balance spectral and energy efficiency while taking into account mode selection and resource allocation constraints that are important in the integrated cellular-D2D environment. Our analysis and numerical results indicate that multi-hop D2D communications combined with the proposed PC scheme can be useful not only for harvesting the potential gains previously identified in the literature, but also for extending the coverage of cellular networks.Comment: 6 pages and 7 figure

    Securing UAV Communications Via Trajectory Optimization

    Full text link
    Unmanned aerial vehicle (UAV) communications has drawn significant interest recently due to many advantages such as low cost, high mobility, and on-demand deployment. This paper addresses the issue of physical-layer security in a UAV communication system, where a UAV sends confidential information to a legitimate receiver in the presence of a potential eavesdropper which are both on the ground. We aim to maximize the secrecy rate of the system by jointly optimizing the UAV's trajectory and transmit power over a finite horizon. In contrast to the existing literature on wireless security with static nodes, we exploit the mobility of the UAV in this paper to enhance the secrecy rate via a new trajectory design. Although the formulated problem is non-convex and challenging to solve, we propose an iterative algorithm to solve the problem efficiently, based on the block coordinate descent and successive convex optimization methods. Specifically, the UAV's transmit power and trajectory are each optimized with the other fixed in an alternating manner until convergence. Numerical results show that the proposed algorithm significantly improves the secrecy rate of the UAV communication system, as compared to benchmark schemes without transmit power control or trajectory optimization.Comment: Accepted by IEEE GLOBECOM 201
    • …
    corecore