Co-operative Communication with Opportunistic Relays

Abstract

In multihope mobile Adhoc Networks, developing efficient and scalable routing protocols is one of the challenging tasks due to the inherent nature of infrastructurelessness and high dynamics. We propose a simple Shortest Distance path relay selection criteria employing Decode and Forward (DF) Cooperative Protocol. We consider a single source and a single destination network with N candidate relays which distribute uniformly within the coverage area. The cooperation between the source and a relay provides improved robustness to wireless fading. Assuming a Flat Rayleigh fading channel with Log-distance path loss model the proposed relay selection criteria is compare with Reactive Best Expectation relay selection criteria and Proactive Opportunistic relay selection criteria. We will further analyze energy consumption, throughput and compare the proposed system results with the other techniques available in literature. The simulation results will show that the proposed Shortest Distance path relay selection consumes less energy and has shortest delay compared to the Reactive Best Expectation and Proactive Opportunistic relay selection methods.