| Up
Further Reading:
Charles Perkins (ed.),
"Ad-Hoc Networking", Addison-Wesley, Upper Saddle River
(NJ), 2001.
|
This paper was submitted to Dr. Rasoul Safavian of The George
Washington University, Washington, D.C., as partial fulfillment of course
requirement in Mobile Communication Systems (ECE 253) on April 24, 2002.
Abstract
An ad-hoc network is a multi-hop wireless network where all nodes
cooperatively maintain network connectivity without a centralized
infrastructure. If these nodes change their positions dynamically, it is called
a mobile ad-hoc network (manet). Due to the limited
transmission range of wireless nodes, as well as the rapid change in network
topology, multiple network hops may be needed for one node to exchange data with
another across the network. Thus, each mobile node operates not only as a host
but also as a router, forwarding packets for other mobile nodes in the network
that may not be within the transmission range of the source. Each node
participates in an ad-hoc routing protocol that allows it to discover multi-hop
paths through the network to any other node.
Two conflicting requirements have to be kept in mind when designing a manet
routing algorithm— frequent topology updates are required because of mobility,
yet, frequent updates result in higher message overhead and greater power loss.
Different routing protocols use different metrics to dynamically determine the
optimal path between the sender and the recipient. These cost parameters include
number of hops, delay, link quality, location stability and power conservation.
The aim of this paper is to classify and qualitatively describe
different network routing algorithms, with particular emphasis on
power-awareness. A few common routing protocols have been explored in detail and
refinements proposed.
The
complete text of the Term Paper may be accessed here (26 pages, 169 KB).
(Requires Adobe Reader)
|
|
