Dynamic Routing in Mobile Ad Hoc Network

1. Dynamic Routing in Mobile Ad Hoc Network 報告者：呂佐鴻 指導教授：李鴻璋

2. What is Ad Hoc? • In an ad hoc network, a set of wireless stations communicate directly with one another without using an AP or any connection to a wired network.

3. Position-based routing protocol use the geographic position of nodes to make routing decisions. • Location information can be obtained through GPS or some other type of positioning mechanism.

4. Position-based routing can be divided into two distinct tasks： • The location service (discovering the position of the destination) • The actual routing of data packets (based on location information)

5. Position or geographical routing thus allows radios to operate nearly stateless; nodes neither have to store routing tables nor transmit messages to keep routing tables up-to-date. • One potential weakness of this family of location-aware protocols is the dependence on GPS for obtaining one’s location.

6. There exist three common routing strategies for position-based routing – greedy forwarding, directed flooding, and hierarchical routing. • A node forwards a given packet to one (greedy forwarding) or more (directed flooding) one-hop neighbors that are located closer to the destination than the forwarding node itself.

7. Distance routing effect algorithm for mobility (DREAM) • DREAM is based on the observation that the greater the distance separating two nodes. • Source and intermediate nodes calculate the direction of destination D and, based on the mobility information about D, associate an angular range with the routing entry to D.

8. Distance routing effect algorithm for mobility (DREAM) • The direction toward the destination is determined by means of the so-called “expected region”. • A message is forwarded to all neighbors whose direction belongs to the selected range.

9. Distance routing effect algorithm for mobility (DREAM)

10. Distance routing effect algorithm for mobility (DREAM) • The neighboring hops repeat this procedure using their view for D’s position. • Nodes in DREAM broadcast position update messages to update the position information by other nodes.

11. Distance routing effect algorithm for mobility (DREAM) • A node can control the accuracy of its position information available to other nodes by • Modifying the frequency with which it sends position updates • Indicating how far a position update packet is allowed to travel before being discarded.

12. Distance routing effect algorithm for mobility (DREAM) • The distance effect is a reasonable paradigm when intermediate hops are allowed to update the position information carried in a packet. • DREAM works well in combination with an all-for-all location service that provides more accurate information close to the destination.

13. Distance routing effect algorithm for mobility (DREAM) • This reduces the size of expected region and thus the area in which the packet is flooded. • DREAM uses directed flooding to limit the flooding to the direction of the destination. • Directed flooding restricts routing redundancy which may prevent the routing protocol from discovering the shortest paths.

14. Location-aided routing (LAR) protocol • LAR assumes that data source node knows the location and roaming speed of the destination node. • The LAR protocol basically uses restricted flooding to discover routes. • Specifically, only the hosts in the request zone help forward route-searching packets.

15. Location-aided routing (LAR) protocol • S initiates a route discovery process, it should include the coordinates of the request zone in the packet. • A receiving host simply needs to compare it own location to the request zone to decide whether or not to rebroadcast the route-searching packet.

16. Location-aided routing (LAR) protocol

17. Location-aided routing (LAR) protocol • When D receives the route request packet, it sends a route reply packet back to S. When S receives the reply, the route is established. • If the route cannot be discovered within a specified time-out period, S can initiate a new route discovery with an expanded request zone.

18. Location-aided routing (LAR) protocol • One potential weakness of the protocol is that prior knowledge of the destination’s location may not always be available at the source. • The protocol may require mobiles to communicate their location more frequently, or enlist the aid of a distributed location service.

19. Location-aided routing (LAR) protocol • Furthermore, underlying the location-aided routing protocol is the notion that a route to the destination can be found by search in the general direction of the destination. • Terrain features such as buildings, hills, and foliage are, however, not considered.

20. Location-aided routing (LAR) protocol