An ad hoc network is a dynamic multi-hop wireless network that is established
by a group of mobile hosts on a shared wireless channel by virtue of their
proximity to each other. Since wireless transmissions are locally broadcast in
the region of the transmitting host, hosts that are in close proximity can hear
each other and are said to be neighbors. The transitive closure of the
neighborhood of all the hosts in the set of mobile hosts under consideration
forms an ad hoc network. Thus, each host is potentially a router and it is
possible to dynamically establish routes by chaining together a sequence of
neighboring hosts from a source to a destination in the ad hoc network.
The scarcity of the wireless channels makes it difficult for resource
critical applications to execute in wireless environments. Also, efficient
resource utilization becomes a challenging task. This project focuses on
mechanisms for routing in ad-hoc networks such that the routes would have a
higher chance of satisfying the required resources
History of Ad hoc Networks..
In 1996 TIMELY started looking at theoretical aspects of approximations to
minimum dominating sets. Nodes in dominating sets were identified as candidate
nodes for maintaining shared information in a network. This work led to the
genesis of routing based on spine architecture. The spine was an approximation
to minimum connected dominating set. Several routing algorithms based on spine
were developed, such as PSR, OSR etc. But global computation was the major
drawback of the spine architecture. Over the years this work evolved into CEDAR
which briefly, is a QoS routing architecture for ad-hoc networks based on
management and computation of core nodes (dominating nodes) and distributed
state.
| 
