Location-aided Routing Research Articles

Multicasting Model for Efficient Data Transmission in VANET

VANETs (Vehicle Ad hoc Networks) are networks made up of a number of vehicular nodes that are free to enter and leave the network. The Location Aided Routing (LAR) protocol is the one that is most frequently utilized among them. Here, the route request packets are flooded across many pathways to the source node using the broadcasting strategy. The vehicles that have a direct path to the destination send the route reply packets back to the source. The least number of hops and the sequence number are used to determine the route from source to destination. This research study has used the multicasting approach to construct a path from the source node to the destination node. Within this multicasting strategy, the root nodes from the network are selected for data routing. The path between the source and the destination is chosen using a root node. The suggested approach is put into practice using the NS2, and some parametric values are computed to produce analytical findings.

Underwater Wireless Sensor Networks Performance Comparison Utilizing Telnet and Superframe

Underwater Wireless Sensor Networks (UWSNs) have recently established themselves as an extremely interesting area of research thanks to the mysterious qualities of the ocean. The UWSN consists of sensor nodes and vehicles working to collect data and complete tasks. The battery capacity of sensor nodes is quite limited, which means that the UWSN network needs to be as efficient as it can possibly be. It is difficult to connect with or update a communication that is taking place underwater due to the high latency in propagation, the dynamic nature of the network, and the likelihood of introducing errors. This makes it difficult to communicate with or update a communication. Cluster-based underwater wireless sensor networks (CB-UWSNs) are proposed in this article. These networks would be deployed via Superframe and Telnet applications. In addition, routing protocols, such as Ad hoc On-demand Distance Vector (AODV), Fisheye State Routing (FSR), Location-Aided Routing 1 (LAR1), Optimized Link State Routing Protocol (OLSR), and Source Tree Adaptive Routing—Least Overhead Routing Approach (STAR-LORA), were evaluated based on the criteria of their energy consumption in a range of various modes of operation with QualNet Simulator using Telnet and Superframe applications. STAR-LORA surpasses the AODV, LAR1, OLSR, and FSR routing protocols in the evaluation report’s simulations, with a Receive Energy of 0.1 mWh in a Telnet deployment and 0.021 mWh in a Superframe deployment. The Telnet and Superframe deployments consume 0.05 mWh transmit power, but the Superframe deployment only needs 0.009 mWh. As a result, the simulation results show that the STAR-LORA routing protocol outperforms the alternatives.

EMBN-MANET: A method to Eliminating Malicious Beacon Nodes in Ultra-Wideband (UWB) based Mobile Ad-Hoc Network

Recent breakthroughs in microelectromechanical systems, microsystem technologies, and wireless communications have made energy-efficient, inexpensive, off-the-shelf devices that unambiguously carry data without communication overhead practical. UWB radio technology employs minimal energy for short-range, high-bandwidth communications throughout a large section of the radio. Mobile computing organizations now explore mobile ad-hoc networks. Decentralized networks communicate. Peer nodes enable wireless device-to-device communication. Location-based and location-aided routing improve ad hoc routing. Physical or involuntary configuration places mobile nodes during deployment. Large networks need too much manual setup. GPS receivers for each sensor unit would significantly increase network installation costs. It inspired non-GPS and non-physical configuration localization. Most localization systems use beacon nodes. Beacon nodes are unique. Standard security approaches block secure beacon nodes, which might compromise localization. This research investigates beacon node localization issues and attacks. We constructed a statistical model to detect rogue beacon nodes in the ad hoc network and studied how various attacks affect localization. Bogus beacon nodes find mobile nodes. We enabled malicious beacon node communication. Trilateration and Received Signal Strength Indicator found unknown nodes. Trilateration detects compromised beacon nodes. The algorithm finds malicious beacon nodes. Our experiments removed 90% of compromised beacon nodes. Our flexible localization technique allows several algorithms and range methods without time complexity. Location identification affected fake beacon nodes.

Performance and Improvement Analysis of the Underwater WSN Using a Diverse Routing Protocol Approach

