Showing papers on "Link-state routing protocol published in 2021"

An Optimized Framework for WSN Routing in the Context of Industry 4.0.

Abstract: The advancements in Industry 4.0 have opened up new ways for the structural deployment of Smart Grids (SGs) to face the endlessly rising challenges of the 21st century. SGs for Industry 4.0 can be better managed by optimized routing techniques. In Mobile Ad hoc Networks (MANETs), the topology is not fixed and can be encountered by interference, mobility of nodes, propagation of multi-paths, and path loss. To extenuate these concerns for SGs, in this paper, we have presented a new version of the standard Optimized Link State Routing (OLSR) protocol for SGs to improve the management of control intervals that enhance the efficiency of the standard OLSR protocol without affecting its reliability. The adapted fault tolerant approach makes the proposed protocol more reliable for industrial applications. The process of grouping of nodes supports managing the total network cost by reducing severe flooding and evaluating an optimized head of clusters. The head of the unit is nominated according to the first defined expectation factor. With a sequence of rigorous performance evaluations under simulation parameters, the simulation results show that the proposed version of OLSR has proliferated Quality of Service (QoS) metrics when it is compared against the state-of-the-art-based conventional protocols, namely, standard OLSR, DSDV, AOMDV and hybrid routing technique.

An Improved Harmony Search Algorithm for Proactive Routing Protocol in VANET

Abstract: Vehicular ad-hoc network (VANET) is the direct application of mobile ad-hoc network (MANET) in which the nodes represent vehicles moving in a city or highway scenario. The deployment of VANET relies on routing protocols to transmit the information between the nodes. Different routing protocols that have been designed for MANET were proposed to be applied in VANET. However, the real-time implementation is still facing challenges to fulfill the quality of service (QoS) of VANET. Therefore, this study mainly focuses on the well-known MANET proactive optimized link state routing (OLSR) protocol. The OLSR in VANET gives a moderate performance; this is due to its necessity of maintaining an updated routing table for all possible routes. The performance of OLSR is highly dependent on its parameter. Thus, finding optimal parameter configurations that best fit VANET features and improve its quality of services is essential before its deployment. The harmony search (HS) is an emerging metaheuristic optimization algorithm with features of simplicity and exploration efficiency. Therefore, this paper aims to propose an improved harmony search optimization (EHSO) algorithm that considers the configuration of the OLSR parameters by coupling two stages, a procedure for optimization carried out by the EHSO algorithm based on embedding two popular selection methods in its memory, namely, roulette wheel selection and tournament selection. The experimental analysis shows that the proposed approach has achieved the QoS requirement, compared to the existing algorithms.

The vehicle routing problem with cross-docking and resource constraints

Abstract: In this paper, we propose an extension of the vehicle routing problem with cross-docking that takes into account resource constraints at the cross-dock. These constraints limit the number of docks that can be used simultaneously. To solve this new problem, we adapt a recently proposed matheuristic based on large neighborhood search. In particular, we focus on the feasibility tests for insertions and compare heuristics and constraint programming strategies. Finally, computational experiments on instances adapted from the vehicle routing problem with cross-docking are reported. They give insights on the impact of a limited cross-dock capacity on the routing cost.

An Optimized Communication Scheme for Energy Efficient and Secure Flying Ad-hoc Network (FANET)

Abstract: FANET (flying ad-hoc network) has provided broad area for research and deployment due to efficient use of the capabilities of drones and UAVs (unmanned ariel vehicles) in several military and rescue applications. Drones have high mobility in 3D (3 dimensional) environment and low battery power, which produce various problems such as small journey time and infertile routing. The optimal routing for communication will assist to resolve these problems and provide the energy efficient and secure data transmission over FANET. Hence, in this paper, we proposed a whale optimization algorithm based optimized link state routing (WOA-OLSR) over FANET to provide optimal routing for energy efficient and secure FANET. The efficiency of OLSR is enhanced by using WOA and evaluated performance shows the better efficiency of WOA-OLSR in terms of some parameters such as a packet delivery ratio, end to end delay, energy utilization, throughput, and time complexity against the previous approaches OLSR, MP-OLSR, P-OLSR, ML-OLSR-FIFO and ML-OLSR-PMS.

