scholarly journals Two-Excitation Routing via Linear Quantum Channels

2020 ◽  
Author(s):  
Tony John George Apollaro ◽  
Wayne Jordan Chetcuti
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Linear Chain ◽  
Quantum Channels ◽  
Transfer Scheme ◽  
Limited Region ◽  
Single Qubit ◽  
The Many ◽  
Quantum Internet ◽  
Linear Quantum

Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qubit routing protocols have not been intensively investigated so far. Building on the many-excitation transfer protocol in Ref. , we apply the perturbative transfer scheme to a two-excitation routing protocol on a network where multiple two-receivers block are coupled to a linear chain. We address both the case of switchable and permanent couplings between the receivers and the chain. We find that the protocol allows for efficient two-excitation routing on a fermionic network, although for a spin-12 network only a limited region of the network is suitable for high-quality routing.

scholarly journals Two-Excitation Routing via Linear Quantum Channels

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 51
Author(s):  
Tony John George Apollaro ◽  
Wayne Jordan Chetcuti
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Linear Chain ◽  
Quantum Channels ◽  
High Quality ◽  
Transfer Scheme ◽  
Limited Region ◽  
Single Qubit ◽  
Quantum Internet ◽  
Linear Quantum

Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qubit routing protocols have not been intensively investigated so far. Building on a recently proposed many-excitation transfer protocol, we apply the perturbative transfer scheme to a two-excitation routing protocol on a network where multiple two-receivers block are coupled to a linear chain. We address both the case of switchable and permanent couplings between the receivers and the chain. We find that the protocol allows for efficient two-excitation routing on a fermionic network, although for a spin-12 network only a limited region of the network is suitable for high-quality routing.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

A Comparative study on secure routing algorithms SAODV and A-SAODV in Mobile AdHoc Networks (MANET) – The Enhancements of AODV

2012 ◽  
Vol 3 (2) ◽  
pp. 419-423
Author(s):  
JARUPULA RAJESHWAR ◽  
Dr G NARSIMHA
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Dynamic Network ◽  
Secure Routing ◽  
Mobile Adhoc Networks ◽  
Security Challenges ◽  
Basic Protocol ◽  
Freely Moving ◽  
Adhoc Networks ◽  
Secure Routing Protocols

A freely moving nodes forming as group to communicate among themselves are called as Mobile AdHoc Networks (MANET). Many applications are choosing this MANET for effective commutation due to its flexible nature in forming a network. But due to its openness characteristics it is posing many security challenges. As it has highly dynamic network topology security for routing is playing a major role. We have very good routing protocols for route discovery as well as for transporting data packers but most of them lack the feature of security like AODV. In this paper we are studying the basic protocol AODV and identify how it can be made secure. We are studying a protocol S-AODV which is a security extension of AODV which is called Secure AODV (S-AODV) and we are studying enhanced version of S-AODV routing protocol a Adaptive Secure AODV (A-SAODV). Finally we have described about the parameter to be taken for performance evaluation of different secure routing protocols

scholarly journals EZ-SEP: Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1021
Author(s):  
Zhanserik Nurlan ◽  
Tamara Zhukabayeva ◽  
Mohamed Othman
Keyword(s):  
Sensor Network ◽  
Hierarchical Clustering ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Cluster Head ◽  
Average Power ◽  
Base Station ◽  
Average Power Consumption ◽  
Clustering Approach ◽  
Heterogeneous Sensor Network

Wireless sensor networks (WSN) are networks of thousands of nodes installed in a defined physical environment to sense and monitor its state condition. The viability of such a network is directly dependent and limited by the power of batteries supplying the nodes of these networks, which represents a disadvantage of such a network. To improve and extend the life of WSNs, scientists around the world regularly develop various routing protocols that minimize and optimize the energy consumption of sensor network nodes. This article, introduces a new heterogeneous-aware routing protocol well known as Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network or EZ-SEP, where the connection of nodes to a base station (BS) is done via a hybrid method, i.e., a certain amount of nodes communicate with the base station directly, while the remaining ones form a cluster to transfer data. Parameters of the field are unknown, and the field is partitioned into zones depending on the node energy. We reviewed the Z-SEP protocol concerning the election of the cluster head (CH) and its communication with BS and presented a novel extended mechanism for the selection of the CH based on remaining residual energy. In addition, EZ-SEP is weighted up using various estimation schemes such as base station repositioning, altering the field density, and variable nodes energy for comparison with the previous parent algorithm. EZ-SEP was executed and compared to routing protocols such as Z-SEP, SEP, and LEACH. The proposed algorithm performed using the MATLAB R2016b simulator. Simulation results show that our proposed extended version performs better than Z-SEP in the stability period due to an increase in the number of active nodes by 48%, in efficiency of network by the high packet delivery coefficient by 16% and optimizes the average power consumption compared to by 34.

Clustering-based Energy Efficient Multipath Adaptive Routing Protocols for Underwater Wireless Sensor Networks

