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
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 WS-OLSR 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.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
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.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
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.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
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 WS-OLSR 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.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
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.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
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.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
The document discusses how transmission power impacts the quality of service (QoS) in mobile ad hoc network (MANET) routing protocols. It investigates four routing protocols - AODV, DSR, DSDV, and OLSR using the NS3 simulator. The analysis shows that AODV generally has the best performance in terms of packet delivery ratio, packet loss, jitter, and delay across different transmission power levels. Increasing transmission power improves the performance for all protocols, with AODV maintaining consistent high performance regardless of power level.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
Wireless communication is significantly influenced by the Mobile Ad Hoc Network (MANET), which consists of nodes like mobile phones, tablets, computers, or other devices that can connect with one another. MANET is a decentralized network that communicates without using any specified infrastructure. The lack of battery power in this multihop network with no infrastructure is problematic. As a result, proper transmission power utilization must be considered. Transmission power significantly impacts the data dissemination of different routing protocols used in this MANET environment. By taking this issue into account, the performance of routing protocols is examined based on different transmission power settings. The packet delivery ratio (PDR), packet loss (PL), jitter, and Dealy all play a role in determining network service quality. This study investigates how transmission power impacts MANET routing protocols’ quality of Service (QoS). The MANET routing protocols investigated in this study include AODV, OLSR, DSDV, and DSR. NS3 is used to create the simulation env
An effective transmit packet coding with trust-based relay nodes in VANETsjournalBEEI
Vehicular ad-hoc networks (VANETs) are characterized by limited network resources such as limited bandwidth and battery capacity. Hence, it is necessary that unnecessary use of network resources (such as unnecessary packet transfers) is reduced in such networks so that the available power can be conserved for efficient multicast communications. In this paper, we have presented a Transmit Packet Coding (TPC) Network Coding in VANET to ensure reliable and efficient multicasting. With network coding, the number of transmitted packets over the network can be reduced, ensuring efficient utilization of network devices and resources. Here, the trust-based graph optimization is performed using Cuckoo search algorithm to select the secure relay nodes. The experimental results showed the superiority of the presented approach compared to the existing techniques in terms of throughput, latency, hop delay, packet delivery ratio, network decoder outage probability, and block error rate.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
IRJET - A Review on Congestion Control Methods in Mobile Adhoc NetworksIRJET Journal
This document reviews different techniques for congestion control in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how congestion can occur and degrade network performance. The literature survey section then summarizes several recent studies that have proposed various congestion control methods. These include adaptive data rate and control of hello packets, cross-layer approaches, hop-by-hop congestion control algorithms, avoiding congestion by monitoring bandwidth capacity, and fuzzy logic based congestion control. The document concludes that congestion is a major issue in MANETs and different control mechanisms aim to improve throughput, delivery ratio and reduce packet loss and delay.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANETIJCNCJournal
This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Performance Analysis of Energy Efficient Cross Layer Load Balancing in Tactic...IRJET Journal
This document analyzes the performance of energy efficient cross-layer load balancing in tactical multi-gateway wireless sensor networks. It compares the performance of AODV routing under four different modes: Normal, Optimal, Compressed, and Optimal Compressed. The Optimal Compressed mode uses both load balancing and data compression (Run Length Encoding) and performs best with the lowest delay, highest energy fairness, lowest packet loss rate, and lowest routing overhead according to simulations run in NS2. The proposed approach of using both load balancing and compression outperforms using either technique alone or without them, improving important network metrics like lifetime.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
MPR selection to the OLSR quality of service in MANET using minmax algorithmIJECEIAES
The document describes a study that uses the min-max algorithm to improve the performance of the Optimized Link State Routing (OLSR) protocol in mobile ad hoc networks (MANETs). The min-max algorithm selects multipoint relay (MPR) nodes for OLSR based on the largest signal range. The document outlines related work on MPR selection algorithms and OLSR improvements. It then describes the simulation methodology, including the use of the NS-2 simulator to test standard OLSR and OLSR with min-max. Key quality of service (QoS) metrics like packet delivery ratio, throughput, packet loss, delay, topology control overhead, and energy consumption are evaluated under different node densities.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Improved AODV based on Load and Delay for Route Discovery in MANETIOSR Journals
This document proposes an improved AODV routing protocol for mobile ad hoc networks (MANETs) that considers both node load and routing delay when selecting routes. It calculates a "route weight" based on the average load and delay of the nodes along each potential path from source to destination. The path with the lowest route weight is then selected for routing to help balance traffic loads across the network and minimize delays. Simulation results showed this approach can dynamically balance traffic allocation between paths and optimize resource utilization in the MANET.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
More Related Content
Similar to WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying Search Algorithm
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
The document discusses how transmission power impacts the quality of service (QoS) in mobile ad hoc network (MANET) routing protocols. It investigates four routing protocols - AODV, DSR, DSDV, and OLSR using the NS3 simulator. The analysis shows that AODV generally has the best performance in terms of packet delivery ratio, packet loss, jitter, and delay across different transmission power levels. Increasing transmission power improves the performance for all protocols, with AODV maintaining consistent high performance regardless of power level.
TRANSMISSION POWER AND QUALITY OF SERVICE IN MANET ROUTING PROTOCOLSijwmn
Wireless communication is significantly influenced by the Mobile Ad Hoc Network (MANET), which consists of nodes like mobile phones, tablets, computers, or other devices that can connect with one another. MANET is a decentralized network that communicates without using any specified infrastructure. The lack of battery power in this multihop network with no infrastructure is problematic. As a result, proper transmission power utilization must be considered. Transmission power significantly impacts the data dissemination of different routing protocols used in this MANET environment. By taking this issue into account, the performance of routing protocols is examined based on different transmission power settings. The packet delivery ratio (PDR), packet loss (PL), jitter, and Dealy all play a role in determining network service quality. This study investigates how transmission power impacts MANET routing protocols’ quality of Service (QoS). The MANET routing protocols investigated in this study include AODV, OLSR, DSDV, and DSR. NS3 is used to create the simulation env
An effective transmit packet coding with trust-based relay nodes in VANETsjournalBEEI
Vehicular ad-hoc networks (VANETs) are characterized by limited network resources such as limited bandwidth and battery capacity. Hence, it is necessary that unnecessary use of network resources (such as unnecessary packet transfers) is reduced in such networks so that the available power can be conserved for efficient multicast communications. In this paper, we have presented a Transmit Packet Coding (TPC) Network Coding in VANET to ensure reliable and efficient multicasting. With network coding, the number of transmitted packets over the network can be reduced, ensuring efficient utilization of network devices and resources. Here, the trust-based graph optimization is performed using Cuckoo search algorithm to select the secure relay nodes. The experimental results showed the superiority of the presented approach compared to the existing techniques in terms of throughput, latency, hop delay, packet delivery ratio, network decoder outage probability, and block error rate.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
IRJET - A Review on Congestion Control Methods in Mobile Adhoc NetworksIRJET Journal
This document reviews different techniques for congestion control in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how congestion can occur and degrade network performance. The literature survey section then summarizes several recent studies that have proposed various congestion control methods. These include adaptive data rate and control of hello packets, cross-layer approaches, hop-by-hop congestion control algorithms, avoiding congestion by monitoring bandwidth capacity, and fuzzy logic based congestion control. The document concludes that congestion is a major issue in MANETs and different control mechanisms aim to improve throughput, delivery ratio and reduce packet loss and delay.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANETIJCNCJournal
This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
Energy efficiency cross layer protocol for wireless mesh networkIJCNCJournal
Wireless mesh network (WMN) is a novel emerging tec
hnology that will change the world more effectively
and efficiently. It is regarded as a highly promisi
ng technology being increasingly important in mobil
e
wireless networks of the future generation. In this
paper, we consider energy management for wireless
mesh networks from a point of view that started rec
ently to attract the attention means the conservati
on of
energy for operational and the environment reasons
which is known as the Green Networking. This paper
discusses different routing protocols to establish
a protocol which considers energy efficiency. The e
xisting
protocols are compared using the basic functions of
routing and the suggest protocol is designed to
overcome some of their shortcomings. We are focusin
g on the conception of the cross-layer routing
protocol that is implemented in TDMA (Time Division
Multiple Access) wireless mesh networks based
MAC protocol.
Performance Analysis of Energy Efficient Cross Layer Load Balancing in Tactic...IRJET Journal
This document analyzes the performance of energy efficient cross-layer load balancing in tactical multi-gateway wireless sensor networks. It compares the performance of AODV routing under four different modes: Normal, Optimal, Compressed, and Optimal Compressed. The Optimal Compressed mode uses both load balancing and data compression (Run Length Encoding) and performs best with the lowest delay, highest energy fairness, lowest packet loss rate, and lowest routing overhead according to simulations run in NS2. The proposed approach of using both load balancing and compression outperforms using either technique alone or without them, improving important network metrics like lifetime.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
MPR selection to the OLSR quality of service in MANET using minmax algorithmIJECEIAES
The document describes a study that uses the min-max algorithm to improve the performance of the Optimized Link State Routing (OLSR) protocol in mobile ad hoc networks (MANETs). The min-max algorithm selects multipoint relay (MPR) nodes for OLSR based on the largest signal range. The document outlines related work on MPR selection algorithms and OLSR improvements. It then describes the simulation methodology, including the use of the NS-2 simulator to test standard OLSR and OLSR with min-max. Key quality of service (QoS) metrics like packet delivery ratio, throughput, packet loss, delay, topology control overhead, and energy consumption are evaluated under different node densities.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
Improved AODV based on Load and Delay for Route Discovery in MANETIOSR Journals
This document proposes an improved AODV routing protocol for mobile ad hoc networks (MANETs) that considers both node load and routing delay when selecting routes. It calculates a "route weight" based on the average load and delay of the nodes along each potential path from source to destination. The path with the lowest route weight is then selected for routing to help balance traffic loads across the network and minimize delays. Simulation results showed this approach can dynamically balance traffic allocation between paths and optimize resource utilization in the MANET.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Similar to WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying Search Algorithm (20)
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
EECRPSID: Energy-Efficient Cluster-Based Routing Protocol with a Secure Intru...IJCNCJournal
A revolutionary idea that has gained significance in technology for Internet of Things (IoT) networks backed by WSNs is the " Energy-Efficient Cluster-Based Routing Protocol with a Secure Intrusion Detection" (EECRPSID). A WSN-powered IoT infrastructure's hardware foundation is hardware with autonomous sensing capabilities. The significant features of the proposed technology are intelligent environment sensing, independent data collection, and information transfer to connected devices. However, hardware flaws and issues with energy consumption may be to blame for device failures in WSN-assisted IoT networks. This can potentially obstruct the transfer of data. A reliable route significantly reduces data retransmissions, which reduces traffic and conserves energy. The sensor hardware is often widely dispersed by IoT networks that enable WSNs. Data duplication could occur if numerous sensor devices are used to monitor a location. Finding a solution to this issue by using clustering. Clustering lessens network traffic while retaining path dependability compared to the multipath technique. To relieve duplicate data in EECRPSID, we applied the clustering technique. The multipath strategy might make the provided protocol more dependable. Using the EECRPSID algorithm, will reduce the overall energy consumption, minimize the End-to-end delay to 0.14s, achieve a 99.8% Packet Delivery Ratio, and the network's lifespan will be increased. The NS2 simulator is used to run the whole set of simulations. The EECRPSID method has been implemented in NS2, and simulated results indicate that comparing the other three technologies improves the performance measures.
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal
A 160-bit (20-byte) hash value, sometimes called a message digest, is generated using the SHA-1 (Secure Hash Algorithm 1) hash function in cryptography. This value is commonly represented as 40 hexadecimal digits. It is a Federal Information Processing Standard in the United States and was developed by the National Security Agency. Although it has been cryptographically cracked, the technique is still in widespread usage. In this work, we conduct a detailed and practical analysis of the SHA-1 algorithm's theoretical elements and show how they have been implemented through the use of several different hash configurations.
Optimizing CNN-BiGRU Performance: Mish Activation and Comparative AnalysisIJCNCJournal
Deep learning is currently extensively employed across a range of research domains. The continuous advancements in deep learning techniques contribute to solving intricate challenges. Activation functions (AF) are fundamental components within neural networks, enabling them to capture complex patterns and relationships in the data. By introducing non-linearities, AF empowers neural networks to model and adapt to the diverse and nuanced nature of real-world data, enhancing their ability to make accurate predictions across various tasks. In the context of intrusion detection, the Mish, a recent AF, was implemented in the CNN-BiGRU model, using three datasets: ASNM-TUN, ASNM-CDX, and HOGZILLA. The comparison with Rectified Linear Unit (ReLU), a widely used AF, revealed that Mish outperforms ReLU, showcasing superior performance across the evaluated datasets. This study illuminates the effectiveness of AF in elevating the performance of intrusion detection systems.
An Hybrid Framework OTFS-OFDM Based on Mobile Speed EstimationIJCNCJournal
The Future wireless communication systems face the challenging task of simultaneously providing high-quality service (QoS) and broadband data transmission, while also minimizing power consumption, latency, and system complexity. Although Orthogonal Frequency Division Multiplexing (OFDM) has been widely adopted in 4G and 5G systems, it struggles to cope with a significant delay and Doppler spread in high mobility scenarios. To address these challenges, a novel waveform named Orthogonal Time Frequency Space (OTFS). Designers aim to outperform OFDM by closely aligning signals with the channel behaviour. In this paper, we propose a switching strategy that empowers operators to select the most appropriate waveform based on an estimated speed of the mobile user. This strategy enables the base station to dynamically choose the waveform that best suits the mobile user’s speed. Additionally, we suggest retaining an Integrated Sensing and Communication (ISAC) radar approach for accurate Doppler estimation. This provides precise information to facilitate the waveform selection procedure. By leveraging the switching strategy and harnessing the Doppler estimation capabilities of an ISAC radar.Our proposed approach aims to enhance the performance of wireless communication systems in high mobility cases. Considering the complexity of waveform processing, we introduce an optimized hybrid system that combines OTFS and OFDM, resulting in reduced complexity while still retaining performance benefits.This hybrid system presents a promising solution for improving the performance of wireless communication systems in higher mobility.The simulation results validate the effectiveness of our approach, demonstrating its potential advantages for future wireless communication systems. The effectiveness of the proposed approach is validated by simulation results as it will be illustrated.
Enhanced Traffic Congestion Management with Fog Computing - A Simulation-Base...IJCNCJournal
Accurate latency computation is essential for the Internet of Things (IoT) since the connected devices generate a vast amount of data that is processed on cloud infrastructure. However, the cloud is not an optimal solution. To overcome this issue, fog computing is used to enable processing at the edge while still allowing communication with the cloud. Many applications rely on fog computing, including traffic management. In this paper, an Intelligent Traffic Congestion Mitigation System (ITCMS) is proposed to address traffic congestion in heavily populated smart cities. The proposed system is implemented using fog computing and tested in a crowdedCairo city. The results obtained indicate that the execution time of the simulation is 4,538 seconds, and the delay in the application loop is 49.67 seconds. The paper addresses various issues, including CPU usage, heap memory usage, throughput, and the total average delay, which are essential for evaluating the performance of the ITCMS. Our system model is also compared with other models to assess its performance. A comparison is made using two parameters, namely throughput and the total average delay, between the ITCMS, IOV (Internet of Vehicle), and STL (Seasonal-Trend Decomposition Procedure based on LOESS). Consequently, the results confirm that the proposed system outperforms the others in terms of higher accuracy, lower latency, and improved traffic efficiency.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
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 WS-OLSR 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.
May 2024, Volume 16, Number 3 - The International Journal of Computer Network...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
The simplified electron and muon model, Oscillating Spacetime: The Foundation...RitikBhardwaj56
Discover the Simplified Electron and Muon Model: A New Wave-Based Approach to Understanding Particles delves into a groundbreaking theory that presents electrons and muons as rotating soliton waves within oscillating spacetime. Geared towards students, researchers, and science buffs, this book breaks down complex ideas into simple explanations. It covers topics such as electron waves, temporal dynamics, and the implications of this model on particle physics. With clear illustrations and easy-to-follow explanations, readers will gain a new outlook on the universe's fundamental nature.
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying Search Algorithm
1. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
DOI: 10.5121/ijcnc.2022.14603 37
WS-OLSR: MULTIPOINT RELAY SELECTION
IN VANET NETWORKS USING A WINGSUIT
FLYING SEARCH ALGORITHM
Waleed Khalid Ahmed1
, MohdNazri bin Mohd Warip1
,
Waleed Khalid Abduljabbar2
and Mohamed Elshaikh1
1
School of Computer and Communication Engineering,
University Malaysia Perlis (UniMAP), Malaysia
2
College of Administration and Economics University of Fallujah, Iraq
ABSTRACT
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.
KEYWORDS
OLSR, WS-OLSR, MPR selection, Wingsuit Flying Search, VANETs, Broadcast Storm Problem.
1. INTRODUCTION
Vehicular Ad-Hoc Networks (VANETs) is a new developing wireless technology concept that
supports communication amongst various nearby vehicles to vehicles and enables vehicles to
have access to the Internet [1]. In VANETS, there are still several interesting areas. Such as
medium access control, routing protocols, and security, which lack large amounts of study. There
is also a miss of freely available simulators that can rapidly and accurately simulate VANETs [2].
The number of vehicles in today's cities has increased, resulting in increased traffic, which has
resulted in an increase in the number of traffic accidents. This is where VANET networks come
into play, with the purpose of decreasing and attempting to avoid such accidents [3].
The Mobile Ad-hoc Network (MANET) is a kind of Vehicular Ad-hoc Network (VANET).
VANETs are independent, wireless, and have no infrastructure. The vehicles of a VANET serve
as mobile nodes that organize and configure themselves, and they can share information amongst
themselves [4]. These networks are intended to minimize the risk faced by drivers and passengers
while on the road [5]. Therefore, they are essential for implementing various field applications,
such as intelligent transportation and intelligent cities [6], which may bring us many benefits,
2. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
38
such as the development of traffic in cities through-traffic lights and smart virtual intersections
that help reduce travel time and fuel consumption [7].
Naturally, vehicles must co-operate when relaying messages over a vast area. Whether these
messages are transmitted and received effectively depends on multi-hop retransmissions [8][9].
Problems known as a broadcast storm can arise when the network does not have sufficient
bandwidth to handle the number of messages being broadcast. The excessive routing associated
with broadcast storms brings about significant increases in packet collisions and contention [10].
In VANETs, the mitigating broadcast storm problem represents one of the main challenges for
researchers [11]. Researchers have discussed this issue, taking many different approaches like
linear programming optimization for VANETs, and stochastic routing to efficiently navigate
vehicles [12]. Dedicated Infrastructure to support VANETs has also been researched and led to
further integration between VANETs and techniques to ensure better communication and fewer
less congestions [13]. Congestion control in VANET is investigated intensively using different
approaches like topology algorithms and power control algorithms with different metrics such as
CBR, and IPD as performance indicators. Results have suggested that hybrid techniques such as
combined Tx power and rate control are promising [14].
OLSR is an acronym for (Optimized Link State Routing) protocol is the pro-active routing
protocol are using to establish a path between nodes of the network. These protocols are
dependent on a routing procedure that is primarily based on the MPR (Multi Points Relay)
selection of the technicality that order to minimize a network traffic load and else the road to the
destination [15] [16]. The MPR-s search method, initiation by an NPC (Node Per-forming the
Computation), enables it to assort the group of many nodes capable of sending and receiving the
messages and the data for nodes outside its range, herewith covering the whole network. The
calculations of this MPR using the standard algorithm RFC-3626 outlined below remain
simplistic and deficient because it doesn't account for all node's characteristics. To conduct a
deep examination of this issue, we compare numerous methods proposed by researchers to
enhance the service quality [17] [18] and the security level [19] [20] of these protocols against
the attack. [21][22].
In this paper, a new approach called Wingsuit Search-Optimized Link State Routing Protocol
(WS-OLSR) optimized protocol can be used to control broadcast storms through optimized
routing. By reducing control and topology messages and transferring data through a minimum
count of nodes in a minimum count of hops. Section 2 described the related works. Section 3
presents some main issues that need to be understood in VANETs. Section 4 describes the
proposed methodology and the pseudo algorithm of (WS-OLSR). Section 5 provides the detailed
parameters and simulation setup while the results evaluation and discussion are provided in
Section 6. Lastly, the conclusion will be in Section 7.
2. RELATED WORK
The necessity first algorithm (NFA) was used to select MPRs. In comparison to the greedy
algorithm [23], the results of the reformation using the OPNET showed that the planned
algorithm will decrease the sum of TC and MPR from 0.7% to 11.2%. PDR, throughput, latency,
and power usage, on the other hand, were not evaluated.
Another research study proposed two methods for lowering and stabilizing the MPR: universally
optimizing MPR selections and retraining MPRs [24]. The OMNET simulation results illustrate
that their method dramatically recovers OLSR efficiency. PDR, throughput, latency, and power
usage, on the other hand, were not evaluated.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
39
A local database of surrounding nodes was proposed by the researchers, which could be extended
in 3 hops [25]. The MPR choice seeks to minimize the TC packet overhead by identifying the
nearby subset of the MPR. Due to the sum of TC packet, costs, and routing performance, the
replication consequences of the NS2 showed that the OLSR variants outperform the normal
OLSR.
Centered on powerful broadcasts over wireless ad hoc networks, another approach is to add more
MPR nodes. The planned approach chooses another MPR node so that 2 MPR hopping nodes can
be found [26]. The number of extra MPR nodes is calculated using mathematical modeling and
simulation. Also, the simulation findings demonstrate that the suggested strategy can betterthe
throughput and delivery ratio when compared to a regular OLSR. Dynamic ecological conditions,
on the other hand, have not been evaluated.
In [27], the selected multi-point relay kinetics (KMPR based on mobility predictions) was
investigated. Simulation findings with NS2 showed that the planned KMPR approach can
decrease overhead (RO) and delays when compared to the norm OLSR. Parameters such as
packet surrender ratio, throughput, and energy consumption, on the other hand, were not
evaluated.
In wireless OLSR ad hoc networks, MPR choice, using the extended MPR (EMPR) principle, has
been investigated [28]. In MPR elections, the value of the cost is taken into account by EMPR as
an additional element. The recommended EMPR definition provides a larger coverage area for
the MPR ensemble than the MPR-based OLSR heuristic. On one hand, the outcomes of the
OPNET simulation show that EMPR will reduce the value of packet loss depending on the rapid
changes. However, the evolution of parameters such as PDR, throughput, delay, and energy
efficacy wasn’t evaluated.
EOLSR (Energy Efficient Optimized Link State Routing), an MPR chosen method based on
residual energy, was investigated by [29]. The EOLSR process is the OLSR several in which an
energy level and the number of neighbouring nodes are used to determine the MPR selected and
path calculations. The simulation results indicate that the EOLSR method has the potential to
significantly reduced residual energy in more numbers of nodes. However, the PDR, throughput,
packet loss, and delay parameters haven’t been evaluated.
3. ISSUES AND PROBLEMS IN VANETS
3.1. Routing Protocols in VANETs
Routing protocols govern communication and information exchange between two nodes. In the
VANET networks, routing protocols are close to MANET technology. VANET and MANET
environments are not the same; MANET has less mobility than VANET because VANET routing
makes high mobility difficult. Routing protocols are classified into two groups based on topology
and geographic position [30].
In topology-based protocols: Routing tables are used to send data packets from the source to the
destination node [31]. Reactive, Proactive, and hybrid routing protocols are the three kinds of
topology-based routing protocols [32][33].
While with geographical routing each node knows its location by utilizing GPS or any other
indirect localization approach [34].
4. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
40
3.2. Broadcast Storm Problem
Broadcasting is a method of communication between network nodes, in which one node sends a
message packet to all its neighbours [35]. Since other network protocols and applications depend
on broadcasting facilities, it is a critical and central networking activity [36].
One of the main wireless network features is to link plenty of nodes to increase coverage by
utilizing switch and router forwarding mechanisms. However, when all the linked nodes return
the received packets without any central control, the network becomes congested, which is
regarded as the problem of the broadcast storm[37][38].
Using a more adequate routing protocol can mitigate the broadcasting storm problem by better-
selecting nodes that broadcast messages over the network, which contributes to decreasing
collisions and messages over flooding.
Later, a novel modified version of the OLSR routing protocol based on the Wingsuit Flying
Search algorithm has been investigated in detail for the purpose to optimize node selection in
VANET networks, aiming to reduce the count of total relay nodes that broadcast control
messages over the widest area possible occupied by a VANET network.
3.3. OLSR Protocol
According to [39], “OLSR is an ad-hoc network proactive routing protocol, OLSR consists of
four main principles such as neighborhood sensing, message flooding, topology information, and
path computation. which keeps a network topology view on each node and offers a route as soon
as it's required [40]. Furthermore, it employs the Multi-Point Relay (MPR) principle to reduce
control traffic and offer the shortest paths (in terms of hops) to all network destinations. Each
node selects a subset of nodes in its neighborhood as its MPR – an MPR set is thus relative to
each node – and retains track of the neighbors who have elected themselves as an MPR. The
shortest route to all potential destinations is then calculated from these lists, a route between two
nodes being a sequence of MPR. When obtaining a broadcast message ‘M’ from a node ‘u’, a
node ‘v’ posts it, if it is the first time ‘v’, gets ‘M’ and, if node ‘v’ is the MPR of node ‘u’. This
permits the reduction of the number of transmitter nodes. The algorithm which permits a node ‘u’
to select its MPR, elect nodes in its neighborhood in such a way that the whole 2-neighborhood
of ‘u’ is enclosed by its MPR. MPR was chosen such that the 2-neighborhood of ‘u’ is reached in
two hops from ‘u’, and the k-neighborhood ‘u’ is attained in ‘k’ hops”. As a result, the paths are
expected to be the shortest.
3.4. MPR Selection
Here, we present a commonly used method [39] for optimal MPR selection: “The Greedy MPR
Heuristic. Let N (u) be the neighborhood of a node u, which is a node that:
The set of nodes in the u's range.
Shares a bidirectional link with u, (equation 1):
𝒗 ∈ 𝑵(𝒖) ⟺ 𝒖 ∈ 𝑵(𝒗)
The neighborhood of u is N2 (u), that is the set of neighboring nodes of at least one node of N (u)
but not of N (u), (equation 2):
𝑵𝟐(𝒖) = {𝒗 𝒔. 𝒕. ∃𝒘 ∈ 𝑵(𝒖)|𝒗 ∈ 𝑵(𝒘){𝒖} ∪ 𝑵(𝒖)}
(1)
(2)
5. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
41
A message sent by node u and relayed by a node v ∈ N(u) reaches a node w ∈ N2(u) ∩ N(v) in
2hops.
For a node v ∈ N(u), let 𝒅𝒖
+
(𝒗) be the number of nodes of N2 (u) that are in N (v), (equation 3):
𝒅𝒖
+(𝒗) = {𝑵𝟐(𝒖) ∩ 𝑵(𝒗)}
This quantity is the number of nodes of N2(u) that node u can reach in 2 hops via node (v). For a
node v ∈ N2(u), let 𝒅𝒖
−
(𝒗) be the number of nodes of N (u)
which are in N (v), (equation 4):
𝒅𝒖
−(𝒗) = {𝑵(𝒖) ∩ 𝑵(𝒗)}
This quantity is the number of nodes in N(u) which allow the connection of nodes u and v in 2
hops.
If, (equation 5):
𝒅𝒖
−(𝒗) = 𝟏
There is only one node w in 𝑵(𝒖) ∩ 𝑵(𝒗) which allows to connecting v and u in 2 hops. We say
that v is an isolated node of node u. Note that "isolated nodes" are also relative to a node. The
Original algorithm is run at every node and selects the MPR in two steps.
In equation 6, a node u selects in N (u), a set of nodes that integrally covers N2(u). We define as
MPR(u) this set of MPR selected by u. MPR(u) is such that:
𝒖 ∪ 𝑵𝟐(𝒖) ⊂ ⋃ 𝑵(𝒗)
𝒗∈𝑴𝑷𝑹(𝒖)
We call MPR1(u) ⊂ MPR(u) the nodes that u selects at the first step. (u) selects as MPR1(u)
the nodes which cover its isolated nodes. MPR1(u) is thus the only way to reach isolated nodes
of u in 2 hops from u.
Thus, the first step is mandatory to cover N2(u) with MPR(u).
In the second step, u considers the nodes in N2(u) not already covered by the MPR1 (u). It
chooses as MPR the node of N(u) allowing to cover the maximal number of uncovered nodes of
N2 (u), and so on till getting N2(u) all covered”.
The present standard method of MPR selection has the following disadvantages:
Every node selects an MPR set based on a highly connecting node to a the 2-hop neighbor.
Therefore, the node which has the higher connectivity will be selected as MPR by many nodes
and the node with the lowest connectivity to 2-hop neighbour will be selected by fewer or will
not be selected by any node. This diverts major traffic to a high connectivity direction leading
to congestion.
The energy of the MPR node will be consumed faster due to excessive demand to relay the
transmission of neighbor nodes while another will preserve its energy leading to misbalanced
(3)
(4)
(5)
(6)
6. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
42
overall power consumption and the network connectivity will be badly affected in terms of
bandwidth availability and delays.
An adequate MBR selection to achieve shortest yet location-optimized routes are the key to
reducing traffic, especially unnecessary communication between a node to avoid congestion and
power loss. So, finding a better way to select the MBR in every hop to be located inside a better
spatial conformation, would reduce the number of relay nodes and shorten routes. For that reason,
the Wingsuit Flying Search algorithm will be discussed as a promising technique for a better
MBR system.
3.5. Wingsuit Flying Search Algorithm (WFS)
The (WFS) is a novel optimization method inspired by extreme sports like "Wingsuit Flying"
which is done by certain amateurs at high altitudes [41]. The method replicates a pilot's desire to
land at the lowest point on the Earth's surface within their range i.e., the search space's global
minimum. At each iteration, this is performed by probing the search space with a carefully
selected population of points. While the population is iteratively updated, the flier eventually
receives a sharper image of the surface, shifting attention to lower regions.
The algorithm is basically a population-based search that renews the set of possible solution
points iteratively. After selecting a set of initial points, a cost function is applied to the set. The
set of the next iteration is calculated from neighbor points of points that produce the lowest
values of the desired cost function, and so on.
WFS is a relatively simple algorithm to use since it demands only the population size and the
maximum number of iterations. Additionally, it is overly simple to implement due to its structural
simplicity.
Although the standard OLSR protocol has many advantages in controlling congestions, but in
many situations it fails to achieve a smooth control over congestion due to many reasons such he
nature of messaging system and the algorithm that selects MPRs.
So, we introduce in this research a new version of OLSR protocol named WS_OLSR, aiming to
better calculate MPRs to optimize its spatial allocation and reduce their numbers to mitigate
congestion and maximize coverage area.
The particular novelties inducted in (WS-OLSR) proposed can summarize in:
This is the first use of the Wingsuit Flying Search (WFS) algorithm as a swarm intelligent
metaheuristic in VANET, and it is a promising approach, according to our implementation
and simulation
(WS-OLSR) will enhance OLSR methodology to find a minimum hop count towards the
destination benefiting from (WFS) algorithm, which leads to less traffic by reducing control
messages density.
The second target will lead to mitigating broadcast storms in VANETs.
4. OPTIMIZING “OLSR” PROTOCOL USING WFS
To select MPRs that maximize the coverage and minimize the number of required MPRs during
flooding, both RSS (Received Signal Strength) as a reachability metric and AoA (Angle of
Arrival) as a coverage metric are used.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
43
We introduce a new cost function as an additive factor when calculating MPR1 and MPR2 for
any selected node using the method mentioned previously. Let’s assume the following:
There is a fixed station that has the capability of measuring AoA to any moving node and
acknowledging this node of this AoA value as shown in figure 1, we denote this angle as θ.
Figure 1. Fixed station
For any given node u, messages should be delivered to any destination node directly and that
is a one-hop path or using one relay node and that is a 2-hop node, and so on.
Every node has the capability of measuring RSS values to all N1 neighbors (that shared a
bidirectional link). We denote RSS as r.
Let αi,j be the subtraction of arrival angles (equation 1) calculated between every 2 nodes (i,
j) of N(u),:
∝𝑖,𝑗 = 𝜃𝑗 − 𝜃𝑖 : 𝑖, 𝑗 ∈ 𝑁(𝑢)
Then we can define the following cost function:
𝑓𝑐(∝,𝑟) = (𝑤1 |∑ 𝑟𝑖
𝑛
𝑖=1
| − 𝑤2 ∑ ∝𝑖,𝑗
𝐶2
𝑛
∀𝑖,𝑗∈𝑁(𝑢)
)
Where:
W1 = W2=1: When calculating 1-hop neighbours of a node u(N1(u)).
W1=1.5, W2=0.5: When calculating 2-hop neighbors of a node u(N2(u)).
Minimizing FC (equation 2) using the wingsuit algorithm will result in a set of nodes with
desired characteristics in each iteration, then the real nodes will be estimated by a simple fitting
step.
An additional step will be considered after executing the Algorithm to choose an adequate
number of nodes with negative and positive values of arrival angles subtracts to ensure a fair
distribution of MPRs.
(1)
(2)
8. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
44
Wingsuit-based MPR calculation pseudo algorithm (WS-OLSR)
//define wingsuit algorithm initial values and limits in terms of RSS and arrival angel
Input: n, α, r, [αmin, αmax],Δαmin, [rmin, rmax], Δrmin
// expected output will be the best number of relay points and the best cost function value
Output: n*
, f*
// assigning the initial values for inputs.
n←500
[αmin, αmax]←[0,π]
[rmin, rmax]← [50,90]
Δαmin←0.25
Δrmin←5
//iterating wingsuit algorithm calculations to find out the desired output.
Fori=1 to iterations count
…Calculating α, r
…Calculating FC
…Getting nodes for the next iteration (nodes having lowest values of Fc)
…fitting calculated nodes to existing nodes
…updating the set of nodes for the next iteration
Next
5. SIMULATION SETUP
OLSR is a gauge simulation analysis and wingsuit search-optimized OLSR (WS-OLSR) is
completed based on several 1-hop MPRs count, 2-hop MPRs count, throughout and topology
control using the Wingsuit Flying Search. The simulation result, using an NS3 discrete event
simulator, provides a conclusion about the execution for a gaugeOLSR, and WS-OLSR utilizes a
Wingsuit Flying Search. Table 1 shows the simulation parameters.
Table 1. Simulation parameters
Parameters Description
Network Simulator NS 3.29
Operation System Ubuntu 18.04
Routing Protocols Standard OLSR and WS-OLSR
Number of Nodes 25-200
Radio Propagation Mode Two dimensions’ ground
Transport Protocol UDP
Packet Size 512 bytes
MAC Protocol IEEE 802.11
Mobility Model Random Waypoint
Simulation Time 200 seconds
Simulation Area 1000 m x 1000 m
Fixed Speed 20 m/sec
As we have stated previously that reducing the count of total relay nodes that broadcast control
messages over the widest area possible occupied by a VANET network would reduce TC
messages and regulate loads over the network leading to less congestion status, simulation has
focused on the 1-hop MPRs count accompanied by the throughput to manifest the ability of WS-
OLSR protocol to evenly distribute MBRs, while the lower 2-hop MPRs count would be related
to minimal TC messages.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
45
6. WS-OLSR PERFORMANCE EVALUATION
6.1. Number of MPRs
One-hop MPR for a node u is a node set in the range of u, which shares a direct link with it and
can relay its messages to another node. Less number of well-distributed 1-hop MPRs can
sufficiently reduce TC messages and mitigate over flooding. The simulation showed that using
wingsuit-optimized OLSR can reduce 1-hope and 2-hope MPRs required to cover 95% of mobile
nodes by about 15%–20% as shown in figure 2.
Figure 2. WS-OLSR MPRs Count (1-hop, 2-hop)
Figure 2 shows the number of relay nodes that the vehicle had to register during the simulation
period. As mentioned earlier, during this period, the vehicle may cross the studied area several
times, and therefore the network topology will change, increasing or decreasing the number of
nodes eligible to deliver messages. But what distinguishes the new algorithm is that the number
of nodes needed to transfer messages to the target node or vehicle through two loops (2-hops) is
the least possible compared to the traditional OLSR algorithm with two loops. This will have a
significant impact on reducing congestion due to the low number of participating nodes in
delivering data to the target node.
6.2. Throughput
It is the definition as the overall number of packets successfully received in units of time
multiplied by the rate of effective data transferring in Bytes Per Second (Bps). As the throughput
grows, so does the routing protocol's efficiency. For the sum of different nodes, figure 3 displays
the output of the OLSR and the OLSR utilizing the wingsuit algorithm. On deeper nodes, such as
nodes 150 and 200, the OLSR throughput output using the wingsuit algorithm is more stable. The
standard OLSR's throughput performance is unstable and declines as nodes become denser,
particularly at node 200. OLSR using the wingsuit algorithm outperformed the competition.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
46
Figure 3. The throughput rate of WS-OLSR compared to OLSR
Although the result is encouraging, we must later perform a simulation process to estimate the
average channel capacity per user achieved by WS-OLSR when operating in a crowded or fading
environment as suggested in [42] for better examining the proposed algorithm.
6.3. Topo-logy Control (TC)
TC assumes the full amount for routing packets submitted throughout the experiment. Packets
sent through multiple hops were treated as a single trans-mission (one hop). Figure 4 shows the
TCs on OLSR and standard OLSR uses a wingsuit algorithm dependent on the number of
different nodes. At nodes 25 to 100, TC movement on OLSR using the wingsuit algorithm
appears to increase. Denser nodes, on the other hand, appear to have fewer TC values,
particularly at nodes 150 and 200.
Figure 4. TCs of WS-OLSR compared to OLSR
11. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
47
6.4. Results and Discussion
Simulation has been performed under some fixed conditions such as transport protocol (UDP),
MAC protocol (IEEE 802.11), and node speed (20 m/s). Results have indicated that WS-OLSR
reduced TC messages by 10-40% on average accompanied by an increase in throughput by 20-
30% obviously as a direct outcome of reducing MBRs count. Better results in terms of
throughput and TC control messages are achieved when the total node count is high (60 nodes
per 1 Km2) due to better conditions to apply the Wingsuit Flying Search algorithm, which works
better when the initial population is high enough, and a better spatial distribution of MBRs.
Using a Wingsuit Flying Search algorithm was less effective when the total node count was not
high enough as a result of limitations in applying the algorithm, which itself is in continuous
development progress.
The result of the simulation in general shows a significant decrease in the amount of service and
control message which suppresses broadcasting storm phenomenon, that was obvious in terms of
higher “package delivery rate” values. 1st and 2nd hop MPRs selection process is optimized in
terms of total number and spatial distribution without any noticeable negative effects on network
performance like throughput.
Using Wingsuit fly search algorithm in optimizing MPR selection in OLSR protocol yields a
more robust algorithm (WS-OLSR) that can mitigate the broadcasting storm problem effectively.
7. CONCLUSIONS
The current paper suggests the Wingsuit Flying Search enhances OLSR through a better method
of calculating MPR. Applying this method to the OLSR protocol has led to a modified version of
this protocol called WS-OLSR. The execution for standard OLSR and Novel WS-OLSR has been
analyzed based on the number of 1-hop MPRs count, 2-hop MPRs count, and throughput and
topology control. The simulation results show that the Novel WS-OLSR protocol can reducethe
MPR count required to cover 95% of mobile nodes, increase throughput, and reduce TC
compared to standard OLSR which mitigates the broadcasting storm phenomenon in VANETs
significantly.
Using a Wingsuit Flying Search algorithm was less effective when the total node count was not
high enough as a result of limitations in applying the algorithm, which itself is in continuous
development progress. Besides that, many performance parameters must be examined carefully,
especially when vehicles move faster than 20 km/h which is the speed we used in the research.
More studies should be performed later as future work concerning:
Changing transportation and MAC protocols.
Applying enhanced versions may appear later in the Wingsuit Flying Search algorithm.
Study WS-OLSR protocol on highways VANETs to test its capabilities at higher speeds.
CONFLICTS OF INTEREST
The authors declare no conflict of interest.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
48
REFERENCES
[1] W. Khalid Ahmed, M. Nazri Bin Mohd Warp, W. Khalid Abduljabbar, and M. Elshaikh, “Comparing
and Assessing the Enhancements of DYMO and OLSR in VANETs,” IOP Conf. Ser. Mater. Sci.
Eng., vol. 917, no. 1, 2020, DOI: 10.1088/1757-899X/917/1/012078.
[2] A. T. Ali, M. N. M. Warp, W. K. Bduljabbar, and A. M. A. Atta, “Evaluate & Develop a Routing
Protocol of a Fully Functional Simulation System for Vehicular Ad Hoc Networks,” in 2018 1st
Annual International Conference on Information and Sciences (AiCIS), 2018, pp. 249–253.
[3] L. Naula and A. Segovia, “Broadcast and Analysis of Traffic Warning Messages in a VANET
Network,” in International Conference on Smart Technologies, Systems, and Applications, 2019, pp.
52–62.
[4] M. U. Ghazi, M. A. K. Khattak, B. Shabir, A. W. Malik, and M. S. Ramzan, “Emergency Message
Dissemination in Vehicular Networks: A Review,” IEEE ACCESS, vol. 8, pp. 38606–38621,
2020,DOI: 10.1109/ACCESS.2020.2975110.
[5] A. Naja, M. Boulmalf, M. Essaaidi, and O. A. Oualhaj, “Adaptive alert content dissemination
protocol inspired from volunteer’s dilemma game for Vehicular Ad-hoc Networks,” Veh. Commun.,
vol. 19, 2019, DOI: 10.1016/j.vehcom.2019.100180.
[6] M. Burhan and R. A. Rehman, “BSMS: A Reliable Interest Forwarding Protocol for NDN based
VANETs,” in 2020 3rd International Conference on Advancements in Computational Sciences
(ICACS), 2020, pp. 1–6, DOI: 10.1109/ICACS47775.2020.9055953.
[7] J. V. Saiáns-Vázquez et al., “Intersection intelligence: supporting urban platooning with virtual traffic
lights over virtualized intersection-based routing,” Sensors, vol. 18, no. 11, p. 4054, 2018.
[8] M. Fotros, M. M. R. Kashani, J. Rezazadeh, and J. Ayoade, “A Timely VANET Multi-hop Routing
Method in IoT,” in 2019 20th International Conference on Parallel and Distributed Computing,
Applications and Technologies (PDCAT), 2019, pp. 19–24, DOI: 10.1109/PDCAT46702.2019.00015.
[9] V. D. Nguyen, T. Z. Oo, N. H. Tran, and C. S. Hong, “An Efficient and Fast Broadcast Frame
Adjustment Algorithm in VANET,” IEEE Commun. Lett., vol. 21, no. 7, pp. 1589–1592, 2017, DOI:
10.1109/LCOMM.2016.2640958.
[10] H. Hafi, W. Abdou, and S. Merniz, “Adaptive-Segmentation and Flexible-Delay Based Broadcasting
Protocol for VANETs,” in WIRED/WIRELESS INTERNET COMMUNICATIONS, WWIC 2017, 2017,
vol. 10372, pp. 207–218, doi: 10.1007/978-3-319-61382-6_17.
[11] E. E. O. Lousada, C. R. Storck, R. A. F. Mini, and F. d. L. P. Duarte-Figueiredo, “Using Complex
Networks Metrics to Mitigate the Broadcast Storm Problem,” in 2019 IEEE Symposium on
Computers and Communications (ISCC), 2019, pp. 1–6, DOI: 10.1109/ISCC47284.2019.8969765.
[12] A. Elbery, H. S. Hassanein, N. Zorba, and H. A. Rakha, “VANET-based smart navigation for
emergency evacuation and special events,” in 2019 IEEE 24th International Workshop on Computer
Aided Modeling and Design of Communication Links and Networks (CAMAD), 2019, pp. 1–6.
[13] J. B. Johannes, A. M. de Souza, D. Rosário, E. Cerqueira, and L. A. Villas, “Efficient data
dissemination protocol based on complex networks’ metrics for urban vehicular networks,” J.
Internet Serv. Appl., vol. 10, no. 1, 2019, DOI: 10.1186/s13174-019-0114-y.
[14] X. Liu and A. Jaekel, “Congestion control in V2V safety communication: Problem, analysis,
approaches,” Electronics, vol. 8, no. 5, p. 540, 2019.
[15] X. Guo, S. Yang, L. Cao, J. Wang, and Y. Jiang, “A new solution based on optimal link-state routing
for named data MANET,” China Commun., vol. 18, no. 4, pp. 213–229, 2021.
[16] O. Barki, Z. Guennoun, and A. Addams, “Comparative study of MPR selection algorithms based on
statistical model checking,” Int. Conf. Multimed. Comput. Syst. -Proceedings, vol. 0, pp. 327–331,
2017, DOI: 10.1109/ICMCS.2016.7905530.
[17] Alamsyah, I. Ketut Eddy Purnama, E. Setijadi, and M. H. Purnomo, “MPR selection to the OLSR
quality of service in MANET using minmax algorithm,” Int. J. Electr. Comput. Eng., vol. 9, no. 1, pp.
417–425, 2019, DOI: 10.11591/ piece.v9i1.pp417-425.
[18] S. Sahu and S. Sharma, “Secure and proficient cross-layer (SPCL) QoS framework for mobile ad-hoc
network,” Int. J. Electr. Comput. Eng., vol. 9, no. 4, pp. 2603–2613, 2019, DOI:
10.11591/ijece.v9i4.pp2603-2613.
[19] A. Ahmad and S. Ismail, “User selective encryption method for securing MANETs,” Int. J. Electr.
Comput. Eng., vol. 8, no. 5, pp. 3103–3111, 2018, DOI: 10.11591/ piece.v8i5.pp.3103-3111.
[20] K. R. Rao, S. N. T. Rao, and P. C. Reddy, “An effective data privacy mechanism through secure
session key exchange model for MANET,” Int. J. Electr. Comput. Eng., vol. 8, no. 5, pp. 3267–3277,
13. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.6, November 2022
49
2018, DOI: 10.11591/piece.v8i5.pp3267-3277.
[21] Y. Khamayseh, M. B. Yassein, and M. Abu-Jazoh, “Intelligent black hole detection in mobile AdHoc
networks,” Int. J. Electr. Comput. Eng., vol. 9, no. 3, pp. 1968–1977, 2019, DOI: 10.11591/
piece.v9i3.pp1968-1977.
[22] N. Panda and B. K. Pattanayak, “Analysis of blackhole attack in AODV and DSR,” Int. J. Electr.
Comput. Eng., vol. 8, no. 5, pp. 3093–3102, 2018, DOI: 10.11591/ piece.v8i5.pp.3093-3102.
[23] Z. Li, N. Yu, and Z. Deng, “NFA: A new algorithm to select MPRs in OLSR,” 2008 Int. Conf. Wirel.
Commun. Netw. Mob. Comput. com2008, pp. 1–6, 2008, DOI: 10.1109/WiCom.2008.652.
[24] L. Maccari and R. Lo Cigno, “How to reduce and stabilize MPR sets in OLSR networks,” Int. Conf.
Wirel. Mob. Comput. Netw. Commun., pp. 373–380, 2012, DOI: 10.1109/WiMOB.2012.6379101.
[25] A. Boushaba, A. Benabbou, R. Benabbou, A. Zahi, and M. Oumsis, “Optimization on OLSR protocol
for reducing topology control packets,” Proc. 2012 Int. Conf. Multimed. Comput. Syst. ICMCS 2012,
no. iii, pp. 539–544, 2012, DOI: 10.1109/ICMCS.2012.6320282.
[26] J. H. Ahn and T. J. Lee, “Multipoint relay selection for robust broadcast in ad hoc networks,” Ad Hoc
Networks, vol. 17, pp. 82–97, 2014, DOI: 10.1016/j.adhoc.2014.01.007.
[27] J. Härri, F. Filali, and C. Bonnet, “Kinetic multipoint relaying: improvements using mobility
predictions,” in IFIP International Working Conference on Active Networks, 2005, pp. 224–229.
[28] T. H. Lin, H. C. Chao, and I. Wolfgang, “An enhanced MPR-based solution for flooding of broadcast
messages in OLSR wireless ad hoc networks,” Mob. Inf. Syst., vol. 6, no. 3, pp. 249–257, 2010, DOI:
10.3233/MIS-2010-0102.
[29] S. Mahfoudh and P. Minet, “EOLSR: an energy-efficient routing protocol in wireless ad hoc and
sensor networks,” J. Interconnect. Networks, vol. 9, no. 04, pp. 389–408, 2008.
[30] M. Kumar, A. K. Nigam, and T. Sivakumar, “A Survey on Topology and Position Based Routing
Protocols in Vehicular Ad hoc Network (VANET),” Int. J. Futur. Revolut. Comput. Sci. Commun.
Eng., vol. 4, no. 2, pp. 432–440, 2018.
[31] K. A. Darabkh, M. S. A. Judeh, H. Bany Salameh, and S. Althunibat, “Mobility aware and dual phase
AODV protocol with adaptive hello messages over vehicular ad hoc networks,” AEU - Int. J.
Electron. Commun., vol. 94, no. July, pp. 277–292, 2018, DOI: 10.1016/j.aeue.2018.07.020.
[32] A. Srivastava, A. Prakash, and R. Tripathi, “Location-based routing protocols in VANET: Issues and
existing solutions,” Veh. Commun., vol. 23, p. 100231, 2020, DOI: 10.1016/j.vehcom.2020.100231.
[33] M. Tarique and R. Islam, “Performances of Ad Hoc Networks Under Deterministic and Probabilistic
Channel Conditions: Cases for Single Path and Multipath Routing Protocols,” Int. J. Comput.
Networks Commun., vol. 10, no. 4, pp. 1–21, 2018.
[34] A. A. Prates, I. V. Bastos, and I. M. Moraes, “GeoZone: An interest-packet forwarding mechanism
based on dissemination zone for content-centric vehicular networks,” Comput. Electr. Eng., vol. 73,
pp. 155–166, 2019, doi: 10.1016/j.compeleceng.2018.11.015.
[35] S. Pathak, A. Mani, A. Chatterjee, and M. Sharma, “Broadcast Storm Problem in Software Defined
Vehicular Network,” in 2019 International Conference on Intelligent Computing and Control
Systems (ICCS), 2019, pp. 1537–1542, DOI: 10.1109/ICCS45141.2019.9065687.
[36] S. Latif, S. Mahfooz, B. Jan, N. Ahmad, Y. Cao, and M. Asif, “A comparative study of scenario-
driven multi-hop broadcast protocols for VANETs,” Veh. Commun., vol. 12, pp. 88–109, 2018, DOI:
https://doi.org/10.1016/j.vehcom.2018.01.009.
[37] G. K. Pallai, M. Sankaran, and A. K. Rath, “Self-Pruning based Probabilistic Approach to Minimize
Redundancy Overhead for Performance Improvement in MANET,” Int. J. Comput. Networks
Commun. Vol, vol. 13, 2021.
[38] S. Kamakshi and V. S. Shankar Sriram, “Modularity based mobility aware community detection
algorithm for broadcast storm mitigation in VANETs,” Ad Hoc Networks, vol. 104, p. 102161, 2020,
DOI: https://doi.org/10.1016/j.adhoc.2020.102161.
[39] A. Busson, N. Mitton, and E. Fleury, “Analysis of the multi-point relay selection in olsr and
implications,” in IFIP Annual Mediterranean Ad Hoc Networking Workshop, 2005, pp. 387–396.
[40] T. Sanguankotchakorn, S. K. Wijayasekara, and S. Nobuhiko, “Performance of OLSR MANET
Adopting Cross-Layer Approach Under CBR and VBR Traffics Environment,” Int. J. Comput.
Networks Commun. Vol, vol. 10, 2018.
[41] N. Covic and B. Lacevic, “Wingsuit Flying Search-A Novel Global Optimization Algorithm,” IEEE
Access, vol. 8, pp. 53883–53900, 2020, DOI: 10.1109/ACCESS.2020.2981196.
[42] P. Varzakas, “Channel capacity per user in a power and rate adaptive hybrid DS/FFH‐CDMA cellular
system over Rayleigh fading channels,” Int. J. Commun. Syst., vol. 25, no. 7, pp. 943–952, 2012.