Location-aware Routing Protocol Research Articles

Smart Hybridized Routing Protocol for Animal Monitoring and Tracking Applications

Wireless sensor networks (WSN) have been exploited for {countless} application domains, most notably the surveillance of environments and habitats, which has already become a critical mission. As a result, WSNs have been implemented to monitor animal care and track their health status. However, excessive energy utilization and communication traffic on packet transmissions lead to system deterioration, especially whenever perceived information captured in the monitoring area is transferred to the access point over multiple dynamic sinks. Further to manage the energy and data transmission issue, the energy consumption and location aware routing protocol has been architected on the wireless Nano sensor nodes. In this article, a novel hybrid energy and location aware routing protocol to cloud enabled IoT based Wireless Sensor Network towards animal health monitoring and tracking has been proposed. However proposed data routing protocol incorporates the trace file for path selection for data transmission to base station using sink node. Trace file has been obtained on processing the cluster heads established in the network. Therefore, clustering of node in the network has to be achieved using LEACH protocol which enhances the network scalability and network lifetime by clustering the nodes with Metaheuristics constraints like location or node density comparability. The objective of the proposed model is to enhance the network scalability and energy consumption by establishing the multiple node clusters with high density cluster head through Metaheuristics Node Clustering optimization techniques. Metaheuristics based node clustering is been obtained using Improved Particle Swarm Optimization. Further it is employed to compute the optimal path for sensed data transmission to base station. Node clustering provides high energy consumption among the sensing nodes and to establish the high energy clusters towards sensed information dissemination to base station on dynamically reforming the nodes clusters with respect to Node density and node location. Simulation analysis of the proposed energy efficient routing protocol provides high performance in energy utilization, packet delivery ratio, packet loss and Average delay compared against the conventional protocols on propagation of the data through sink node to base station

A location-aware routing protocol with adaptive transmission angle management in mobile overlay cognitive ad hoc networks

In this paper, we propose the location-aware routing protocol (LRP) to enhance the spectrum efficiency in mobile overlay cognitive ad hoc network and provide the adaptive transmission angle management to reduce the number of control packet. The main contributions of this paper can be summarised as follows. First, we propose a LRP to improve the spectrum efficiency for the considered networks. The LRP can establish a route by avoiding the coverage of primary users (PUs). Second, the LRP selects the next node that is the nearest node from the centre line between a source node and a destination node. Thus, the proposed routing protocol can transmit the data packet stably. Third, we propose an adaptive transmission angle management that takes into account the previous session route state in order to reduce the amount of control packet in the considered networks.

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.

A location-aware routing protocol with adaptive transmission angle management in mobile overlay cognitive ad hoc networks

A location-aware routing protocol with adaptive transmission angle management in mobile overlay cognitive ad hoc networks

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

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

Secure location aware routing protocol with authentication for data integrity

Similar to mobile ad hoc network (MANET), cloud computing also has properties including wireless communication within predesigned network and also limitations such as network privacy and performance. With regards to MANET security is a prime concern where the security is compromised through several attackers. Attacks can be of two types—active and passive. These attacks are prone to network devices and the network is made unavailable. It is hard to identify the location of unknown nodes and attacks when there is a mobility period. Prior studies show that schemes are introduced by authors to protect location of nodes that are genuine from attackers. The MANETs make use of a security routing scheme for the purpose of establishing a secure route along with a secure transmission of data. The main threat to security in case of the MANET is its integrity, privacy and non-repudiation. In order to combat with such threats to security there are several protocols to routing that have been designed for the reduction of the threats in security in the MANET. The need for such protocols that are scalable and energy efficient with the small, low power as well as inexpensive positioning instruments has resulted in the introduction of various routing protocols that are location-based with a promising choice in terms of MANETs. In this study, to strike a balance between location authentication and node identity secure location aware routing protocol (SCLARP) is developed. In the first module of the proposed study, introduction of network and attack model take place, which can follow the rules of secure authentication; whereas, in the second part of the protocol, along with location integrity, secure multicast tree is formed. The main focus of this module is the development of secure multicast groups. In the final module, deployment of public key encryption and decryption scheme take place which deploys in protecting the node from the attackers. As soon as the plain text from the side of the decryption is got the source nod or the parent node will broadcast all data packets to its destination. From the results of the study, it is shown that SCLARP performs better with regards to location and packet integrity, node authentication ratio, end-to-end delay and packet delivery ratio.

A secure and efficient cluster based location aware routing protocol in MANET

