• Aucun résultat trouvé

Placement and Frequency Assignment in WLAN

N/A
N/A
Protected

Academic year: 2022

Partager "Placement and Frequency Assignment in WLAN"

Copied!
21
0
0

Texte intégral

(1)

Joint Optimization of Access Point

Placement and Frequency Assignment in WLAN

A. Gondran – A. Caminada O. Baala – H. Mabed

September 26 - 28, 2007

Tashkent University of Information Technologies TUIT, Tashkent, Uzbekistan

Optical Communications Networks

(2)

Agenda

1. Problem

2. Frequency channel assignment 3. Our approach

4. ACP and AFP combination

5. Conclusion/Perspectives

(3)

1. Problem

WLAN Planning

1. selecting a location for each transmitter 2. setting the parameters of all transmitters Objectives:

providing users wireless access to their local network.

respecting financial requirements

guarantying a given quality of service.

(4)

1. Overlapped Problems

Transmitter Location + Frequency Assignment (Coverage + Interferences)

+ Access Points + coverage area

+ Access Points + interference

- coverage area

Automatic Cell Planning Automatic Frequency Planning

4. ACP and AFP combination 5. Conclusion/Perspectives

Set covering problem Graph coloring problem

(5)

Successively : most studies

– Constraints are added to the location problem in order to ease the frequency channel assignment

– The global problem is over-constrained

Simultaneously : very rare

– Only three channels with co-channel interference (Wertz04)

1. Overlapped Problems

Transmitter Location + Frequency Assignment

(Coverage + Interferences)

(6)

2. Frequency assignment

• Share the resources: frequency channels

• IEEE 802.11b/g: 13 channels (3 non-overlapping)

4. ACP and AFP Combination 5. Conclusion/Perspectives

(7)

2. Frequency Assignment

• 3 non-overlapping channels

– More than 3 antennas => interferences

– Interference: computation of SINR (Signal-to-Interference- plus-Noise-Ratio)

– Spreading interference over the whole area

• 2 approaches

– Global view: interference at cell level: 3-graph colouring T-coloration

– Local view: interference at user level: SINR computation

(8)

• One user receives several signals

– Best signal

– Interfering signals

• Measurement

• Maximising the SINR

2. SINR computation

Signal to Interference plus Noise Ratio

best signal interfering

( ) SINR P

P γ f N

= ∑ ∆ +

4. ACP and AFP combination 5. Conclusion/Perspectives

(9)

real bit rate

• The bit rate provided by the network is unique and takes into account all variables (location, setting and

frequency)

• Require calculus – higher computation time

3. New approach: unifying both problems and both criteria

Transmitter Location + Frequency Assignment

(Coverage + Interferences)

(10)

3. Our fitness

Deviation between the bit rate desired by the user and the real bit rate provided by the network on downlink interference basis

( s a ) max(0, t )

a AP t users

c c β

∈ ∈

+ + × −∆

∑ ∑

4. ACP and AFP combination 5. Conclusion/Perspectives

Gondran A., Caminada A., Fondrevelle J., Baala O., “Wireless LAN planning: a didactical model to optimise the cost and effective payback”. International Journal of Mobile

Network Design and Innovation 2007 - Vol. 2, No.1 pp. 13 - 25

(11)

3. Our fitness

Sum of all network users bit rate lack (in kbps) weighted by a financial cost β

Optimisation under constraints of coverage (minimum bit rate for all users)

( s a ) max(0, t )

a AP t users

c c β

∈ ∈

+ + × −∆

∑ ∑

(12)

• Originality

– tackling both problems in the same time

– multiple interfering signals are used to compute SINR – 13 available channels (not only 3)

– Large-scale combinatory !!!

• Comparing 3 strategies

– strategy 1: ACP without channel and 13-channels AFP successively – strategy 2: 3-channels ACP and 13-channels AFP successively

– strategy 3: 13-channels ACP and AFP together

4. Joint ACP and AFP

