NCA: New Cooperative Algorithm for Reducing Topology Control Packets in OLSR

Benabbou, Adil; Boushaba, Abdelali; Zahi, Azeddine; Benabbou, Rachid; Oumsis, Mohammed; Ouatik, Saïd El Alaoui

doi:10.4304/jnw.10.3.125-133

Cited by 7 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computation of the MPR set may take a long time and increases overhead significantly. Consequently, the New Cooperative Algorithm (NCA) in [21] was proposed to reduce topology control overhead by reducing the number of MPR relay nodes. This method has locally minimized the number of head cluster, it considers the degree of cooperation and link reachability degree.…”

Section: Related Workmentioning

confidence: 99%

“…In [19], [20], and [21], the shortest path algorithm of OLSR routing protocol attempts to reduce the number of MPR as well as the size of control messages problem. These heuristic do not always provide the optimum solution, they disregard alternate available routes having the same link reachability and hop path length.…”

Section: B the Process Of Cluster Head Selectionmentioning

confidence: 99%

“…To this aim, NS2 simulation were used to compare and evaluate the performance of the discussed algorithm, also a performance comparison of both TC and overhead to highlight the effectiveness of our new algorithm. We evaluated the performance of the CACA with the following routing protocols as the baseline; UM-OLSR [35], COOP [19], NCA-MPR [21], NFA [20] and QOLSR [27]. Those protocols are all extensions of original OLSR protocol, and they are strongly depend on the link reachability and their configuration parameters.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…The Network Simulator NS [36], version 2.34 tool was selected to run 10 urban network scenarios and to validate the impact performance parameters on relay selection metrics. The experiments have been carried out by evaluating our algorithm compared with these of UM-OLSR [35], COOP [19], NCA-MPR [21], NFA [20] and QOLSR [27]. So, we define realistic urban scenarios using the free tool Simulation of Urban Mobility (SUMO) [37] to generate a Manhattan Grid mobility models within the space of 1400 m×1200 m. The traffic Simulation (SUMO) is used to create the most common information such as road direction, edges, conditions, traffic signs and lights, and vehicle speeds, etc.…”

Section: Simulation Set-upmentioning

confidence: 99%

“…However, in a high dynamic scenario such as VANET, this protocol does not consider the constraints of nodes mobility which leads to recurrent disconnections, network overhead and significantly reduces network lifetime [15]- [17]. The additional control overhead leads to a collision in the network and thus wasting network resources [18]- [21]. To overcome this problem, several studies focused on Quality of Service (QoS) constraints as a key feature to enhance the ability of routing protocols for reducing the impact of the highly dynamic environment of VANET [22]- [24] and [25].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An Adaptive Relay Selection Scheme for Enhancing Network Stability in VANETs

et al. 2020

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) are a special type of wireless ad hoc network that requires highly scalable routing strategies to establishing reliable end-to-end communication. Because of the high dynamic of VANETs, the mobility of vehicle nodes increases the control traffic overhead. Accordingly, establishing reliable end-to-end communication paths depends entirely on the routing mechanism and the type of nodes mobility information. In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. The CACA algorithm is introduced to improve the ability of the MPR scheme for maintaining long-lived routes. Moreover, the network scalability is enhanced by adaptively selecting most sustainable paths based on a signal strength beacon and the mobility degree of a node, which reduces significantly minimizes the size of control messages overhead as well the routing tables recalculation process. Simulation experiments using the network simulator are presented to demonstrate the effectiveness of our solution. The results show that the proposed algorithm can improve network performance effectively relative to other algorithms. INDEX TERMS Quality of Service, VANETs, cooperative MPR scheme, Routing, cluster-based, OLSR protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: B the Process Of Cluster Head Selectionmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

Section: Simulation Set-upmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Adaptive Relay Selection Scheme for Enhancing Network Stability in VANETs

et al. 2020

View full text Add to dashboard Cite

show abstract

Optimal Relay Selection Strategy for Energy-Efficient Cooperative Multi-Hop Image Transmission in Wireless Multimedia Sensor Network

Devulapalli¹,

Maganti²,

Gae³

et al. 2022

Cybernetics and Systems

View full text Add to dashboard Cite

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

Potula¹,

Ijjada

2022

Cybernetics and Systems

View full text Add to dashboard Cite

Routing is the key issue for Vehicular Networks since each node in the network has mobility. Dynamic nature of vehicular networks increases with the mobility and the consequence is reflected over control 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 source vehicle, and cluster-head coverage area to enhance the Packet Delivery Ratio (PDR) of multi-hop network with tolerable End-to-End transmission delay. Further, we optimize and obtained optimal number of cooperative vehicles in every hop with the objective to minimize the end-to-end energy consumption. Finally, simulation results demonstrate the effectiveness of proposed algorithm compared to other state of art algorithms.

show abstract

NCA: New Cooperative Algorithm for Reducing Topology Control Packets in OLSR

Cited by 7 publications

References 8 publications

An Adaptive Relay Selection Scheme for Enhancing Network Stability in VANETs

An Adaptive Relay Selection Scheme for Enhancing Network Stability in VANETs

Optimal Relay Selection Strategy for Energy-Efficient Cooperative Multi-Hop Image Transmission in Wireless Multimedia Sensor Network

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

Contact Info

Product

Resources

About