Interference Aware Routing Game for Cognitive Radio Ad-hoc Networks

Amiri-Doomari, Soodeh; Mirjalily, Ghasem; Abouei, Jamshid

doi:10.26636/jtit.2018.110817

Cited by 6 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[3]. As established in, routing encounters in CRAHNs are categorized into three chief sorts: channel-based, host-based and networkbased routing [4]. Routing in CRAHN is a very significant job having a countless result on the complete presentation of the system.…”

Section: Cognitive Radio Ad-hoc Network (Crahn)mentioning

confidence: 99%

“…In Interference-aware routing game [4], relay efficient value (RCV) metric is used to reduce the end-to-end delay and decrease the interference from SUs. The RCV is resultant regarding space amid the impart and terminus, the efficacy function of the game theory exemplary is resultant regarding RCV, entire movement load on nodule and intrusion.…”

Section: Problem Identificationmentioning

confidence: 99%

“…The simulation of the proposed Multi-population Firefly Algorithm (MFA) for Relay Assisted Efficient Routing (MFARAER) protocol is conducted in NS2 and it is compared with Reinforcement Learning Routing (RLR) [2] and Interference Aware Routing Game (IARG) [4]. The performance is evaluated with respect to End-to-End Delay (E2D), Packet Delivery Ratio (PDR), throughput and average residual energy.…”

Section: Experimental Settingsmentioning

confidence: 99%

See 2 more Smart Citations

Multi-Population Firefly Algorithm (Mfa) for Relay Assisted Efficient Routing in Cognitive Radio Ad-Hoc Networks (Crahn)

2020

jcr

View full text Add to dashboard Cite

The existing routing techniques in Cognitive Radio ad-hoc networks (CRAHN) do not consider the delay, energy consumption, interference, traffic load parameters and success rate of data delivery. In order to solve these problems, in this paper, we propose to design a relay assisted cost effective routing protocol for CRAHNS. In this routing protocol, some of the secondary users are designated as relay nodes along the route towards the destination. Multi-population Firefly Algorithm (MFA) is used to establish the routing path based on the Interference to PUs, Number of Hops and Average current traffic load, Packet reception ratio and Average residual energy metrics. By simulation results, we show that the proposed technique improves the data delivery rate and reduces the energy consumption.

show abstract

Section: Cognitive Radio Ad-hoc Network (Crahn)mentioning

confidence: 99%

Section: Problem Identificationmentioning

confidence: 99%

Section: Experimental Settingsmentioning

confidence: 99%

See 1 more Smart Citation

Multi-Population Firefly Algorithm (Mfa) for Relay Assisted Efficient Routing in Cognitive Radio Ad-Hoc Networks (Crahn)

2020

jcr

View full text Add to dashboard Cite

show abstract

“…Amiri-Doomari, S., Mirjalily, & Abouei, J. (2019) [8] proposed a Stability-based routing method which is used for the link scheduling and channel assignment in the MANET. Mahalakshmi, S& Vadivel, (2019) [9] proposed a novel method for detecting the shortest route for the process of the transmission of the information packets.…”

Section: Literature Surveymentioning

confidence: 99%

A Trusted Method For Early Data Link Failure Prediction

Jegan*,

Kamalakkannan,

Samundiswary

2020

IJRTE

View full text Add to dashboard Cite

Mobile ad-hoc network was widely used in the various fields for several applications. In the field of the wireless sensor network the link failure prediction is still a baffling one. The proposal here provides clear facts about the concepts of the link failure. In this paper the Proficient Trusted Node ID Based Resource Reservation Protocol (PT-NIDBRRP) was used. Here the shortest path was detected by using the weighted end-to-end delay based approach. This algorithm will find the short cut route from the particular starting place to the target and can improve the detection rate. By starting the route detection process the sequence numeral and the hop address is added to the protocol. After detecting the shortest path the link failure was detected. The link failure localization structure in the implemented trusted protocol has the higher ability in predicting and fixing the link failure issues. Then to find out the cause attack for the link failure the posterior probability estimation was used to sort out the type of the attack. At last the performance of the proposed method was evaluated through simulation analysis. The simulation result confirms that the proposed methodology is highly effective in detecting the link breakage and the short path algorithm implemented here will reduces the time period of detecting the shortest path. This method provides trusted secure network time duration, energy values and trust scores play an important role between the source and destination in the network.

show abstract

“…While Biyanwilage et al proposed a new power allocation method and compared it with a conventional water-filling power allocation method for minimising the interference power received by TV receivers from a CU subject to his minimum transmission capacity. Amiri-Doomari et al [34] proposed the interference routing game algorithm for enabling the CUs to minimise the power interference on the PUs and maximising payoff function.…”

Section: Literature Surveymentioning

confidence: 99%