Low latency broadcast in multirate wireless mesh networks chun tung chou archan misra junaid qadir
Download
1 / 20

Keon Jang 2007. 10. 18 - PowerPoint PPT Presentation


  • 90 Views
  • Uploaded on

Low Latency Broadcast in Multirate Wireless Mesh Networks Chun Tung Chou, Archan Misra, Junaid Qadir. Keon Jang 2007. 10. 18. Outline. Introduction Impact of Multirate Links on Efficient Broadcasting Problem Formulation Heuristic Algorithm Simulation and Performance Study Conclusion.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Keon Jang 2007. 10. 18' - anika


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Low latency broadcast in multirate wireless mesh networks chun tung chou archan misra junaid qadir

Low Latency Broadcast in Multirate Wireless Mesh NetworksChun Tung Chou, Archan Misra, Junaid Qadir

Keon Jang

2007. 10. 18


Outline
Outline

  • Introduction

  • Impact of Multirate Links on Efficient Broadcasting

  • Problem Formulation

  • Heuristic Algorithm

  • Simulation and Performance Study

  • Conclusion


Introduction
Introduction

  • Wireless mesh network (WMN) is considered to be promising technology for suburban and urban community-based networks

  • Two aspects of WMN research is popular

    • Use of multichannel, multi-radio mesh nodes

    • Multi-rate Mac protocols

1

2

3

100m

11Mbps

400m

1Mbps


Introduction cont d
Introduction(cont’d)

  • How low-latency (and possibly high-throughput) network-layer broadcast can be realized?

  • WMN broadcast applications

    • Broadcast community specific content

      • Neighborhood soccer game or etc.

    • Wide-are content to a group of receivers


Introduction cont d1
Introduction(cont’d)

  • Effect of multi-rate links on efficient broadcasting

    • Is multi-rate multicast necessary?

    • How effective it is?

  • Choice of transmission rates in multi-rate networks

    • How many different transmission rate is needed?

    • Are some rates more efficient than others?


Impact of multi rate link on efficient broadcasting
Impact of Multi-rate Link on Efficient Broadcasting

  • Broadcast from node 1 to all the other nodes

5

1

2

3

4

400m

1Mbps

100m

11Mbps

400m

1Mbps

400m

1Mbps


Case 1 1 transmit 1 node
Case 1: 1 Transmit / 1 Node

5

1

2

3

4

400m

1Mbps

100m

11Mbps

400m

1Mbps

400m

1Mbps

1 -> (2,5)

2 -> 3

3 -> 4

Time

0

11

22

33


Case 2 allow multiple transmit
Case 2: Allow multiple transmit

5

1

2

3

4

400m

1Mbps

100m

11Mbps

400m

1Mbps

400m

1Mbps

1 -> 2

3 -> 4

1 -> 5

2 -> 3

Time

0

1

12

23


Problem formulation
Problem Formulation

  • Build an algorithm to minimize broadcasting latency in wireless mesh networks

  • Assumptions

    • MAC-layer multi-rate multicast capability

    • Each node has single radio

    • Radio on all nodes are tuned to common channel

    • etc

This problem is NP Hard!


Heuristic algorithm
Heuristic Algorithm

  • 3 Stages

    • Broadcasting Tree Construction

    • Multicast Grouping

    • Scheduling Transmissions

2

1

s

2

2


Weighted connected dominating set construction wcds
Weighted Connected Dominating-set Construction (WCDS)

V = nodes

N(x,y)= reachable nodes from x with rate y

C = covered nodes

T = tree

R = transmission rates

WCDS is modification of MCDS


Multicast grouping algorithm
Multicast Grouping Algorithm

  • a->b, 1

  • a->c, 8

20

.

.

.

c

8

31

a

Time

1

+Max(8+20,30)

-----------------

31

30

1

b

.

.

.


Multicast grouping algorithm cont d
Multicast Grouping Algorithm(cont’d)

  • a->(b,c) 8

20

.

.

.

c

8

38

a

Time

8

+Max(20,30)

-----------------

38

30

8

b

.

.

.


Multicast grouping algorithm cont d1
Multicast Grouping Algorithm(cont’d)

  • a->b, 1

  • a->c, 8

20

.

.

.

c

8

31

a

Time

1

+Max(8+20,30)

-----------------

31

30

1

b

.

.

.


Scheduling of transmissions
Scheduling of Transmissions

  • From WCDS and Grouping, all the multicasts transmissions(sender, recipient group) are known

  • Scheduling determines a time that each multicast happens based on dependency and interference

    • Dependency: a node can relay only after it receives


Simulated performance studies
Simulated Performance Studies

  • 4 Different Tree Construction Algorithm

    • WCDS

    • BIB(author’s previous work)

    • SPT (shortest path using Dijkstra)

    • CDS (lowest transmission rate only)

  • 100 randomly generated topologies


Normalized latency single transmission case
Normalized LatencySingle Transmission Case


Normalized throughput single transmission case
Normalized ThroughputSingle Transmission Case


Multiple transmission case
Multiple Transmission Case

  • Only 2 out of 100 topologies required multiple transmission

  • Multiple may not be required in single radio and single channel case

  • However, multi-radio and multi-channel is more likely to benefit from multiple transmission


Conclusion
Conclusion

  • Proposed the novel concept of multi-rate link-layer multicast for network-layer broadcast

  • Showed that exploiting multi-rate can reduce latency and increase throughput


ad