Scribd
Upload
33 views

Position Based Routing: Keshab Chandra Nayak 0701294119

This abstract discusses position based routing in ad hoc networks. Recent availability of GPS and techniques for finding relative positions has justified applying position based routing methods to design power efficient and scalable networks. Several position based routing algorithms have been developed in recent years, including unicast and multicast routing algorithms. The abstract surveys existing routing methods and provides a taxonomy based on characteristics like loop-free behavior, distributed operation, path strategy, metrics used, memorization, guaranteed delivery, scalability, and robustness. It also briefly discusses issues related to position based routing schemes, power and cost aware routing, and physical requirements, experimental design, location updates, QoS, congestion, scheduling, topology construction, and broadcasting.

Uploaded by

kesavnayak
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Position Based Routing: Keshab Chandra Nayak 0701294119

This abstract discusses position based routing in ad hoc networks. Recent availability of GPS and techniques for finding relative positions has justified applying position based routing methods to design power efficient and scalable networks. Several position based routing algorithms have been developed in recent years, including unicast and multicast routing algorithms. The abstract surveys existing routing methods and provides a taxonomy based on characteristics like loop-free behavior, distributed operation, path strategy, metrics used, memorization, guaranteed delivery, scalability, and robustness. It also briefly discusses issues related to position based routing schemes, power and cost aware routing, and physical requirements, experimental design, location updates, QoS, congestion, scheduling, topology construction, and broadcasting.

Uploaded by

kesavnayak
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ABSTRACT

Position Based Routing


Abstract
Recent availability of small inexpensive low power
GPS(Global Positioning System) receivers and techniques for
finding relative coordinates based on signal strengths, and the
need for the design of power efficient and scalable networks,
provided justification for applying position based routing
methods in ad hoc networks. A number of such algorithms
were developed in last few years,like Unicast Routing
Algorithm and Multicast Routing Algorithms. The 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 (hop count,
power or cost), memorization (memoryless or memorizing
past traffic),guaranteed delivery, scalability, and robustness
(strategies to handle the position deviation due to the
dynamicity of the network). We briefly discuss the issues
coming under the Existing Position Based Routing Scheme
Basic Distance, Progress, and Direction Based Methods,Partial
Flooding and Multi-Path Based Path Strategies,Depth First
Search Based Routing with Guaranteed Delivery,Nearly
Stateless Routing with Guaranteed Delivery,Power and Cost
Aware Routing,We also briefly discuss relevant issues such as
physical requirements, experimental design, location updates,
QoS, congestion, scheduling node activity,topology
construction, broadcasting and network capacity. physical
requirements, experimental design, location updates, QoS,
congestion, scheduling node activity,topology construction,
broadcasting and network capacity.

Keshab chandra nayak


0701294119

You might also like