Location-based Routing Protocol Research Articles

Adaptive Location-based Routing Protocols for Dynamic Wireless Sensor Networks in Urban Cyber-physical Systems

This study investigates the development and enhancement of adaptive location-based routing protocols within dynamic wireless sensor networks (WSNs) in urban cyber-physical systems, recommending the implementation of the study’s innovative Urban Adaptive Location-based Routing Protocol (UALRP). This innovative protocol integrates real-time data analytics and adaptive machine learning models into its algorithmic framework to dynamically optimize routing decisions based on continuously changing urban conditions. Through the utilization of data-driven simulation models and machine learning techniques, the research sought to significantly improve the efficiency, reliability, and scalability of urban WSNs. Existing protocols such as Geographic Adaptive Fidelity (GAF), Greedy Perimeter Stateless Routing (GPSR), and Dynamic Source Routing (DSR) were critically assessed under urban settings using extensive datasets detailing New York City's traffic patterns and environmental variables. The analysis demonstrated that while GPSR showed superior performance in terms of latency, throughput, and energy efficiency among the traditional protocols, the introduction of UALRP, with its advanced predictive and adaptive capabilities, can further optimize these metrics. The study affirms the critical role of enhancing location accuracy and the ongoing advancement of machine learning models within urban routing protocols. These insights advocate for the broader implementation of adaptive strategies like UALRP to foster the development of more resilient and efficient urban cyber-physical systems.

An Efficient Grid-Based Geocasting Scheme for Wireless Sensor Networks

In a wireless sensor network (WSN), geocasting is a location-based routing protocol used for data collection or information delivery. In geocasting, a target region usually contains many sensor nodes with limited battery capacity, and sensor nodes in multiple target regions need to transmit data to the sink. Therefore, how to use location information to construct an energy efficient geocasting path is a very important issue. FERMA is a geocasting scheme for WSNs based on Fermat points. In this paper, an efficient grid-based geocasting scheme for WSNs, which is called GB-FERMA, is proposed. The scheme uses the Fermat point theorem to search for the specific nodes as Fermat points in a grid-based WSN, and it selects the optimal relay nodes (gateways) in the grid structure to realize energy-aware forwarding. In the simulations, when the initial power 0.25 J, the average energy consumption of GB-FERMA is about 53% of FERMA-QL, 37% of FERMA, and 23% of GEAR; however, when with the initial power 0.5 J, the average energy consumption of GB-FERMA is about 77% of FERMA-QL, 65% of FERMA, and 43% of GEAR. The proposed GB-FERMA can effectively reduce the energy consumption and thus prolong the lifetime of the WSN.

NextRoute: a lossless model for accurate mobility prediction

