16.11.2012 Views

Wireless Network Design: Optimization Models and Solution ...

Wireless Network Design: Optimization Models and Solution ...

Wireless Network Design: Optimization Models and Solution ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

5 Mathematical Programming <strong>Models</strong> for Third Generation <strong>Wireless</strong> <strong>Network</strong> <strong>Design</strong> 111<br />

at location k. The model imposes the following constraint sets to ensure that each<br />

tower is connected to a selected MTSO<br />

∑ sℓk = yℓ<br />

k∈K<br />

∀ℓ ∈ L, (5.27)<br />

sℓk ≤ zk ∀ℓ ∈ L,∀k ∈ K. (5.28)<br />

The model assumes that each MTSO has capacity to connect to at most α towers<br />

<strong>and</strong> enforces this capacity limit with the constraint set<br />

∑ sℓk ≤ αzk<br />

ℓ∈L<br />

∀k ∈ K. (5.29)<br />

To model the construction of the backbone network, CKKOIP uses a set of network<br />

flow constraints that describe a spanning tree structure that is rooted at the<br />

PSTN gateway <strong>and</strong> connects all of the selected MTSO locations 1 . The basic idea is<br />

that a unit of flow is generated at MTSO location k if zk = 1, <strong>and</strong> that unit of flow<br />

either goes directly to the PSTN gateway or to a neighboring MTSO on the backbone.<br />

The model uses the binary variable w jk to indicate whether or not there is a<br />

backbone link between MTSO location j ∈ K <strong>and</strong> MTSO/PSTN gateway location<br />

k ∈ K0, <strong>and</strong> integer variable u jk to represent the amount of flow on that link. Note<br />

that u jk does not represent the amount of telecommunications traffic on link ( j,k),<br />

but rather the number of MTSO’s that are connected to the PSTN gateway via a path<br />

using the link between locations j <strong>and</strong> k. The constraints that construct the backbone<br />

network are<br />

z0 = 1, (5.30)<br />

∑ uk j + uk0 = ∑ u jk + zk ∀k ∈ K, (5.31)<br />

j∈K\{k}<br />

j∈K\{k}<br />

∑ uk0 = ∑ zk, (5.32)<br />

k∈K k∈K<br />

u jk ≤ |K|zk ∀ j ∈ K,k ∈ K0 \ { j}, (5.33)<br />

u jk ≤ |K|w jk ∀ j ∈ K,k ∈ K0 \ { j}. (5.34)<br />

Constraint (5.30) ensures that the backbone network includes the PSTN gateway.<br />

The second set of constraints, (5.31), are for flow conservation. They state, for<br />

MTSO k, that the out-flow is equal to the in-flow plus the generated flow, zk. Constraint<br />

set (5.32) ensures that the total amount of flow reaching the PSTN gateway<br />

is equal to the number of selected MTSOs. Constraint sets (5.33) <strong>and</strong> (5.34) ensure<br />

that there is flow on the link between MTSO k <strong>and</strong> MTSO j (or the PSTN gateway)<br />

only if both locations are selected for the design <strong>and</strong> connected by a direct link in<br />

the backbone network.<br />

1 Editor’s note: <strong>Network</strong> flow constraints are also used to model spanning tree structures in Chapter<br />

10.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!