Multipoint Relay Research Articles

Optimizing Routing Protocol Design for Long-Range Distributed Multi-Hop Networks

The advancement of communication technologies has facilitated the deployment of numerous sensors, terminal human–machine interfaces, and smart devices in various complex environments for data collection and analysis, providing automated and intelligent services. The increasing urgency of monitoring demands in complex environments necessitates low-cost and efficient network deployment solutions to support various monitoring tasks. Distributed networks offer high stability, reliability, and economic feasibility. Among various Low-Power Wide-Area Network (LPWAN) technologies, Long Range (LoRa) has emerged as the preferred choice due to its openness and flexibility. However, traditional LoRa networks face challenges such as limited coverage range and poor scalability, emphasizing the need for research into distributed routing strategies tailored for LoRa networks. This paper proposes the Optimizing Link-State Routing Based on Load Balancing (LB-OLSR) protocol as an ideal approach for constructing LoRa distributed multi-hop networks. The protocol considers the selection of Multipoint Relay (MPR) nodes to reduce unnecessary network overhead. In addition, route planning integrates factors such as business communication latency, link reliability, node occupancy rate, and node load rate to construct an optimization model and optimize the route establishment decision criteria through a load-balancing approach. The simulation results demonstrate that the improved routing protocol exhibits superior performance in node load balancing, average node load duration, and average business latency.

A Link’s Fineness Based on Spatial Relation for Multipoint Relays Selection Algorithm in Mobile Ad Hoc Networks Algorithm

The propagation of wireless mobile equipment has given rise to mobile ad hoc networks (MANET), which allow the establishment of networks deprived of infrastructure support. The improvements in these technologies have also resulted in the variety of link quality, scalability, stability and reachability limits. Principally, due to their incapability to guarantee node reliability, MANETs are weak in highly dynamic environment. Since high-speed nodes, low density, and rapid changes in the topology are directly damage networks performances and lifetime. In response, routing is an inspiring issue in these networks. This paper proposed a new routing scheme in MANETS. This technique is integrated in the optimized link state routing (OLSR). In the projected scheme, the author defines a link fineness based on spatial relation between mobile nodes, which exploits different parameters, speed, direction and acceleration, including the sent and received of hello packets. Correspondingly, the proposed selected multipoint relays (MPRs) based the projected methods is included in the algorithm. The scheme elected more stable MPRs with high link’s quality, more neighborhood degree and higher willingness as MPR that can increase the reachability and stability of the network even in an extremely dynamic situation. This version of OLSR is verified by the network simulator (NS3) under the Radom Waypoint mobility model. Results revealed an important improvement for SLF_OLSR. In addition, this scheme can be integrated into other protocols in MANETs.

An Improved Routing Protocol for Optimum Quality of Service in Device-to-Device and Energy Efficiency in 5G/B5G

Some challenges when implementing the optimized link state routing (OLSR) protocol on real-life devices and simulators are unmanageable: link quality, rapid energy depletion, and high processor loads. The causes of these challenges are link state processing, unsuitable multipoint relay (MPR) nodes, and information base maintenance. This paper proposes a structured, energy-efficient link sensing and database maintenance technique. The improved OLSR in the paper replaces the OLSRv2’s HELLO, HELLO, and Topology Control (TC) message sequence with a new sequence. MPR nodes are not mandated to broadcast TC messages if the number of nodes and their OLSRv2 addresses remain unchanged after subsequent broadcasts or if no node reported 2-hop symmetric connections. The paper further proposes an MPR selection technique that considers four parameters: node battery level, mobility speed, node degree, and connection to the base station for optimum relay selection. It combines the four parameters into one metric to reduce energy dissipation and control routing overhead. The modifications were implemented in NS-3, and the simulation results show that our improved OLSR outperforms the existing OLSR, OLSRv2 and other improved routing protocols in energy consumption, routing overhead, the packet delivery ratio and end-to-end delay, as compared to the related literature.

Network Stability Based Multicriteria Weighted MPRs Selection Algorithm for Mobile Ad Hoc Networks

