Coverage and service bounds for UMTS

Hodge, Leigh Edward, Ghosh, Sasthi C., Hurley, Stephen, Whitaker, Roger Marcus ORCID: https://orcid.org/0000-0002-8473-1913 and Allen, Stuart Michael ORCID: https://orcid.org/0000-0003-1776-7489 2008. Coverage and service bounds for UMTS. Presented at: International Conference on Mobile Technology, Applications, and Systems, Yilan, Taiwan, 10-12 September 2008. Published in: Lin, Yi-Bing, Chao, Han-Chieh and Chong, Peter Han Joo eds. Mobility '08: Proceedings of the International Conference on Mobile Technology, Applications, and Systems, Yilan, Taiwan, 10-12 September, 2008. New York, NY: ACM, 10.1145/1506270.1506333

Full text not available from this repository.

Abstract

Although upper bounds on cell planning have been derived for UMTS systems, little has been done to address lower bounds. In this paper we present the findings of a preliminary investigation into techniques for deriving upper and lower bounds for 3G network design. Lower bounds are derived via an integer linear programming (ILP) approach and upper bounds are derived using a meta-heuristic approach (tabu search). The lower bound provides a bench-mark against which the effectiveness of the meta-heuristic approach can be evaluated. We propose three optimization models addressing transmitter and pilot power requirements, and derive and contrast upper and lower bounds. The results of experimentation show that the tabu search is competitive with the lower bounds derived from the ILP and has substantially lower execution time for larger problems.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics Systems Immunity Research Institute (SIURI)
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Additional Information:	Article No. 49
Publisher:	ACM
ISBN:	9781605580890
Last Modified:	26 Jun 2024 01:08
URI:	https://orca.cardiff.ac.uk/id/eprint/14125

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item