12.07.2015 Views

Wireless Ad Hoc and Sensor Networks

Wireless Ad Hoc and Sensor Networks

Wireless Ad Hoc and Sensor Networks

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Optimized Energy <strong>and</strong> Delay-Based Routing 359constraints imposed by the ad hoc networking environment. Therefore,any routing protocol proposed for a multihop ad hoc wireless networkmust consider the following design issues:Reactive vs. proactive routing approach: In the reactive routing approach(on-dem<strong>and</strong>), a route is not identified unless it is required. Bycontrast, proactive protocols periodically exchange control messages<strong>and</strong> provide the required routes instantly when needed. Inthe selection of reactive vs. proactive techniques, there is a tradeoffbetween the latency in finding the route to a destination <strong>and</strong>the control traffic overhead.Centralized vs. distributed approaches: Because there is no centralizedcontrol in wireless ad hoc networks, a distributed routing protocolis preferred.Optimal route: The definition of an optimal route is very importantfor the design of a routing protocol. General criteria are that thenumber of hops on the path or the overall link cost is used as themetric to determine the optimal route.Scalability: The routing protocol should scale well in large wirelessad hoc <strong>and</strong> sensor networks, with rapid topology changes <strong>and</strong>link failures.Control traffic overhead: The routing protocols must minimize the controltraffic overhead required to discover the routes.Efficiency: The routes selected by the routing protocol affect the performanceof the network in terms of delay, throughput, <strong>and</strong> energyefficiency. Therefore, the routing protocol should aim atimproving the overall network efficiency.In this chapter, the available routing protocols (Clausen <strong>and</strong> Jacquet 2003,Perkins et al. 2003, Johnson et al. 2003, Park <strong>and</strong> Corson 1997, Sivakumaret al. 1999, Perkins <strong>and</strong> Bhagwat 1994, Aceves <strong>and</strong> Spohn 1999) are reviewed,<strong>and</strong> an optimal energy-delay routing scheme is introduced. Reactive protocolslike AODV (Perkins et al. 2003), DSR (Johnson et al. 2003), TORA (Park<strong>and</strong> Corson 1997), <strong>and</strong> CEDAR (Sivakumar et al. 1999) compute the routeson-dem<strong>and</strong>, which reduces the control overhead at the cost of increasedlatency. The rapid changes to the topology <strong>and</strong> link failures present in adhoc networks, <strong>and</strong> the need to react quickly to the routing dem<strong>and</strong>s, makeproactive protocols more suitable for such networks. A few examples ofproactive routing protocols are DSDV (Perkins <strong>and</strong> Bhagwat 1994), STAR(Aceves <strong>and</strong> Spohn 1999), <strong>and</strong> OLSR (Jacquet et al. 2001, Clausen <strong>and</strong> Jacquet2003). However, these routing protocols attempt to find the minimal hoppath from the source to the destination, an approach that may not providethe optimal path in terms of delay <strong>and</strong> energy efficiency.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!