Distributed Dynamic Frequency Allocation in Fractional Frequency Reused Relay Based Cellular Networks

Haibo Mei, John Bigham, Peng Jiang, and Eliane Bodanese

Outline
Introduction
System model Problem formulation Cell colouring based frequency allocation DDFF Analysis Simulation Conclusion

Introduction(1)
frequency shortage

hindering high network capacity and throughput

Frequency allocation is a solution Frequency allocation algorithms can be

centralized or distributed
fixed or dynamic allocation,

can constrain the dynamic schemes to be what are called hybrid algorithms

Introduction(2)
the distributed and dynamic frequency allocation algorithms are the most suitable for channel allocation All channels are kept in a central pool and are assigned dynamically to cells as new calls arrive
distributed frequency allocation algorithms

involve BS-BS communication within adjacent cells to make distributed channel

System Model
The channels in super group of a cell can be used by the MSs in all the 3 sectors. The channels in a regular group of a cell can only be used by the MSs in the sector that the regular group allocated in.

Problem formulation

Problem formulation
Di is the data rate threshold for satisfactory service to MS i. Wi is the set of cells that cover MS i. Ri,j,b is the data rate of MS i provided by channel j in cell b when MS i directly connects to BS. xsuperi,j,b represents whether MS i is allocated channel j from super group of cell b or not. xs,regi,j,b represents whether MS i is allocated channel j from the regular group of sector s in cell b or not. Rsuperi,j,b and Rregi,j,b are the data rate of channel j offered to MS i when channel j is allocated to super group and regular group in cell b respectively.

Problem Formulation
(9) formulates the data rate obtained by MS i from channel j when MS i connects to a BS through two hops and is relayed by RS r in cell b. In (9), Rr,j,b represents data rate of BS-RS connection offered by channel j. Rj,r is the data rate of a RS-MS connection, which is decided by the condition of the reused channel selected by the Smart Channel Selection scheme from adjacent cells. S(i) in (10) represents whether MS i is served nor not.

If the maximum data rate received by MS i from its covering cells (Wi) >= threshold Di, S(i) is 1. Otherwise S(i) is 0.
(11) represents that frequency allocation should maximize network throughput.

(12) requires that frequency allocation should minimize network call blocking rate (the ratio of un-served users to the total number of users
Finally, in (13) TDFA denotes the running time of distributed frequency allocation and this should be minimized. The lower TDFA is, the higher DDFFA efficiency is.

Cell Colouring based frequency allocation

Simultaneous frequency allocation in CDFA.

DDFFA
DDFFA has two parts: Distributed Channel Grouping to group channels into super group or regular group in each cell

Distributed Channel Borrowing to adjust the channel grouping for finer frequency allocation and to handle the extra channel requirements of non transparent RSs using Smart Channel Selection

Distributed Channel Grouping

When starting channel grouping in cell b, the algorithm takes the current channel allocation state of cell b as input: {xj,bs,reg , xj,bsuper } the utility of changing group in each channel is calculated in cell b if channel j is changed from super group to regular group,the utility of changing group of channel j is defined to be the difference between the potential average data rate if channel j were allocated to the regular group of sector s (Ws,reg ) and the average data rate if channel j stays in super group ( Wsuper ). based on the utility of changing groups of each sector, the algorithm evaluates each channel to decide whether to change its group or not the channel is prone to be grouped to the regular group of a sector whose available average data rate (gs ) is smaller than its data rate requirement: Cs .

Distributed Channel Borrowing

Distributed Channel Grouping considers average data rate not number of users

Distributed Channel Borrowing to further adjust xs,reg with reference to the user distribution:Ms,b

First of all DCB considers heavily loaded sector and borrows the channels are not locked into A heavily loaded sector means this sector has users |Mk,b | which is more than the number of available channels: jC x super + xk.reg

Distributed Channel Borrowing

This heavily loaded sector can borrow channels to satisfy its user requirements that are not locked in itself
Channel locking means that a channel cannot be used nor

lent to other sectors by the sector that the channel is locked into.

After finishing processing all the heavily loaded sectors in cell b, Distributed Channel Borrowing considers every

RS in cell b (say RS r).

Distributed Channel Borrowing

RS r evaluates all the channels in C to selected satisfied

channels.For example, RS r selects channel j if condition: j C (SINRr,j = maxjC (SINRr,j ))and(SINRr,j >SINRthreshod are satisfied.
RS r finishes Smart Channel Selection when it finds enough

channels for its users or all the available channels have been evaluated.
After Distributed Channel Borrowing, the final xs,reg ,x super (j C,

s S, b B) and xj,r (r R, j C) are the output of DDFFA.

Simulation(1)

Simulation(2)
Monte Carlo Simulation
The simulations consider 19 cells with relays in each sector. have used 60 scenarios to evaluate each frequency allocation scheme and there are 7x60 simulations. The number of frequency allocation schemes with the color combinations is 7

Simulation(3)

Simulation(4)

Conclusion
As the distributed planar graph coloring algorithm can only guarantee that neighbor cells have different colors, this limits the C-DFA usage when the intercell interference is not limited in neighboring cell. Through analysis and simulation, it is shown that DDFFA does give the best RBCN throughput Channel borrowing augments Dynamic FFR to give finer frequency allocation. The trade-off between the number of colors and algorithm running time in C-DFA is also analyzed and investigated.