In these scenarios, the network needs to be
supplied with a trajectory that would serve as a ???nominal??? trajectory that
the routing protocol will try to adhere to, taking into account its own constraints,
such as node power depletion. The use of a computer aided design
(CAD) tool is proposed to allow an expert to enter a set of ordered coordinate
points and have the CAD design come up with a compact description of the
???nominal??? trajectory, adapting it to the given constraints. Simulation results
are discussed and a comparison with existing mechanisms is also given.
2 Routing in Ad Hoc Networks
Routing protocols in ad hoc networks can be grouped into two categories:
proactive and reactive protocols. Several protocols have been proposed in the
literature and many of them have served as mimicking models importable to
sensor networks. In this section, a brief description of both categories, their
advantages and disadvantages is given.
2.1 Proactive Routing
Many routing protocols fall under the category of proactive based routing.
Proactive protocols set up and update routing tables regardless of whether
communication is needed. Destination Sequence Distance Vector (DSDV) [17]
is a classical example of this group. DSDV is based on the Bellman??“Ford
algorithm which ensures that no loops are formed in the routing tables. Every
node in the network stores information about the next hop and distance
to every other node in the network.
Pages:
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584