On Optimal Link Activation With Interference Cancelation in Wireless Networking

Yuan, Di; Angelakis, Vangelis; Chen, Lei; Karipidis, Eleftherios; Larsson, Erik G.

doi:10.1109/tvt.2012.2222683

Cited by 46 publications

(24 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are two basic transmission types in D2D communication: single-hop transmission, in which data are transmitted from the transmitter to the receiver directly as the channel condition between them meets the quality of service (QoS) requirement; and multi-hop transmission, where some devices act as relay stations, in which data are transmitted from the transmitter to the receiver hop by hop, and the route must be opportunistically optimized to guarantee the performance [4]. In general, because of the high channel quality of short-range D2D links, the D2D UEs can achieve a high single-hop transmission rate [5,6]. However, there exists a possibility that the channel condition between two potential D2D UEs cannot support a direct single-hop link.…”

Section: Background and Motivationmentioning

confidence: 99%

Joint Relay Selection and Resource Allocation for Energy-Efficient D2D Cooperative Communications Using Matching Theory

Feng

Huang

et al. 2017

Applied Sciences

View full text Add to dashboard Cite

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.

show abstract

Section: Background and Motivationmentioning

confidence: 99%

Joint Relay Selection and Resource Allocation for Energy-Efficient D2D Cooperative Communications Using Matching Theory

Feng

Huang

et al. 2017

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…IC in the context of max-min power control and admission control has been studied in [16,17], but without beamforming. The authors of [13][14][15] consider IC and beamforming assuming nonlinear dirty-paper coding schemes, but do not present any practical algorithm.…”

Section: Relation To Prior Workmentioning

confidence: 99%

“…For instance, it is well-known that interference cancellation (IC), in which the MSs decode and subtract the strong interference, achieves better performance in terms of, e.g., increase in link capacity and reduction in transmitted BS power [13][14][15][16][17]. In this paper, we consider multiuser downlink beamforming with interference cancellation (BFIC).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multiuser downlink beamforming with interference cancellation using a SDP-based branch-and-bound algorithm

Philipp

Ulbrich

Cheng

et al. 2014

2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

We consider in this paper multiuser downlink beamforming with interference cancellation (BFIC). In our BFIC problem, the total transmitted power of the base station (BS) is minimized under signalto-interference-plus-noise ratio (SINR) requirements of the mobile stations (MSs) and single-stage interference cancellation (SSIC) is adopted at the MSs. The challenge of the problem lies in its combinatorial and non-convex nature. We propose a semidefinite programming (SDP) based branch-and-bound (BnB) algorithm to (optimally) solve the BFIC problem. The SDP-based BnB algorithm employs SDP and sequential second-order cone programming. We further develop a fast heuristic algorithm for large-scale applications. Simulations show that employing SSIC achieves significant reductions in total transmitted BS power. The proposed SDP-based BnB algorithm optimally solves all considered instances of the BFIC problem, and the heuristic algorithm yields near-optimal solutions.

show abstract

“…The improvement of network capacity by IC are studied in [47,48]. For LA, in [49], the authors addressed optimal LA under the physical model with IC, indicating the effectiveness of IC in boosting the number of concurrently activated links, especially for low to medium SINR thresholds.…”

Section: Link Activationmentioning

confidence: 99%

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

He¹

View full text Add to dashboard Cite

Wireless communications have become an important part of modern life. The ubiquitous wireless networks and connectivities generate exponentially increasing data traffic. In view of this, wireless network optimization, which aims at utilizing the limited resource, especially spectrum and energy, as efficiently as possible from a network perspective, is essential for performance improvement and sustainable development of wireless communications.In the dissertation, we focus on a fundamental problem of wireless network optimization, link scheduling, as well as its subproblem, link activation. The problem type arises because of the nature of wireless media and hence it is of relevance to a wide range of networks with multiple access. We freshen these classic problems up by novel extensions incorporating new technologies of interference management or with new performance metrics. We also revisit the problems in their classic setup to gain new theoretical results and insights for problemsolving. Throughout the study, we consider the problems with a general setup, such that the insights presented in this dissertation are not constrained to a specific technology or network type. Since link activation and scheduling are key elements of access coordination in wireless communications, the study opens up new approaches that significantly i improve network performance, and eventually benefit practical applications.The dissertation consists of five research papers. The first paper addresses maximum link activation with cooperative transmission and interference cancellation. Papers II and III investigate the minimumtime link scheduling problem in general and a particular class of networks, respectively. In Paper IV, we consider the scheduling problem of emptying a network in its broad form and provide a general optimality condition. In Paper V, we study the scheduling problem with respect to age of information.ii Populärvetenskaplig SammanfattningTrådlös kommunikationär av stor betydelse i dagens samhälle. Möjligheten att ansluta kommunikationsenheter till trådlösa nätverk harökat markant på senare tid vilket medfört att nätverken belastas alltmer då mängden datatrafik tilltar. Med hänsyn till dettaär optimering av trådlösa nätverk synnerligen betydelsefullt. Genom att t.ex. effektivisera nyttjandet av tillgängliga frekvenser samt minska energiförbrukningenär det möjligt att erhålla hållbara kommunikationslösningar med hög prestanda.Den här avhandlingen fokuserar på optimering i trådlösa nätverk och viktiga utmaningar som berör resurstilldelning och aktivering av förbindelser mellan kommunikationsenheter, vilket kan hanteras på olika sätt och där vald strategi ofta har påtaglig inverkan på ett nätverks prestanda. I avhandlingen studeras klassiska problemställningar på nya sätt med hänsyn till alternativa prestandamått samt tekniker som berör interferens. Detär avgörande att förbindelser och reglering av resurser hanteras på ett vettigt och välgenomtänkt sätt och i avhandlingen ges nya förslag på hur detta kanåstadkomma...

show abstract

On Optimal Link Activation With Interference Cancelation in Wireless Networking

Cited by 46 publications

References 32 publications

Joint Relay Selection and Resource Allocation for Energy-Efficient D2D Cooperative Communications Using Matching Theory

Joint Relay Selection and Resource Allocation for Energy-Efficient D2D Cooperative Communications Using Matching Theory

Multiuser downlink beamforming with interference cancellation using a SDP-based branch-and-bound algorithm

A Comprehensive Analysis of Optimal Link Scheduling for Emptying a Wireless Network

Contact Info

Product

Resources

About