1 / 37

Energy- Aware Routing in Mobile Ad Hoc Networks

Energy- Aware Routing in Mobile Ad Hoc Networks . CSE 6590. By : Abeer & Abdullah. Outline. Energy Challenge in MANETs Global Energy-Aware Routing (GEAR) Local Energy-Aware Routing (LEAR ) Performance Discussion . Wireless Networks: MANETs. Wireless Networks. Infrastructure-based.

jalia
Download Presentation

Energy- Aware Routing in 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. Energy-Aware Routing in Mobile Ad Hoc Networks CSE 6590 • By : Abeer & Abdullah

  2. Outline • Energy Challenge in MANETs • Global Energy-Aware Routing (GEAR) • Local Energy-Aware Routing (LEAR) • Performance • Discussion

  3. Wireless Networks: MANETs Wireless Networks Infrastructure-based Infrastructureless Cellular Networks Mobile Nodes Static Nodes Wireless LANs Mobile Ad hoc Networks Mesh Networks Sensor Networks

  4. MANETs: Challenges • Wireless channels: error-prone media • Low bandwidth channels • Security • Unpredictable mobility • Devices: low power, limited resources • Maintaining connectivity, states

  5. Energy Challenges in MANETs • Portability and mobility • Each device act both as a host and a router • Energy efficiency is becoming the most critical issue for battery-operated devices • It is important to find ways to increase the life time of the network.

  6. Techniques to Reduce Power Consumptions • Reduce CPU clock speed • Spinning down internal disk • Turn off screen light • Power down mode • Turn off the radio when not in use • Not in Ad hoc networks • Local Energy-Aware Routing (LEAR) can be used

  7. Energy-Aware Ad Hoc Routing Algorithms

  8. Energy-Aware Ad Hoc Routing Algorithms • Global Energy-Aware Routing Algorithm (GEAR) • Local Energy-Aware Routing Algorithm (LEAR)

  9. What is GEAR? • Global Energy-Aware Routing Algorithm (GEAR) • Purpose : Optimize energy • Based on DSR • Simple and efficient • Requires global information • To find the optimal route

  10. What is GEAR? (Cont.) • Use power metrics • Minimize Energy consumed/packet • Maximize Time to Network Partition • Minimize Variance in node power levels • Minimize Cost/Packet

  11. How GEAR works ? • Source • Broadcast RREQ as DSR • Intermediate nodes • Node’s battery level attached to RREQ • Destination • Receives all RREQs from all possible paths • Chooses the route which minimizes the power

  12. Table : GEAR algorithm

  13. Advantages of GEAR • Advantages: • Saves energy • Maximizes system lifetime • Does that mean GEAR has good performance?

  14. Why does GEAR perform badly ? • Disadvantages: • Blocking • Can not utilize route cache • High traffic • Need for a new algorithm to overcome GEAR’s disadvantages

  15. Motivations for New Energy-Aware Routing protocol • Reducing energy consumption • Increasing nodes and networks lifetime • Taking advantage of the original DSR • Overcoming GEAR’S disadvantages

  16. What is LEAR? • Local Energy-Aware Routing Algorithm (LEAR) • Purpose : Optimize energy • Based on DSR • Does not require global information

  17. LEAR Basic Form • Nodes can forward or drop RREQ depending on its remaining battery power (Er) • Basic operation behavior : IfEr > Thr, Forward RREQ otherwise, Drop RREQ • Thr : Threshold value • Er : remaining battery power

  18. Why Sequence Numbers in LEAR ? • Worst case: all RREQs are dropped • Source re-send same RREQ with larger sequence number • Intermediate nodes adjusts (lowers) its Thr to allow forwarding to continue.

  19. LEAR Basic Form Problems • Two problems in the basic form: • Repeated RREQ messages • Difficulty in utilize route cache

  20. Problems 1 : Repeated RREQ Messages Er < Thr B Er < Thr Er < Thr Er < Thr C1 A S C2 D 1st RREQ 1st RREQ dropped by A due to node’s low battery level 2nd RREQ 2nd RREQ dropped by B 3rd RREQ 3rd RREQ dropped by C1 4th RREQ 4th RREQ dropped by C2 5th RREQ (a) Five route discovery procedures are required

  21. Problems 1: (Solution) B Er < Thr C1 A S C2 D 1st RREQ 1st RREQ dropped forwards DROP_ROUTE_REQ DROP_ROUTE_REQ message is broadcast 2nd RREQ (b) Two route discovery procedures are required

  22. Problems 2 : Difficulty in Utilize Route Cache Node B knows a path to D in its route cache Er > Thr B ROUTE_CACHE C1 ROUTE_REQ Er > Thr ROUTE_CACHE A S C2 ROUTE_REQ ROUTE_CACHE D ROUTE_CACHE message is unicast ROUTE_REQ message is broadcast (a) Unicast message to inform to the destination

  23. Problems 2 : (Solution) Node B knows a path to D in its route cache B Er< Thr ROUTE_CACHE C1 ROUTE_REQ DROP_RO UTE_CACHE A DROP_RO UTE_CACHE S ROUTE_REQ C2 CANCEL_ROUTE_CACH E D CANCEL_ROUTE_CACHE DROP_ROUTE_CACHE message is unicast message is sent back (b) Invalidating route cache upon a node with low battery level

  24. Table : LEAR algorithm

  25. Table : LEAR algorithm (cont.) ≠ ≠

  26. Solutions What Could Solve LEAR Problems ? • Routing-control messages • DROP_ROUTE_REQ • ROUTE_CACHE • DROP_ROUTE_CACHE • CANCEL_ROUTE_CACHE

  27. comparison

  28. Performance • GloMoSim 2.0 simulator • Parameters: • 40 mobile nodes • 1000 meters by 1000 meters range • 500 seconds of simulation time • Power consumption 0.05 Watts (sleep) to 1.50 Watts • 2 Assumptions: • Energy consumed during idling is ignored • Non-promiscuous mode

  29. DSR vsLEAR Reaming Battery Levels

  30. DSR vsLEAR Distribution of energy consumptions

  31. DSR vs LEAR Energy consumption with faster nodes

  32. DSR vs LEAR Ratio of Accepted ROUTE_REQs

  33. Summary • Problems: Larger transmission time: • Precedence to energy efficiency. • Less data receive ratio. • Balanced energy consumptions based on local info. • Simple • Can be easily integrated into existing ad hoc routing algorithms • LEAR improves the energy balance as much as 35% compared to the DSR algorithm.

  34. Future Work • GEAR simulation to compare results with LEAR • Optimize LEAR by using Alternative Path Routing • Apply LEAR to broadcast type network

  35. Discussion

  36. References • Woo, Kyungtae, et al. "Non-blocking, localized routing algorithm for balanced energy consumption in mobile ad hoc networks." Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001. Proceedings. Ninth International Symposium on. IEEE, 2001. • S. Singh, M. Woo, and C. S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” International Conference on Mobile Computing and Networking (MobiCom'98), pp.181-190, Oct. 1998. • R. Kravets and P. Krishnan, “Power Management Techniques for Mobile Communication,” International Conference on Mobile Computing and Networking (MobiCom'98), Oct. 1998. • D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, edited by T. Imielinski and H. F. Korth, Kluwer Academic Publishers, 1996. • Class ppts

  37. Thank you for listening!

More Related