Energy efficient hierarchical based fish eye state routing protocol for flying Ad-hoc networks

Abstract: Flying Ad-hoc networks are emergent area in Ad-hoc networks evolved from MANETs and VANETs. Small unmanned aerial vehicles (UAVs) are used in FANETs applications and these small UAVs have limited resources while efficiently utilization of these resources is most critical task in real time monitoring of FANETs application. Network consumes its resources in path selection process and data routing from source to destination. Selecting of efficient routing protocol to utilize all available resources played vital role in extending network life time. In this article fisheye state routing (FSR) protocol is implemented in FANET and compare networks performance in term of channel utilization, link utilization vs throughput and packet delivery ratio (PDR) with distance sequence distance vector (DSDV), optimized link state routing (OLSR), adhoc on demand distance vector (AODV), dynamic source routing (DSR) and temperary ordered routing protocol (TORA). Experimental analysis slows that FSR is good in term of PDR (16438 packets delivered), channel utilization (89%) and link vs throughput from the rest of routing protocols after addressing of these problems UAVs resources are efficiently utilized (energy).

Segment Routing Centralized BGP Egress Peer Engineering

Abstract: Segment Routing (SR) leverages source routing. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. A segment can represent any instruction topological or service-based. SR allows to enforce a flow through any topological path while maintaining per-flow state only at the ingress node of the SR domain. The Segment Routing architecture can be directly applied to the MPLS dataplane with no change on the forwarding plane. It requires a minor extension to the existing link- state routing protocols. This document illustrates the application of Segment Routing to solve the BGP Egress Peer Engineering (BGP-EPE) requirement. The SR-based BGP-EPE solution allows a centralized (Software Defined Network, SDN) controller to program any egress peer policy at ingress border routers or at hosts within the domain.

An Optimized and Efficient Routing Protocol Application for IoV

Abstract: IoV is the latest application of VANET and is the alliance of Internet and IoT. With the rapid progress in technology, people are searching for a traffic environment where they would have maximum collaboration with their surroundings which comprise other vehicles. It has become a necessity to find such a traffic environment where we have less traffic congestion, minimum chances of a vehicular collision, minimum communication delay, fewer communication errors, and a greater message delivery ratio. For this purpose, a vehicular ad hoc network (VANET) was devised where vehicles were communicating with each other in an infrastructureless environment. In VANET, vehicles communicate in an ad hoc manner and communicate with each other to deliver messages, for infotainment purposes or for warning other vehicles about emergency scenarios. Unmanned aerial vehicle- (UAV-) assisted VANET is one of the emerging fields nowadays. For VANET’s routing efficiency, several routing protocols are being used like optimized link state routing (OLSR) protocol, ad hoc on-demand distance vector (AODV) routing protocol, and destination-sequenced distance vector (DSDV) protocol. To meet the need of the upcoming era of artificial intelligence, researchers are working to improve the route optimization problems in VANETs by employing UAVs. The proposed system is based on a model of VANET involving interaction with aerial nodes (UAVs) for efficient data delivery and better performance. Comparisons of traditional routing protocols with UAV-based protocols have been made in the scenario of vehicle-to-vehicle (V2V) communication. Later on, communication of vehicles via aerial nodes has been studied for the same purpose. The results have been generated through various simulations. After performing extensive simulations by varying different parameters over grid sizes of 300 × 1500 m to 300 × 6000 m, it is evident that although the traditional DSDV routing protocol performs 14% better than drone-assisted destination-sequenced distance vector (DA-DSDV) when we have number of sinks equal to 25, the performance of drone-assisted optimized link state routing (DA-OLSR) protocol is 0.5% better than that of traditional OLSR, whereas drone-assisted ad hoc on-demand distance vector (DA-AODV) performs 22% better than traditional AODV. Moreover, if we increase the number of sinks up to 50, it can be clearly seen that the DA-AODV outperforms the rest of the routing protocols by up to 60% (either traditional routing protocol or drone-assisted routing protocol). In addition, for parameters like MAC/PHY overhead and packet delivery ratio, the performance of our proposed drone-assisted variants of protocols is also better than that of the traditional routing protocols. These results show that our proposed strategy performs better than the traditional VANET protocols and plays important role in minimizing the MAC/PHY and enhancing the average throughput along with average packet delivery ratio.

