dc.contributor.author |
Kazantzakis, MG |
en |
dc.contributor.author |
Demestichas, PP |
en |
dc.contributor.author |
Anagnostou, ME |
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/11615 |
|
dc.subject |
MOBILE TELEPHONY |
en |
dc.subject |
FREQUENCY ALLOCATION |
en |
dc.subject |
UMTS |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.subject.classification |
Telecommunications |
en |
dc.subject.other |
Algorithms |
en |
dc.subject.other |
Communication channels (information theory) |
en |
dc.subject.other |
Computer programming |
en |
dc.subject.other |
Frequency allocation |
en |
dc.subject.other |
Telecommunication traffic |
en |
dc.subject.other |
Dynamic channel allocation algorithms |
en |
dc.subject.other |
Fixed channel allocation |
en |
dc.subject.other |
Frequency reuse |
en |
dc.subject.other |
Mobile telephony systems |
en |
dc.subject.other |
Mobile radio systems |
en |
dc.title |
Optimum frequency reuse in mobile telephony systems |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1002/dac.4500080304 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1002/dac.4500080304 |
en |
heal.language |
English |
en |
heal.publicationDate |
1995 |
en |
heal.abstract |
The reason why cellular mobile telephony systems exist is that they allow frequency reuse. Dynamic allocation algorithms improve the network efficiency and the service quality. Dynamic allocation is closely related to the following instantaneous allocation problem: given a number of channels (frequencies), a cell structure and the number of calls to be accommodated in each cell, find the optimum allocation of channels to cells subject to restrictions concerning the distance of cells, where the same frequency can be reused. In this paper we formulate and solve this problem by showing that it can be reduced to a 0-1 programming problem. Finally we present results, and draw subsequent conclusions. |
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.4500080304 |
en |
dc.identifier.isi |
ISI:A1995RG75300003 |
en |
dc.identifier.volume |
8 |
en |
dc.identifier.issue |
3 |
en |
dc.identifier.spage |
185 |
en |
dc.identifier.epage |
190 |
en |