Mobility prediction of vehicles has become a key feature in mobility management in smart cities, mobile computing environments, intelligent transportation systems, vehicular networks, and location-based services. It has several important applications in traffic congestion forecasting, location-based routing protocol designs and targeting advertisements generation, etc. Mobility prediction (aka route prediction) consists of forecasting future routes to be traversed by a vehicle. Several models have been proposed for route prediction. These models are generally probabilistic models (e.g., Markov models) or data mining-based models (e.g., sequential rule-based models), and are trained with historical location data. Although these models were shown to perform well, one important drawback is that they are lossy. In other words, a large amount of information found in the location data is discarded by their training processes. Consequently, these models do not perform well for predicting routes where detailed information is required to perform accurate predictions. Besides, several prediction models assume the Markovian hypothesis that the next location of a user only depends on his/her current location and any previous movement of the user is ignored in prediction. This hypothesis has been employed, such as in Lian et al. (ACM Trans Intell Syst Technol 6:1–27, 2015. https://doi.org/10.1145/2629557), as a simplifying assumption because it allows building models having a small size. However, this assumption is often unrealistic and thus greatly decreases the accuracy of route prediction. Moreover, these models are noise sensitive as they do not tolerate the smallest deviation in location data principally prone to several disturbances and uncertainty issues. To address these limitations, this paper introduces a novel route prediction model named NextRoute. The proposed model is lossless as it compresses location data in a prediction tree without information loss, and it is designed to use all the relevant information contained in the training data to perform prediction. In contrast to some other proposals, NextRoute provides efficient noise tolerance strategy that loosened the similarity measure when matching the current trajectory of vehicle with historical data. An extensive experimental evaluation was conducted with real-world and synthetic datasets providing quite encouraging results.

Hybrid Geo-Location Routing Protocol for Indoor and Outdoor Positioning Applications

Internet of Things (IoT) essentially demands smart connectivity and contextual awareness of current networks with low power and cost effective wireless solutions. Routing is the backbone of the system controlling the flow of transmission. This work demonstrates a collation between performance investigations of a location-based routing protocol Geocast Adaptive Mesh Environment for Routing with contextual information collected from Global Positioning System (GPS) and Framework for Internal Navigation and Discovery (FIND) respectively. The systems are evaluated based on various metrics i.e. Accuracy, Packet Delivery Ratio and Packet Overhead by means of Network Simulator (NS-2). FIND shows enhanced performance in most cases as compared to GPS for indoor and outdoor environments. The results of this research can be deployed in different areas such as in-building navigation, hospital patient tracking, Smart City context aware service provisioning and Industry 4.0 deployments.

アドホックネットワークにおける指向性アンテナを用いた適応型位置情報ルーチング

In mobile ad hoc networks (MANETs), when information about the location of the destination node is known, efficient communication can be achieved by using location-based routing protocols. Even in location-based routing protocols, with omnidirectional antennas there is some redundant route discovery by blind flooding of route request packets outside the area between the source and destination. These redundant route discovery propagations can be reduced by using both a scheme of restricted flooding and directional antennas. In this paper, we propose a new location-based routing protocol using both restricted flooding and directional antennas, called Adaptive Location-Aware Routing with Directional Antennas (ALAR-DA). To investigate the performance of ALAR-DA, we compare it with existing location-aware routing protocols. Our simulation results show that ALAR-DA outperforms existing protocols from the standpoints of delay and route discovery traffic.

A STUDY ON LOCATION-BASED ROUTING PROTOCOL FOR WSN

30Apr 2016 A STUDY ON LOCATION-BASED ROUTING PROTOCOL FOR WSN Pavithra M.N and Chinnaswamy C.N. PG student, Department of IS&E, The National institute of engineering, Mysore, Karnataka, India. Associate Professor, The National institute of engineering, Mysore, Karnataka, India.

Removal of Malicious Attacks using Hybrid Symmetric Cryptograhic Technique

Security in Mobile Ad-hoc Network (MANET) plays an important role for providing effective network service without any malicious attack. Intrusion detection is crucial in improving the performance of mobile ad-hoc network. Intrusion detection monitors the activities in a mobile system by collecting the information and then analyzing them. Most previous works for intrusion detection use the current acknowledgement and location-based routing protocol to combat against the intrusion detection. In this work to secure the mobile network system from malicious attacks, Hybrid Symmetric Cryptography Technique (HSCT) is introduced. The HSCT uses Advanced Encryption Standard (AES) and Message Digest 5 (MD5). Advanced Encryption Standard (AES) is based on the principle of substitution and permutation keying model adapted as node ids in the mobile ad-hoc network. AES ensures higher amount of packets being transmitted with minimum packet delay. The main MD5 algorithm operates on a 128-bit state, divided into four 32-bit words in mobile nodes to remove the malicious attack. AES and MD5 fused together on the mobile nodes to communicate packets with high security. The HSCT algorithms offer data security and users authenticity using a mixture of two symmetric cryptographic techniques. HSCT measure and analyze different parameters such as true positive rate on detecting abnormal activities, packet delay, rate of intrusion being detected with respect to node density and packets being transmitted. The HSCT is simulated using NS2. Experiment results show that the proposed technique achieves better performance in considerably minimizing the packet delay rate by 33.36% and improves the true positive rate on detecting abnormal activities by 25.83% compared to the state-of-the-art works.

A Survey: Wireless Sensor Network and its Routing Protocol

Wireless Sensor Network (WSN) is latest technology for sensing and processing different physical and environmental condition data such as heat, temperature, pressure etc.WSN is the network of small sensing node and these node have capability of sensing data and communicating with base station(Sink Node).WSN also have routing capability that route the data to sink node using various routing protocol. WSN routing protocol classified into various types based on network tropology i.e. Flat, Hierarchical and Location Based routing protocol in WSN used for selecting optimal routes path in sensor network. In this paper we study about WSN and different routing protocol that are used in WSN for routes the data to destination node.[2][4]

Cross Layer Location Based Routing Protocol in WSN

Cross Layer Location Based Routing Protocol in WSN

VANETs Using Efficient Routing Hybrid Protocol to Increase Performance in Different traffic Scenarios

A vehicular ad hoc network (VANETs) is a upcoming technology to establish a communication between a vehicles while travelling which provide a internet connectivity. VANET provides wireless communication among vehicles and vehicle to road side equipments. The communication between vehicles is used for safety, traffic monitoring, entertainment and exchanging warning messages between vehicles. The performances of communication depend on how better the routing takes place in the network. Routing of data depends on the routing protocols being used in network. Within VANETs; vehicle mobility will cause the communication links between vehicles to frequently be broken. Such link failures increase the routing overhead and decrease network scalability. For that propose a Hybrid location-based routing protocol (HLAR). Which is generally used for repairing a link failure? HLAR is a combines feature of reactive routing with location-based geographic routing in a manner that efficiently uses all the location information available.

English

Mobile Ad-Hoc Network (MANET) uses an anonymous routing protocol for security purpose. This protocol hides nodes original identity from outsider, so that observer cannot threaten the security of network. An anonymous communication method in MANETs is mostly classified into three type s reactive methods, proactive methods and anonymous routing technique. Other reactive routing techniques involves hop-by-hop encryption and redundant traffic routing .This routing methods either generate high cost or cannot provide full anonymity protection to sources, destinations, data and routes Mobile Ad Hoc Networks (MANETs) uses various anonymous routing protocols to support anonymity protection to sources and destination and data. Therefore to offer a high anonymity protection, Anonymous Location-based Efficient Routing protocol (ALERT) is proposed. Basic idea behind ALERT is to dynamically partition the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which creates a non-traceable anonymous route.

Improvement of LAR1 Routing Protocol

Abstract LAR1 is a reactive and location based routing protocol used in wireless ad hoc network. It has three packets with the help of which it transfer data from one node to another and maintain connection, they are - route request, route reply and route error packets. This paper is based on using two types of route request packets – modified route request packet (used initially when no information about destination is used) and original route request packet (used when route breakage has taken place). In modified route request packet we have removed redundant fields like zone variable field and flooding variable field. We used well known network simulator QualNet 6.1 from scalable networks to compare original LAR1 and modified LAR1 (MYLAR1). In comparing it is found that performance parameters such as average unicast jitter, average unicast end to end delay, total unicast messages received and unicast received throughput of MYLAR1 is better than original LAR1 routing protocol.

English

Mobile Ad Hoc Networks (MANETs) using anonymous routing protocols hidden node identity and external routes having anonymity protection. Anonymous routing protocols use either hop-by-by hop encryption or redundant traffic, which generates more cost or without providing full anonymity protection to the data source and destination. It has more cost and increase for naturally resource constraint problem in MANETs particularly in multimedia wireless applications. High anonymity protection at a lower cost, we propose an unsigned Location-based competent Routing protocol. It dynamically partitions the network field into different zones and randomly chooses nodes in various zones as intermediate relay nodes, it also non traceable. It's based on counter intersection and timing attacks. It performs better route anonymity. It has self configuring infrastructure less networks. In future, the Random forwarder node replication attack will be also eliminated. To consider this attack, set up server will assign the key for each random forwarder node is generated by using the polynomial bivariate key generation scheme. The key wrapping algorithm used to protect the key from the adversary. In this paper, one way hash chain algorithm is used for key wrapping.

A Study of Geographic Adaptive Fidelity Routing Protocol in Wireless Sensor Network

The Energy consumption is a great challenge in the field on Wireless Sensor Network (WSN). It affects the performance of the whole network. There are two basic functions of nodes in the WSN. First is to collect the information from other sensor nodes and second is to pass the information to the base station. A variety of routing protocols have been proposed to reduce the energy consumption of nodes and increase the network lifetime. One of the most popular energy efficient routing protocol is Geographic Adaptive Fidelity (GAF). This is the location based routing protocol which uses the nodes location information to transfer the data. This reduces the use of energy by turning off the radio of some nodes which share the same functionalities. This paper focuses on the GAF protocol and its working. Also this paper reviews the variety of new versions based on GAF protocol to make it better.

A Link Quality Prediction Metric for Location based Routing Protocols under Shadowing and Fading Effects in Vehicular Ad Hoc Networks

The location-based routing protocol has been chosen as one of the efficient routing approaches in vehicular ad hoc networks in terms of low overhead and high scalability. Its critical advantage lies in performing a pathless routing such that a node having a packet forwards it to its neighbor node that provides the shortest physical distance to destination and this process continues until the packet reaches destination. The problem lies in that the link stability of the neighbors varies largely depending on the mobility of vehicles and the environmental factors that incur shadowing and fading effects. In this paper, we propose a new link quality prediction metric associated with location based protocols to improve the selection of next hop, that consider both the link quality assessment based on the transmission success rate and the link quality assessment based on the prediction of the future locations of vehicles. Simulation results are presented to demonstrate the efficiency of the proposed metric.

A Novel Energy Efficient Joint Dynamic Emissive Location-Based Routing Scheme for SOFAR Channel Underwater Sensor Networks

The Underwater Sensor Network (UWSN) could be recorded by hydrophones suspended in the channel as earthquake monitors by seismic events on or below the seafloor generated energy. In this paper, we present a novel position of sensor devices and routing protocol towards short for Sound Fixing and Ranging channel (SOFAR) for Sound Fixing and Ranging channel technologies, which could save transmission power. The sound speed also increases towards the warmer sea surface with temperature. Thus we use the oceanography to find more efficient ways of utilizing routing protocol and in to obtain more effective detection and identification capabilities for underwater sources. We present an adaptive location-based routing protocol which can overcome the location based UWSN without Global Positioning System (GPS) position. It reduced costs of deployment in long range propagation. The performances are measured according to the energy consumption per bit in which the result of simulator is better than other routing protocols such as FBR.

Traffic deflection method for dos attack defense using a location-based routing protocol in the sensor network

As the ubiquitous computing environment gets more attention and development, WSN (Wireless Sensor Network) is getting popular as well. Especially, the development of wireless communication and sensor equipment greatly contributes to the popularization of WSN. On the other hand, the safety and security of WSN attracts lots of attention due to such a development and distribution. The DoS (Denial of Service) attack, which gets more sophisticated and broadens its domain into various services fields, may have negative effects on WSN, making it vulnerable to attacks. Since WSN collects information through sensors that are already deployed, it is difficult to have its energy recharged. When WSN is under a DoS attack, sensor nodes consume lots of energy, bringing about a fatal result to the sensor network. In this paper, we propose a method to efficiently defend against DoS attacks by modifying routing protocols in the WSN. This method uses a location based routing protocol that is simple and easy to implement. In the WSN environment where the location-based routing protocol is implemented, this method disperses the DoS attack concentration of traffic by using the traffic deflection technique and blocks it out before arriving at the target destinations. To find out the number of traffic redirection nodes proper for this method, we have performed a few experiments, through which the number of such nodes was optimized.

A Self-Organizing Angle-based Routing Protocol for Urban Environments

MANET is not suitable to be applied to vehicle environments because of frequent path loss and path re-routing. To solve these problem, It is known that location-based routing protocol VANET is efficient. But, the VANET algorithm does not consider urban environments due to frequent vehicle movement and jamming by tall building. In this paper, we propose an efficient routing protocol to improve transfer efficiency and reduce transfer hop count. in urban networks.

A personalized Wireless Sensor Network Communication Model for computerization of Electric Power Distribution

Automation of electric power distribution in a l o a d p o i n t b y p r o v i d i n g reliable manner and cost-efficient can be accomplished by complete automation of the central control centre which coordinates the operation of several area centers while ensuring security of supply against loss of generation, transmission capacity, maintaining the voltage, current and frequency of the system within specified limits, temperature, pressure, and oil level of the transformers is required. Currently, automation is done with the help of Supervisory Control and Data Acquisition (SCADA) and Intelligent Electronic Devices (IEDs). A novel method is proposed in this paper about communication among the sensors. In this paper the cooperative wireless sensor network architecture for communication of the monitored signals and the employment of a virtual MIMO model, which would considerably reduce errors due to transient surge of charges and other interferences were discussed. Further, the paper proposes the use of a location aware protocol, GEAR, which is suitable for the sensor network architecture, as compared to the currently used protocols. The appropriate placement of sensors and adoption of additional signaling schemes can also prevent theft of electrical power, which is not a new problem in many areas. The application of sensor networks is becoming ever-present, and this paper introduces a new area of application of the sensor nets viz. in the automation of electrical power distribution. The automation of power distribution can be made well-organized in terms of energy utilization, speed, and bandwidth necessities from beginning to end to the application of sensor nets. The efficient elements that achieve security control and monitoring of the various signals are the sensor networks. The essential fault analysis system should provide results of a complete system-wide analysis of an event to the system dispatchers and safety engineers within seconds of the event happening. This may not be feasible with the existing SCADA technology. Wei Ye et al. (4) mention that the major drawback of current SCADA systems is that they are static, inflexible, and often have a centralized architecture. Further, there may be increased operational risks (8) associated with an inconsistent level of staff operational competency. In that case, the human intervention in decision making has to be minimized. In the proposed communication model, the processing of data signals by a single control centre (master) processor is decentralized, and the processing of information may be done in a distributed manner. Each sensor node may have a battery for its operation. The nodes are asleep, and unless there is a significant change in the measured parameters, only then they transmit. This avoids redundant transmission and hence saves a considerable amount of power and complex wiring to link all these sensors to the control equipment is eliminated through low power wireless transmission. The bandwidth requirement is least since the transmissions are mostly limited and are done only when necessary. The process of communication among the sensors is divided into the following phases: The long-haul transmission of signals to the monitoring (HMI) stations by strategic placement of the sensor clusters and implementing the location- based GEAR protocol and the communication of signals within clusters of the sensors that are in close proximity to each other on a virtual MIMO basis. The paper proposes the use of a location-based routing protocol called GEAR (Geographic and Energy Aware Routing) that implements energy efficient geographic packet forwarding techniques. The GEAR protocol is energy efficient on its own, and it would make possible faster communication. The location of sensors can be obtained by means of a hardware system (GPS) or by irregular beaconing. Since in the electric distribution network the sensors are rather static, the location information need not be transmitted frequently. This reduces the overhead in routing, as compared to other sensor networks scenarios. The broadcasting of information sensed by the sensors or a question that is sent by the base station is a primary need in the automation of power distribution. The broadcasting of data is done in a faster manner by use of the GEAR protocol. The assumption made (2) is that the energy consumed for processing is far

A New Scalable Hybrid Routing Protocol for VANETs

Vehicular ad hoc networks (VANETs) are highly mobile wireless networks that are designed to support vehicular safety, traffic monitoring, and other commercial applications. Within VANETs, vehicle mobility will cause the communication links between vehicles to frequently be broken. Such link failures require a direct response from the routing protocols, leading to a potentially excessive increase in the routing overhead and degradation in network scalability. In this paper, we propose a new hybrid location-based routing protocol that is particularly designed to address this issue. Our new protocol combines features of reactive routing with location-based geographic routing in a manner that efficiently uses all the location information available. The protocol is designed to gracefully exit to reactive routing as the location information degrades. We show through analysis and simulation that our protocol is scalable and has an optimal overhead, even in the presence of high location errors. Our protocol provides an enhanced yet pragmatic location-enabled solution that can be deployed in all VANET-type environments.