The planet Earth is the most water-rich place because oceans cover more than 75% of its land area. Because of the extraordinary activities that occur in the depths, we know very little about oceans. Underwater wireless sensors are tools that can continuously transmit data to one of the source sensors while also monitoring and recording the physical and environmental parameters of their surroundings. An underwater wireless sensor network (UWSN) is the name given to the network created by the collection of these underwater wireless sensors. This particular technology is the most efficient way to analyse performance parameters. A network path is chosen to send traffic by using the routing method, a process that is also known as a protocol. The routing protocols ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR), dynamic manet on demand routing protocol (DYMO), location-aided routing 1 (LAR 1), optimized link state routing (OLSR), source-tree adaptive routing optimum routing approach (STAR-ORA), zone routing protocol (ZRP), and STAR-least overhead routing approach (STAR-LORA) are a few models of routing techniques. By changing the number of nodes in the model and the maximum speed of each node, performance parameters such as average transmission delay, average jitter, percentage of utilisation, and power used in transmit and receive modes are explored. The results obtained using QualNet 7.1 simulator suggest the suitability of routing protocols in the UWSN.

Performance study of reactive routing protocol in wildfire detection using mobile ad-hoc network

The routing protocols play an important role in creating routes and sending packets between sensor nodes. There are many methods in the literature that presented and applied several protocols in various domains. However, there is a lack of using routing protocols in the detection of wildfire. Moreover, most methods have used a single number of sensor nodes, where there is a need to investigate the routing protocol based on different simulation parameters such as the number of sensor nodes. Therefore, in this paper, we propose a type of reactive routing protocol that is named Location Aided Routing (LAR). The simulation of LAR protocol has been conducted based on a various number of sensor nodes in order to deeply study and investigate the LAR protocol in the detection of wildfire. In addition, different performance metrics are used for evaluating the performance of the LAR protocol. In the simulation, the performance of LAR protocol shows promising results in the wildfire detection.

Forest Fire Detection Using New Routing Protocol.

The Mobile Ad-Hoc Network (MANET) has received significant interest from researchers for several applications. In spite of developing and proposing numerous routing protocols for MANET, there are still routing protocols that are too inefficient in terms of sending data and energy consumption, which limits the lifetime of the network for forest fire monitoring. Therefore, this paper presents the development of a Location Aided Routing (LAR) protocol in forest fire detection. The new routing protocol is named the LAR-Based Reliable Routing Protocol (LARRR), which is used to detect a forest fire based on three criteria: the route length between nodes, the temperature sensing, and the number of packets within node buffers (i.e., route busyness). The performance of the LARRR protocol is evaluated by using widely known evaluation measurements, which are the Packet Delivery Ratio (PDR), Energy Consumption (EC), End-to-End Delay (E2E Delay), and Routing Overhead (RO). The simulation results show that the proposed LARRR protocol achieves 70% PDR, 403 joules of EC, 2.733 s of E2E delay, and 43.04 RO. In addition, the performance of the proposed LARRR protocol outperforms its competitors and is able to detect forest fires efficiently.

A Simulation Modeling Approach for the Performance of Proactive, Reactive and Position-based Routing Protocols in MANET

Mobile Ad Hoc Network (MANET) hasrecently gotten much attention, especially regarding proactive, reactive, and position-based routing protocols. Routing protocols' primary objective is to transmit data packets from their source to their destination. Identifying the best routing protocol is a common problem in Ad Hoc networks. This paper presents a performance evaluation study of proactive, Open Shortest Path First (OSPF), reactive; Ad Hoc onDemand Distance Vector Routing (AODV), and positionbased routing; Location-Aided Routing (LAR1). The QualNet v5.1 simulator was used to conduct the performance evaluation study. The effectiveness of those routing protocols was also assessed using measures of throughput, typical endto-end delay, typical jitter, and energy consumption. This paper depicts that OSPF and AODV have the best performance among the number of packet sizes for the tested protocols.

IEEHR: Improved Energy Efficient Honeycomb based Routing in MANET for Improving Network Performance and Longevity