Skeleton-Based Swarm Routing (SSR): Intelligent Smooth Routing for Dynamic UAV Networks

Abstract: A swarm of unmanned aerial vehicles (UAVs) requires the transmission of mission-related data across the network. The resource constraints and dynamic nature of the swarm bring critical challenges to the design of UAV routing protocols. Most of the conventional ad hoc routing schemes are not intelligent and cannot adapt to the dynamic nature of UAV swarming networks. On the other hand, some artificial intelligence (AI)-based routing schemes may consume significant computational resources in the UAVs. In this article, a low-cost, adaptive routing protocol, namely skeleton-based swarm routing (SSR) , is proposed, which exploits an intelligent online learning algorithm and the topology features of the mission-driven UAV swarm to distribute the traffic over optimal routes. Here, the skeleton represents the most stable parts of the swarm formation. SSR architecture consists of three modules: 1) A geometric addressing module, which assigns geometric coordinates to each node based on the swarm skeleton structure; 2) A leaf-like routing pipe which allows the selection of multiple candidate routes around the shortest path; 3) An intelligent low-complexity learning model which determines how to distribute the packets inside the routing pipe to achieve load-balanced, high-throughput transmissions. The proposed skeleton-based scheme can also facilitate the UAV formation construction and morphing. The simulation results show that the proposed SSR protocol can noticeably improve the network performance (up to 100% throughput improvement) compared to the single path routing schemes, such as the ad-hoc on-demand distance vector (AODV) and link-quality and traffic-load aware optimized link state routing (LTA-OLSR) protocols.

A new solution based on optimal link-state routing for named data MANET

Abstract: NDN is an important instance of Information-Centric Networking. When integrating NDN into MANET, exploring new routing is a necessary task for this research area. The LSAs flooding is a common method to obtain network topology during route establishment. However, the LSAs flooding often results in a broadcast storm in high-density MANET. Using the MPR set proposed in the OLSR can effectively reduce the number of LSAs in the process of route establishment and can further solve the broadcast storm. In this paper, an enhanced neighbor discovery protocol firstly is designed to establish a MPR set. The new protocol can effectively avoid the problem incurred by unidirectional links that impact the network performance in a wireless environment. And then a new and proactive routing NOLSR based on OLSR for NDN-MANET is proposed to support NDN in MANET. And another important work is that NOLSR is implemented on top of NDN Forwarding Daemon NFD. Finally, we make a comparative analysis between NOLSR and the two most relative schemes such as traditional LSA-flooding and the scheme [1] by emulation experiments in the NDN emulator mini-NDN.

Decentralizing Private Blockchain-IoT Network with OLSR

Abstract: With data transparency and immutability, the blockchain can provide trustless and decentralized services for Internet of Things (IoT) applications. However, most blockchain-IoT networks, especially those with a private blockchain, are built on top of an infrastructure-based wireless network (i.e., using Wi-Fi access points or cellular base stations). Hence, they are still under the risk of Single-Point-of-Failure (SPoF) on the network layer, hindering the decentralization merit, for example, when the access points or base stations get failures. This paper presents an Optimized Link State Routing (OLSR) protocol-based solution for that issue in a private blockchain-IoT application. By decentralizing the underlying network with OLSR, the private blockchain network can avoid SPoF and automatically recover after a failure. Single blockchain connections can be extended to multiple ad hoc hops. Services over blockchain become flexible to fit various IoT scenarios. We show the effectiveness of our solution by constructing a private Ethereum blockchain network running on IoT devices (i.e., Raspberry Pi model 4) with environmental data sensing (i.e., Particular Matter (PM)). The IoT devices use OLSR to form an ad hoc network. The environment data are collected and propagated in transactions to a pre-loaded smart contract periodically. We then evaluate the IoT blockchain network’s recovery time when facing a link error. The evaluation results show that OLSR can automatically recover after the failure. We also evaluate the transaction-oriented latency and block-oriented latency, which indicates the blocks have a high transmission quality, while transactions are transferred individually.

