Digitální knihovna UHK

Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas

Zobrazit minimální záznam

dc.rights.license CC BY eng
dc.contributor.author Orogun, Adebola cze
dc.contributor.author Fadeyi, Oluwaseun Omolaja cze
dc.contributor.author Krejcar, Ondřej cze
dc.date.accessioned 2020-06-04T14:57:08Z
dc.date.available 2020-06-04T14:57:08Z
dc.date.issued 2019 eng
dc.identifier.issn 1999-5903 eng
dc.identifier.uri http://hdl.handle.net/20.500.12603/314
dc.description.abstract The need for smart and sustainable communication systems has led to the development of mobile communication networks. In turn, the vast functionalities of the global system of mobile communication (GSM) have resulted in a growing number of subscribers. As the number of users increases, the need for efficient and effective planning of the "limited" frequency spectrum of the GSM is inevitable, particularly in densely-populated areas. As such, there are ongoing discussions about frequency (channel) allocation methods to resolve the challenges of channel allocation, which is a complete NP (Nondeterministic Polynomial time) problem. In this paper, we propose an algorithm for channel allocation which takes into account soft constraints (co-channel interference and adjacent channel interference). By using the Manhattan distance concept, this study shows that the formulation of the algorithm is correct and in line with results in the literature. Hence, the Manhattan distance concept may be useful in other scheduling and optimization problems. Furthermore, this unique concept makes it possible to develop a more sustainable telecommunication system with ease of connectivity among users, even when several subscribers are on a common frequency. eng
dc.format p. "Article number: 186" eng
dc.language.iso eng eng
dc.publisher MDPI eng
dc.relation.ispartof FUTURE INTERNET, volume 11, issue: 9 eng
dc.subject graph coloring eng
dc.subject channel allocation eng
dc.subject GSM eng
dc.subject cellular frequency eng
dc.subject communication eng
dc.subject zbarvení grafu cze
dc.subject přidělení kanálu cze
dc.subject GSM cze
dc.subject buněčná frekvence cze
dc.subject sdělení cze
dc.title Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas eng
dc.title.alternative Udržitelné komunikační systémy: Grafové značení pro přidělování buněčných frekvencí v hustě obydlených oblastech cze
dc.type article eng
dc.identifier.obd 43875483 eng
dc.identifier.wos 000487748900015 eng
dc.identifier.doi 10.3390/fi11090186 eng
dc.description.abstract-translated The need for smart and sustainable communication systems has led to the development of mobile communication networks. In turn, the vast functionalities of the global system of mobile communication (GSM) have resulted in a growing number of subscribers. As the number of users increases, the need for efficient and effective planning of the "limited" frequency spectrum of the GSM is inevitable, particularly in densely-populated areas. As such, there are ongoing discussions about frequency (channel) allocation methods to resolve the challenges of channel allocation, which is a complete NP (Nondeterministic Polynomial time) problem. In this paper, we propose an algorithm for channel allocation which takes into account soft constraints (co-channel interference and adjacent channel interference). By using the Manhattan distance concept, this study shows that the formulation of the algorithm is correct and in line with results in the literature. Hence, the Manhattan distance concept may be useful in other scheduling and optimization problems. Furthermore, this unique concept makes it possible to develop a more sustainable telecommunication system with ease of connectivity among users, even when several subscribers are on a common frequency. cze
dc.publicationstatus postprint eng
dc.peerreviewed yes eng
dc.source.url https://www.mdpi.com/1999-5903/11/9/186 cze
dc.relation.publisherversion https://www.mdpi.com/1999-5903/11/9/186 eng
dc.rights.access Open Access eng


Soubory tohoto záznamu

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam

Prohledat DSpace


Procházet

Můj účet