Optimal channel assignment in cellular networks

Rouskas Angelos, N; Kazantzakis Michael, G; Anagnostou Miltiades, E

dc.contributor.author	Rouskas Angelos, N	en
dc.contributor.author	Kazantzakis Michael, G	en
dc.contributor.author	Anagnostou Miltiades, E	en
dc.date.accessioned	2014-03-01T01:11:23Z
dc.date.available	2014-03-01T01:11:23Z
dc.date.issued	1995	en
dc.identifier.issn	1074-5351	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11613
dc.subject	cellular network	en
dc.subject	frequency reuse	en
dc.subject	channel assignment	en
dc.subject	convex maximization	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Algorithms	en
dc.subject.other	Cellular radio systems	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Constraint theory	en
dc.subject.other	Linear programming	en
dc.subject.other	Mathematical programming	en
dc.subject.other	Optimal systems	en
dc.subject.other	Optimization	en
dc.subject.other	Problem solving	en
dc.subject.other	Signal interference	en
dc.subject.other	Telecommunication control	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Cellular networks	en
dc.subject.other	Cochannel constraints	en
dc.subject.other	Convex maximization	en
dc.subject.other	Frequency reuse	en
dc.subject.other	Optimal channel assignment	en
dc.subject.other	Quadratic maximization programming	en
dc.subject.other	Frequency allocation	en
dc.title	Optimal channel assignment in cellular networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1002/dac.4500080603	en
heal.identifier.secondary	http://dx.doi.org/10.1002/dac.4500080603	en
heal.language	English	en
heal.publicationDate	1995	en
heal.abstract	In this paper we consider the problem of assigning frequencies to mobile terminals in a cellular network. We show that an optimal solution can be obtained by solving a sequence of alternating linear and quadratic maximization programming problems. We address co-channel constraints and adopt as an objective function the maximization of potentially established calls. Our algorithm is fairly general, and does not depend on any special network structure. This study indicates that mathematical programming can be used as an efficient technique for solving the aforementioned problem.	en
heal.publisher	John Wiley & Sons Ltd, Chichester, United Kingdom	en
heal.journalName	International Journal of Communication Systems	en
dc.identifier.doi	10.1002/dac.4500080603	en
dc.identifier.isi	ISI:A1995TQ20900002	en
dc.identifier.volume	8	en
dc.identifier.issue	6	en
dc.identifier.spage	359	en
dc.identifier.epage	364	en