Towards Sheaf Theoretic Analyses for Delay Tolerant Networking

Abstract: The goal of Delay Tolerant Networking (DTN) is to take a collection of heterogeneous, disparate connections between satellites, space assets, ground stations, and ground infrastructure and bring it together into a cohesive, functioning overlay network. Depending on the systems being considered, one can find links with a one-way light time exceeding minutes (and hours), periodic links which can sometimes be predicted by orbital mechanics, and restrictions based on the variety of capabilities built into these systems. These characteristics preclude traditional network models and routing techniques and have classically led to either rigid routing tables or purely probabilistic models. As the deeper underlying structures remain unknown, development of more DTN-optimized algorithms has lacked the necessary foundation. In a continuation of previous work, the goal of this paper is to identify and study these fundamental structures that exist in delay tolerant networks (DTN), with a focus on space networks. The current routing methodology has been to use contact graph routing (CGR) algorithms. CGR models a series of known contacts as a static graph. For CGR to work, this graph must be globally consistent and must have an accurate picture of the network. Because this is a globally controlled structure, there is little room for flexibility in the event of changes to the network which would naturally occur as the network grows. As a response to the desire for flexibility as the network changes, we introduced the mathematical structure known as sheaves to DTNs last year. The tag-line for sheaves is that they are a mathematically precise way of gluing local data together into unique global data. Thus, sheaves lend extra power to traditional models (and routing algorithms) by taking additional information and merging it, in as consistent a manner as possible, with the representation itself. The clearest example of how Earth-bound networks exhibit behavior that is “sheafy” is link state routers, which build a local-to-global picture of their network by gluing local information together into a global network, exactly as a sheaf would do. For routing within delay tolerant networks to truly exploit this structure, a deeper structure than a graph is required. In this paper, we develop sheaves that can work over directed graphs such as temporal flow networks, we construct a sheaf representation for Dijkstra's algorithm, and we outline a construction for routing sheaves capable of modeling multicast scenarios. Finally, there is a section of future work suggesting follow-on research.

A Competent Ad-hoc Sensor Routing Protocol for Energy Efficiency in Mobile Wireless Sensor Networks

Abstract: In wireless sensor networks (WSNs), energy utilization plays an essential part in the survival time (survivability) of the network. All the network aspects are redesigned to work in the WSN for lesser energy consumption. In this regard, routing protocol and dynamic topology are very crucial aspects to be noted. In this work, we present a competent ad-hoc sensor routing (CASeR) protocol for delay reduction, reliable data communication, and efficient energy usage in mobile WSNs (MWSNs). It is aimed to cope up with challenging requirements of the rising limited battery powered technologies, which requires low energy consumption and end-to-end delay (EED). Further, the CASeR uses reservation based channel allocation using reservation time division multiple access mobility adaptive cross-layer in dynamic networks and cost based multi-hop communication for packet forwarding and gradient maintenance. The MWSN routing protocols, robust ad-hoc sensor routing, mobility adaptive cross-layer routing, and proactive highly ambulatory sensor routing as well as the mobile ad-hoc network protocols, optimized link state routing and ad-hoc on demand distance vector, measure up with the CASeR. The simulation results show improvements over other routing protocols in energy consumption, EED, queuing delay, and reliable data communication. The competence of this protocol makes it highly suitable to minimize time delay in target applications.

Juniper and Cisco routing policy and protocols for multivendor IP networks

