Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks

In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However,...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Yi Tian [verfasserIn] Takuya Yoshihiro [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2020

Schlagwörter:	WMNs channel assignment routing collision-free MILP

Übergeordnetes Werk:	In: IEEE Access - IEEE, 2014, 8(2020), Seite 120712-120723
Übergeordnetes Werk:	volume:8 ; year:2020 ; pages:120712-120723

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1109/ACCESS.2020.3006275

Katalog-ID:	DOAJ054322472

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ054322472
003	DE-627
005	20230503030855.0
007	cr uuu---uuuuu
008	230227s2020 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1109/ACCESS.2020.3006275 \|2 doi
035			\|a (DE-627)DOAJ054322472
035			\|a (DE-599)DOAJ73c02e247bd842589f9112793bbce099
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK1-9971
100	0		\|a Yi Tian \|e verfasserin \|4 aut
245	1	0	\|a Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks
264		1	\|c 2020
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance.
650		4	\|a WMNs
650		4	\|a channel assignment
650		4	\|a routing
650		4	\|a collision-free
650		4	\|a MILP
653		0	\|a Electrical engineering. Electronics. Nuclear engineering
700	0		\|a Takuya Yoshihiro \|e verfasserin \|4 aut
773	0	8	\|i In \|t IEEE Access \|d IEEE, 2014 \|g 8(2020), Seite 120712-120723 \|w (DE-627)728440385 \|w (DE-600)2687964-5 \|x 21693536 \|7 nnns
773	1	8	\|g volume:8 \|g year:2020 \|g pages:120712-120723
856	4	0	\|u https://doi.org/10.1109/ACCESS.2020.3006275 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/73c02e247bd842589f9112793bbce099 \|z kostenfrei
856	4	0	\|u https://ieeexplore.ieee.org/document/9130654/ \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2169-3536 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a SSG-OLC-PHA
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_31
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_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
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_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 8 \|j 2020 \|h 120712-120723

Indexfelder

author_variant	y t yt t y ty
matchkey_str	article:21693536:2020----::rfidmnaaeolsofecanlsinetomlihnemli
hierarchy_sort_str	2020
callnumber-subject-code	TK
publishDate	2020
allfields	10.1109/ACCESS.2020.3006275 doi (DE-627)DOAJ054322472 (DE-599)DOAJ73c02e247bd842589f9112793bbce099 DE-627 ger DE-627 rakwb eng TK1-9971 Yi Tian verfasserin aut Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance. WMNs channel assignment routing collision-free MILP Electrical engineering. Electronics. Nuclear engineering Takuya Yoshihiro verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 120712-120723 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:120712-120723 https://doi.org/10.1109/ACCESS.2020.3006275 kostenfrei https://doaj.org/article/73c02e247bd842589f9112793bbce099 kostenfrei https://ieeexplore.ieee.org/document/9130654/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_2014 GBV_ILN_4012 GBV_ILN_4037 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 120712-120723
spelling	10.1109/ACCESS.2020.3006275 doi (DE-627)DOAJ054322472 (DE-599)DOAJ73c02e247bd842589f9112793bbce099 DE-627 ger DE-627 rakwb eng TK1-9971 Yi Tian verfasserin aut Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance. WMNs channel assignment routing collision-free MILP Electrical engineering. Electronics. Nuclear engineering Takuya Yoshihiro verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 120712-120723 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:120712-120723 https://doi.org/10.1109/ACCESS.2020.3006275 kostenfrei https://doaj.org/article/73c02e247bd842589f9112793bbce099 kostenfrei https://ieeexplore.ieee.org/document/9130654/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_2014 GBV_ILN_4012 GBV_ILN_4037 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 120712-120723
allfields_unstemmed	10.1109/ACCESS.2020.3006275 doi (DE-627)DOAJ054322472 (DE-599)DOAJ73c02e247bd842589f9112793bbce099 DE-627 ger DE-627 rakwb eng TK1-9971 Yi Tian verfasserin aut Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance. WMNs channel assignment routing collision-free MILP Electrical engineering. Electronics. Nuclear engineering Takuya Yoshihiro verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 120712-120723 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:120712-120723 https://doi.org/10.1109/ACCESS.2020.3006275 kostenfrei https://doaj.org/article/73c02e247bd842589f9112793bbce099 kostenfrei https://ieeexplore.ieee.org/document/9130654/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_2014 GBV_ILN_4012 GBV_ILN_4037 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 120712-120723
allfieldsGer	10.1109/ACCESS.2020.3006275 doi (DE-627)DOAJ054322472 (DE-599)DOAJ73c02e247bd842589f9112793bbce099 DE-627 ger DE-627 rakwb eng TK1-9971 Yi Tian verfasserin aut Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance. WMNs channel assignment routing collision-free MILP Electrical engineering. Electronics. Nuclear engineering Takuya Yoshihiro verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 120712-120723 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:120712-120723 https://doi.org/10.1109/ACCESS.2020.3006275 kostenfrei https://doaj.org/article/73c02e247bd842589f9112793bbce099 kostenfrei https://ieeexplore.ieee.org/document/9130654/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_2014 GBV_ILN_4012 GBV_ILN_4037 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 120712-120723
allfieldsSound	10.1109/ACCESS.2020.3006275 doi (DE-627)DOAJ054322472 (DE-599)DOAJ73c02e247bd842589f9112793bbce099 DE-627 ger DE-627 rakwb eng TK1-9971 Yi Tian verfasserin aut Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance. WMNs channel assignment routing collision-free MILP Electrical engineering. Electronics. Nuclear engineering Takuya Yoshihiro verfasserin aut In IEEE Access IEEE, 2014 8(2020), Seite 120712-120723 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:8 year:2020 pages:120712-120723 https://doi.org/10.1109/ACCESS.2020.3006275 kostenfrei https://doaj.org/article/73c02e247bd842589f9112793bbce099 kostenfrei https://ieeexplore.ieee.org/document/9130654/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_2014 GBV_ILN_4012 GBV_ILN_4037 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2020 120712-120723
language	English
source	In IEEE Access 8(2020), Seite 120712-120723 volume:8 year:2020 pages:120712-120723
sourceStr	In IEEE Access 8(2020), Seite 120712-120723 volume:8 year:2020 pages:120712-120723
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	WMNs channel assignment routing collision-free MILP Electrical engineering. Electronics. Nuclear engineering
isfreeaccess_bool	true
container_title	IEEE Access
authorswithroles_txt_mv	Yi Tian @@aut@@ Takuya Yoshihiro @@aut@@
publishDateDaySort_date	2020-01-01T00:00:00Z
hierarchy_top_id	728440385
id	DOAJ054322472
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">DOAJ054322472</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503030855.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2020.3006275</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ054322472</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ73c02e247bd842589f9112793bbce099</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">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yi Tian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</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">In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">WMNs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">channel assignment</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">collision-free</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MILP</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Takuya Yoshihiro</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">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">8(2020), Seite 120712-120723</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2020</subfield><subfield code="g">pages:120712-120723</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2020.3006275</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/73c02e247bd842589f9112793bbce099</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/9130654/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</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">SSG-OLC-PHA</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_31</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_2014</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_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_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">8</subfield><subfield code="j">2020</subfield><subfield code="h">120712-120723</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Yi Tian
spellingShingle	Yi Tian misc TK1-9971 misc WMNs misc channel assignment misc routing misc collision-free misc MILP misc Electrical engineering. Electronics. Nuclear engineering Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks
authorStr	Yi Tian
ppnlink_with_tag_str_mv	@@773@@(DE-627)728440385
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK1-9971
illustrated	Not Illustrated
issn	21693536
topic_title	TK1-9971 Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks WMNs channel assignment routing collision-free MILP
topic	misc TK1-9971 misc WMNs misc channel assignment misc routing misc collision-free misc MILP misc Electrical engineering. Electronics. Nuclear engineering
topic_unstemmed	misc TK1-9971 misc WMNs misc channel assignment misc routing misc collision-free misc MILP misc Electrical engineering. Electronics. Nuclear engineering
topic_browse	misc TK1-9971 misc WMNs misc channel assignment misc routing misc collision-free misc MILP misc Electrical engineering. Electronics. Nuclear engineering
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	IEEE Access
hierarchy_parent_id	728440385
hierarchy_top_title	IEEE Access
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)728440385 (DE-600)2687964-5
title	Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks
ctrlnum	(DE-627)DOAJ054322472 (DE-599)DOAJ73c02e247bd842589f9112793bbce099
title_full	Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks
author_sort	Yi Tian
journal	IEEE Access
journalStr	IEEE Access
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2020
contenttype_str_mv	txt
container_start_page	120712
author_browse	Yi Tian Takuya Yoshihiro
container_volume	8
class	TK1-9971
format_se	Elektronische Aufsätze
author-letter	Yi Tian
doi_str_mv	10.1109/ACCESS.2020.3006275
author2-role	verfasserin
title_sort	traffic-demand-aware collision-free channel assignment for multi-channel multi-radio wireless mesh networks
callnumber	TK1-9971
title_auth	Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks
abstract	In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance.
abstractGer	In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance.
abstract_unstemmed	In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 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_2014 GBV_ILN_4012 GBV_ILN_4037 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
title_short	Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks
url	https://doi.org/10.1109/ACCESS.2020.3006275 https://doaj.org/article/73c02e247bd842589f9112793bbce099 https://ieeexplore.ieee.org/document/9130654/ https://doaj.org/toc/2169-3536
remote_bool	true
author2	Takuya Yoshihiro
author2Str	Takuya Yoshihiro
ppnlink	728440385
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1109/ACCESS.2020.3006275
callnumber-a	TK1-9971
up_date	2024-07-03T22:32:39.414Z
_version_	1803598911939543040
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">DOAJ054322472</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503030855.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2020.3006275</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ054322472</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ73c02e247bd842589f9112793bbce099</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">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yi Tian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</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">In multi-channel multi-radio wireless mesh networks (MCMR WMNs), assigning each radio with an appropriate channel to maximize the performance is a challenging problem. In this optimization, the primal concern lays on how to mitigate effects of interference to avoid performance degradation. However, collision-freedom for a given traffic demand under the limitation of precious channel resources has not been achieved yet. In this paper, we present a collision-free joint channel assignment and routing scheme called TACCA (Traffic-demand-Aware Collision-free Channel Assignment) for MCMR WMNs. To reduce the required number of channels, TACCA incorporates a property of CSMA (Carrier Sense Multiple Access), i.e., it adopts CSMA-aware interference model and a CSMA-aware shared link capacity model. We formulate a mixed integer linear programming (MILP) to optimize the network utility and enhance the practical usefulness under the given traffic demands. The evaluation results with a MILP solver show that TACCA achieves collision-freedom in both grid and random topology networks with 3-5 orthogonal channels, and exhibits good network utilization performance. In addition, the network simulation results show that TACCA achieves mostly collision-free communications under up-to-date PHY and MAC models, and presents excellent communication performance.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">WMNs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">channel assignment</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">collision-free</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MILP</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Takuya Yoshihiro</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">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">8(2020), Seite 120712-120723</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2020</subfield><subfield code="g">pages:120712-120723</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2020.3006275</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/73c02e247bd842589f9112793bbce099</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/9130654/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</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">SSG-OLC-PHA</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_31</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_2014</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_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_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">8</subfield><subfield code="j">2020</subfield><subfield code="h">120712-120723</subfield></datafield></record></collection>
score	7.398514

Nicht das Richtige dabei?

Schreiben Sie uns!

Traffic-Demand-Aware Collision-Free Channel Assignment for Multi-Channel Multi-Radio Wireless Mesh Networks

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?