In present scenario, efficient energy conservation has been the greatest focus in Mobile Adhoc Networks (MANETs). Typically, the energy consumption rate of dense networks is to be reduced by proper topological management. Honeycomb based model is an efficient parallel computing technique, which can manage the topological structures in a promising manner. Moreover, discovering optimal routes in MANET is the most significant task, to be considered with energy efficiency. With that motive, this paper presents a model called Improved Energy Efficient Honeycomb based Routing (IEEHR) in MANET. The model combines the Honeycomb based area coverage with Location-Aided Routing (LAR), thereby reducing the broadcasting range during the process of path finding. In addition to optimal routing, energy has to be effectively utilized in MANET, since the mobile nodes have energy constraints. When the energy is effectively consumed in a network, the network performance and the network longevity will be increased in respective manner. Here, more amount of energy is preserved during the sleeping state of the mobile nodes, which are further consumed during the process of optimal routing. The designed model has been implemented and analyzed with NS-2 Network Simulator based on the performance factors such as Energy Efficiency, Transmission Delay, Packet Delivery Ratio and Network Lifetime.

Refining Location-Aided Routing (LAR) through Proactive Algorithm

One of the weaknesses in Location-Aided Routing (LAR) is the delay due to partial flooding of data packets throughout the ad hoc network during route discovery. Systematic literature review indicates that very little or no studies conducted to seek a solution to this routing weakness in LAR. This study proposes introduction of periodic updates of location information among the nodes as a solution to minimizing latency. Proactive-LAR (P-LAR) eliminates partial flooding, thus reducing latency while advancing routing performance of traditional LAR. As a research scope, this study uses Angle of Arrival (AoA), Time of Arrival (ToA), Time Difference of Arrival (TDoA) and the expected distance of nodes and the direction of movement as the only location information details. Moreover, the simulation on OMNET ++ is limited to the initial expected zone of LAR Scheme 1. Simulation of the modified LAR Scheme 1 algorithm indicates that inclusion of proactivity as an algorithmic aspect of LAR augments general data packets throughput, latency, packets delivery ratio while minimizing the number of packets dropped. Nodes mobility in simulation was considered stationary. The simulation results—as analyzed through RapidMiner, suggest that proactive algorithmic element in LAR routing algorithm can potentially minimize partial flooding thus improving routing performance while minimizing routing overheads such as jitter and delay.

Design and development of anonymous location based routing for mobile ad-hoc network

Mobile ad-hoc network (MANET) consists of wireless nodes interacting with each other impulsively over the air. MANET network is dynamic in nature because of which there is high risk in security. In MANET keeping node and routing secure is main task. Many proposed methods have tried to clear this issue but unable to fully resolve. The proposed method has strong secure anonymous location based routing (S2ALBR) method for MANET using optimal partitioning and trust inference model. Here initially partitions of network is done into sectors by using optimal tug of war (OTW) algorithm and compute the trustiness of every node by parameters received signal strength, mobility, path loss and co-operation rate. The process of trust computation is optimized by the optimal decided trust inference (ODTI) model, which provides the trustiness of each node, highest trust owned node is done in each sector and intermediate nodes used for transmission. The proposed method is focusing towards optimization with respect to parameter such as energy, delay, network lifetime, and throughput also above parameter is compared with the existing methods like anonymous location-based efficient routing protocol (ALERT), anonymous location-aided routing in suspicious MANET (ALARM) and authenticated anonymous secure routing (AASR).

Secure Location-Aided Routing Protocols With Wi-Fi Direct For Vehicular Ad Hoc Networks

Secure routing protocols are proposed for the vehicular ad hoc networks. The protocolsintegrate the security authentication process with the Location-Aided Routing (LAR) protocol to supportWi-Fi Direct communications between the vehicles. The methods are robust against various security threats.The security authentication process adopts a modified Diffie-Hellman key agreement protocol. The Diffie-Hellman protocol is used with a short authentication string (SAS)-based key agreement over Wi-Fi Directout-of-band communication channels. It protects the communication from any man-in-the-middle securitythreats. In particular, the security process is integrated into two LAR routing schemes, i.e., the request-zoneLAR scheme and the distance-based LAR scheme.We conduct extensive simulations with different networkparameters such as the vehicular node density, the number of the malicious nodes, and the speed of thenodes. Simulation results show that the proposed routing protocols provide superior performance in securedata delivery and average total packet delay. Also, the secure distance-based LAR protocol outperforms thesecure request-zone LAR protocol.