Manets are self-governing networks using several mobile nodes, which communicate together through wireless media, without the necessity of prior infrastructure. Therefore, due to highly dynamic and unconfident environments, Manets are weak to guarantee link lifetime, security, reliability and stability. Since, mobility, energy and security are the main factors for improved performance in the network. Paths and relay devices with enhanced stability and security are considered as critical subjects. The study suggests an improved process based on a Multicriteria purpose consistent with numerous systems of measurement. These systems of measurement are energy level, trust measure and mobility of mobile nodes. The concept is to select improved Multipoint relays (MPRs) able to transmit data efficiently, and increase lifetime and reachability. The proposed improvement supports the routing and the selection of paths. The selection of the greatest effective relay nodes can enhance the classification performance. The scheme is based on the OLSR protocol and performance results are defined using the network simulator (NS3) with different movement models. The results showed significant improvements in MCW_OLSR. The proposed version enhances network proficiency for different mobile environments.

Improved MPR Selection Algorithm-Based WS-OLSR Routing Protocol

Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WSOLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.

Disaster scenario optimised link state routing protocol and message prioritisation

AbstractNatural and artificial (human‐made) disasters have been steadily increasing all over the world, signifying the importance of providing reliable and energy friendly communication network to survivors in the aftermath of a disaster. On the other hand, low‐battery devices running optimised link state routing (OLSR) protocol often experience quick power failure which restricts their ability to communicate for a necessary period during rescue operations. To extend the lifespans and prioritise message delivery on low‐battery devices, the authors examine disaster scenario optimised link state routing (DS‐OLSR) protocol ALERT message and propose an innovative solution to prioritise messages based on the device battery energy level, leading to more energy conservation, packet delivery as well as better emotional state of survivors. An ALERT message is a novel message type added to mobile ad‐hoc network's (MANET) popular OLSR protocol for energy efficiency. The proposed DS‐OLSR Protocol and Message Prioritisation (DS‐OLSRMP) as an extension of DS‐OLSR modifies the multipoint relay mechanism and uses a prioritisation technique which classify nodes into four priority groups: Critical, High, Medium, and Low priorities. These priority groups help in prioritising both message delivery and message status notifications for devices with low battery energy. The DS‐OLSRMP was implemented in a Network Simulator, version 3.29 and compared with DS‐OLSR, OLSRv1 and OLSRv2. The simulation results show that DS‐OLSRMP performs better than DS‐OLSR, OLSRv1 and OLSRv2 in terms of energy conservation and packets delivery in the simulation of both sparse and dense network scenarios.

A smart filtering-based adaptive optimized link state routing protocol in flying ad hoc networks for traffic monitoring

Nowadays, the use of drones as a fundamental element of smart cities has attracted the attention of many researchers to monitor and control the traffic of vehicles. Because of the high flexibility of multi-drone systems, like flying ad hoc networks (FANETs), they provide various services and improve modern life in smart cities. However, due to the unique features of FANET, especially the high speed of drones and rapid changes in network topology, communication reliability is a serious challenge in this network. Hence, traditional routing protocols, such as optimized link state routing (OLSR) scheme, cannot work well in these networks. In this paper, a smart filtering-based adaptive optimized link state routing (SFA-OLSR) scheme is proposed in FANETs. To increase adaptability to the FANET environment, SFA-OLSR provides a new solution to adjust the hello broadcast period so that each flying node specifies its broadcast period based on a new scale called cosine similarity between real and predicted positions. Furthermore, in SFA-OLSR, each flying node develops a filtering algorithm based on two parameters, namely link lifetime and remaining energy. The purpose of this algorithm is to reduce the size of the single-hop neighboring set of each flying node and minimize the search space when finding multi-point relays (MPRs). This increases the convergence speed of the algorithm. Then, SFA-OLSR exploits the sparrow search algorithm (SSA) to single out the best MPRs. This algorithm introduces a multi-objective function by focusing on three components, including energy, link lifespan, and neighbor degree. Lastly, the simulation process of SFA-OLSR is performed by the NS3 simulator. This process evaluates the performance of the proposed method and three schemes, namely Gangopadhyay et al., P-OLSR, and OLSR-ETX. These evaluations show that SFA-OLSR has a good performance in terms of three scales, namely packet delivery ratio, delay, and throughput, but its overhead is more than other methods.

A Comprehensive Evaluation Algorithm of Multi-Point Relay Based on Link-State Awareness for UANETs.

