Co-operative shortest path relay selection for multihop MANETs

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, 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 are distributed uniformly within the coverage area. Flat Rayleigh fading channel with Log-distance path loss model is considered. In Shortest Distance Path Relay Selection we select the relay which is near to assumed Line of Sight (LOS). In Reactive Best Expectation Relay Selection Criteria relays which minimize total transmission time are selected for cooperation after source transmission. In Proactive Opportunistic Relay Selection Criteria before the source transmission, best relay which maximize mutual information capacity is selected for cooperation. The proposed relay selection criteria was compared with Reactive Best Expectation Relay Selection Criteria and Proactive Opportunistic Relay Selection Criteria. We further analyzed energy consumption, throughput and delay of the proposed system. The simulation results show that the proposed Shortest Distance Path Relay Selection consume less energy and has shortest delay compared to the Reactive Best Expectation and Proactive Opportunistic Relay Selection methods.

Cite

CITATION STYLE

APA

Asha Rani, M. (2015). Co-operative shortest path relay selection for multihop MANETs. In Advances in Intelligent Systems and Computing (Vol. 328, pp. 697–706). Springer Verlag. https://doi.org/10.1007/978-3-319-12012-6_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free