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

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...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Adebola Orogun [verfasserIn] Oluwaseun Fadeyi [verfasserIn] Ondrej Krejcar [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2019

Schlagwörter:	graph coloring channel allocation GSM cellular frequency communication

Übergeordnetes Werk:	In: Future Internet - MDPI AG, 2010, 11(2019), 9, p 186
Übergeordnetes Werk:	volume:11 ; year:2019 ; number:9, p 186

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.3390/fi11090186

Katalog-ID:	DOAJ009575375

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ009575375
003	DE-627
005	20230310021329.0
007	cr uuu---uuuuu
008	230225s2019 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.3390/fi11090186 \|2 doi
035			\|a (DE-627)DOAJ009575375
035			\|a (DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a T58.5-58.64
100	0		\|a Adebola Orogun \|e verfasserin \|4 aut
245	1	0	\|a Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas
264		1	\|c 2019
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a 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.
650		4	\|a graph coloring
650		4	\|a channel allocation
650		4	\|a GSM
650		4	\|a cellular frequency
650		4	\|a communication
653		0	\|a Information technology
700	0		\|a Oluwaseun Fadeyi \|e verfasserin \|4 aut
700	0		\|a Ondrej Krejcar \|e verfasserin \|4 aut
773	0	8	\|i In \|t Future Internet \|d MDPI AG, 2010 \|g 11(2019), 9, p 186 \|w (DE-627)610604147 \|w (DE-600)2518385-0 \|x 19995903 \|7 nnns
773	1	8	\|g volume:11 \|g year:2019 \|g number:9, p 186
856	4	0	\|u https://doi.org/10.3390/fi11090186 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be \|z kostenfrei
856	4	0	\|u https://www.mdpi.com/1999-5903/11/9/186 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1999-5903 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 11 \|j 2019 \|e 9, p 186

Indexfelder

author_variant	a o ao o f of o k ok
matchkey_str	article:19995903:2019----::utialcmuiainytmarplblnapocfrellrrqecalc
hierarchy_sort_str	2019
callnumber-subject-code	T
publishDate	2019
allfields	10.3390/fi11090186 doi (DE-627)DOAJ009575375 (DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be DE-627 ger DE-627 rakwb eng T58.5-58.64 Adebola Orogun verfasserin aut Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier 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. graph coloring channel allocation GSM cellular frequency communication Information technology Oluwaseun Fadeyi verfasserin aut Ondrej Krejcar verfasserin aut In Future Internet MDPI AG, 2010 11(2019), 9, p 186 (DE-627)610604147 (DE-600)2518385-0 19995903 nnns volume:11 year:2019 number:9, p 186 https://doi.org/10.3390/fi11090186 kostenfrei https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be kostenfrei https://www.mdpi.com/1999-5903/11/9/186 kostenfrei https://doaj.org/toc/1999-5903 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2019 9, p 186
spelling	10.3390/fi11090186 doi (DE-627)DOAJ009575375 (DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be DE-627 ger DE-627 rakwb eng T58.5-58.64 Adebola Orogun verfasserin aut Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier 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. graph coloring channel allocation GSM cellular frequency communication Information technology Oluwaseun Fadeyi verfasserin aut Ondrej Krejcar verfasserin aut In Future Internet MDPI AG, 2010 11(2019), 9, p 186 (DE-627)610604147 (DE-600)2518385-0 19995903 nnns volume:11 year:2019 number:9, p 186 https://doi.org/10.3390/fi11090186 kostenfrei https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be kostenfrei https://www.mdpi.com/1999-5903/11/9/186 kostenfrei https://doaj.org/toc/1999-5903 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2019 9, p 186
allfields_unstemmed	10.3390/fi11090186 doi (DE-627)DOAJ009575375 (DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be DE-627 ger DE-627 rakwb eng T58.5-58.64 Adebola Orogun verfasserin aut Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier 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. graph coloring channel allocation GSM cellular frequency communication Information technology Oluwaseun Fadeyi verfasserin aut Ondrej Krejcar verfasserin aut In Future Internet MDPI AG, 2010 11(2019), 9, p 186 (DE-627)610604147 (DE-600)2518385-0 19995903 nnns volume:11 year:2019 number:9, p 186 https://doi.org/10.3390/fi11090186 kostenfrei https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be kostenfrei https://www.mdpi.com/1999-5903/11/9/186 kostenfrei https://doaj.org/toc/1999-5903 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2019 9, p 186
allfieldsGer	10.3390/fi11090186 doi (DE-627)DOAJ009575375 (DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be DE-627 ger DE-627 rakwb eng T58.5-58.64 Adebola Orogun verfasserin aut Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier 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. graph coloring channel allocation GSM cellular frequency communication Information technology Oluwaseun Fadeyi verfasserin aut Ondrej Krejcar verfasserin aut In Future Internet MDPI AG, 2010 11(2019), 9, p 186 (DE-627)610604147 (DE-600)2518385-0 19995903 nnns volume:11 year:2019 number:9, p 186 https://doi.org/10.3390/fi11090186 kostenfrei https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be kostenfrei https://www.mdpi.com/1999-5903/11/9/186 kostenfrei https://doaj.org/toc/1999-5903 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2019 9, p 186
allfieldsSound	10.3390/fi11090186 doi (DE-627)DOAJ009575375 (DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be DE-627 ger DE-627 rakwb eng T58.5-58.64 Adebola Orogun verfasserin aut Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier 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. graph coloring channel allocation GSM cellular frequency communication Information technology Oluwaseun Fadeyi verfasserin aut Ondrej Krejcar verfasserin aut In Future Internet MDPI AG, 2010 11(2019), 9, p 186 (DE-627)610604147 (DE-600)2518385-0 19995903 nnns volume:11 year:2019 number:9, p 186 https://doi.org/10.3390/fi11090186 kostenfrei https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be kostenfrei https://www.mdpi.com/1999-5903/11/9/186 kostenfrei https://doaj.org/toc/1999-5903 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2019 9, p 186
language	English
source	In Future Internet 11(2019), 9, p 186 volume:11 year:2019 number:9, p 186
sourceStr	In Future Internet 11(2019), 9, p 186 volume:11 year:2019 number:9, p 186
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	graph coloring channel allocation GSM cellular frequency communication Information technology
isfreeaccess_bool	true
container_title	Future Internet
authorswithroles_txt_mv	Adebola Orogun @@aut@@ Oluwaseun Fadeyi @@aut@@ Ondrej Krejcar @@aut@@
publishDateDaySort_date	2019-01-01T00:00:00Z
hierarchy_top_id	610604147
id	DOAJ009575375
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ009575375</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310021329.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/fi11090186</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ009575375</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Adebola Orogun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">graph coloring</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">channel allocation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GSM</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">cellular frequency</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">communication</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Oluwaseun Fadeyi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ondrej Krejcar</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Future Internet</subfield><subfield code="d">MDPI AG, 2010</subfield><subfield code="g">11(2019), 9, p 186</subfield><subfield code="w">(DE-627)610604147</subfield><subfield code="w">(DE-600)2518385-0</subfield><subfield code="x">19995903</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:9, p 186</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/fi11090186</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/1999-5903/11/9/186</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1999-5903</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2019</subfield><subfield code="e">9, p 186</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Adebola Orogun
spellingShingle	Adebola Orogun misc T58.5-58.64 misc graph coloring misc channel allocation misc GSM misc cellular frequency misc communication misc Information technology Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas
authorStr	Adebola Orogun
ppnlink_with_tag_str_mv	@@773@@(DE-627)610604147
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	T58
illustrated	Not Illustrated
issn	19995903
topic_title	T58.5-58.64 Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas graph coloring channel allocation GSM cellular frequency communication
topic	misc T58.5-58.64 misc graph coloring misc channel allocation misc GSM misc cellular frequency misc communication misc Information technology
topic_unstemmed	misc T58.5-58.64 misc graph coloring misc channel allocation misc GSM misc cellular frequency misc communication misc Information technology
topic_browse	misc T58.5-58.64 misc graph coloring misc channel allocation misc GSM misc cellular frequency misc communication misc Information technology
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Future Internet
hierarchy_parent_id	610604147
hierarchy_top_title	Future Internet
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)610604147 (DE-600)2518385-0
title	Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas
ctrlnum	(DE-627)DOAJ009575375 (DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be
title_full	Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas
author_sort	Adebola Orogun
journal	Future Internet
journalStr	Future Internet
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2019
contenttype_str_mv	txt
author_browse	Adebola Orogun Oluwaseun Fadeyi Ondrej Krejcar
container_volume	11
class	T58.5-58.64
format_se	Elektronische Aufsätze
author-letter	Adebola Orogun
doi_str_mv	10.3390/fi11090186
author2-role	verfasserin
title_sort	sustainable communication systems: a graph-labeling approach for cellular frequency allocation in densely-populated areas
callnumber	T58.5-58.64
title_auth	Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas
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.
abstractGer	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.
abstract_unstemmed	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.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2009 GBV_ILN_2014 GBV_ILN_2111 GBV_ILN_2129 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	9, p 186
title_short	Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas
url	https://doi.org/10.3390/fi11090186 https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be https://www.mdpi.com/1999-5903/11/9/186 https://doaj.org/toc/1999-5903
remote_bool	true
author2	Oluwaseun Fadeyi Ondrej Krejcar
author2Str	Oluwaseun Fadeyi Ondrej Krejcar
ppnlink	610604147
callnumber-subject	T - General Technology
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.3390/fi11090186
callnumber-a	T58.5-58.64
up_date	2024-07-04T00:12:29.767Z
_version_	1803605193280978944
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ009575375</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310021329.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/fi11090186</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ009575375</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ1684ab7cd1664325af6e7ecb44e139be</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Adebola Orogun</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">graph coloring</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">channel allocation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GSM</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">cellular frequency</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">communication</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Oluwaseun Fadeyi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ondrej Krejcar</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Future Internet</subfield><subfield code="d">MDPI AG, 2010</subfield><subfield code="g">11(2019), 9, p 186</subfield><subfield code="w">(DE-627)610604147</subfield><subfield code="w">(DE-600)2518385-0</subfield><subfield code="x">19995903</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:9, p 186</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/fi11090186</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/1684ab7cd1664325af6e7ecb44e139be</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/1999-5903/11/9/186</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1999-5903</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2019</subfield><subfield code="e">9, p 186</subfield></datafield></record></collection>
score	7.4009867

Nicht das Richtige dabei?

Schreiben Sie uns!

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

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?