1 / 19

A Region-Based Routing Protocol for Wireless Mobile Ad Hoc Networks

A Region-Based Routing Protocol for Wireless Mobile Ad Hoc Networks. Yong Liu, Xuhui Hu, Myung J. Lee, and Tarek N. Saadawi, City University of New York Network 2004. Outline. Introduction Related work The REGR protocol Route Creation Protocol Route Update Protocol Simulation Results

Download Presentation

A Region-Based Routing Protocol for Wireless Mobile Ad Hoc Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. A Region-Based Routing Protocol for Wireless Mobile Ad Hoc Networks Yong Liu, Xuhui Hu, Myung J. Lee, and Tarek N. Saadawi, City University of New York Network 2004

  2. Outline • Introduction • Related work • The REGR protocol • Route Creation Protocol • Route Update Protocol • Simulation Results • Conclusion

  3. Introduction • Routing protocols are responsible for establishing low-cast high-quality routes in rather dynamic environment • Flooding-based • Dominant-sets-based

  4. Introduction • Flooding-based scheme • Advantage • Create a optimal routes • Disadvantage • Contention • Collision • Redundancy • Reduce redundant broadcast • Probabilistic • Count-based • Distance-based • Angle-based

  5. Introduction • Goal • Create a prerouting region between any active source and its desired destination • Limit the propagations of route request packets only within this region

  6. Related work [9] R. Castenada, S. R. Das, and M. K. Marina, “Query Localization Techniques for On-demand Routing Protocols in Ad Hoc Networks,” ACM/Kluwer Wireless Networks J., vol. 8, no. 2, Mar. 2002. • Proposed to repair broken routes with little control overhead • Updated route always shares the main body with the old route • Route update to track a mobile endpoint will become longer and longer

  7. Related work [10] C.-K. Toh, “Maximum Battery life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks,” IEEE Commun. Mag., June 2001. • Consider the reciprocal of residual battery

  8. Route Creation Protocol-Destination Discovery • The source initiates route construction by first broadcasting a destination locating (DLOC) packet • Distance-based approach • It does not hear the same packet from a neighbor within a distance threshold D • Counter-based approach • It does not hear the same packet from more than C neighbors • Distance-based backoff approach • The nodes located at the border of the sender relay the DLOC at the earliest time

  9. Route Creation Protocol-Destination Discovery • All nodes relaying the DLOC have to create a backward routing entry for the source. • When the DLOC arrives at the destination, a preliminary route is immediately ready in the backward direction (from destination to source).

  10. Route Creation Protocol-Formation of Prerouting Region • The destination selects the shortest route among them • Preliminary route • After choosing a preliminary route • The destination broadcasts a region definition (RDEF) packet to its neighbors • REGION_WIDTH • TTL

  11. Route Creation Protocol-In-Region Route Discovery • The destination broadcasts an RREQ packet a short period after it releases the RDEF • Link quality • Power condition • Each in-region node adds the reciprocal of its residual battery capacity as its node cost to the RREQs • The source chooses the best one and begins to forward data along this route

  12. Route Update Protocol • The RU-SRC initiates the route update process by broadcasting an RDEF packet • The low-power nodes and broken points of the route may block propagation of the RDEF • Every capable node in the old route starts a route-cleartimer after it broadcasts the RDEF out and wait RDEF_ACK • If the sender doesn’t receive RDEF_ACK, increases the TTL and try once more

  13. Simulation Results • Node: 100-400 • Network size: 2000m*2000 m • Transmission range: 250 m • The initial power of each node: 25 J • Node transmitting power: 0.66 W • Node receiving power: 0.395 W • Node idle power: 0.035 W • Packet transmission rate: 5 packets/s • Packet size: 2048 bits • RREQ and DLOC packet size: 192 bits • RREP and RDEF packet size: 160 bits

  14. Simulation Results

  15. Simulation Results

  16. Conclusion • We introduce a region-based routing protocol for wireless mobile ad hoc networks • Blindly spread RREQs to the whole network • Limits route discovery activities within a predefined region between the source and destination

More Related