Abstract: From the Publisher: Obtain a clear understanding of how routing information and traffic flows on a multivendor network Routing policies for networks are often complex and not well understood. Many books detail the operation of routing protocols such as OSPF or BGP, but none place the protocols in the context of routing policies and the real world of ISP peering and customer relationships. Once realistic expectations of packet routing behavior are added to the basic routing protocols, routing policies are unavoidable. Fortunately, Walter Goralski sheds some much-needed light on this intricate protocol-policy relationship by offering two important benefits where other routing books fall short. Goralski covers both Juniper and Cisco, and touches on other vendor implementations. Next, he focuses on real routing policy situations–the way routing domains actually work–instead of just detailing the protocol anatomy. Real-world multivendor configuration examples make this a hands-on guide for the network engineer or administrator who needs to optimize network traffic flows. Topics covered include: Addressing and routing Subnets and supernets ISP peering and routing policies Cisco and Juniper Networks router configuration Routing Information Protocol (RIP) Configuring RIP, OSPF, IS-IS, and BGP Routing policies for all networking situations Author Biography: Walter J. Goralski is an instructor and course developer at Juniper Networks, the number-two vendor of network routing products. Goralski has more than 35 years of experience in data communications, including 14 years at AT&T. He has written seven books on networking topics, the most recent one on optical networking.

A secured multiplicative Diffie Hellman key exchange routing approach for mobile ad hoc network

Abstract: As related to environments which possess non-malicious nodes contained in a network, the well-known protocols that are provides by the existing researchers for routing are designed. There are several security threats which are prevented the mobile network development which essentially is an ad hoc network and this is because of the network’s susceptible nature. Hence in order to secure the nodes from anonymous behaviours, an efficient routing algorithm is needed to provide as secure network. Secure routing based multiplicative Diffie Hellman key exchange (MDKE) algorithm is suggested in order to enhance MANET’s security in this research paper and MDKESR is the framework being proposed. In order to enhance the packet delivery ratio, advanced encryption standard (AES) algorithm based encrypted data is utilized in this proposed scheme. By comparing the results security simulation by deployment of the already existing Routing otherwise known as SUPERMAN with IPSec, secure ad hoc on-demand distance vector (SAODV) and secure optimized link state routing (SOLSR) are taken into account in order to show that the proposed frameworks of MDKESR with respect to security which is a wireless communication.

Novel trust evaluation using NSGA-III based adaptive neuro-fuzzy inference system

Abstract: Recently Mobile adhoc networks (MANETs) have received the great attention of researchers as these models provide a wide range of applications. But MANET nodes are prone to various security threats. To overcome this issue, many trust management frameworks have been implemented in the literature. It has been found that the use of machine learning can predict trust values more efficiently. However, machine learning performance suffers from the hyper-parameters tuning and over-fitting issues. Therefore, in this paper, novel trust management is proposed. initially, the Adaptive neuro-fuzzy inference system (ANFIS) is used to train the trust prediction model. Thereafter, a non-dominated sorting genetic algorithm-III (NSGA-III) is used to tune the hyper-parameters of the ANFIS model. Precision, recall, and root mean squared error metrics are used to design a multi-objective fitness function. Optimized link state routing (OLSR) protocol is used for comparative analyses purpose. Three different attacks are applied on the designed network i.e., link spoofing, jellyfish, and gray hole attacks to obtain the dataset. Comparative analysis reveals that the proposed trust evaluation model outperforms the competitive trust evaluation models in terms of various performance metrics such as routing overheads, average end to end latency, packet delivery ratio, and throughput. Thus, the proposed protocol is more secure against various security threats.

Soft-Mesh: A Robust Routing Architecture for Hybrid SDN and Wireless Mesh Networks

