18.02.2014 Views

wireless ad hoc networking

wireless ad hoc networking

wireless ad hoc networking

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Supporting Multimedia Communication 619<br />

mobiles/cell). However, the interference caused by the handoff mobiles I h<br />

needs to be considered as a separate source from the general other-cellinterference<br />

term, since they might transmit stronger signals than expected<br />

(as shown in Section 23.4).<br />

The received signal strength is modeled by a path loss model:<br />

p j,i = P j r −µ<br />

j,i 10 η 10 , where P j is the mobile’s transmitting power, r j,i the distance<br />

between the mobile and base stations, µ (= 3.5) the path loss order,<br />

and η the zero-mean random power fluctuation. We also assume that the<br />

nonhandoff mobile is under perfect power control of its resident cell, with<br />

a normalized received power level of 1 † .<br />

Using the diversity decoding for uplink channel, the best link among<br />

the active set is chosen for the jth handoff mobile. If A j is the active set of<br />

the jth mobile, we have<br />

SIR j = min<br />

i∈A j<br />

SIR j,i (23.14)<br />

The SIR for the in-cell mobiles in each active set could be similarly obtained.<br />

Note that the interference from all of the handoff mobiles is now regarded<br />

as noise, and the regular in-cell mobile users have unit received signal<br />

strength. For traffic type t in the ith active cell with spre<strong>ad</strong>ing factor SF t ,<br />

the SIR is approximated by<br />

SIR(i, t) =<br />

SF t<br />

(m i + ∑ j (P jr −µ<br />

j,i 10 η 10 ) + fI o )<br />

(23.15)<br />

Let H denote the set of handoff mobiles at any time. The optimal SF/power<br />

assignments that maximum throughput for the handoff mobile can be<br />

obtained by solving the following problem:<br />

max z = ∑ j∈H<br />

W<br />

SF j<br />

(23.16)<br />

SIR j ≥ b j , j ∈ H (23.17)<br />

SIR i,t ≥ b t , i ∈ A, and t ∈{traffic type set} (23.18)<br />

23.4.4.3 Suboptimal SF/POWER Admission Algorithms<br />

Without nonnegative power constraints, the optimal solution for Eq. (23.18)<br />

can be obtained by Lagrange’s method after relaxing the SINR constraints<br />

into linear form (see Ref. [7] for details). However, it might not result in<br />

a feasible solution for the original problem due to the possible zero-value<br />

† In practice, the received powers of different traffic are not uniformly assigned, thus<br />

they cause a different level of interference.

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

Saved successfully!

Ooh no, something went wrong!