1 / 39

Outline

A Low-latency and Energy-efficient Scheduling Algorithm for Multi-group Multicasting in Mobile Ad Hoc Networks Advisor: Professor Frank Y. S. Lin Presented by Pei-Wei Li. Outline. Introduction Problem Description Problem Formulation Lagrangian Relaxation. Introduction.

clangley
Download Presentation

Outline

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 Low-latency and Energy-efficient Scheduling Algorithm for Multi-group Multicasting in Mobile Ad Hoc Networks Advisor: Professor Frank Y. S. Lin Presented by Pei-Wei Li

  2. Outline • Introduction • Problem Description • Problem Formulation • Lagrangian Relaxation

  3. Introduction • In MANET, multicasting is the fundamental operation of many applications, including military communications, emergency relief and video conferencing, which require time-critical information. • Power is a valuable resource in MANET due to the limited battery capability of nodes. • The mobility of nodes in MANET causes the topology of the network to rapidly change.

  4. Introduction • There is an interesting trade-off between energy consumption and end-to-end latency of multicast when the transmission radius of a node is adjustable . • Case 1: transmission radius ↑ • latency ↓ • link holding time ↑ • energy consumption ↑ • Case 2: transmission radius ↓ • latency ↑ • link holding time ↓ • energy consumption ↓

  5. Step1: construct a multicast tree for each multicast source to reach its group members Step 2: schedule the transmission time of the nodes on these multicast trees and avoid the collision of transmission Objective: minimize the latency of multicasting Consider the mobility of nodes and the energy consumption of transmission.

  6. Problem Description

  7. Problem Description Source 6 4 Source 5 1 7 8 2 3

  8. Problem Description t1+t2+t3

  9. Problem Description

  10. Problem Description • Assumption • We get the location and mobility information of all nodes from GPS. • Prediction of velocities and oncoming positions of nodes can be provided by Gauss-Markov mobility model. • Transmission time can be divided into discrete slots. • All nodes in the network have their clocks synchronized. • Packet propagation delay can be ignored. • Each multicast source has single data to send.

  11. Problem Formulation

  12. Problem Formulation

  13. Problem Formulation

  14. Problem Formulation

  15. Problem Formulation Objective function

  16. Problem Formulation Subject to

  17. Problem Formulation Subject to

  18. Problem Formulation ≧1 1 0 0 Subject to

  19. Problem Formulation ≧0 1 0 Subject to

  20. Problem Formulation 1 Subject to

  21. Problem Formulation 1 1 Subject to

  22. Problem Formulation i j k k 1 1 1 0 1 1 Subject to

  23. Problem Formulation Subject to

  24. Lagrangian Relaxation

  25. Lagrangian Relaxation

  26. Lagrangian Relaxation

  27. Lagrangian Relaxation

  28. Lagrangian Relaxation

  29. Lagrangian Relaxation

  30. Lagrangian Relaxation

  31. Lagrangian Relaxation

  32. Lagrangian Relaxation

  33. Lagrangian Relaxation

  34. Lagrangian Relaxation

  35. Lagrangian Relaxation

  36. Lagrangian Relaxation

  37. Lagrangian Relaxation

  38. Thanks for your listening!

More Related