Abstract: Wireless Mesh Networks (WMNs) are considered self-organizing, self-healing, and self-configuring networks. Despite these exciting features, WMNs face several routing challenges including scalability, reliability and link failures, mobility, flexibility, and other network management issues. To address these challenges, WMNs need to make programmable to allow modifications of standard techniques to be configured and implemented through software programs that can be resolved by integrating Software Defined Networking (SDN) architecture. SDN, being a cutting-edge technology promises the facilitation of network management as well as routing issues of wireless mesh networks. However, the evolution of the legacy IP-based network model in its entirety leads to technical, operational, and economic problems that can be mitigated by full interoperability between SDN and existing IP devices. This study introduces a Robust Routing Architecture for Hybrid Software-Defined and Wireless Mesh Networks (Soft-Mesh), by systematic and gradual transitioning of WMNs to SDNs in an efficient manner. The main objective of this paper is to suggest improvements to the architecture of the SDN node that allow the implementation of various network functions such as routing, load balancing, network control, and traffic engineering for the hybrid SDN and IP networks. Mininet-WiFi Simulator is used to perform various experiments to evaluate the performance of proposed architecture by creating a hybrid network topology with a varying number of nodes that is 50, 100, 150, 200, and 250 including SDN hybrid and legacy nodes with varying proportion of SDN hybrid and legacy nodes. Results are taken for the average UDP throughput, end-to-end delay, packet drop ratio, and routing overhead while comparing with traditional routing protocols including Optimized Link State Routing (OLSR) and Better Approach to Mobile Adhoc Networking (BATMAN) and with existing hybrid SDN/IP routing architectures including Hakiri and wmSDN. The analysis of simulation results shows that the proposed architecture Soft-Mesh outperforms in terms of the aforementioned performance metrics than the traditional and exiting hybrid routing protocols. Soft-Mesh gives 50% to 70% improved results concerning the incremental proportion of SDN hybrid nodes.

A dynamic source routing protocol based on path reliability and link monitoring repair

Abstract: The two most essential factors for mobile self-organizing networks applicable to drones are reliability and stability. In harsh communication environments, such as mountainous regions and natural disasters, the use of satellites and terrestrial communication stations has severe time delays due to the high speed of UAVs, resulting in frequent communication interruptions with UAVs. Therefore, UAVs need to establish self-organizing networks for communication and information sharing. High-speed movement will lead to rapid changes in the network topology, resulting in established links being in an unstable connection state and even frequent routing errors, thus preventing the establishment of stable communication links. In order to improve the communication quality of UAVs under high-speed movement, we propose a dynamic source routing protocol based on path reliability and monitoring repair mechanism (DSR-PM). The model performs data transmission by filtering the best reliability path. The link state information is monitored during transmission and broken links are repaired in time to ensure the communication stability and reliability of the links and improve the data transmission efficiency. We simulated the approach in NS2 software and the simulation results show that the DSR-PM protocol effectively reduces parameters such as overhead, packet loss and delay, improves network throughput, and provides better communication performance.

Flexible multipoint relay selection for suitable route in mobile ad hoc networks

Abstract: The dynamic formations of the mobile ad hoc networks require routing protocols to handle the routing requirements in run-time. The purpose of this work is to improve the endurance, quality, and trust of the path chosen by the link state routing in mobile ad hoc networks. The multipoint relay concept has been fascinating in link sate routing optimization to reduce duplicate retransmissions in the same region. In this paper, we present the notion of flexibility and suitability in choosing the multipoint relays. A suitable multipoint relay selection algorithm has been proposed to choose the appropriate multipoint relays which are trustworthy, restrain appropriate residual battery and possess a good quality link for interconnections. The algorithm also takes care of the willingness, reachability, degree, and the relative mobility of the nodes in the selection process. The results illustrate that the selection of the appropriate relay nodes offers substantial improvements.

Novel Fuzzy Based Crow Search Optimization Algorithm for Secure Node-to-Node Data Transmission in WSN