Mobile adhoc network (MANET) is a collection of node under a communication with each other nodes in the network. They are mobile nodes which can change its location according to the requirement. So the location based routing is needed for transmission of packet. For the data packet security, the existing algorithm is enhanced as “A secure location aware routing protocol”. In this nodes are arranged by means of a clustering technique. This protocol will predict the future location of node using particle swarm optimization. The link lifetime, speed, distance and position of node is calculated earlier to find the optimized route. The trust value of node is computed from neighbor node which helps in prediction of future location and also to find malicious node in network to reduce packet loss. To prevent data from malicious node, the packets are encrypted using elliptic curve cryptography. Due to trust value, the routing information can be updated for easily and also improve the network throughput.

Energy Location Aware Routing Protocol (ELARP) for Wireless Multimedia Sensor Networks

Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.

Energy Location Aware Routing Protocol (ELARP) for Wireless Multimedia Sensor Networks

Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.

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

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.

Dynamic Reliable Location Aware Routing Protocols for Mobile Wireless Sensor Network

Energy efficiency, network lifetime, data transmission, endto-end delay, reliable routing protocols for mobility centric and mobility of Cluster Head are the major parameters used for wireless sensor network (WSN), and are maintained by various of protocols. Existing cluster-based mobile routing protocols such as LEACH, LEACH-Mobile, LEACH-Mobile Enhanced, CBR-Mobile, LFCP-MWSN consider energy efficiency of sensor node. These protocols allocate the extra timeslots using time division multiple access (TDMA) scheme to accommodate nodes that enter a cluster because of mobility and thus increase the end-to-end delay. In this study a new ILFCP-MWSN protocol is proposed based on mobility of the cluster head. The results revealed that ILFCP-MWSN protocol is more efficient in terms of Energy Consumptions, Remaining Energy and Approximate Number of Data Transmissions than those of the existing LEACH-M, LEACHME, LFCP-MWSN protocols.

Trust and Location-Aware Routing Protocol for Wireless Sensor Networks

ABSTRACTThis paper presents the trust and location-aware routing (TLAR) protocol for cooperative location-aware routing in wireless sensor networks. The objective of the TLAR protocol is to offer dependable and lightweight location-aware routing solution for the resource constrained WSNs. TLAR protocol consists of two modules: (1) trust assessment and (2) routing. In the trust assessment module, nodes running the TLAR protocol calculate the consolidated trust values (CTVs) of its neighboring nodes by using direct and indirect observations. During CTVs calculation, unlike existing trust models, the proposed trust module dynamically adjusts weights associated with the trust metrics. On the other hand, in the routing module, the routing decisions are supported by CTVs and geographic routing principles. The performance of the TLAR protocol is validated through the network simulator ns-2 simulations. It is observed from the simulation results that the TLAR protocol is robust in detecting and isolating malicious nodes from the routing process.

A Brief Review on Dynamic Reliable Location Aware Routing Protocols for Mobile Wireless Sensor Network

Energy efficiency, network lifetime, data transmission, end- to-end delay and reliable routing protocols for mobility centric are the major parameters used for wireless sensor network (WSN), and are maintained by various of protocols. Existing cluster-based mobile routing protocols such as LEACH, LEACH-Mobile, LEACH-Mobile Enhanced, CBR-Mobile, LFCP-MWSN consider energy efficiency of sensor node. These protocols allocate the extra timeslots using time division multiple access (TDMA) scheme to accommodate nodes that enter a cluster because of mobility and thus increase the end-to-end delay. In this paper we discussed the various protocols such as LEACH, LEACH-M, LEACH-ME, DSC, CBR-M, LFCP-MWSN. The results revealed that that LFCP-MWSN protocol is more efficient in terms of energy consumptions, network lifetime and data transmissions than those of the existing LEACH-M and LEACH-ME protocols. KeywordsClustering Methods; Wireless Sensor

Optimization of Location Aware Routing Protocol for Wireless Adhoc Tactical Networks

Optimization of Location Aware Routing Protocol for Wireless Adhoc Tactical Networks

Reliable location-aware routing protocol for mobile wireless sensor network

