• Nenhum resultado encontrado

On the Capacity of Wireless CSMA/CA Multihop Networks

N/A
N/A
Protected

Academic year: 2022

Share "On the Capacity of Wireless CSMA/CA Multihop Networks"

Copied!
38
0
0

Texto

(1)

On the Capacity of

Wireless CSMA/CA Multihop Networks

Rafael Laufer and Leonard Kleinrock

Bell Labs, UCLA

IEEE INFOCOM 2013

(2)

• Carrier sense multiple access with collision avoidance (CSMA/CA)

Before transmitting, the node verifies if the medium is idle via carrier sensing If idle, sample a random back-off interval and starts counting down

Whenever busy, freeze the counter and wait for ongoing transmission to finish

INTRODUCTION

Wireless CSMA/CA Multihop Networks

U 2 (t)

2

1 3

(3)

• Considered unpredictable with unknown throughput limitations

Distributed nature of CSMA/CA: nodes should back off from each other

Buffer dynamics of unsaturated sources: time-varying subset of transmitters Dependence of downstream links on upstream traffic: coupled queue state

Strong dependence among the state of transmitters

Physical proximity and traffic pattern induce correlation across the network

INTRODUCTION

Wireless CSMA/CA Multihop Networks

(4)

• Understand throughput limits of wireless CSMA/CA multihop networks

• Provide answers to specific questions regarding the network capacity

If the rate of f 1 increases by 10%, how much can f 2 still achieve?

If f 3 starts, by how much must f 1 and f 2 slow down to keep the network stable?

• Determine the capacity region of arbitrary wireless networks

INTRODUCTION Goals

f 2

(5)

• Theory to model the behavior of wireless CSMA/CA multihop networks

Handle buffer dynamics of unsaturated traffic sources and multihop flows Respect interference constraints imposed by the wireless medium

• Characterization of the capacity region of any wireless network

No restrictions on node placement: suitable for arbitrary networks

Agnostic to the distribution of network parameters: only averages are relevant Convex only when nodes are within range: nonconvex in general

• Feasibility test

INTRODUCTION

Key Contributions

(6)

• Single-path routing, with routes and bit rates assumed fixed

• Omnidirectional antenna communicating in a single channel

• CSMA/CA for medium access control

• Network state S composed of links transmitting

Knowledge of the feasible link sets in the network

• : fraction of time that all links in S are transmitting

MODEL AND ASSUMPTIONS

System Model

(7)

THROUGHPUT MODELING

(8)

SATURATED SINGLE-HOP FLOWS

All Nodes Within Carrier Sense Range

(9)

SATURATED SINGLE-HOP FLOWS All Nodes Within Carrier Sense Range

U 1 (t)

t

1

U 2 (t)

U 3 (t) t

t

(10)

• By definition, the steady-state solution is

• Ratio between and

SATURATED SINGLE-HOP FLOWS

All Nodes Within Carrier Sense Range

(11)

• System of linear equations

• Steady-state solution

• Throughput of each flow

SATURATED SINGLE-HOP FLOWS

All Nodes Within Carrier Sense Range

(12)

SATURATED SINGLE-HOP FLOWS

Not All Nodes Within Carrier Sense Range

2 1

3

(13)

SATURATED SINGLE-HOP FLOWS

Not All Nodes Within Carrier Sense Range

U 1 (t)

U 2 (t) t

U 3 (t) t

t

(14)

• Steady-state solution for this case

• General solution

• Throughput of each flow

SATURATED SINGLE-HOP FLOWS

Not All Nodes Within Carrier Sense Range

(15)

UNSATURATED SINGLE-HOP FLOWS Idle Time

U 1 (t)

t

1

U 2 (t)

U 3 (t) t

t

(16)

• Steady-state solution

• Source behavior

Injecting too little traffic:  0 Injecting too much traffic:  1

UNSATURATED SINGLE-HOP FLOWS

(17)

• Why the solution is similar to the saturated case?

Statistically equivalent to a saturated network

Average transmission times are the same Average backoff times are larger by 1/

UNSATURATED SINGLE-HOP FLOWS

(18)

UNSATURATED SINGLE-HOP FLOWS Primal Unsaturated Network

U 1 (t)

t

1

U 2 (t)

U 3 (t) t

