Title: An efficient cooperative routing algorithm for large-scale wireless networks based on capacity and location

Authors: D. Praveen Kumar; P. Pardha Saradhi

Addresses: Department of Electronics and Communication Engineering, KL Deemed to be University, Vaddeswaram, Andhra Pradesh – 522502, India; Vardhaman College of Engineering, Hyderabad, Telangana – 501218, India ' Department of Electronics and Communication Engineering, KL Deemed to be University, Vaddeswaram, Andhra Pradesh – 522502, India

Abstract: Cooperative communication has been extensively used in small-scale wireless networks, by virtue of its capability to mitigate the fading effects. Extending cooperative communication technique to large-scale networks undergoes severe interference; multi-radio-multi-channel is exploited in large scale wireless networks to ameliorate throughput by concurrent transmissions over orthogonal channels to dwindle interference. Capitalising on these potential advantages, stand in need for efficacious routing and potent mapping of channels to radios. In this paper, we have proffered an algorithm by concurrently considering: 1) relay selection using distance and maximum-available-channel-capacity parameters; 2) channel assignment using dynamic global table. Our algorithm selects a relay-node based on the available channel capacity in the shortest-path to minimise the transmission delay without affecting aggregate throughput. The evaluation and analysis of the proposed model is compared with interference-aware-cooperative-routing algorithm and observed that the proposed algorithm has improved delay reduction by 27.5% and the average number of hops by 32.5%.

Keywords: channel assignment; cooperative communication; cooperative routing; multi-radio large scale network; relay selection.

DOI: 10.1504/IJCNDS.2021.115572

International Journal of Communication Networks and Distributed Systems, 2021 Vol.26 No.4, pp.446 - 463

Received: 30 Nov 2019
Accepted: 20 Jul 2020
Published online: 10 Jun 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article