2020 ◽  
Vol 6 (2) ◽  
pp. EC-54-EC-62
Author(s):  
Edy Victor Haryanto ◽  
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Transmission Rate ◽  
Adaptive Routing ◽  
Maximum Energy ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Underwater Wireless Sensor Networks

In an underwater wireless sensor network (UWSN), research challenges occur in the availability of new connectivity protocols, sensors, and utilization of energy. One of the issues is to enhance the lifespan of the network without increasing the supply, cost, and level of resources. This paper proposes a conceptual routing protocol for UWSN, known as Energy-Efficient Multipath Adaptive Routing (E2MAR) protocols, which is primarily intended for long-term control with greater energy efficiency and transmission rate. Key development conditions were set by the E2MR and forward nodes are chosen based on the performance index. Different tests are carried out by evaluating E2MR in terms of the number of live nodes, end-to-end latency, packet delivery rate, and maximum energy usage efficiently compared to some other Routing protocols. The lifespan of the network has also been greatly enhanced.

scholarly journals MANETs performance analysis with dos attack at different routing protocols

2015 ◽  
Vol 4 (2) ◽  
pp. 390 ◽  
Author(s):  
Alaa Zain ◽  
Heba El-khobby ◽  
Hatem M. Abd Elkader ◽  
Mostafa Abdelnaby
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Geographic Routing ◽  
Security Threat ◽  
Dos Attacks ◽  
Reactive Routing ◽  
Hoc Networks ◽  
The Impact

A Mobile Ad-Hoc Networks (MANET) is widely used in many industrial and people's life applications, such as earth monitoring, natural disaster prevention, agriculture biomedical related applications, and many other areas. Security threat is one of the major aspects of MANET, as it is one of the basic requirements of wireless sensor network, yet this problem has not been sufficiently explored. The main purpose of this paper is to study different MANETs routing protocols with three scenarios of Denial of Service (DoS) attacks on network layer using proactive routing protocol i.e. Optimized Link State Routing (OLSR) and Reactive routing protocols like Ad hoc On-Demand Distance Vector (AODV), Hybrid routing protocols like Geographic Routing Protocol (GRP). Moreover, a comparative analysis of DoS attacks for throughput, Data loss, delay and network load is taken into account. The performance of MANET under the attack is studied to find out which protocol is more vulnerable to the attack and how much is the impact of the attack on both protocols. The simulation is done using OPNET 17.

scholarly journals Analisis Perbedaan Peformance dan Quality Of Service (Qos) Antara Eigrp dengan Ospf (Studi Kasus Menggunakan 6 Router Melalui GNS 3 dan Wireshark)

2018 ◽  
Vol 2 (1) ◽  
pp. 10
Author(s):  
Unung Verawardina
Keyword(s):  
Quality Of Service ◽  
Long Range ◽  
Routing Protocol ◽  
Packet Loss ◽  
Routing Protocols ◽  
Data Transfer ◽  
Link State ◽  
Routing Table ◽  
The Difference

In a dynamic routing setting a routing protocol is required to perform the settings to find the shortest and best path. Routing protocols are of two types: vector distance and link state. Use of EIGRP routing that includes long-range vectors and link state OSPF Link link state coverage, peg well to be implemented in complex network because it can adapt well. In this research is the method used for routing and speed of time available EIGRP routing and OSPF routing through simulator GNS3 and wireshark application, then analyze the difference of peformance with speed of routing table and speed of time. While for Quality of Service (QoS) compare network service quality from EIGRP and OSPF routing which include delay, packet loss, and throughput. Based on the results of the research shows the EIGRP routing table is better in the selection path, EIGRP smaller time tansfer data then its data transfer faster than the OSPF. Overall Quality Of Service (Qos) delay, packetloss and throughput on EIGRP and OSPF are well balanced and good.

scholarly journals Study and Optimized Simulation of OSPFv3 Routing Protocol in IPv6 Network

2019 ◽  
pp. 11-16
Author(s):  
Md. Anwar Hossain ◽  
Mst. Sharmin Akter
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Internet Protocol ◽  
The Internet ◽  
Address Space ◽  
Next Generation Internet ◽  
Ipv6 Address ◽  
Ipv6 Network ◽  
Packet Tracer

Routing is a design way to pass the data packet. User is assigns the path in a routing configuration. A significant role played by the router for providing the dynamic routing in the network. Structure and Configuration are different for each routing protocols. Next generation internet protocol IPv6 which provides large address space, simple header format. It is mainly effective and efficient routing. It is also ensure good quality of service and also provide security. Routing protocol (OSPFv3) in IPv6 network has been studied and implemented using ‘cisco packet tracer’. ‘Ping’ the ping command is used to check the results. The small virtual network created in Cisco platform .It is also used to test the OSPFv3 protocol in the IPv6 network. This paper also contains step by step configuration and explanation in assigning of IPv6 address in routers and end devices. The receiving and sending the packet of data in a network is the responsibility of the internet protocol layer. It also contains the data analysis of packet forwarding through IPv6 on OSPFv3 in simulation mode of cisco packet virtual environment to make the decision eventually secure and faster protocol in IPv6 environment.

Sign in / Sign up

Export Citation Format

Share Document