Enhancing Route lifetime in Vehicular Ad Hoc ?Networks Based on Skellam Distribution Model

The emergence of smart cities and the need to use intelligent transportation systems has led to an increased reliance on vehicle ad hoc networks (VANET). The topology of VANET is highly dynamic, which results in a short effective routing time. This paper presents a two-stage algorithm to select a route that can sustain communication between vehicles for as long as possible while taking into account the variables that affect the VANET topology. The first stage uses Skellam distribution model to assess the connectivity probability of paths in ?a 2d road network based on traffic-flow and the number of vehicles ?joining and leaving the ?network, accordingly, the path with the highest connectivity is chosen. In the second stage, the control packets sent only to vehicles on the selected path to detect routes between source and destination, thus reducing the overhead of control packets and increasing network stability. ? the algorithm adopts the principle of global evaluation to ?estimate the lifetime ?of the ?detected ?routes within the chosen path. ?the route with the ?best estimated ?lifetime ?is ?chosen to be ?the active route. ?in the event of route failure, the validity of the next route in lifetime is confirmed to be adopted as the alternate route. The proposed algorithm was compared with both on-?demand distance ?vector routing protocol (AODV) protocol and the modified location-aided routing ??(LAR) ?protocol. The proposed algorithm showed greater network stability, higher performance in terms of longer lifetime route detection, less energy consumption and higher throughput.

Minimizing Routing Overheads in Zone Routing Protocol (ZRP); Replacing Zone Radius with Node Location Information

There are many routing protocols suggested for use in Mobile Ad Hoc Networks (MANETs). Among them (the routing protocols) is the Zone Routing Protocol (ZRP). ZRP uses the concept of zones to ensure that proactive activities are limited to a defined area around a node. The zone is determined by the radius (hops). By limiting a proactive zone on the radius, the transmission of data packets is made effective. However, any node that resides beyond the zone, is reachable reactively. The literature review indicates that one of the shortcomings in ZRP is the overlapping of zones. Furthermore, the exercise of determining zone radius is complicated. The overlapping of zones occurs because individual nodes and their zones are determined by a hop-count radius. Consequently, this overlapping of zones leads to increased routing overhead in ZRP. In an effort to resolve zone overlapping and thus reduce routing overheads, this study suggests the application of the Location-Aided Routing (LAR) Scheme I in the Interzone Routing Protocol (IARP) scheme of ZRP. By applying LAR Scheme 1 algorithm, the need for a hop-count-based radius is eliminated. Location information of nodes in IARP ensures that zones do not overlap, resulting in reduced routing overheads. This study simulates elementary parameters of delay, drop rates, deliver ratio, and the general throughput of ZRP based on the number of nodes, the area, and the size of the data packets. The conventional algorithm of ZRP was rendered on NS-2 and while the nodal-location enhanced ZRP algorithm on OMNET++. Simulation results suggest that the positionally enhanced ZRP algorithm minimizes zonal overlapping hence better data packets throughput, minimized delay and drop rates, and augmented data packets delivery ratio.

Energy Aware Metaheuristic Optimization with Location Aided Routing Protocol for MANET

A mobile ad hoc network (MANET) involves a group of wireless mobile nodes which create an impermanent network with no central authority and infrastructure. The nodes in the MANET are highly mobile and it results in adequate network topology, link loss, and increase the re-initialization of the route discovery process. Route planning in MANET is a multi-hop communication process due to the restricted transmission range of the nodes. Location aided routing (LAR) is one of the effective routing protocols in MANET which suffers from the issue of high energy consumption. Though few research works have focused on resolving energy consumption problem in LAR, energy efficiency still remains a major design issue. In this aspect, this study introduces an energy aware metaheuristic optimization with LAR (EAMO-LAR) protocol for MANETs. The EAMO-LAR protocol makes use of manta ray foraging optimization algorithm (MRFO) to help the searching process for the individual solution to be passed to the LAR protocol. The fitness value of the created solutions is determined next to pass the solutions to the objective function. The MRFO algorithm is incorporated into the LAR protocol in the EAMO-LAR protocol to reduce the desired energy utilization. To ensure the improved routing efficiency of the proposed EAMO-LAR protocol, a series of simulations take place. The resultant experimental values pointed out the supreme outcome of the EAMO-LAR protocol over the recently compared methods. The resultant values demonstrated that the EAMO-LAR protocol has accomplished effectual results over the other existing techniques.

