NDLI: Min-cut based partitioning for urban LTE cell site planning

Content Provider	IEEE Xplore Digital Library
Author	Engels, A. Reyer, M. Steiger, A. Mathar, R.
Copyright Year	2013
Description	Author affiliation: Inst. for Theor. Inf. Technol., RWTH Aachen Univ., Aachen, Germany (Engels, A.; Reyer, M.; Steiger, A.; Mathar, R.)
Abstract	Common approaches for partitioning cell site planning problems into smaller instances typically suffer from the lack of knowledge about the number of clusters k that is appropriate for the particular problem. When applying an iterative processing over methods such as the k-means algorithm or the related k-medoids approach to determine the optimum k, the computational effort can be higher than solving the original problem instance directly. This is particularly the case if the optimum k is small, which happens most likely in urban environments where the user density and the number of cells are high. In this paper, we propose a graph-based method using minimum cut operations to partition a planning instance automatically into an appropriate number of k sub-problems. We demonstrate the benefits of this approach by numerical evaluation of exemplary application to the problem of planning LTE cell site locations in an urban environment.
Sponsorship	IEEE Commun. Soc.
Starting Page	515
Ending Page	520
File Size	1276391
Page Count	6
File Format	PDF
ISBN	9781467331319
e-ISBN	9781467331333
DOI	10.1109/CCNC.2013.6488492
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-01-11
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Planning Interference Bandwidth Computer architecture Microprocessors Clustering algorithms Partitioning algorithms interference modeling LTE network planning graph theory multi-objective optimization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Dynamic Clustering Algorithm Design for C-RAN Based on Multi-Objective Optimization Theory

Graph-Based Multicell Scheduling in OFDMA-Based Small Cell Networks

A min-max cut algorithm for graph partitioning and data clustering

A min-max cult algorithm for graph partitioning and data clustering.

Bipartite network based multi-cell clustering scheme in randomly located CoMP systems

Uplink performance of LTE-based multi-hop cellular network with out-of-band relaying

Multi-objective Optimization of Graph Partitioning Using Genetic Algorithms

A probabilistic approach for multi-objective clustering using game theory

A physical cell identity self-organization algorithm in LTE-advanced systems

Min-cut based partitioning for urban LTE cell site planning

Similar Documents

A Dynamic Clustering Algorithm Design for C-RAN Based on Multi-Objective Optimization Theory

Graph-Based Multicell Scheduling in OFDMA-Based Small Cell Networks

A min-max cut algorithm for graph partitioning and data clustering

A min-max cult algorithm for graph partitioning and data clustering.

Bipartite network based multi-cell clustering scheme in randomly located CoMP systems

Uplink performance of LTE-based multi-hop cellular network with out-of-band relaying

Multi-objective Optimization of Graph Partitioning Using Genetic Algorithms

A probabilistic approach for multi-objective clustering using game theory

A physical cell identity self-organization algorithm in LTE-advanced systems

Min-cut based partitioning for urban LTE cell site planning