DocumentCode
2445611
Title
Optimal partitioning of cellular networks
Author
Tollis, Ioannis G.
Author_Institution
Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA
Volume
3
fYear
1996
fDate
23-27 Jun 1996
Firstpage
1377
Abstract
The problem of partitioning a cellular network into several disjoint parts is central to the design of cellular systems. The objective is to partition the network of cells into two or more parts such that the amount of handover between cells that belong to different parts (or any other cost function) is minimized. All the cells in each part are assigned to the same mobile switching center (MSC). We present a model and fast algorithms that obtain partitions that minimize the handover (or any other cost function) between cells that belong to different MSCs
Keywords
cellular radio; minimisation; algorithms; cellular networks; cost function; design; handover; mobile switching center; optimal partitioning; Algorithm design and analysis; Base stations; Cellular networks; Computer science; Cost function; Land mobile radio cellular systems; Partitioning algorithms; Quality of service; Telephony; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on
Conference_Location
Dallas, TX
Print_ISBN
0-7803-3250-4
Type
conf
DOI
10.1109/ICC.1996.533634
Filename
533634
Link To Document