Stability-based routing, link scheduling and channel assignment in cognitive radio mobile ad-hoc networks

One fundamental issue in cognitive radio mobile ad hoc networks (CR-MANETs) is the selection of a stable path between any source and destination node to reduce the end-to-end delay and energy consumption arisen from route reconstruction. In this way, we analyse the link stability by calculating the...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks 2019-05, Vol.25 (4), p.2013-2026
Main Authors: Amiri-Doomari, Soodeh, Mirjalily, Ghasem, Abouei, Jamshid
Format: Article
Language:English
Subjects:
Algorithms
Cognitive radio
Communications Engineering
Computer Communication Networks
Computer networks
Delay
Electrical Engineering
Energy consumption
Energy transmission
Engineering
Interference
IT in Business
Mobile ad hoc networks
Mobile communication systems
Networks
Packet transmission
Scheduling
Stability analysis
Time dependence
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:One fundamental issue in cognitive radio mobile ad hoc networks (CR-MANETs) is the selection of a stable path between any source and destination node to reduce the end-to-end delay and energy consumption arisen from route reconstruction. In this way, we analyse the link stability by calculating the link life time that is dependent on failures caused by secondary users’ (SUs) movements and primary users’ (PUs) activities. We propose a joint stability-based routing, link scheduling and channel assignment (SRLC) algorithm in CR-MANETs, which is benefited from considering the link life time, amount of interference imposed on PUs and energy consumption. The proposed algorithm selects a frequency channel/time slot in a way that channel utilization and previous behaviours of SUs and PUs, are taken into account. In the proposed SRLC, the concept of load balancing is applied by avoiding to route packets through SUs with insufficient energy. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, end-to-end delay, goodput and the energy usage per packet transmission under three different scenarios. The results show our proposed scheme finds better routes compared to the recently proposed joint stable routing and channel assignment protocol.
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-018-1793-1