Abstract: Various sensor nodes are interconnected with each other in wireless sensor network (WSN). WSN communicates to every node within the network wirelessly to collect data regarding the surrounding environment and send the particular data to the destination/centralised location. The sensor nodes transmit the data and the source sensor node transmits data to destination sensor nodes through various intermediary sensor nodes. Thus, secure transmission is required in which WSN must be free from malicious nodes to achieve safe transfer. In this paper, our objective is to provide secure data transmission in an efficient manner from source to destination through a trust based path namely novel fuzzy based crow search optimization algorithm (F-CSO) and optimised link state routing protocol (OLSR) protocol. Through NS3 tool, nodes are deployed in the network area and novel F-CSO is performed with respect to three parameters such as distance, degree and transmission energy. The best nodes are considered for optimization process and it must satisfy the three conditions such as lower distance between each node for transmitting the data, higher degree and higher energy for transmission. A set of nodes that satisfies this condition are gathered by the fuzzy rule technique and then further optimised by crow search optimization technique leading to exact nodes through which trust based transmissions are performed. Further, routing can be achieved by the OLSR protocol. The performance of the proposed system is compared with existing studies with respect to the system for detecting the malicious nodes with and without utilizing proposed F-CSO in terms of execution time, throughput, and packet delivery ratio. The evaluation result has shown that malicious nodes is detected in an efficient manner through the use of F-CSO, showing better results with various parameters.

Online Learning for Shortest Path and Backpressure Routing in Wireless Networks

Abstract: We consider the adaptive routing problem in multihop wireless networks. The link states are assumed to be random variables drawn from unknown distributions, independent and identically distributed across links and time. This model has attracted a growing interest recently in cognitive radio networks and adaptive communication systems. In such networks, devices are cognitive in the sense of learning the link states and updating the transmission parameters to allow efficient resource utilization. This model contrasts sharply with the vast literature on routing algorithms that assumed complete knowledge about the link state means. The goal is to design an algorithm that learns online optimal paths for data transmissions to maximize the network throughput while attaining low path cost over flows in the network. We develop a novel Online Learning for Shortest path and Backpressure (OLSB) algorithm to achieve this goal. We show theoretically that OLSB achieves a logarithmic regret, defined as the loss of an algorithm as compared to a genie that has complete information about the link state means. Simulation results support the theoretical findings and demonstrate strong performance of the OLSB algorithm.

A multi-hop routing protocol based on link state prediction for intra-body Wireless Nanosensor Networks

Abstract: As a network that communicates human health information, iWNSNs (in-vivo Wireless Nanosensor Networks) must be able to detect and report back to human health in real time, and low delay and high reliability are required in iWNSNs. In view of the unstable link state in iWNSNs, a multi-hop routing protocol based on link state prediction called MRLSP is proposed. The protocol proposes a link state estimation based on Kalman filtering. In addition, an ultrasonic energy harvesting system is introduced to intermittently charge nanonodes. In the routing process, the protocol first ensures the forwarding direction of the data packet by limiting the range of the next hop node, and uses the historical state and current information of the link to estimate the link state. Finally, a fuzzy system is established using the link state, the distance and the node’s remaining energy. We use the fuzzy logic output as the criterion to select the next hop node to ensure that fewer hops complete the forwarding and successful transmission of the packet. The simulation results verify that MRLSP has advantages in end-to-end delay and data packet transmission success rate, and can maximize network performance while ensuring sufficient node energy.

Enhanced route optimization technique and design of threshold-T for malicious node detection in ad hoc networks

Abstract: MANET has attracted popularity due to the tremendous use of internet and its allied resources, the ease of deployment and features of MANET keeps it ahead in wireless domain and gaining recognition in the networking domain, but it is true that the security is at stake and researchers have to put additional efforts for developing standardize architecture for securing wireless networks. The preventive measures encryption, authentication and cryptography fails to detect newer attacks that leads wireless network more susceptible than wired. Continuous node mobility causes frequent changes in the topology and link state. The noise collision, fading issue and interference are majorly responsible for making the wireless networks more prone to failure. Along with the rigid less infrastructure, the MANET faces the challenge from false positive and false negative for deciding the threshold value-T and intended intruder/malicious nodes with accuracy. The value of ‘T’ should be designed and chosen properly in between the true and false alerts. Along with these, the route optimization also plays very important role in ad hoc network. If there are multiple routes, then optimum path free from malicious nodes must be chosen from source to destination. The research paper mainly focuses on formation of cluster and cluster head, optimum path and designing the Threshold-T.