Two-level data packet security mechanism – secure location-aided routing (SLAR)

Secure data transmission is one of the most difficult challenges of Mobile Ad hoc Networks (MANET), it is a group of wireless mobile nodes that creates a temporary network without the help of a centralized system, infrastructure, or access point. Location-Aided Routing (LAR) protocols limit the ad hoc network's search for a new route to a limited "request zone." For safe message transmission in the current Location Aided Routing protocol, the Secure Location Aided Routing algorithm (SLAR) is proposed in this paper. The LAR is a geographic routing protocol that establishes the route discovery region between the source and distance before forwarding the route request packets. SLAR is an extension of LAR where the performance of LAR is compared in the presence and absence of malicious nodes, and the security of LAR is improved by putting cryptographic features in it. SLAR has significantly improved throughput, end-to-end delay, and packet delivery ratio compared to LAR.

Secure Optimized Request Zone Location-Aided Routing

Secure data transmission is one of the biggest challenges for Vehicular Ad Hoc Networks (VANETs) due to its dynamic and infrastructure-less characteristics. Such security services become a demand to provide safe and secure conversation between automobiles. In this paper, two optimized secure routing protocol for VANETs were proposed: 1) Secure Tilted-Rectangular-Shaped Request Zone Location-Aided Routing protocol (STRS-RZLAR); 2) Secure Cone-Shaped Request Zone LAR (SCS-RZLAR). Each proposed secure protocol integrates a security unit with an optimized shape request zone. The security unit in both protocols is a multi-layer unit that adopts two security agreement protocols: 1) modified Diffie-Hellman key agreement protocol; 2) short authentication string (SAS)-based key agreement protocol. The overall communication scheme is performed using Wi-Fi Direct out-of-band channels. The proposed secure protocols provide a reliable and secure data transmission between automobiles in a VANET and thus making it robust against man-in-the-middle attack (MITMA). Extensive simulations using three main network parameters: vehicular node density, number of malicious nodes and vehicle speed show that the proposed secure routing protocols provide superior performance regarding data delivery and normalized routing load (NRL) with a trade-off in average end to end packet delay. From the other side, Simulation results show that SCS-RZLAR protocol outperforms the STRS-RZLAR protocol regarding NRL and average end to end packet delay, while STRS-RZLAR protocol outperforms the SCS-RZLAR protocol regarding data delivery.

Adaptive Security-aware Cone-shaped Request-zone Location-aided Routing Protocol Using Agent-Based Methodology for VANETs

In this paper, we propose an agent-based adaptive security-aware enhancement algorithm with congestion control mechanism for limited resources VANETs using intelligent transportation systems. The proposed security algorithm is to be installed at a central server that receives information about the vehicle resources from distributed intelligent road side units (RSUs) in a virtual segmented road via existing wireless cellular networks (4G). The security algorithm adaptively makes a decision about the best integrity security service level a source node can adopt while encrypting its data flows according to a resource estimation congestion control mechanism. The information about the security level decision will be transferred from the central server to the RSU via wireless cellular networks (4G). From the other side, the RSU transfers it to the source vehicle node via Wi-Fi direct technology. In finding the secure route to destination, we adopt our previously proposed secure cone-shaped request-zone LAR (SCSLAR). In order to notify the destination node with the security level that was adopted by the source, we override the 1st 3 bits of the 1st payload byte of the IEEE 802.11 wireless frame format to represent the associated integrity security level. Using three main network parameters: node density, vehicular speed, and number of malicious nodes, extensive simulation results based on QualNet simulator that is based on the GloMoSim used by Scalable Network Technologies (SNT) show that the proposed secure cone-shaped request zone LAR with resource estimation methodology (SCSLAR-RE) outperforms the SCSLAR regarding data delivery and in protecting the VANET from being congested by heavy traffic load through minimizing both the buffer consumption and the average packets delays at the destination side, while providing the best integrity security level to the data streams that make them robust against the alteration threat.