Designing energy efficient and reliable routing protocols for mobility centric applications of wireless sensor network (WSN) such as wildlife monitoring, battlefield surveillance and health monitoring is a great challenge since topology of the network changes frequently. Existing cluster-based mobile routing protocols such as LEACH-Mobile, LEACH-Mobile-Enhanced and CBR-Mobile consider only the energy efficiency of the sensor nodes. However, reliability of routing protocols by incorporating fault tolerance scheme is significantly important to identify the failure of data link and sensor nodes and recover the transmission path. Most existing mobile routing protocols are not designed as fault tolerant. These protocols allocate extra timeslots using time division multiple access (TDMA) scheme to accommodate nodes that enter a cluster because of mobility and thus, increases end-to-end delay. Moreover, existing mobile routing protocols are not location aware and assume that sensor nodes know their coordinates. In this study the authors, we propose a location-aware and fault tolerant clustering protocol for mobile WSN (LFCP-MWSN) that is not only energy efficient but also reliable. LFCP-MWSN also incorporates a simple range free approach to localise sensor nodes during cluster formation and every time a sensor moves into another cluster. Simulation results show that LFCP-MWSN protocol has about 25–30% less network energy consumptions and slightly less end-to-end data transmission delay than the existing LEACH-Mobile and LEACH-Mobile-Enhanced protocols.

Vector routing protocols for Delay Tolerant Networks

In Delay Tolerant Networks (DTNs) with frequent network partitioning, routing packets is a challenge, because the successful establishment of an end-to-end path between source and destination nodes is not guaranteed. Typical routing protocols for DTNs depend on data replications over multiple paths for reliable data delivery. Since they invoke a lot of replicated packets, we propose three efficient Vector Routing protocols based on the vector of node movements in order to reduce the number of such replications: Flooding-based, History-based and Location-aware Vector Routing protocols. Using ns-2 simulation with two different mobility models, we verify that Vector Routing protocols show better performance than other existing protocols in terms of less amount of traffic incurred without loss of packet delivery ratio.

Velocity-Assisted Predictive Mobility and Location-Aware Routing Protocols for MobileAd HocNetworks

In recent years, many location-aware routing protocols have been proposed for mobile ad hoc networks. The efficiency of the routing protocols can be improved by considering the location information of the mobile nodes (MNs). However, the mobility characteristics of the MNs have not been taken into account in most of the related work. In this paper, the proposed velocity-aided routing (VAR) algorithm determines its packet forwarding scheme based on the relative velocity between the intended forwarding node and the destination node. The routing performance can further be improved by the proposed predictive mobility and location-aware routing (PMLAR) algorithm, which incorporates the predictive moving behaviors of MNs in protocol design. The region for packet forwarding is determined by predicting the future trajectory of the destination node. The routing performance can be effectively enhanced by adopting both the proactive maintenance and the VAR mechanisms within the proposed PMLAR scheme. Simulation results show that the PMLAR protocol associated with its derivative schemes outperforms other routing protocols under different network topologies.

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks

One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, position-based routing protocol uses the location information of mobile nodes to confine the route searching space into a smaller estimated range. The smaller route searching space to be searched, the less routing overhead and broadcast storm problem will occur. In this paper, we proposed a location-based routing protocol called LARDAR. There are three important characteristics be used in our protocol to improve the performance. Firstly, we use the location information of destination node to predict a smaller triangle or rectangle request zone that covers the position of destination in the past. The smaller route discovery space reduces the traffic of route request and the probability of collision. Secondly, in order to adapt the precision of the estimated request zone, and reduce the searching range, we applied a dynamic adaptation of request zone technique to trigger intermediate nodes using the location information of destination node to redefine a more precise request zone. Finally, an increasing-exclusive search approach is used to redo route discovery by a progressive increasing search angle basis when route discovery failed. This progressive increased request zone and exclusive search method is helpful to reduce routing overhead. It guarantees that the areas of route rediscovery will never exceed twice the entire network. Simulation results show that LARDAR has lower routing cost and collision than other protocols.

A Location-Aware Routing Protocol for the Bluetooth Scatternet

Bluetooth is a most promising technology for the wireless personal area networks and its specification describes how to build a piconet. Though the construction of scatternet from the piconets is left out in the specification, some of the existing solutions discuss the scatternet formation issues and routing schemes. Routing in a scatternet, that has more number of hops and relay nodes increases the difficulties of scheduling and consumes the bandwidth and power resources and thereby impacts on the performance of the entire network. In this paper, a novel routing protocol (LARP) for the Bluetooth scatternet is proposed, which reduces the hop counts between the source and the destination and reconstructs the routes dynamically using the location information of the Bluetooth devices. Besides, a hybrid location-aware routing protocol (HLARP) is proposed to construct the shortest routes among the devices with or without having the location information and degenerate the routing schemes without having any location information. Experimental results show that our protocols are efficient enough to construct the shortest routing paths and to minimize the transmission delay, bandwidth and power consumption as compared to the other protocols that we have considered.