Partner Selection Techniques In Cooperative Wireless Communication Using Game Theory

Loading...
Thumbnail Image
Date
2014-07
Authors
Adeleke, Oluseye Adeniyi
Journal Title
Journal ISSN
Volume Title
Publisher
Universiti Sains Malaysia
Abstract
The performance of any cooperative wireless communication largely depends on a suitable selection of partners (or relay nodes) and an efficient allocation of resources like power. So a careful selection of these relay nodes as partners is quite crucial to introduce transmit diversity for the communication network. In previous research works involving partner selection where a tool called game theory has been employed, the entire available relay nodes are involved in the game, which on the long run extend the convergence time and therefore increase the power consumption on the network, which is actually not desirable. Another drawback is the use of the Amplify and Forward (AF) cooperative protocol for the cooperative game model with its inherent problem of noise being amplified with the transmitted signal. In this research, the focus is to propose the Trade-Off and Bidding game schemes aimed at addressing these drawbacks. These proposed schemes are aimed at assisting the partner selection and power allocation algorithms in a distributed multi-relay node cooperative communication network. In this new approach, speed of convergence to equilibrium is very crucial, especially in a power-limited system where fast convergence speed is tantamount to conservation of power on the wireless network. This thesis seeks to go a step further from existing works by reducing the convergence time as it relates to the selection of suitable relay nodes, and by extension, allocation of power by the source node. In these game schemes, a cooperative wireless communication network is modelled as a single-source node, multi-relay node communication network where the wireless nodes act as game players. While the source node and the relay nodes are respectively leader and followers in the Trade-Off scheme, they are modelled as auctioneer and bidders respectively in the Bidding game scheme. However, a big contrast between this work and similar works in this area is the inclusion of proximity criteria in the proposed schemes. These new criteria are introduced with a view to increasing the speed of convergence to equilibrium for the schemes. For the convergence scheme, the Karush-Kuhn-Tucker (KKT) optimality conditions in solving a nonlinear optimization problem are employed to obtain an optimal value that the price or utility of the selected relay node(s) converges to. The results show that in the trade-off game scheme, there is 29% decrease in the convergence time when the proposed scheme is compared with a previous work while there is a 20% decrease in convergence time for the proposed bidding game scheme when compared with a related work. These results obviously show that these new schemes outperform the existing ones, primarily due to the fewer necessary relay nodes made to be involved in the process. Thus this reduces the convergence time and reduces the power consumption on the wireless network.
Description
Keywords
Cooperative wireless communication , tool called game theory
Citation