Open Access
An Analysis of the Effects of Intelligent Location Prediction Algorithms on Greedy Geographic Routing in Mobile Ad-Hoc Networks
Fraser Cadger,Kevin Curran,Jose Santos,Sandra Moffett +3 more
- pp 324-333
Reads0
Chats0
TLDR
The main contribution of this paper is the implementation and analysis of two existing location prediction schemes on top of the existing Greedy Perimeter Stateless Routing (GPSR) protocol ran in greedy mode.Abstract:
Geographic routing uses the physical locations of devices for routing purposes instead of the conventional routing protocols which make use of logical addressing schemes representing an abstract hierarchy. Greedy geographic routing is a popular method favoured for its efficiency and its simplicity that considers only one hop neighbours. Greedy routing needs only minimal network information and as such is resilient to change and dynamic behaviour. Recent advances have seen the development of location prediction algorithms that use a variety of methods to determine a node’s future location based on their previous movements. Such prediction schemes can potentially benefit greedy geographic routing by allowing nodes to make routing decisions based on where a node will go rather than where it was according to the last update. The use of location prediction algorithms therefore allows geographic routing protocols to make decisions that are more intelligent, thus not only improving routing performance but providing a crucial step towards fully autonomous computer communications. The main contribution of this paper is the implementation and analysis of two existing location prediction schemes on top of the existing Greedy Perimeter Stateless Routing (GPSR) protocol ran in greedy mode.read more
Citations
More filters
Journal ArticleDOI
Location Prediction of Vehicles in VANETs Using A Kalman Filter
TL;DR: In all traces, the proposed model exhibits superior prediction accuracy than the other prediction schemes, and this paper quantitatively compares the prediction performance of a Kalman filter and neural network-based methods.
Journal ArticleDOI
Effect of network parameters on neighbor wireless link breaks in GPSR protocol and enhancement using mobility prediction model
TL;DR: The effects of network parameters (beacon packet interval-time, node speed, network density, transmission range, and network area size) on Wireless link breakage, identified as the neighbor wireless link break (NWLB) problem, in the GPSR protocol are identified and the NWLBP model is proposed.
Journal ArticleDOI
Location and Mobility-Aware Routing for Improving Multimedia Streaming Performance in MANETs
TL;DR: This work investigates the prediction of continuous numerical coordinates using artificial neural networks to solve the problem of accurately predicting future location in non-infrastructure networks.
Journal ArticleDOI
An Adaptive Secure and Efficient Routing Protocol for Mobile Ad Hoc Networks
TL;DR: An adaptive routing protocol for MANETs is presented, which dynamically configures the routing function with respect to the varying requirement parameters and the contextual features as per the desired application context.
Book ChapterDOI
MANET location prediction using machine learning algorithms
TL;DR: Three popular machine learning techniques have been implemented in MATLAB and tested using data obtained from a variety of mobile simulations in the ns-2 simulator with the aim of guiding and encouraging development of location-predictive MANET applications.
References
More filters
Proceedings ArticleDOI
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Proceedings ArticleDOI
A scalable location service for geographic ad hoc routing
TL;DR: GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work, and compares favorably with Dynamic Source Routing.
Proceedings Article
Compass routing on geometric networks.
TL;DR: A close look at maps of numerous cities around the world, show that the previous way to explore a new, and unknown city will in general yield walks that will be close to the optimal ones to travel from one location to another.
Journal ArticleDOI
The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks
TL;DR: This paper analyze the use of on-demand behavior in routing protocols, focusing on its effect on the routing protocol's forwarding latency, overhead cost, and route caching correctness, drawing examples from detailed simulation of the dynamic source routing (DSR) protocol.
Book ChapterDOI
Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy
Silvia Giordano,Ivan Stojmenovic +1 more
TL;DR: This article surveys known routing methods, and provides their taxonomy in terms of a number of characteristics: loop-free behavior, distributed operation (localized, global or zonal), path strategy (single path, multi-path or flooding based), metrics used, guaranteed delivery, scalability, and robustness.