An OLSR-based Geocast Routing Protocol for Vehicular Ad Hoc Networks

Abstract: In some Vehicular Ad Hoc Networks (VANETs) applications, the geocast routing protocol is used for data transmission from a source vehicle to a group of vehicles located in a common region. Efficient data transmission to the destination region is one of the critical challenges of geocast routing protocols. In this research, the geocast routings are considered that exploit rateless coding to improve the reliability, and so packet delivery ratio. Some of these geocast routing methods use flooding schemes to deliver the messages to the destination region. However, in order to cut high overheads caused by flooding schemes, the routing protocols that use unicast routes for data delivery have been taken into account. In this way, recent geocast routing protocols exploit on-demand unicast routing methods such as Ad-hoc On-Demand Distance Vector (AODV) to deliver the packets to the destination region and then broadcast them in that area. However, the packet delivery ratio and the delay of those methods are respectively lower and higher than flooding-based methods. This paper proposes to exploit the table-driven Optimized Link State Routing (OLSR) protocol to deliver the messages to the destination region. To customize the OLSR protocol for geocasting, we propose a number of modifications to message flows and data exchanges. Compared to on-demand geocast protocols, OLSR imposes lower message delay and delivers more messages to the destination region at a higher overhead expense. To overcome this overhead, we also propose algorithms to adjust the control message intervals of the OLSR protocol in each node. Simulation results show that our OLSR-based protocol demonstrates better performance in terms of delay and packet delivery ratio than those of the traditional AODV-based method and CALAR-DD protocol regarding various vehicles' densities, vehicles' velocities, message sizes, and destination region sizes. Compared to the traditional OLSR, using the tuned OLSR-based method has also significantly reduced the signaling overhead costs.

YANG Data Model for Segment Routing

Abstract: This document defines a YANG data model ([RFC6020], [RFC7950]) for segment routing ([RFC8402]) configuration and operation. This YANG model is intended to be used on network elements to configure or operate segment routing. This document defines also generic containers that SHOULD be reused by IGP protocol modules to support segment routing.

RON-enhanced blockchain propagation mechanism for edge-enabled smart cities

Abstract: Edge computing can serve latency-sensitive data generated by smart IoT devices in smart cities, which cannot be accommodated by cloud services. However, edge-enabled smart cities applications face many security issues such as massive centralization, vulnerability to tampering, and tracing difficulty. Blockchain, as an emerging ledger technology, can be a useful solution to these problems. However, due to network propagation delay, blockchain fork may occur in the network of edge-enabled smart cities at some time. It can lead to double payment attacks and damage data integrity. To address this issue, this paper proposes a blockchain network propagation mechanism based on the resilient overlay network (RON) for edge-enabled smart cities. Firstly, it reconstructs the networking mode between the blockchain nodes in smart cities based on RON so that the blockchain nodes can quickly detect the link state of the Internet in smart cities. The shortest path algorithm and policy routing are then applied to construct the propagation path between the blockchain nodes to optimize the Gossip propagation mechanism and enhance the QoS and QoE. Simulation results show that the RON-based blockchain network propagation mechanism for edge-enabled smart cities is beneficial in terms of average route hop count, transmission success rate, routing overhead, average delay, and reduced fork probability.

An optimized mobile similarity and link transmission quality routing protocol for urban VANETs

Abstract: Reliable communication is always one of the requirements of vehicular ad-hoc networks (VANETs). However the high speed mobile nodes and dynamic topology structure of VANETs means it is difficult to get a stable link between vehicles. Toward this end, we propose an optimized mobile similarity and link transmission quality routing (OMSLTQR) to select routing nodes and maintain the quality of communication link. Mobile similarity and link transmission quality are two basis for routing selection. To get the speed information for mobile similarity calculation, we modify the frame structure. The local information frame is redesigned to save and transmit link selection information. We also propose an algorithm based on OMSLTQR to find the routing neighbor set. Simulation results shows that our OMSLTQR achieves better system performance than optimized link state routing in terms of end-to-end delay and successful transmission rate.