Multi-user Symmetric Cooperation Based on Nash Bargaining Solution in Cooperative Relay Networks

This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allo...

Full description

Saved in:
Bibliographic Details
Published in:International journal of automation and computing 2011-11, Vol.8 (4), p.452-458
Main Authors: Ma, Kai, Guan, Xin-Ping, Wang, Juan, Wei, Xiao-Min
Format: Article
Language:English
Subjects:
Algorithms
CAE) and Design
Computer Applications
Computer simulation
Computer-Aided Engineering (CAD
Control
Cooperation
Engineering
Mathematical models
Mechatronics
Optimization
Relay networks
Robotics
Slot allocation
Strategy
中继
合作模式
多用户
对称
接纳控制算法
时隙分配
纳什
网络
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution （NBS）. Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.
ISSN:1476-8186
1751-8520
DOI:10.1007/s11633-011-0603-3