Académique Documents
Professionnel Documents
Culture Documents
1012
1013
u] of G1 and G2, where |W|>|V|, then H is called the iv) ∀ v∈ O, x∈ A, ∃ v’∈ V─ O,
maximal common subgraph (MCS) of G1 and G2. µ(v’ )=x ∧ C(v, v’)>0.
(1)
2.2. RCAP model , where C(v, v’) is the separation constraint cij and i, j
are the indexes of vertices v and v’.
A cellular mobile communication network N, The constraints i), ii), iii) and iv) in RCAP represent
composed of n cells, can be represented as a graph G = both channel separation constraints and the reuse
[V, E, µ, u], where the cells are considered as the pattern constraint. The objective of RCAP is to assign
vertices in the graph. An edge that connects two as many cells in G as possible to the co-channel groups
vertices indicates that the two cells represented by defined by the reuse pattern P, in other words, as few
these two vertices are adjacent to each other. The label cells in G as possible to the orphan group O. The cells
of each vertex indicates the co-channel group the cell in O are not allowed to share the same channels with
belongs to. Cells in the same co-channel group are that in the reuse groups V1, V2, … and Vk.
permitted to be allocated the same channel.
The label of each edge <vi, vj> in G indicates the 3. The Reuse-pattern-oriented channel
way vi is adjacent to vj and is called adjacency mode. assignment algorithm RCA
There are six adjacency modes in the regular cellular
networks and each mode is represented by an integer RCA is composed of two sequential stages. At the
between 1 and 6. In Fig. 2, u (<A, B>) is 3 and u (<B, first stage, the Maximal Common Subgraph Detection
A>) is 4. Algorithm is used to partition the whole network into
several reuse groups. At the second stage, the heuristic
algorithm is employed to assign channels to each cell
on the basis of the reuse groups.
1013
1014
is assigned a label or become an orphan, it is removed then copied to all the other reuse groups, following that
from this set; the cell i, which has the same label as that of another
Minf(w): the set of cells within the interference cell j in the seed group, shares the same one channel
domain of the cell w, ie. Minf(w) = {v | v∈V and C(v, with j. Finally, HFA is employed to distribute channels
w)>0}. for all the cells in the orphan group.
The procedure of reuse group partition is listed in To obtain a plan for the seed group, a channel
Fig. 3. A recursive scheme for MCS mining is separation matrix M= (mij ) m×m should be created for
implemented in the procedure Backtrack(VMM), this group. This matrix cannot be created merely by
which is to find all the MCSs of Gs and P by taking out the corresponding rows and columns from
backtracking search on the input vertex matching the matrix C. None of the reuse groups is alone and
matrix with some pruning strategies. three kinds of constraints exist between adjacent reuse
groups. The matrix M can be defined as
mij = Max{C(v, w)}
, where v, w∈ V, µ(v)=i, µ(w)=j (2)
1014
1015
have been assigned and the maximum of that
respectively.
The comparison shows that, with respect to the same
one network, RCA uses less PN offsets than HCA, and
the margin grows when the size of the network gets
larger. RCA outperforms HCA, because it takes
account of reuse patterns and endeavors to minimize
the reuse distance.
1015
1016
This area contains 49 regular and irregular cells, each [5] M. Duque-Antón, D. Kunz, and B. Rüber, “Channel
of which contains three sectors. assignment for cellular radio using simulated annealing”,
The reuse pattern employed includes 12 vertices and IEEE Trans. Veh. Technol., IEEE, Feb. 1993, vol. 42, pp. 14-
the reuse distance is 3. The partition of reuse groups is 21.
[6] N. Funabiki and Y. Takefuji, “A neural network parallel
shown in Table 2. The number in brackets right after
algorithm for channel assignment problems in cellular radio
each cell index is the label assigned to the cell. Some networks”, IEEE Trans. Veh. Technol., Nov. 1992, vol. 41,
reuse groups with small sizes are not listed in the table, pp. 430-437.
which are 49(11), 11(9), 2(6), 36(12), 4(11) and 37(5). [7] M. Alabau, L. Idoumghar, and R. Schott, “New hybrid
On the basis of the partitions of reuse groups genetic algorithms for the frequency assignment problem”,
given in Table II, 54 (i.e. (12+6)× 3) PN-offset are IEEE Trans. on Broadcasting, Mar. 2002, vol. 48, pp. 27-34.
then assigned to 49× 3 sectors in this area by RCA, [8] S. C. Ghosh, B. P. Sinha, and N. Das, “Channel
where 62 PN-offset are needed for these 147 sectors if assignment using genetic algorithm based on geometric
HCA is applied to the whole 49-cell network. symmetry”, IEEE Trans. Veh. Technol., Jul. 2003, vol. 52,
pp. 860–875.
[9] F. Box, “A heuristic technique for assignment frequencies
6. Conclusions to mobile radio nets”, IEEE Trans. Veh. Tech., May 1978,
vol. 27, pp. 57-64.
Aiming at PN offset planning in CDMA networks, [10] W. Ye, L. Cheng, and H. X. Cui, “Heuristic Frequency
we propose a reuse-pattern-oriented CAP model Optimizing in GSM/GPRS Networks”, Computer Supported
RCAP, along with its solution scheme RCA. Cooperative Work in Design, Lecture Notes in Computer
There are several key characteristics in our scheme. Science, 2007, vol. 4402.
[11] H.J. Cao and W.L. Wu, “PN offset planning of short-
The maximal common-subgraph-mining algorithm is
code in CDMA system”, Acta Electronica Sinica, Nov. 2000,
used to detect reuse groups and to plot out co-channel vol. 28, pp. 63-67.
groups, while the labeling method assures the co- [12] China Unicom, “PN offset planning in CDMA networks
channel constraints being satisfied. In regard to of China Unicom,” Technical Reports, Beijing, July, 2001.
heuristic channel assignment for reuse groups, an [13] J. R. Ullmann, “An algorithm for subgraph
approach for separation matrix generating is given. The isomorphism”, Journal of the Association for Computing
strategies for adapting the scheme to practical networks Machinery, Jan. 1976, vol. 23, pp. 31-42.
with irregular cells are also illustrated. [14] E. B. Krissinel and K. Henrick, “Common subgraph
The effectiveness of RCA was verified by three isomorphism detection by backtracking search”, Software -
Practice and Experience, Mar. 2004, vol. 34, pp. 591-607.
benchmarks. The feasibility of RCAP in practical
[15] H. Tamura, M. Sengoku, K. Nakano, and S. Shinoda,
networks was validated by an application case in “Graph theoretic or computational geometric research of
Yingkou city. The result also showed the need of cellular mobile communications”, in Proc. IEEE ISCAS’99,
improvement on inexact graph matching to satisfy Orlando, 1999, vol.6, pp.153-156.
practical requirements. In addition, our future work [16] W. C. Y. Lee and D.J. Y. Lee, “Intelligent automated
will concentrate on a reuse-pattern-oriented CAP frequency assignment program”, in Proc. 51st IEEE Veh.
model that allows a cell to request more than one Technol. Conf., Tokyo, 2000, vol. 2, pp. 820-824.
channel, and is expected to be more suitable for [17] M. Mouly, “Regular cellular reuse patterns”, in Proc.
channel assignment in GSM/GPRS networks and IEEE 41st Veh. Technol. Conf., 1991, pp.681-688.
[18] K. L. Yeung and T. S. Yum, “The optimization of
WCDMA networks.
nominal channel allocation in cellular mobile systems”, in
Proc. IEEE ICC’93, Geneva, 1993, vol.2, pp.915-919.
References [19] R. E. Ahmed, R. Cardan and I. Ahmad, “Pattern-
oriented channel assignment (POCA) scheme for cellular
[1] J.S. Lee and L.E. Miller, CDMA Systems Engineering systems”, in Proc. 55th IEEE Veh. Technol. Conf., 2002,
Handbook, Artech House, Beijing, 1998. vol.3, pp.1059-1063.
[2] M. T. Dai, Z. Z. Wu, and S. X. Shao, Optimization of
GSM Mobile Communication Networks, Posts&Telecom.
Press, Beijing, 2003.
[3] C. W. Sung and W. S. Wong, “A graph theoretic
approach to the channel assignment problem in cellular
systems”, in Proc. 45th IEEE Veh. Technol. Conf., IEEE,
Chicago, 1995, pp. 604-608.
[4] G. Even, Z. Lotker, D. Ron, and S. Smorodinsky,
“Conflict-free colorings of simple geometric regions with
applications to frequency assignment in cellular networks”,
in Proc. FOCS’02, IEEE, Vancouver, 2002, pp. 691-700.
1016
1017