Multipoint Relay Research Articles

Multipoint Relay Selection based on Stability of Spatial Relation in Mobile Ad hoc Networks

Increasing stability is one of the main objectives in designing routing protocols for Mobile Ad-Hoc Network (MANETS). Various research schemes have been addressed to this challenge and to support it. In fact, some papers have considered modifications to MPRs selection mechanism in OLSR. In this paper, the author proposes a new mechanism to elect stable and sustainable nodes relay between all nodes in MANETs. In this mechanism, a mobility function is used as the main selection criterion based on the calculation of the spatial relation of a node relative to its neighbor. This mechanism is applied in OLSR protocol to choose stable and supportable MPRs nodes. This mechanism significantly finds more stable MPRs and it promises QoS metrics such as lost packets and delay. Simulation results reveals a significant performance gains and it motivates further examinations to develop the mechanism in order to improve the routing protocol requirements. Performances are evaluated based on Random Waypoint model and network simulator ns3.

Performance Analysis of OLSR Protocol in Mobile Ad Hoc Networks

Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the Random Waypoint model (RWP), Random Direction model (RD), Nomadic Community model (NC), and the Reference Point Group Model (RPGM) with a low as well as high random range mobility of the nodes. Moreover, BonnMotion Software and Network simulator NS-3 used to implement the simulation scenarios. Further, the performance of the OLSR protocol analyzed and evaluated based on latency, routing overhead, and packet loss ratio metrics. According to the results, the OLSR protocol provides the best performance over the RWP model in a low mobility environment, whereas the Nomadic mobility model is suitable for OLSR protocol in a high mobility environment.

Performance Analysis of OLSR Protocol in Manet Considering Different Mobility Speed and Network Density

A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly, thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable and consistent connectivity between the mobile nodes. They conclude logically based on the interaction between mobile nodes in MANET routing and encourage them to choose the optimum path between source and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as the optimized variant of link state routing in which packets are sent throughout the network using the multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol under condition of changing mobility speed and network density. The study's performance indicators are average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2 (NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise redundant data transmission during the normal message broadcast. The MPRs enhance the link state protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired broadcasts can be reduced and limited. Further research will focus on different scenario and environment using different mobility model.

Proposed emerged and enhanced routing protocols for wireless networks

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as DS-ZRP routing protocol. The third proposed routing protocol is designed based on using the advantaged of multipoint relays in OSLR protocol with the advantages of route cashing in DSR protocol, and we named it as OLS-DSR routing protocol. Then, some experimental tests are doing by demonstration case studies and the experimental results proved that our proposed routing protocols outperformed than current wireless routing protocols in terms of important network performance metrics such as periodical broadcast, network control overhead, bandwidth overhead, energy consumed and latency.

A V2V charging allocation protocol for electric vehicles in VANET

This paper tackles the problem of the propagation of charging information in Vehicular Ad-hoc Networks (VANETs) and the decentralized allocation of Vehicle-to-Vehicle (V2V) charging pairs. Electric Vehicles (EVs) have gained the attention of various sectors as a green alternative to the air-polluting fuel-based vehicles. However, due to the limitation of the EVs' battery capacity and the shortage in the number of charging stations causing significant waiting time to charge, V2V charging has emerged as a promising solution to help address these issues. Mainly, V2V solutions need to define two mechanisms: an information dissemination mechanism and a charging pairs allocation mechanism. In the literature, two architectures are proposed: centralized and semi-distributed using VANET. However, in addition to suffering from the single point of failure problem, centralized solutions consider only connected vehicles during the charging pair allocation. On the other hand, existing VANET based solutions address the problem of charging information dissemination while still performing the allocation of V2V charging pairs in a centralized way. In this paper, we propose an ad-hoc-based solution for V2V charging where both information dissemination and charging pairs allocation are performed over VANET. To do so, at the application layer of VANET, a decentralized protocol for V2V is proposed. This protocol is divided into two phases: providers announcement where consumers in the network can discover the nearby providers, and provider-consumer allocation where providers select the appropriate consumer based on the received OFFERs. At the network layer, Quality of Service-Optimized Link State Routing (QoS-OLSR) is used to find routing paths using the Multi-Point Relays (MPRs). These MPRs are in fact utilized by the protocol to propagate the announcement of the providers to the network. The simulation results show high performance of the proposed protocol in terms of packet delivery ratio and end-to-end delay. In addition, in terms of payoff and allocation rate, the proposed protocol performs better than centralized allocation in the presence of disconnected EVs.

Blockchain-based distributed management system for trust in VANET

