On the Throughput of MIMO-Empowered Multihop Cognitive Radio Networks

Gao, Cunhao; Shi, Yi; Hou, Y. Thomas; Kompella, Sastry

doi:10.1109/tmc.2011.80

Cited by 22 publications

(19 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [34], Chowdhury et al proposed to adapt the classical TCP rate control to interact with the spectrum sensing and other lower-layer functionalities in secondary ad hoc networks. Hou et al studied cross-layer resource allocation for capacity (or throughput) maximization in SINR-modelbased [35] and MIMO-powered [36] CR networks. Different from these works, we consider dynamic spectrum access with cooperative relays.…”

Section: Related Workmentioning

confidence: 99%

Distributed Resource Management for Cognitive Ad Hoc Networks With Cooperative Relays

Guan

Melodia

Yuan

et al. 2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

It is well known that the data transport capacity of a wireless network can be increased by leveraging the spatial and frequency diversity of the wireless transmission medium. This has motivated the recent surge of research in cooperative and dynamicspectrum-access (which we also refer to as cognitive spectrum access) networks. Still, as of today, a key open research challenge is to design distributed control strategies to dynamically jointly assign: 1) portions of the spectrum and 2) cooperative relays to different traffic sessions to maximize the resulting network-wide data rate. In this paper, we make a significant contribution in this direction. First, we mathematically formulate the problem of joint spectrum management and relay selection for a set of sessions concurrently utilizing an interference-limited infrastructure-less wireless network. We then study distributed solutions to this (nonlinear and nonconvex) problem. The overall problem is separated into two subproblems: 1) spectrum management through power allocation with given relay selection strategy; and 2) relay selection for a given spectral profile. Distributed solutions for each of the two subproblems are proposed, which are then analyzed based on notions from variational inequality (VI) theory. The distributed algorithms can be proven to converge, under certain conditions, to VI solutions, which are also Nash equilibrium (NE) solutions of the equivalent NE problems. A distributed algorithm based on iterative solution of the two subproblems is then designed. Performance and price of anarchy of the distributed algorithm are then studied by comparing it to the globally optimal solution obtained with a newly designed centralized algorithm. Simulation results show that the proposed distributed algorithm achieves performance that is within a few percentage points of the optimal solution.Index Terms-Cognitive radio networks, cooperative relay, distributed spectrum management, game theory. Manuscript

show abstract

Section: Related Workmentioning

confidence: 99%

Distributed Resource Management for Cognitive Ad Hoc Networks With Cooperative Relays

Guan

Melodia

Yuan

et al. 2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…AbbasiJannatabad et al in [15] studied the cooperative beamforming and relay selection problem, and power allocation was also considered. In [16], Gao et al explored the MIMO-empowered CR network to achieve the ultimate flexibility and efficiency in dynamic spectrum access and spectrum utilization. They developed a mathematical model to optimize the maximize throughout.…”

Section: Related Workmentioning

confidence: 99%

VSMC MIMO: A spectral efficient scheme for cooperative relay in cognitive radio networks

Kong

Yuan

Han

et al. 2015

2015 IEEE Conference on Computer Communications (INFOCOM)

View full text Add to dashboard Cite

Abstract-Multiple-Input Multiple-Output (MIMO) technology has become an efficient way to improve the capacity and reliability of wireless networks. Traditional MIMO schemes are designed mainly for the scenario of contiguous spectrum ranges. However, in cognitive radio networks, the available spectrum is discontiguous, making traditional MIMO schemes inefficient for spectrum usage. This motivates the design of new MIMO schemes that apply to networks with discontiguous spectrum ranges. In this paper, we propose a scheme called VSMC MIMO, which enables MIMO nodes to transmit variable numbers of streams in multiple discontinuous spectrum ranges. This scheme can largely improve the spectrum utilization and meanwhile maintain the same spatial multiplexing and diversity gains as traditional MIMO schemes. To implement this spectral-efficient scheme on cooperative MIMO relays in cognitive radio networks, we propose a joint relay selection and spectrum allocation algorithm and a corresponding MAC protocol for the system. We also build a testbed by the Universal Software Radio Peripherals (USRPs) to evaluate the performances of the proposed scheme in practical networks. The experimental results show that VSMC MIMO can efficiently utilize the discontiguous spectrum and greatly improve the throughput of cognitive radio networks.

show abstract

“…Among the research efforts of MIMO in multi-hop networks, there is an active research line that builds upon the so-called degree-of-freedom (DoF) model [1], [2], [4], [8], [12], [15], [16], [17], [24], [25]. The concept of DoF was originally defined to represent the maximum multiplexing gain of MIMO channel in the information theory (IT) community [11], [31].…”

Section: Introductionmentioning

confidence: 99%

“…Although a DoF model is not able to completely capture all the PHY-layer capabilities of MIMO, it offers a simple yet effective tool to study MIMO in a multi-hop network. As such, various DoF models have been proposed and applied to solve a variety of network problems (see, e.g., [1], [4], [8], [12] for throughput maximization, [2], [15], [17], [24], [25] for MAC protocols).…”

Section: Introductionmentioning

confidence: 99%

A Scheduling Algorithm for MIMO DoF Allocation in Multi-Hop Networks

Zeng

Shi

Hou

et al. 2016

IEEE Trans. on Mobile Comput.

Self Cite

View full text Add to dashboard Cite

Recently, a new MIMO degree-of-freedom (DoF) model was proposed to allocate DoF resources for spatial multiplexing (SM) and interference cancellation (IC) in a multi-hop network. Although this DoF model promises many benefits, it hinges upon a global node ordering to keep track of IC responsibilities among all the nodes. An open question about this model is whether its global ordering property can be achieved among the nodes in the network through distributed operations. In this paper, we explore this question by studying DoF scheduling in a multi-hop MIMO network, with the objective of maximizing the minimum throughput among a set of sessions. We propose an efficient DoF scheduling algorithm to solve it and show that our algorithm only requires local operations. We prove that the resulting DoF scheduling solution is globally feasible and show that there exists a corresponding feasible global node ordering for IC, albeit such global ordering is implicit. Simulation results show that the solution values obtained by our algorithm are relatively close to the upper bound values computed by CPLEX solver, thereby indicating that our algorithm is highly competitive.

show abstract

On the Throughput of MIMO-Empowered Multihop Cognitive Radio Networks

Cited by 22 publications

References 28 publications

Distributed Resource Management for Cognitive Ad Hoc Networks With Cooperative Relays

Distributed Resource Management for Cognitive Ad Hoc Networks With Cooperative Relays

VSMC MIMO: A spectral efficient scheme for cooperative relay in cognitive radio networks

A Scheduling Algorithm for MIMO DoF Allocation in Multi-Hop Networks

Contact Info

Product

Resources

About