Performance Analysis in Cooperative Communication
Ashima Yadav
Ashima Yadav, Student M.TECH, ECE, Gurgaon Institute of Technology, Bilaspur, Gurgaon, Haryana, India.
Manuscript received on July 17, 2012. | Revised Manuscript received on August 25, 2012. | Manuscript published on August 30, 2012. | PP: 11-14 | Volume-1 Issue-6, August 2012. | Retrieval Number: F0582071612/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper, we have developed a framework for resource allocation in a multi user cooperative wireless network. We have considered centralized and decentralized node-relay assignment with the objective of maximizing the sum throughput. We present an efficient polynomial time centralized assignment algorithm to achieve this objective, and also investigate efficient decentralized schemes that do not require a central authority to perform the allocation. We present a novel message passing based assignment scheme which converges to the optimal value, and present an adapted scheme based on distributed auction theory. We also present a simple sub-optimal greedy assignment strategy and provide empirical data to support its practical significance.
Keywords: We present a novel message passing based assignment scheme which converges to the optimal value, and present an adapted scheme based on distributed auction theory.