Blockchain technology is gaining a lot of ground as a research topic lately. Wireless ad hoc network researchers are studying and applying blockchain to solve security and reliability issues. Blockchain is a distributed database maintained by multiple nodes in the network, and it is used as a solution to trust and security issues. Within a vehicular ad hoc network (VANET), vehicles provide mutual road safety by generating and broadcasting messages. However, due to the lack of trust in these networks, the reliability of the messages exchanged is questionable. To alleviate this problem, reputation systems have been proposed. Howbeit, these systems require trust and rewards management. Due to the characteristics of VANET, most safety systems require repetitive processes that have a direct impact on performance (resources). The proposed system provides all vehicles in the network with a distributed, highly secure and tamper-proof common framework for routing in VANETs using the Blockchain. In order to incorporate the Blockchain into the VANETs, we use the Optimized Link State Routing (OLSR) as a characteristic protocol. The OLSR is a routing protocol that presents several security concerns because its routing mechanism is based on the availability of a small group of nodes called Multi-point Relay (MPR), and the security mechanisms are executed at each node individually with repetitive processes to be performed. In our contribution, we use blockchain, as a reliable and highly secure technology, to solve OLSR security issues, motivating (rewarding) vehicles to collaborate and avoiding repetitive detection processes. The simulation shows that our system is very efficient to be used in environments with limited resources like VANET. Detection time and detection overhead are reduced, as isolation of malicious nodes increases the efficiency of the detection process.

ECHO: Efficient Zero-Control-Packet Broadcasting for Mobile Ad Hoc Networks

Applications such as collaborative mapping motivate a need for network-wide broadcasting in Mobile Ad Hoc Networks (MANET) with low-rate long-range links. Existing MANET protocols are inadequate in such low-capacity regimes due to their high use of control packets. We present a novel protocol called ECHO that constructs and maintains a broadcast backbone without using any control packets. Instead, using a field in the data packet header, a node transmits and listens for an “echo” of the specific packet to determine its membership in the backbone. ECHO is deterministic, source-independent, fully distributed, accommodates mobility, and balances battery consumption across nodes. We prove ECHO’s correctness and show that its communication complexity is lower than that of Multi-Point Relay (MPR) and Flooding, and comparable to that of Opportunistic Announcement (OA). Simulations over random mobile low-capacity networks show that ECHO provides at least a 30 percent better delivery ratio than Flooding, MPR, and OA for 50-node networks and dramatically reduces the communication load. Experiments on a 12-node testbed of goTenna mobile mesh networking devices show that ECHO reduces transmissions by about 3x and increases battery life by more than 50 percent over Flooding. ECHO’s performance advantages are crucial for scalable broadcast in low-power, low-capacity wireless networks.

Evaluation of Routing Protocols and Mobility in Flying Ad-hoc Network

The ability of dynamic reconfigurability, quick response and ease of deployment has made Unmanned Aerial Vehicles (UAVs), a paramount solution in several areas such as military applications. Flying ad-hoc network (FANET) is a net-work of UAVs connected wirelessly and configured continuously without infrastructures. Routing on its own is not significant, but the mobility sequence of a UAV in FANETs is a more significant factor and an interesting research topic. The routing protocols gives us a certain and better perception of routing structure for FANETs. In this paper, routing protocols such as Ad-hoc On-Demand Vector (AODV), Dynamic Source Routing (DSR), Temporally Ordered Routing Algorithm (TORA), Geographic Routing Protocol (GRP) and Optimized Link State Routing (OLSR) are compared using performance parameters such as number-of-hops, packet loss ratio, throughput, end-to-end delay and throughput. The mobility models like Pursue Mobility Model (PRS), Semi-Circular Random Movement (SCRM), Manhattan Grid Mobility Model (MGM) and Random Waypoint Mobility (RWPM). The evaluation is carried out with three scenarios including one sender node and one receiver node, all senders one receiver and all senders all receivers are considered for above protocols and mobility models. For all evaluation scenarios, the performance of OLSR is the most efficient among the five routing protocols under four different performance parameters due to its proactive nature which makes the routing information up to date with the help of MPR (Multi Point Relay) in the network, resulting in the reduction of routing overhead in the network.

WITHDRAWN: A novel proactive routing strategy to defend node isolation attack in MANETS