(19)

UNSATURATED SINGLE-HOP FLOWS Dual Saturated Network

U 1 (t)

U 2 (t) t

U 3 (t) t

t

1

(20)

CAPACITY REGION CHARACTERIZATION

(21)

• Normalized throughput of transmitter i

• Express as a function of

• Find the inverse

• Limit the stability factors to the range

CAPACITY REGION

Characterization Algorithm

(22)

CAPACITY REGION

Two Transmitters Within Carrier Sense Range

(23)

CAPACITY REGION

Two Transmitters Within Carrier Sense Range

1 y 1

y 2

1 1

1 

2 2

1 

 1

2 1

2

1  

2 1

1

1  

 1 

2

2 2 1

1 y

y

 

2

1 1

1 1

1 y

y

 

1  0

1  1

2  0

  2  1

(24)

CAPACITY REGION

Three Transmitters Within Carrier Sense Range

(25)

CAPACITY REGION

Three Transmitters Within Carrier Sense Range

1 y 1

y 2 1

y 3 1

(26)

CAPACITY REGION

Three Transmitters Not Within Carrier Sense Range

2 1

3

(27)

CAPACITY REGION

Three Transmitters Not Within Carrier Sense Range

1 y 1

y 2

1 1

1 

2 2

1 

 1

1 1 1 2 1

2

1     

1 1 1 2 1

1 1 1

1     

 

 1  1

1 1

2 2 1

2 2

2

 

 

 

y y

y y

2

1 1

1 1

1 y

y

 

Capacity lost due to the lack of

synchronization between nodes

(28)

CAPACITY REGION

Three Transmitters Not Within Carrier Sense Range

1 y 1

y 2

1

(29)

FEASIBILITY TEST

(30)

• Does the network support a given rate vector ?

• Normalized throughput depends only on average values

approximates the total transmission time as approximates the total time as

• Plug into the expression and check if

FEASIBILITY TEST

Feasibility of Input Rates

(31)

SIMULATION RESULTS

(32)

SIMULATION SCENARIO

MIT Roofnet Network: Single-Hop Flows

(33)

SIMULATION RESULTS

Single-Hop Flows (ρ = 1.00)

(34)

SIMULATION RESULTS

Single-Hop Flows (ρ = 0.50)

(35)

SIMULATION RESULTS

Single-Hop Flows (ρ = 0.25)

(36)

SIMULATION RESULTS

Single-Hop Flows (ρ = 0.01)

(37)

• Capacity of wireless CSMA/CA multihop networks poorly understood

• Theory able to model the network behavior

Buffer dynamics of unsaturated sources and multihop flows

Wireless CSMA/CA multihop networks are not erratic, but predictable

• System of nonlinear equations characterizes the network capacity

Agnostic to the distribution of network parameters, only averages relevant

• Knowledge of the underlying process governing CSMA/CA networks

Opens up new areas of research

Routing optimization and network provisioning

CONCLUSIONS

(38)

On the Capacity of

Wireless CSMA/CA Multihop Networks

Referências

Documentos relacionados

Além disso, o Facebook também disponibiliza várias ferramentas exclusivas como a criação de eventos, de publici- dade, fornece aos seus utilizadores milhares de jogos que podem

The probability of attending school four our group of interest in this region increased by 6.5 percentage points after the expansion of the Bolsa Família program in 2007 and

O presente estudo teve como objectivo avaliar o Estado Nutricional (EN) das crianças inscritas no 4º ano do 1º ciclo das escolas públicas do Ensino Básico

33 Relativamente a sugestões para estudos futuros, parece-nos interessante estudar o efeito do conflito na criatividade das equipas, tendo em conta a influência das emoções

Partindo desta questão tudo correu naturalmente como que um encadeamento natural de atividades que as crianças iam sugerindo, pois sentiam que estas lhe faziam falta. Partindo assim

H„ autores que preferem excluir dos estudos de prevalˆncia lesŽes associadas a dentes restaurados para evitar confus‚o de diagn€stico com lesŽes de

Na hepatite B, as enzimas hepáticas têm valores menores tanto para quem toma quanto para os que não tomam café comparados ao vírus C, porém os dados foram estatisticamente

" JJJJJJJJJJJJJJJJJJJJJJJJJJ