Enhancing Route lifetime in Vehicular Ad Hoc ‎Networks Based on Skellam Distribution Model

The emergence of smart cities and the need to use intelligent transportation systems has led to an increased reliance on vehicle ad hoc networks (VANET). The topology of VANET is highly dynamic, which results in a short effective routing time. This paper presents a two-stage algorithm to select a route that can sustain communication between vehicles for as long as possible while taking into account the variables that affect the VANET topology. The first stage uses Skellam distribution model to assess the connectivity probability of paths in ‎a 2d road network based on traffic-flow and the number of vehicles ‎joining and leaving the ‎network, accordingly, the path with the highest connectivity is chosen. In the second stage, the control packets sent only to vehicles on the selected path to detect routes between source and destination, thus reducing the overhead of control packets and increasing network stability. ‎ the algorithm adopts the principle of global evaluation to ‎estimate the lifetime ‎of the ‎detected ‎routes within the chosen path. ‎the route with the ‎best estimated ‎lifetime ‎is ‎chosen to be ‎the active route. ‎in the event of route failure, the validity of the next route in lifetime is confirmed to be adopted as the alternate route. The proposed algorithm was compared with both on-‎demand distance ‎vector routing protocol (AODV) protocol and the modified location-aided routing ‎‎(LAR) ‎protocol. The proposed algorithm showed greater network stability, higher performance in terms of longer lifetime route detection, less energy consumption and higher throughput.

3D Location Oriented Routing in Flying Ad-Hoc Networks for Information Dissemination

A Flying Ad-hoc Networks (FANETs) is an autonomous technology that creates a self-organized wireless network via Unmanned Arial Vehicles (UAVs). In this network, all UAVs can communicate within a restricted range of wireless communication in the absence of fixed infrastructure. As a result of high mobility, the limited energy, and the communication range of UAVs, network forming and deformation between them are very frequent that causes packet delivery failure. Therefore, a stable route is always needed to ensure effective data dissemination between source and destination in FANETs. Since it has drastically changing network topology, therefore, to maintain the stable route during packet transmission, there is a need for a suitable routing protocol. This paper proposes an Optimized Location-Aided Routing (O-LAR) protocol which is the modified version of Location-Aided Routing (LAR) protocol. Our protocol’s novelty comes from the fact that it established an optimal route between UAVs for information dissemination towards their respective destination UAV by considering weight function. A weighted function is used to decide the best next-hop node selection based on the parameters like residual energy, distance, and UAV movement direction. The performance of the O-LAR is evaluated mathematically and simulated through the NS-2 simulator. The empirical results attest that O-LAR improves the link duration, network lifetime, packet delivery ratio, and average throughput compared with the state-of-the-art protocols: LEPR, D-LAR, and LAR. Further, the proposed scheme reduces the number of next-hops, routing overhead and end-to-end delay compared to the state-of-the-art protocols.

SIBLAR: a secured identity-based location aware routing protocol for MANETs

A mobile ad-hoc network (MANET) is a self-organising distributed wireless network without any central infrastructure support wherein every participating node independently acts as a router. Several routing protocols are available for information dissemination in MANETs but their efficiency is limited due to security breaches. Providing security schemes for robust information dissemination is of high prominence for the real time deployment of MANET applications. From the existing literature, it is understood that very few research efforts were made to ensure security for routing protocols and there is a huge scope for the design and development of secured routing protocols for MANETs. In this paper, we have considered the security issues with respect to location aided routing (LAR) and proposed a secured identity-based location aware routing (SIBLAR) protocol to achieve system security with improved key refreshment mechanism. MANET scenarios were created in ns2 and the efficiency of the proposed SIBLAR protocol was evaluated based on certain performance metrics. In the presence of security attacks, the proposed SIBLAR scheme is found efficient when compared to basic LAR.