Routing protocols designed for MANETs are, in general are highly vulnerable to various forms of security attacks. A routing protocol is vital to the functioning of a wireless ad hoc network, and hence, security needs to be present to negate any potential malicious influences. However, providing efficient security mechanisms for such routing protocols is still viewed as being a considerable challenge. This paper proposes a novel proactive routing strategy to provide the security for MANETs to make the network secure from the node isolation attack. Node isolation attack occurs for the target node by the attacker after observing the network activity. The proposed approach enhances the security by verifying the hello packets from all of its neighboring nodes coming from a new node before choosing it as a multi-point relay (MPR) for data packets. Extensive simulations carried out over the proposed strategy illustrate the outstanding performance with respect to the packet loss rate and throughput .

New MPR Computation for Securing OLSR Routing Protocol Against Single Black Hole Attack

The Optimized Link State Routing Protocol (OLSR) operates as proactive routing protocol destined for Mobile Ad hoc Network, OLSR is considering as one of the four important routing protocols identified by the Internet Engineering Task Force. The core of performance in OLSR routing protocol is the Multipoint Relays (MPRs) which are selected nodes responsible to forward broadcast messages during the flooding process in order to optimize the message overhead across the network. However, OLSR can be affected by the single Black hole attack that presents an active routing attack disturbs the network by dropping the forwarding packets. In this paper, we propose a new algorithm of selection for the MPR set in order to avoid malicious neighbors and select the thrust one by add a new criterion named as degree of forwarding. Our approach is based on exchanging acknowledgment Hello message between 2-hop neighbors when message HELLO is forwarded successfully between them, some modifications in MPR selection process are also made to select the most secure MPR nodes. The simulation of our proposed solution gives highly motivated results compared to the standard version of OLSR routing protocol under the Black hole attack in different network metrics as the throughput, packet delivery ratio, End-to-End delay, jitter delay and packet lost.

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

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.

Matching game theoretical model for stable relay selection in a UAV-assisted internet of vehicles

This paper tackles the problem of selecting stable relays for Optimized Link State Routing protocol (OLSR) in urban Internet of Vehicles (IoV) in the presence of Unmanned Aerial Vehicles (UAVs). With the evolution of Internet of Things (IoT), IoV emerged from the conventional vehicular ad-hoc network to enable Vehicle to Everything (V2X) communication through different routing protocols. In OLSR protocol, Multi-Point Relays (MPRs) are selected based on their reachability and uniqueness to route information. However, urban environments are characterized by the rapid changes in topology due to the presence of intersections and traffic lights. Although clusters were proposed as a solution, selecting stable heads and MPRs are of significance, considering environment metrics to provide higher connectivity. As a solution to improve routing in IoV, a distributed Gale-Shapley matching game is proposed for stable clustering and MPR selection, utilizing nodes' quality of service (QoS). Nodes' QoS is calculated using Bayesian Belief function of stable connections utilizing environment metrics. For further enhancement in the network performance, UAVs are integrated in the network of vehicles. Conducted simulations show high percentage of stable heads and MPRs for the proposed model compared to benchmark protocols. In addition, the proposed model shows high performance in terms of packet delivery ratio, throughput and End-to-End delay, which are further improved by the presence of UAVs.

Evaluation of the Mobility Aware Energy Efficient Multipoint Relay Link Optimized Routing Protocol for Vehicular Ad HOC Networks

Evaluation of the Mobility Aware Energy Efficient Multipoint Relay Link Optimized Routing Protocol for Vehicular Ad HOC Networks

QoS‐aware broadcasting in VANETs based on fuzzy logic and enhanced kinetic multipoint relay

QoS‐aware broadcasting in VANETs based on fuzzy logic and enhanced kinetic multipoint relay

Design and Evaluation of Flooding-Based Location Service in Vehicular Ad Hoc Networks.

Location-based routing protocols for vehicular ad hoc networks (VANETs) use location information to determine routing decisions. This information is provided by a location service that is queried by nodes in order to properly forward packets to communication partners. This paper presents the semiflooding location service, a proactive flooding-based location service that drastically reduces the number of update packets sent over the network compared to traditional flooding-based location services. This goal is achieved by each node partially forwarding location information. We present both deterministic and probabilistic approaches for this algorithm, which remains very simple. A mathematical model is proposed to show the effectiveness of this solution. The cases of homogeneous 1D, 2D, and 3D networks were studied for both deterministic and probabilistic forwarding decisions. We compare our algorithm with simple flooding and with the multipoint-relay (MPR) flooding of the optimized-link-state-routing (OLSR) protocol, and we show that our algorithm, despite being very simple, has excellent scalability properties. The mean number of generated messages ranges with the mean number of the neighbors of one random network node.

RETRACTED ARTICLE: Enhanced route discovery using connected dominating set and 2-hop repair in wireless ad hoc networks

