Geographical Routing With Location Service in Intermittently Connected MANETs
01 Feb 2011-IEEE Transactions on Vehicular Technology (IEEE Institute of Electrical and Electronics)-Vol. 60, Iss: 2, pp 592-604
TL;DR: A geographical routing algorithm called location-aware routing for delay-tolerant networks (LAROD), enhanced with a location service, location dissemination service (LoDiS), which together are shown to suit an intermittently connected MANET (IC-MANET).
Abstract: Combining mobile platforms such as manned or unmanned vehicles and peer-assisted wireless communication is an enabler for a vast number of applications. A key enabler for the applications is the routing protocol that directs the packets in the network. Routing packets in fully connected mobile ad hoc networks (MANETs) has been studied to a great extent, but the assumption on full connectivity is generally not valid in a real system. This case means that a practical routing protocol must handle intermittent connectivity and the absence of end-to-end connections. In this paper, we propose a geographical routing algorithm called location-aware routing for delay-tolerant networks (LAROD), enhanced with a location service, location dissemination service (LoDiS), which together are shown to suit an intermittently connected MANET (IC-MANET). Because location dissemination takes time in IC-MANETs, LAROD is designed to route packets with only partial knowledge of geographic position. To achieve low overhead, LAROD uses a beaconless strategy combined with a position-based resolution of bids when forwarding packets. LoDiS maintains a local database of node locations, which is updated using broadcast gossip combined with routing overhearing. The algorithms are evaluated under a realistic application, i.e., unmanned aerial vehicles deployed in a reconnaissance scenario, using the low-level packet simulator ns-2. The novelty of this paper is the illustration of sound design choices in a realistic application, with holistic choices in routing, location management, and the mobility model. This holistic approach justifies that the choice of maintaining a local database of node locations is both essential and feasible. The LAROD-LoDiS scheme is compared with a leading delay-tolerant routing algorithm (spray and wait) and is shown to have a competitive edge, both in terms of delivery ratio and overhead. For spray and wait, this case involved a new packet-level implementation in ns-2 as opposed to the original connection-level custom simulator.
Citations
More filters
TL;DR: The issues that existing CACC control modules face when considering close to ideal driving conditions are discussed, including how to keep drivers engaged in driving tasks during CACC operations.
Abstract: Cooperative adaptive cruise control (CACC) systems have the potential to increase traffic throughput by allowing smaller headway between vehicles and moving vehicles safely in a platoon at a harmonized speed. CACC systems have been attracting significant attention from both academia and industry since connectivity between vehicles will become mandatory for new vehicles in the USA in the near future. In this paper, we review three basic and important aspects of CACC systems: communications, driver characteristics, and controls to identify the most challenging issues for their real-world deployment. Different routing protocols that support the data communication requirements between vehicles in the CACC platoon are reviewed. Promising and suitable protocols are identified. Driver characteristics related issues, such as how to keep drivers engaged in driving tasks during CACC operations, are discussed. To achieve mass acceptance, the control design needs to depict real-world traffic variability such as communication effects, driver behavior, and traffic composition. Thus, this paper also discusses the issues that existing CACC control modules face when considering close to ideal driving conditions.
382 citations
Cites background from "Geographical Routing With Location ..."
...…existing routi7ng protocols for VANETs have explored various aspects on utilizing roadway characteristics or relays to achieve acceptable performance but still have problems on specific application for CACC, such as lack of methods against high mobility, low disruption tolerance, large delay, etc....
[...]
TL;DR: A comprehensive survey of position-based routing protocols for FANETs with their various categories is proposed, including a classification and a taxonomy of these protocols, and a detailed description of the routing schemes used in each category.
223 citations
Cites background or methods from "Geographical Routing With Location ..."
...• Advantages of LAROD: The store-carry and forward tech- nique used by LAROD provides a high delivery ratio, but at a substantially lower overhead....
[...]
...• Potential applications of LAROD: This kind of routing protocols is not adequate for delay-sensitive applications....
[...]
...proposed Location Aware Routing for Opportunistic Delay Tolerant (LAROD) [94], which is a delay tolerant geographical routing protocol based on the combination of the store-carry-and-forward and greedy forwarding techniques according to the network situation....
[...]
...Location Aware Routing for Opportunistic Delay Tolerant (LAROD) [94] Kuiper et al. proposed Location Aware Routing for Opportunistic Delay Tolerant (LAROD) [94], which is a delay tolerant geographical routing protocol based on the combination of the store-carry-and-forward and greedy forwarding techniques according to the network situation....
[...]
...Parameters FANET position-based routing protocols Reactive-based Greedy-based Delay tolerant (DTN) Heterogeneous RGR ARPAM MUDOR MPGR GPMOR GLSR LAROD AeroRP GRAA LCAD CRUV P-OLSR PASE Ref....
[...]
TL;DR: A comprehensive survey is presented covering the architecture, the constraints, the mobility models, the routing techniques, and the simulation tools dedicated to FANETs, better presenting the state of the art of this specific area of research.
Abstract: Owing to the explosive expansion of wireless communication and networking technologies, cost-effective unmanned aerial vehicles (UAVs) have recently emerged and soon they will occupy the major part of our sky. UAVs can be exploited to efficiently accomplish complex missions when cooperatively organized as an ad hoc network, thus creating the well-known flying ad hoc networks (FANETs). The establishment of such networks is not feasible without deploying an efficient networking model allowing a reliable exchange of information between UAVs. FANET inherits common features and characteristics from mobile ad hoc networks (MANETs) and their sub-classes, such as vehicular ad hoc networks (VANETs) and wireless sensor networks (WSNs). Unfortunately, UAVs are often deployed in the sky adopting a mobility model dictated by the nature of missions that they are expected to handle, and therefore, differentiate themselves from any traditional networks. Moreover, several flying constraints and the highly dynamic topology of FANETs make the design of routing protocols a complicated task. In this paper, a comprehensive survey is presented covering the architecture, the constraints, the mobility models, the routing techniques, and the simulation tools dedicated to FANETs. A classification, descriptions, and comparative studies of an important number of existing routing protocols dedicated to FANETs are detailed. Furthermore, the paper depicts future challenge perspectives, helping scientific researchers to discover some themes that have been addressed only ostensibly in the literature and need more investigation. The novelty of this survey is its uniqueness to provide a complete analysis of the major FANET routing protocols and to critically compare them according to different constraints based on crucial parameters, thus better presenting the state of the art of this specific area of research.
171 citations
Cites background from "Geographical Routing With Location ..."
...LAROD (Location Aware Routing for Opportunistic Delay tolerant network) [228] is a delay tolerant routing protocol dedicated to FANETs....
[...]
TL;DR: This article presents a comprehensive survey of routing protocols proposed for routing in Vehicular Delay Tolerant Networks (VDTN) in vehicular environment, focusing on a special type of VANET, where the vehicular traffic is sparse and direct end-to-end paths between communicating parties do not always exist.
155 citations
Cites background from "Geographical Routing With Location ..."
...The moving destination disseminates its new location using LAROD....
[...]
...To tackle this problem, Location Aware Routing for Delay-Tolerant Networks (LAROD) [54] uses a location dissemination service....
[...]
TL;DR: A Trusted Secure Geographic Routing Protocol (TSGRP) has been proposed for detecting attackers (presence of the hacker), considering the trust value for a node produced by combining the location trusted information and the direct trusted information.
Abstract:
Purpose
This study aims to evaluate the direct trust value for each node and calculate the trust value of all nodes satisfying the condition and update the trust value and value each trust update interval for a secure and efficient communication between sender and destination node. Hence, a Trusted Secure Geographic Routing Protocol (TSGRP) has been proposed for detecting attackers (presence of the hacker), considering the trust value for a node produced by combining the location trusted information and the direct trusted information.
Design/methodology/approach
Amelioration in the research studies related to mobile ad hoc networks (MANETs) and wireless sensor networks has shown greater concern in the presence of malicious nodes, due to which the delivery percentage in any given network can degrade to a larger extent, and hence make the network less reliable and more vulnerable to security.
Findings
TSGRP has outperformed the conventional protocols for detecting attacks in MANET. TSGRP is establishing a trust-based secure communication between the sender and destination node. The evaluated direct trust value is used after the transmission of route-request and route-reply packets, to evaluate the direct trust value of each node and a secure path is established between the sender and the destination node. The effectiveness of the proposed TSGRP is evaluated through NS-2 simulation.
Originality/value
The simulation results show the delay of the proposed method is 92% less than PRISM approach and the overhead of the proposed TSGRP approach is 61% less than PRISM approach.
138 citations
References
More filters
01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,614 citations
01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,256 citations
"Geographical Routing With Location ..." refers methods in this paper
...For comparison, we have also used the random waypoint mobility model [23]....
[...]
01 Jan 2002
TL;DR: A survey of mobility models that are used in the simulations of ad hoc networks and illustrates how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
4,618 citations
01 Aug 2002
TL;DR: In this paper, a survey of mobility models used in the simulations of ad hoc networks is presented, which illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol.
Abstract: In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
4,391 citations
01 Jan 2000
TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Abstract: Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with one another without any pre-existing network infrastructure. Existing ad hoc routing protocols, while robust to rapidly changing network topology, assume the presence of a connected path from source to destination. Given power limitations, the advent of short-range wireless networks, and the wide physical conditions over which ad hoc networks must be deployed, in some scenarios it is likely that this assumption is invalid. In this work, we develop techniques to deliver messages in the case where there is never a connected path from source to destination or when a network partition exists at the time a message is originated. To this end, we introduce Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery. The goals of Epidemic Routing are to: i) maximize message delivery rate, ii) minimize message latency, and iii) minimize the total resources consumed in message delivery. Through an implementation in the Monarch simulator, we show that Epidemic Routing achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
4,355 citations
"Geographical Routing With Location ..." refers background in this paper
...around between nodes until it reaches the destination, and 2) epidemic routing [15], where every node in the network receives a copy of a packet....
[...]