The Multi-Point Relay (MPR) is one of the core technologies for Optimizing Link State Routing (OLSR) protocols, offering significant advantages in reducing network overhead, enhancing throughput, maintaining network scalability, and adaptability. However, due to the restriction that only MPR nodes can forward control messages in the network, the current evaluation criteria for selecting MPR nodes are relatively limited, making it challenging to flexibly choose MPR nodes based on current link states in dynamic networks. Therefore, the selection of MPR nodes is crucial in dynamic networks. To address issues such as unstable links, poor transmission accuracy, and lack of real-time performance caused by mobility in dynamic networks, we propose a comprehensive evaluation algorithm of MPR based on link-state awareness. This algorithm defines five state evaluation parameters from the perspectives of node mobility and load. Subsequently, we use the entropy weight method to determine weight coefficients and employing the method of Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for comprehensive evaluation to select MPR nodes. Finally, the Comprehensive Evaluation based on Link-state awareness of OLSR (CEL-OLSR) protocol is proposed, and simulated experiments are conducted using NS-3. The results indicate that, compared to PM-OLSR, ML-OLSR, LD-OLSR, and OLSR, CEL-OLSR significantly improves network performance in terms of packet delivery rate, average end-to-end delay, network throughput, and control overhead.

Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimized Link State Routing-Based for VANET

The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.

Estimation of the Achievable Performance of Mobile Ad Hoc Networks with Optimal Link State Routing

The paper explores the challenges of constructing self-organizing wireless mobile ad hoc networks (MANETs) utilizing Optimal Link State Routing (OLSR) with MPR (MultiPoint Relay) optimization and quality control through the RSVP (Resource Reservation Protocol). Analytical expressions are presented for calculating the achievable network characteristics, including route acquisition time, network efficiency (routing overhead), packet transmission delay (end-to-end delay), and signal propagation losses between nodes assuming no packet collisions within the network nodes. The possibility of network scalability is analyzed depending on the scenarios of operation and the number of network nodes. Recommendations for the construction and scalability of self-organizing wireless networks are formulated based on the conducted evaluations and calculations.

Election of MPR Nodes and Detection of Malicious Nodes Based on a Byzantine Fault in the OLSR Protocol Case of a Scale-Free Network

V2X (Vehicle-to-Everything) communications play a crucial role in enabling the efficient and reliable exchange of information among vehicles, infrastructure, and other entities in smart transportation systems. However, the inherent vulnerabilities and dynamic nature of V2X networks present significant challenges for ensuring secure and trustworthy communication. By enhancing the security of the OLSR (Optimized Link State Routing) protocol through secure MultiPoint Relays (MPRs) Selection, this research aims to provide a robust approach that enhances the overall security posture of V2X networks, enabling safe and secure interactions between vehicles and their environment. The proposed method is based on the Byzantine general’s problem, which is the principle used in blockchain. Compared to the classical flooding mechanism, this technique greatly reduces network traffic overhead and improves the efficiency of bandwidth utilization. The results demonstrated that the proposed algorithm performed better than the well-used UM-OLSR implementation. The outcome proved that our MPR election algorithm guarantees a better packet delivery ratio, and it also performs very well in the detection and isolation of malicious nodes, leading to increased security of the OLSR protocol control plane.

New approach for selecting multi-point relays in the optimized link state routing protocol using self-organizing map artificial neural network: OLSR-SOM

In order to improve the selection of multi-point relays (MPRs) by a node node performing the computation (NPC) in the optimized link state routing (OLSR) protocol and therefore to guarantee more security for the routing in the mobile ad hoc network (MANET), we propose new approach that could distinguish between the strong and weak MPRs in the list of MPRs already selected using the standard algorithm described in RFC3626 document. This approach is based on self organizing map (SOM) artificial neural network that processes the collected data and then only selects the strong MPRs using a set of criteria allowing a reliable retransmission and a strong link and therefore better network performances. The obtained results, from the simulations that have been carried out using a customized network simulator 3 (NS3) network simulator, show an improvement in terms of throughput, packets delivery ratio (PDR) and the security of the network compared to the standard approach.

OCI-OLSR: An Optimized Control Interval-Optimized Link State Routing-Based Efficient Routing Mechanism for Ad-Hoc Networks

