2011 Wireless Advanced 2011
DOI: 10.1109/wiad.2011.5983294
|View full text |Cite
|
Sign up to set email alerts
|

A graph-based approach for relay selection and resource allocation in cognitive two-way relay networks

Abstract: In this paper, the problems of relay selection and channel allocation in a cognitive two-way relay network are modelled as a classical weighted bipartite graph matching problem and are solved by the Hungarian algorithm. In the proposed radio resource management algorithm, firstly, some of cognitive radio (CR) nodes are selected to establish the primary user connection as a two-way relay scheme. Then, a power updating algorithm is used to give the maximum signal-to-interference-plus-noise ratio (SINR) in the CR… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(14 citation statements)
references
References 11 publications
(10 reference statements)
0
14
0
Order By: Relevance
“…In [36], the authors proposed a novel routing protocol for underwater sensor networks (UWSNs), which was named the location-aware routing protocol (LARP) and could improve packet delivery ratio and reduce normalized routing overhead. In [37], the authors modeled the problems of relay selection and channel allocation as a classical weighted bipartite graph matching problem and solved it by using the Hungarian algorithm. In [38], a novel quantum particle swarm optimization-based relay selection scheme was proposed to maximize the system throughput of the cooperative relay networks and reduce the computational complexity compared with the exhaustive search.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In [36], the authors proposed a novel routing protocol for underwater sensor networks (UWSNs), which was named the location-aware routing protocol (LARP) and could improve packet delivery ratio and reduce normalized routing overhead. In [37], the authors modeled the problems of relay selection and channel allocation as a classical weighted bipartite graph matching problem and solved it by using the Hungarian algorithm. In [38], a novel quantum particle swarm optimization-based relay selection scheme was proposed to maximize the system throughput of the cooperative relay networks and reduce the computational complexity compared with the exhaustive search.…”
Section: Related Workmentioning
confidence: 99%
“…The above works mainly focus on how to maximize the throughput of the system through relay selection with the presence of interference. In particularly, the channel allocation problem was also considered in [37].…”
Section: Related Workmentioning
confidence: 99%
“…We assume the source precoding matrix G is known at the relay. With this assumption, our optimization problem reduces to finding the relay precoding matrix, F in (7), subject to (11) and (14). We can rewrite (7) as…”
Section: Relay Precoder Designmentioning
confidence: 99%
“…multi-relay beamforming for CR systems is studied in [13]. In [14], power and resource allocation for a multi-relay overlay cognitive system is investigated. In [15] and [16], considering an amplify-and-forward (AF) relaying underlay CR system, joint relay selection and power allocation are proposed to achieve the maximum throughput for the CR system subject to power constraints at the CR source and relay nodes, and considering reasonably low interference imposed by the secondary system to the primary system.…”
Section: Introductionmentioning
confidence: 99%
“…This considerable achieved gain can be used to increase coverage area, and provide a new way to enhance LTE-Advanced systems by deploying type 1 relays. More advanced deployments of the relays such as cognitive relays [227], self-organising relays [228,229] coordinated/cooperative relay systems [230][231][232][233], and opportunistic relaying [234] have been studied and are expected to be used in future mobile communications networks.…”
Section: Technical Aspectsmentioning
confidence: 99%