International Journal of Electronics and Communication Engineering and Technology (IJECET)

Source ID:00000004
Volume 10, Issue 3,May-June 2019, Pages 19-32, Page Count - 14

SAMCAR:Spectrum Aware Multi-Coefficient based shortest Anypath Routing in Cognitive Radio Networks

Shyleshchandra Gudihatti K N (1) S H Manjula (2) Venugopal K R (3)

(1) Bangalore University, University Visvesvaraya College of Engineering (UVCE), Bengaluru, Karnataka, India.
(2) Bangalore University, University Visvesvaraya College of Engineering (UVCE), Bengaluru, Karnataka, India.
(3) Bangalore University, Bengaluru, India.

Manuscript ID:- 00000-42975
Access Type : Open Access
Read Full Article


Cite this article:Shyleshchandra Gudihatti K N,S H Manjula,Venugopal K R,  Samcar:spectrum Aware Multi-coefficient Based Shortest Anypath Routing In Cognitive Radio Networks, International Journal of Electronics and Communication Engineering and Technology(IJECET), 2019, 10(3), PP.19-32

Manuscript Level Metrics (MLM)

Views Downloads Citations Cited References Social Shares
23 12 0 0

Abstract

Wireless communication technology has grown tremendously with an advancement of better communication quality. The communication quality depends on the available spectrum bands but due to increased demand, the spectrum scarcity has become a challenging issue. Besides, insignificant spectrum utilization in a wireless network degrades the performance issues. Recently dynamic spectrum management is proposed as a recommended solution by Federeal Communication Commission (FCC) which can enhance the spectrum management. Owing to this spectrum management, Cognitive Radio networks converging to offer possible solution. Accordingly, in this paper, we look at Cognitive Capacity Harvesting network and developed a mult-hop cognitive radio network routing protocol. The proposed routing protocol Multi-Coefficient based Shortest Anypath Routing (MCSAR) is devised based on the link quality, energy consumption and trust values for identifying the next-hop. Additionally, we incorporate the improved Bellman-Ford algorithm for further optimization of the communication. Generally, anypath routing provides two optimal paths in which selection of one optimal path becomes a challenging issue. In order to overcome this issue, we propose priority weight computation where distance from current node to destination node and its trust factors are considered for forwarding node selection. The performance of proposed approach is compared against conventional/existing anypath routing schemes. The extensive simulation result obtained ensures better efficiency in terms of packet delivery ratio, overhead of communication and computation, end-to-end delay, and throughput.
Author Keywords
Anypath routing Cognitive Radio Networks Cognitive Capacitive Harvesting Multi-Coefficient Shortest Anypath Routing Routing Protocol
Index Keywords
Bellman-Ford algorithm Spectrum management Routing schemes Communication quality


ISSN Print: 0976-6464 ISSN Online: 0976-6472
Source Type: Journals Document Type: Journal Article
Publication Language: English DOI:
Abbreviated Journal Title: IJECET Access Type: Open Access
Publisher Name: IAEME Publication Resource Licence: CC BY-NC
Major Subject:Physical Sciences Subject Area classification: Computer Science
Subject area: Computer Networks and Communications Source: SCOPEDATABASE