4. ACP and AFP combination 5. Conclusion/Perspectives

(13)

Optimisation process

- Local search

- 20mn on Pentium 4 - 1 run

Testbed

- 2 floor building - 94 candidate sites - 2 antenna patterns

- 4 levels of emitted power

=> configurations - demand :

600 users (300 on each floor) 500kbps => 300Mbps

8800 test point (SINR)

4. Joint ACP and AFP

93

242 93

0

(408) 10

p p

p

C

=

∑ ≈

150 m

40 m

Floor 1

Floor 2

(14)

4. Joint ACP and AFP

4. ACP and AFP combination 5. Conclusion/Perspectives

93

242 93

0

(408) 10

p p

p

C

=

∑ ≈

150 m

40 m

Floor 1

Floor 2

Optimisation process

- Local search

- 20mn on Pentium 4 - 1 run

Testbed

- 2 floor building - 94 candidate sites - 2 antenna patterns

- 4 levels of emitted power

=> configurations - demand :

600 users (300 on each floor) 500kbps => 300Mbps

8800 test point (SINR)

(15)

4. ACP and AFP combination

21 37 40 AP number

strategy 3

strategy 2 strategy 1

– strategy 1: ACP without channel and 13-channels AFP successively – strategy 2: 3-channels ACP and 13-channels AFP successively

– strategy 3: 13-channels ACP and AFP together

(16)

4. ACP and AFP combination

4. ACP and AFP combination 5. Conclusion/Perspectives

21 37 40 AP number

147

TP uncovered

4

strategy 3

strategy 2 strategy 1

0

– strategy 1: ACP without channel and 13-channels AFP successively – strategy 2: 3-channels ACP and 13-channels AFP successively

– strategy 3: 13-channels ACP and AFP together

(17)

4. ACP and AFP combination

21 37 40 AP number

TP unsatisfied 147

TP uncovered

4

1709

405

strategy 3

strategy 2 strategy 1

0 0

– strategy 1: ACP without channel and 13-channels AFP successively – strategy 2: 3-channels ACP and 13-channels AFP successively

– strategy 3: 13-channels ACP and AFP together

(18)

Floor 1 strategy 1

strategy 2

strategy 3

150 m

40 m

4. ACP and AFP combination 5. Conclusion/Perspectives

(19)

strategy 1

strategy 2

strategy 3

(20)

5. Conclusion/Perspectives

• First results

– simultaneous ACP/AFP is convincing

– feasible solution found quickly (minimum service)

– about 250 networks are evaluated per second (for 8800 test points)

• To do: comparison

– with results from others groups (model / algorithm / test) – with manual deployment

– with others successive approach

• Further algorithmic steps…

4. ACP and AFP combination 5. Conclusion/Perspectives

(21)

Références

Documents relatifs

Cependant, en adoptant une structure du type de celle de la fi¬ gure II-l, dans le cas qui nous intéresse de la machine synchrone autopi lo- tée alimentée en tension, nous

A general method is to treat the induced cost as independent random variables and compute a lower bound probability of their sum in (1) by using Hoeffding’s inequalities [6].

If interferences are assumed to be binary, a multiple carrier frequency assignment problem can be treated as a disjunctive scheduling problem since a user who requests a number

The DFAP begins with an initial set of links, called the initial kernel. The first sub- problem is to assign frequencies to the paths constituting the kernel. Then, new links

Informez votre médecin qui vous suit pour votre HTAP ou votre infirmière si vous prenez l'un des médicaments suivants : - Gemfibrozil [médicament utilisé pour réduire le taux de

Given that there is a unique solution for the GAP, it is still im- possible to develop a correct message passing algorithm which can terminate in pseudo-polynomial number of

On a set of realistic instances, we propose hybrid constraint programming and large neighborhood search solution methods to solve minimum interference and minimum span

In the two-level uncapacitated facility location problem (TUFLP), the single set of locations is substituted with two tiers of locations (depots and satellites), and the path to