MANET (Mobile Ad hoc Networks) functionality is determined by routing protocols’ ability to adjust to atypical changes in information and communication technologies, topological systems, and connection status. Due to interference, node migration, the growth of several pathways, security, and propagation loss, MANET network configurations are dynamic. The proactive routing protocol enhances the message flow utilized in the neighborhood discovery process by using the multipoint relays (MPR) approach. In order to increase the protocol’s effectiveness and efficiency while maintaining the OLSR protocol’s reliability, the research presented in this paper proposed an improved OCI-OLSR (Optimized Control Interval-Optimized Link State Routing) that focuses on better control interval management, an advanced MPR selection process, reducing neighbor hold time as well as decreasing flooding. The suggested proposed protocol was examined using the NS3 simulator, and it was compared to the standard OLSR version and AODV(Ad-hoc On-Demand Routing) routing protocol. According to the analysis’s findings, the suggested system has a lot of promise in terms of a variety of performance metrics under diverse conditions. Overall, the article makes the case that the OCI-OLSR protocol may enhance the performance of the regular OLSR protocol in wireless ad hoc networks by addressing a number of the protocol’s flaws.

An energy-aware routing method using firefly algorithm for flying ad hoc networks

Flying ad-hoc networks (FANETs) include a large number of drones, which communicate with each other based on an ad hoc model. These networks provide new opportunities for various applications such as military, industrial, and civilian applications. However, FANETs have faced with many challenges like high-speed nodes, low density, and rapid changes in the topology. As a result, routing is a challenging issue in these networks. In this paper, we propose an energy-aware routing scheme in FANETs. This scheme is inspired by the optimized link state routing (OLSR). In the proposed routing scheme, we estimate the connection quality between two flying nodes using a new technique, which utilizes two parameters, including ratio of sent/received of hello packets and connection time. Also, our proposed method selects multipoint relays (MPRs) using the firefly algorithm. It chooses a node with high residual energy, high connection quality, more neighborhood degree, and higher willingness as MPR. Finally, our proposed scheme creates routes between different nodes based on energy and connection quality. Our proposed routing scheme is simulated using the network simulator version 3 (NS3). We compare its simulation results with the greedy optimized link state routing (G-OLSR) and the optimized link state routing (OLSR). These results show that our method outperforms G-OLSR and OLSR in terms of delay, packet delivery rate, throughput, and energy consumption. However, our proposed routing scheme increases slightly routing overhead compared to G-OLSR.

Optimal Relay Selection Strategy for Efficient and Reliable Cluster-Based Cooperative Multi-Hop Transmission in Vehicular Communication

Routing is the key issue for Vehicular Networks since each node in the network has mobility. The dynamic nature of vehicular networks increases with mobility and the consequence is reflected in controlling traffic overhead. As a result, the routing technique and the type of node mobility information are completely dependent on building dependable end-to-end communication links. To address these challenges, a Reliable Cluster-based Multi-Hop Cooperative Routing (RCCR) strategy was proposed by using velocity, distance, and link quality parameters. This algorithm obtains the tradeoff between Quality of Service (QoS) and mobility constraints over link parameters. It improves routing scalability by electing cluster heads and selecting Multi-Point Relays (MPRs) while considering mobility constraints and QoS needs. The proposed technique determines the link quality for every pair of nodes based on values of signal strength and distance parameters. The relay vehicles are chosen based on the highest possible QoS value, which is calculated to assure route stability, reliability, and durability. The heuristic limitations of the multi-point relay selection strategy are handled by considering the link quality, distance from the source vehicle, and cluster-head coverage area to enhance the performance of the multi-hop network with tolerable End-to-End transmission delay. Further, we obtained an optimal number of cooperative vehicles in every hop. Finally, simulation results demonstrate the effectiveness of the proposed algorithm compared to other state of art algorithms.

Blockchain-Empowered Efficient Data Sharing in Internet of Things Settings

Sharing data across various Internet of Things (IoT) devices has been a common challenge due to efficiency, security, and stability issues. Blockchain, with security features, is considered to be a potential solution for data sharing in IoT settings. However, traditional blockchain-based solutions cannot satisfy the efficiency requirement of high-frequency data sharing among IoT devices. In this paper, we propose an efficient IoT data sharing approach by adopting the Payment Channel Network (PCN)-extended blockchain. Besides, we develop a homomorphic hashing-based transaction segmentation scheme to solve the issue of low transaction success ratio caused by channel deposit restrictions in PCN. In addition, a Multi-point Relay (MPR)-based multi-path routing scheme has been developed to ensure high-frequency transaction forwarding. The communication overhead of maintaining the routing table is reduced by our proposed Multi-point Relay Selection algorithm, and multiple alternate paths generated by Multiple Routing Path algorithm can improve the transaction success rate. Experiment evaluations have demonstrated that that our proposed approach outperforms the baseline approaches in terms of the transaction efficiency and success ratio.

WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying Search Algorithm

The routing protocol is considered the backbone of network communication. However, mobility and bandwidth availability make optimizing broadcast message flooding a problem in an Optimized Link State Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-OLSR) is investigated to enhance the existing MPR-based solution, arguing that considering a cost function as a further decision measure will effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm phenomenon in VANETs.

Proficient link state routing in mobile ad hoc network‐based deep Q‐learning network optimized with chaotic bat swarm optimization algorithm

SummaryMobile ad‐hoc network (MANET) is a category of ad‐hoc network that can be reconfigurable its network. MANETS are self‐organized networks, that can use the wireless links to connect various networks via mobile nodes: but it consumes more energy and it also has routing problems. This is the major drawback of being connected with the MANET technology. Therefore, this study proposes a new protocol as deep Q‐learning network optimized with chaotic bat swarm optimization algorithm (CBS)‐based optimized link state routing (OLSR) (CBS‐OLSR) for MANET. This protocol reduces MANET energy usage and adopts OLSR multi‐point relay (MPR) technology. MANET's OLSR and the CBS algorithm utilize a similar method to locate the best optimum path from source to destination node. By embedding the new improved deep Q‐learning and OLSR algorithms, both are used for optimizing the MPR sets selection, it can efficiently diminish the energy consumption in the network topology, but automatically increase the lifespan of the network. It also enhances the package delivery ratio and decreases end‐to‐end delay. The experimental outcomes prove that the proposed protocol is reliable and proficient that is appropriate for numerous MANET applications.

OLSR+: A new routing method based on fuzzy logic in flying ad-hoc networks (FANETs)

Flying ad-hoc networks (FANETs) have many applications in military, industrial and agricultural areas. Due to specific features of FANETs, such as high-speed nodes, low density of nodes in the network, and rapid changes in the topology, most routing protocols designed for mobile ad hoc networks (MANETs) or vehicular ad hoc networks (VANETs) are not compatible with FANETs. In this paper, we propose a fuzzy logic-based routing approach called OLSR+ for FANETs. In this scheme, we seek to improve the optimized link state routing protocol (OLSR) so that it can efficiently be used in FANETs. OLSR+ includes four main phases: 1) Discovering neighboring nodes. In this phase, we propose a new and efficient technique for estimating the lifetime of the link between two unmanned ariel vehicles (UAVs) based on the link quality, distance, relative velocity, and movement direction. 2) Selecting multipoint relays (MPRs). In this phase, we present a fuzzy mechanism for selecting a set of MPR nodes. According to this mechanism, when a node has higher residual energy, higher link lifetime, and more neighborhood degree compared to others, it achieves more fitness to be selected as MPR. 3) Discovering the network topology. In this phase, we modify the format of the topology control (TC) message and add two fields, including route energy and route lifetime to this message. 4) Calculating the routing table. In OLSR+, we consider two parameters, including route energy and route lifetime, for establishing stable paths. Finally, we simulate OLSR+ using NS3 and compare its performance with two methods, namely greedy optimized link state routing (G-OLSR) and optimized link state routing (OLSR). The simulation results show that OLSR+ successfully reduces delay compared to G-OLSR and OLSR. In addition, it has higher packet delivery rate and throughput than others. Also, it improves energy consumption in the network. However, OLSR+ has more routing overhead than G-OLSR.

Analysis of routing and security issues in OLSR protocol for video streaming over MANET

Mobile ad-hoc networks (MANETs) are autonomous, self-organizing networks without infrastructure support. The nodes in MANET network are dynamic and these nodes create creates a topological map through exchange of routing information defined by some set of rules called routing protocols which are further classified as proactive, reactive and hybrid. OLSR is proactive type of protocol which is widely used in MANET. The basic principal of OLSR is based on selection of Multipoint Relays (MPR) through flooding mechanism. There have been many enhancements in OLSR routing protocol to improve routing and security issues. But there is still a very vital scope for enhancement in OLSR to overcome these issues. In this paper, we review the different enhancements in OLSR and attempt to find out different routing and security challenges that can be further enhanced in OLSR for video streaming over MANET