1 / 60

Minglu Li ( Department of Computer Science and Engineering, Shanghai Jiao Tong University )

On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas. Minglu Li ( Department of Computer Science and Engineering, Shanghai Jiao Tong University )

elu
Download Presentation

Minglu Li ( Department of Computer Science and Engineering, Shanghai Jiao Tong University )

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. On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas Minglu Li (Department of Computer Science and Engineering, Shanghai Jiao Tong University) Ling Ding, Yifeng Shao (Department of Computer Science, Texas University at Dallas, Richardson) Zhensheng Zhang (Argon ST (formerly SDRC) Inc., San Diego, CA ) BoLi (Department of Computer Science and Engineering, Hong Kong University) IEEE Transactions on Vehicular Technology, TVT 2010

  2. Outline Introduction • Virtual Link Reduction-based Protocol • Performance Evaluation • Conclusion

  3. Introduction • Broadcasting is essential in ad hoc networks for • Data dissemination • Route discovery • Resource discovery • Management • …

  4. Introduction • Broadcasting mechanism can categorize into three types • Simple flooding • Probability based • Neighbor knowledge based Waste too much network bandwidth Consume too much energy

  5. Introduction • Broadcasting mechanism can categorize into three types • Simple flooding • Probability based • Neighbor knowledge based Waste too much network bandwidth Consume too much energy Full delivery may not be guaranteed

  6. Introduction • Broadcasting mechanism can categorize into three types • Simple flooding • Probability based • Neighbor knowledge based Waste too much network bandwidth Consume too much energy Full delivery may not be guaranteed More efficient than flooding and probability based methods

  7. Introduction • Omnidirectional antennas in wireless ad hoc networks are highly inefficient in terms of power and capacity. • Rather small portion of the transmission power is actually intercepted by the antenna of the intended receiver Receiver Unwantedand harmful interference 10 350 Sender

  8. Introduction • Directional antennas achieve better signal-to-noise ratio and reduce interference. Receiver Sender

  9. Introduction • Several protocols have been proposed toward efficient broadcasting using directional antennas. • However, most of them • Are probability based approaches • Rely on location information • Rely on Angle-of-Arrival (AoA) information • Assume specific antenna models

  10. Goal • This paper focus on applying directional antennas to broadcasting. • Achieving full delivery • Reducing transmission cost and redundancy • Reducing bandwidth consumption • No location or AOA information is used • Using a general antenna model

  11. Network Assumption • There is no packet collision. • Otherwise, full delivery cannot be achieved even under flooding.

  12. Antenna Model • General antenna model. • Directional beams do not have to be regular, aligned, or nonoverlapping. • Directional transmission, Omnidirectional reception

  13. Virtual Link Reduction-based Protocol VLR-based Protocol Local Topology Information Maintenance Virtual Link Reduction Forwarding

  14. Virtual Link Reduction-based Protocol VLR-based Protocol Local Topology Information Maintenance Virtual Link Reduction Forwarding

  15. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol First roundexchanged 2 1 3 4 b a e j d i f c h g

  16. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol First roundexchanged 2 1 3 4 b a e j d 2 i 1 2 f c h g

  17. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol First roundexchanged 2 1 3 4 b a e j d 4 i 3 4 f c h g

  18. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol First roundexchanged Second roundexchanged 2 1 3 4 b a e j d i f c h g

  19. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol Second roundexchanged 2 1 3 4 b a e j d i f c h g

  20. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol Second roundexchanged 2 1 3 4 b a e j d i f c h g

  21. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol Second roundexchanged 2 1 3 4 b a e j d i f c h g

  22. Local Topology Information Maintenance Local Topology Information Maintenance Virtual Link Reduction Forwarding Virtual Link Reduction Forwarding VLR-based Protocol 2 1 3 4 b a e j d i f c h g

  23. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol Link Weight Given a network G =(V,E), weight(u1,v1) ＜weight(u2,v2) if andonlyif: (1) min(ID(u1), ID(v1)) ＜min(ID(u2), ID(v2)) (2) min(ID(u1), ID(v1)) ＝min(ID(u2), ID(v2)) and max(ID(u1), ID(v1)) ＜max(ID(u2), ID(v2)). 2 2 2 1 2 ＞ ＞ 3 1 1 3 1 1 3

  24. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol 2 1 3 4 b a e j d i f c h g

  25. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 1 5 10 4 9 6 3 8 7

  26. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 1 5 10 4 9 6 3 8 7

  27. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 2 1 4 1 5 10 4 3 9 3 3 6 3 8 7

  28. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 1 5 10 4 9 6 3 8 7

  29. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 1 5 10 4 9 6 3 8 7

  30. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 2 F(1) ={b, d} 1 5 10 4 4 9 6 3 3 8 7

  31. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  32. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  33. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  34. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  35. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  36. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  37. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  38. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 4 9 6 3 8 7

  39. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 2 F(1) ={b, d} 1 5 5 10 F(4) ={a, d} 4 4 9 9 6 6 3 3 8 7 7 F(3) ={b}

  40. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 5 10 F(4) ={a, d} 4 9 6 6 3 8 7 7 F(3) ={b}

  41. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 10 F(4) ={a, d} 4 F(9) ={b, c} 9 6 3 8 8 7 F(3) ={b}

  42. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 F(4) ={a, d} 4 F(9) ={b, c} 9 6 3 8 7 F(3) ={b}

  43. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 F(1) ={b, d} 1 5 10 F(4) ={a, d} 4 F(9) ={b, c} 9 6 3 8 7 F(3) ={b}

  44. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol b a c d 2 1 5 10 4 9 6 3 8 7 Further conserve energy

  45. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol

  46. Local Topology Information Maintenance Virtual Link Reduction Forwarding VLR-based Protocol minimal_angle=20 m = 20 The new angle should not be smaller than minimal_angle. The number of nodes covered by the new angle should not be smaller than the old number. Use the old angle Further conserve energy b 10 30 70 90 50 30 a c

  47. Performance Evaluation

  48. Performance Evaluation A(i)=90 2 1 N(i, v)=3 The total number copies of a packet received by all nodes The total number of nodes in the network 3 4 | F(v) |=3

  49. Performance Evaluation

  50. Performance Evaluation DSP K=4 VLR K=8 K=16 K=32 K=360

More Related