When traffic of BS is low, two or three neighbor BSs were cooperated to compensation its coverage [9].
Generally at most six neighbor BSs exist around one BSs, so [absolute value of [S.sup.i.sub.cop]] [less than or equal to] 30.
Theorem 3: For TP = {j, k, l} of BS i, if [r.sup.c.sub.j] = [d.sub.ij], [r.sup.c.sub.k] = [d.sub.ik] and [r.sup.c.sub.l] = [d.sub.il], and for each two BSs in TP, a crossover point of their coverage (the other one is site location of BS i) is outsides of coverage of BS i, then {j, k, l} is an ETP for BS i.
Then we update traffic of compensation BSs and recover BS a [member of] [PS.sub.i] to active mode.
An authorization key [AK.sub.j] shared by an MS and [BS.sub.j] must not be reused with other BSs or MSs.
The handover messages (2), (1), (2), and (3) should be sent to each of the neighboring BSs of [BS.sub.0] even though they are shown to be sent only to [BS.sub.1] in [7][9].
1 shows the Access Service Network (ASN) architecture developed by WiMAX Forum [2], where one or more base stations (BSs) are controlled by an ASN Gateway (G/W).
14(b), in the condition of the same QoS requirement for the low loaded balancing BSs after CoMP load balancing, the high loaded balanced BS can only maximally bear .4=59.61 Erlangs with [[omega].sub.2,I] (1,0), A = 50.59 Erlangs with [[omega].sub.2,I] (2,1/2), A = 39.72 Erlangs with [[omega].sub.3,I] (1,2/3) and A = 39.25 Erlangs with [[omega].sub.3,II] (1, 2/3).
The reason is only the user's efficient throughput in this area changes after CoMP if we assume BSs have enough resources to allocate.
7 we have known [[omega].sub.3,I] (2,0) has the largest CoMP extended coverage range except for the overlapped area resulted by the multiple pairs of CoMP BSs. However, the negative effect of the CoMP load balancing is that all the CoMP BSs will bear the same total balanced traffic.