An Efficient Routing Protocol for Secured Communication in Cognitive Radio Sensor Networks

• URL: http://arxiv.org/abs/2008.12895v1
• Date: Sat, 29 Aug 2020 02:45:44 GMT
• Title: An Efficient Routing Protocol for Secured Communication in Cognitive Radio Sensor Networks
• Authors: Sharmin Akter, Mohammad Shahriar Rahman and Nafees Mansoor
• Abstract summary: This paper introduces an efficient reactive routing protocol considering the mobility and the reliability of a node in Cognitive Radio Sensor Networks (CRSNs) The proposed protocol measures the weight for an edge the measuring the mobility patterns of the nodes and channel availability. It is anticipated that the proposed protocol shows efficient routing performance by selecting stable and secured paths from source to destination.
• Score: 4.363674669941547
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper introduces an efficient reactive routing protocol considering the mobility and the reliability of a node in Cognitive Radio Sensor Networks (CRSNs). The proposed protocol accommodates the dynamic behavior of the spectrum availability and selects a stable transmission path from a source node to the destination. Outlined as a weighted graph problem, the proposed protocol measures the weight for an edge the measuring the mobility patterns of the nodes and channel availability. Furthermore, the mobility pattern of a node is defined in the proposed routing protocol from the viewpoint of distance, speed, direction, and node's reliability. Besides, the spectrum awareness in the proposed protocol is measured over the number of shared common channels and the channel quality. It is anticipated that the proposed protocol shows efficient routing performance by selecting stable and secured paths from source to destination. Simulation is carried out to assess the performance of the protocol where it is witnessed that the proposed routing protocol outperforms existing ones.

Related papers

• Smart Routing with Precise Link Estimation: DSEE-Based Anypath Routing for Reliable Wireless Networking [6.123324869194196]
  Shortest Anypath routing offers a solution by adapting routing decisions based on real-time link conditions. This paper introduces a novel approach that leverages the Deterministic Sequencing of Exploration and Exploitation (DSEE), a multi-armed bandit algorithm. By coupling DSEE with Anypath routing, this algorithm continuously learns and ensures accurate delivery probability estimation.
  arXiv  Detail & Related papers  (2024-05-16T18:16:56Z)
• NeuraLunaDTNet: Feedforward Neural Network-Based Routing Protocol for Delay-Tolerant Lunar Communication Networks [0.46040036610482665]
  Space poses challenges such as severe delays, hard-to-predict routes and communication disruptions. Traditional DTN routing protocols fall short of delivering optimal performance, due to the inherent complexities of space communication. We propose utilising a feedforward neural network to develop a novel protocol NeuraLunaDTNet, which enhances the efficiency of lunar communication.
  arXiv  Detail & Related papers  (2024-03-29T14:24:15Z)
• Decentralized Covert Routing in Heterogeneous Networks Using Reinforcement Learning [3.7186047974927257]
  We develop a novel reinforcement learning-based covert routing algorithm that finds a route from the source to the destination. We show based on numerical simulations that the proposed covert routing strategy has only negligible performance loss.
  arXiv  Detail & Related papers  (2024-01-31T23:51:14Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• CARL-DTN: Context Adaptive Reinforcement Learning based Routing Algorithm in Delay Tolerant Network [0.0]
  Delay/Disruption-Tolerant Networks (DTN) invented to describe and cover all types of long-delay, disconnected, intermittently connected networks. This study proposes context-adaptive reinforcement learning based routing protocol to determine optimal replicas of the message based on the real-time density.
  arXiv  Detail & Related papers  (2021-05-02T20:08:17Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Genetic Improvement of Routing Protocols for Delay Tolerant Networks [3.9571744700171756]
  We improve two routing protocols widely adopted in Delay Tolerant Networks (DTNs) We dissect them into their fundamental components, i.e., checking if a node can transfer data, or sending messages to all connections. We apply Genetic Improvement (GI) to manipulate these components as terminal nodes of evolving trees.
  arXiv  Detail & Related papers  (2021-03-12T17:46:51Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Power Control for a URLLC-enabled UAV system incorporated with DNN-Based Channel Estimation [82.16169603954663]
  This letter is concerned with power control for ultra-reliable low-latency communications (URLLC) enabled unmanned aerial vehicle (UAV) system incorporated with deep neural network (DNN) based channel estimation.
  arXiv  Detail & Related papers  (2020-11-14T02:31:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.