1 / 50

A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks

A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks. Pi-Cheng Hsiu and Tei-Wei Kuo Department of Computer Science and Information Engineering, National Taiwan University. IEEE Transactions on Mobile Computing, TMC 2009. Wireless & Mobile Network Laboratory (WMNL.)

signe-harding
Download Presentation

A Maximum-Residual Multicast Protocol for Large-Scale 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 Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks Pi-Cheng Hsiu and Tei-Wei Kuo Department of Computer Science and Information Engineering, National Taiwan University IEEE Transactions on Mobile Computing, TMC 2009 Wireless & Mobile Network Laboratory (WMNL.) Department of Computer Science and Information Engineering, Tamkang University

  2. Outline

  3. Introduction • Multicasting is widely used in many ad hoc networks. • Teleconference • Tourist information distribution • Multimedia entertainment • Taxi dispatching • Cooperative congestion monitoring

  4. Introduction • With the popularity of mobile devices, routing becomes increasingly challenging. • Network topologies may change quickly in an unpredictable way. • Data traffic may change quickly in an unpredictable way. • Critical energy efficiency considerations.

  5. Introduction • Routing over mobile ad hoc networks is complicated by the considerations of energy efficiency. • Minimum-Energy Routing. • Maximum-Lifetime Routing.

  6. Introduction • Most of the existing literature in power-aware routing • Rely on the knowledge of certain global information. • Remaining energy • Minimum transmission power • Difficulty and cost in the maintenance of up-o-date information. • Various assumptions are made to reduce the problem complexity. • Static network topologies • Fixed traffic patterns

  7. Goal • Proposes a power-aware routing protocol. • Prolong the first node failure time. • Without collecting the topology of the whole network. • Without collecting the remaining energy information of each node. • Nodes are able to have different communication ranges. • Multicasting • Distributed.

  8. Network Assumption • Every node is able to adjust its power level in packet transmission. • Every node is able to measure the received signal strength RSSI (Received Signal Strength Indication).

  9. Maximum-Residual Multicast Protocol Maximum-Residual Multicast Protocol Route Discovery Route Establishment Data Forwarding

  10. Maximum-Residual Multicast Protocol - Overview Source b d Destination f a c e Route Discovery Route Establishment Data Forwarding

  11. Maximum-Residual Multicast Protocol - Overview a, 0.25 b, 0.25 Source b d Destination f a e, 0.5 d, 0.5 c e a, 0.5 c, 0.5 d, 0.75 Route Discovery Route Establishment Data Forwarding

  12. Maximum-Residual Multicast Protocol - Overview a, 0.25 b, 0.25 Source b d Destination f a e, 0.5 c e a, 0.5 d, 0.75 Route Discovery Route Establishment Data Forwarding

  13. Maximum-Residual Multicast Protocol - Overview b, 0.25 Source b d d, 0.75 Destination f a a, 0.5 c e e, 0.5 Route Discovery Route Establishment Data Forwarding

  14. Maximum-Residual Multicast Protocol Maximum-Residual Multicast Protocol Route Discovery Route Establishment Data Forwarding

  15. Route Discovery Maximum-Residual Multicast u ω(u,v)=5 v β(u)=100 β(v)=85 γ(v)=1

  16. Route Discovery Maximum-Residual Multicast

  17. Route Discovery Maximum-Residual Multicast (90, 1) (80, 1) b d (85, 2) (85, 2) f a The remaining amount of energy of node e. The energy consumption of receiving S of node e. β(e) γ(e) c e (100, 2) (95, 2)

  18. Route Discovery Maximum-Residual Multicast (90, 1) (80, 1) 10 b d 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 10 10 5 10 15 c e (100, 2) (95, 2)

  19. Route Discovery Maximum-Residual Multicast Pt_max = 20 (90, 1) (80, 1) 10 b d 5 Adjust Ratio = 10 10 10 5 (85, 2) (85, 2) ω(c,e) = (Pt_max) × (Adjust Ratio) 15 f 5 5 a ω(f,e) The amount of energy needed for a node c to transmit S to another node e. 10 10 5 10 ω(c,e) ω(e,f) 15 c e (100, 2) (95, 2) Pr_min = 3 0.75 Pr = 4

  20. Route Discovery Maximum-Residual Multicast Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 The residual energy over a path from s to node a. 10 5 (85, 2) (85, 2) 15 f 5 5 a The predecessor of node a. 10 10 5 10 15 c e (100, 2) (95, 2)

  21. Route Discovery Maximum-Residual Multicast 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 min{m[a], β(a)-ω(a,b)-γ(a), β(b)-γ(b)} 10 5 85 80 89 (85, 2) (85, 2) 15 f 5 5 a {sID, nsession, R, β(a), m[a], γ(a)} 10 10 5 10 15 c e (100, 2) (95, 2) 0.5

  22. Route Discovery Maximum-Residual Multicast 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 85 75 98 10 10 min{m[a], β(a)-ω(a,c)-γ(a), β(c)-γ(c)} 5 10 15 c e (100, 2) (95, 2) 0.5

  23. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 10 10 5 10 0.75 15 c e (100, 2) (95, 2) 0.5 0.75

  24. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 min{m[b], β(b)-ω(b,d)-γ(b), β(d)-γ(d)} 10 5 80 84 79 (85, 2) (85, 2) 15 f 5 5 a 10 10 5 10 0.75 15 c e (100, 2) (95, 2) 0.5 0.75

  25. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 75 83 93 10 10 min{m[c], β(c)-ω(c,e)-γ(c), β(e)-γ(e)} 5 10 0.75 15 c e (100, 2) (95, 2) 0.5 0.75

  26. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 10 10 5 10 0.75 15 c e (100, 2) (95, 2) 0.5

  27. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 0.5 10 10 5 10 15 c e (100, 2) (95, 2) 0.5 0.25

  28. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 0.5 10 10 min{m[d], β(d)-ω(d,f)-γ(d), β(f)-γ(f)} 5 10 75 69 83 15 c e (100, 2) (95, 2) 0.5 0.25

  29. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 0.5 79 74 93 10 10 min{m[d], β(d)-ω(d,e)-γ(d), β(e)-γ(e)} 5 10 15 c e (100, 2) (95, 2) 0.5 0.25

  30. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 f 5 5 a 0.25 0.5 10 10 5 10 15 c e (100, 2) (95, 2) 0.5 0.25

  31. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) min{m[e], β(e)-ω(e,f)-γ(e), β(f)-γ(f)} 15 f 5 5 a 74 88 83 0.25 0.25 0.5 10 10 5 10 15 c e (100, 2) (95, 2) 0.5 0.25

  32. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 min{m[f], β(f)-ω(f,d)-γ(f), β(d)-γ(d)} 10 5 74 73 79 (85, 2) (85, 2) 15 Loop free f 5 5 a 0.25 74 73 93 10 10 min{m[f], β(f)-ω(f,e)-γ(f), β(e)-γ(e)} 5 10 15 c e (100, 2) (95, 2) 0.5 0.25

  33. Route Discovery Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) 10 Source b d Destination 5 10 10 10 5 (85, 2) (85, 2) 15 Loop free 5 5 f a 0.25 10 10 5 10 15 c e (100, 2) (95, 2) 0.5 0.25

  34. Route Establishment Maximum-Residual Multicast Maximum-Residual Multicast Protocol Route Discovery Route Discovery Route Establishment Route Establishment Data Forwarding

  35. Route Establishment Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) Source b d Destination (85, 2) (85, 2) f a 0.25 c e (100, 2) (95, 2) 0.5 0.25

  36. Data Forwarding Maximum-Residual Multicast Maximum-Residual Multicast Protocol Route Discovery Route Establishment Route Establishment Data Forwarding Data Forwarding

  37. Data Forwarding Maximum-Residual Multicast 0.25 0.25 Pt_max = 20 (90, 1) (80, 1) Source b d Pt=5 Destination Pt=10 (85, 2) (85, 2) Pt=5 f a 0.5 Pt=10 Pt=5 c e (100, 2) (95, 2) 0.25

  38. Performance Evaluation

  39. Performance Evaluation

  40. Performance Evaluation 500 m 500 m

  41. Performance Evaluation

  42. Performance Evaluation

  43. Performance Evaluation Outrunning problem Overhearing problem 2.6 times 2~9 times

  44. Performance Evaluation Outrunning problem High collision probability

  45. Performance Evaluation Neighbor and group maintenance

  46. Performance Evaluation

  47. Performance Evaluation

  48. Performance Evaluation Shorter path but longer delay！？ Control messages are high-priority packets.

  49. Conclusion • This paper proposes a power-aware routing protocol - MRMP. • Maximize the minimum residual energy of nodes in the network. • Prolong the first node failure time. • Without collecting the topology of the whole network. • Without collecting the remaining energy information of each node. • Nodes are able to have different communication ranges. • Applicable to various related optimization problems. • Ex. Minimization of the total energy consumption of any path from a source to a destination

  50. Wireless & Mobile Network Laboratory (WMNL.) Department of Computer Science and Information Engineering, Tamkang University T h a n k s ~ ~ ~ T T h h a a n n k k s s ~ ~ ~ ~ ~ ~

More Related