Article Information
Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

Keywords: Greedy Decision, Mobility Model, Position Unaware Routing, Position Aware Routing, Greedy Packet Stateless Routing, Beacon Interval, Transmission Range, Node Density

Mehran University Research Journal of Engineering & Technology

Volume 34 ,  Issue 4

Amber  Israr,Veselin  Rakocevic,Muhammad  Aamir


Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm) for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing) protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network