Efficient routing and broadcasting among a set of nodes play a critical role in wireless adhoc networks. for energy efficient routing, a connected dominating set (CDS) based virtual backbone is a promising approach. In the network, one-hop neighbors are selected as multi point relay (MPR) by each node to cover all its two-hop neighbors for the purpose of broadcasting and 2-hop repair. To improve the network lifetime, energy efficient MPR based CDS construction has been proposed by considering the node degree, energy level, node ID and velocity of the node. We also propose a route discovery protocol to relay route request messages, which makes use of the CDS nodes to obtain a stable routing path; 2-hop repair for route maintenance, which reduces the path damage (reduced control packets with lesser consumption of bandwidth) and broadcast storm problem. The simulation results show that the proposed protocol increases the network lifetime up to 30% than other works and effectively repair damaged routes by reducing control packets.

Improved Proactive Routing Protocol Considering Node Density Using Game Theory in Dense Networks

In mobile ad hoc networks, network nodes cooperate by packet forwarding from the source to the destination. As the networks become denser, more control packets are forwarded, thus consuming more bandwidth and may cause packet loss. Recently, game theory has been applied to address several problems in mobile ad hoc networks like energy efficiency. In this paper, we apply game theory to reduce the control packets in dense networks. We choose a proactive routing protocol, Optimized Link State Routing (OLSR) protocol. We consider two strategies in this method: willingness_always and willingness_never to reduce the multipoint relay (MPR) ratio in dense networks. Thus, nodes with less influence on other nodes are excluded from nomination as MPRs. Simulations were used to confirm the efficiency of using our improved method. The results show that the MPR ratio was significantly reduced, and packet delivery ratio was increased compared to the conventional protocol.

Enhanced OLSR routing for airborne networks with multi-beam directional antennas

This research targets the robust routing protocols in airborne networks (ANs). Particularly, we target the AN which is equipped with the latest antenna technology, called Multi-Beam Directional Antenna (MBDA) [1]. MBDA allows the simultaneously packet delivery in multiple directions without RF interference between directions/beams. We have found that MBDAs can actually bring new opportunities to enhance a popularly used AN routing scheme, i.e., optimized link state routing protocol (OLSR). In particular, MBDAs enable OLSR to better achieve low probability of detection (LPD), a critical requirement in many military applications with adversary nodes nearby which try to eavesdrop the signals. Therefore, we propose a multi-path enhanced OLSR, which is able to exploit the advantages of multi-beam transmissions and select the proper multi-point relays (MPRs) to easily reach all nodes by using only a small number of message broadcasts. An innovative method based on social network concept is used for the selection of MPRs in multi-beam OLSR. Finally, we have conducted the simulations and showed that the enhanced OLSR is suitable for mobile and dense airborne networks with LPD requirements.

Improving the selection of MPRs in OLSR protocol: a survey of methods and techniques

Multi Point Relays (MPRs) are those nodes that are calculated and determined by the Optimized Link State Routing protocol (OLSR) in order to minimize and avoid overload inside the Mobile Ad hoc Network (MANET). In this paper, we will present a synthetic study of many techniques and methods for calculating and selecting the MPR nodes using a set of criteria namely energy, mobility, bandwidth, the quality of links, etc. The result of this study shows that most techniques consider a limited number of metrics for selecting the MPR nodes and therefore they are insufficient to allow the OLSR protocol to be quite complete and efficient because several metrics can occur at the same time in the real execution environment.

Enhancing VANETs Broadcasting Performance with Mobility Prediction for Smart Road

In the last decade, daily lifestyles have been invaded by mobile networks which added a huge exchange of information. This exchange among vehicular nodes as a novel paradigm in smart cities, rapidly became one of the most important topics for industrial investigations and academic research in the same time. This technology covers several domains which impacts the daily human life making emerging mobile social network services to be projected on vehicular networks. Moreover, and especially in big cities, vehicular ad hoc networks (VANET) as a form of intelligent transportation systems have to have a cooperative driver assistance. Such applications generally call out broadcasting techniques for data dissemination. Many approaches were introduced in literature in the aim of improving broadcast performance, one of these approaches is mobility prediction. Since mobility has various aspects such as node position, direction, velocity and also density many broadcast algorithms were founded on one or more different mobility parameter. Multi point relay (MPR) a traditional heuristic for broadcasting protocols, were extended based on kinetic aspect of the network to Kinetic multi point relay (KMPR) heuristic. In this paper we introduce a modification of KMPR main formula by setting a new more accurate coverage density parameter. Then we endorse the original algorithm by other constraints to manage more performance metrics. We finally illustrate that our contribution improves the forwarding process quality compared to MPR and KMPR by reducing the relay set size and duplicate information.