MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs

Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supp...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Chao Li [verfasserIn] Yida Xu [verfasserIn] Yongjun Xu [verfasserIn] Boyu Diao [verfasserIn] Zhulin An [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2019

Schlagwörter:	Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks

Übergeordnetes Werk:	In: IEEE Access - IEEE, 2014, 7(2019), Seite 21133-21146
Übergeordnetes Werk:	volume:7 ; year:2019 ; pages:21133-21146

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1109/ACCESS.2019.2895309

Katalog-ID:	DOAJ016090152

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ016090152
003	DE-627
005	20230310080837.0
007	cr uuu---uuuuu
008	230226s2019 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1109/ACCESS.2019.2895309 \|2 doi
035			\|a (DE-627)DOAJ016090152
035			\|a (DE-599)DOAJ7d61280f23c14379a47896f2572048c0
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK1-9971
100	0		\|a Chao Li \|e verfasserin \|4 aut
245	1	0	\|a MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs
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 Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks.
650		4	\|a Link scheduling
650		4	\|a power allocating
650		4	\|a minimum frame length
650		4	\|a successive interference cancellation
650		4	\|a underwater acoustic networks
653		0	\|a Electrical engineering. Electronics. Nuclear engineering
700	0		\|a Yida Xu \|e verfasserin \|4 aut
700	0		\|a Yongjun Xu \|e verfasserin \|4 aut
700	0		\|a Boyu Diao \|e verfasserin \|4 aut
700	0		\|a Zhulin An \|e verfasserin \|4 aut
773	0	8	\|i In \|t IEEE Access \|d IEEE, 2014 \|g 7(2019), Seite 21133-21146 \|w (DE-627)728440385 \|w (DE-600)2687964-5 \|x 21693536 \|7 nnns
773	1	8	\|g volume:7 \|g year:2019 \|g pages:21133-21146
856	4	0	\|u https://doi.org/10.1109/ACCESS.2019.2895309 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/7d61280f23c14379a47896f2572048c0 \|z kostenfrei
856	4	0	\|u https://ieeexplore.ieee.org/document/8626111/ \|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 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 7 \|j 2019 \|h 21133-21146

Indexfelder

author_variant	c l cl y x yx y x yx b d bd z a za
matchkey_str	article:21693536:2019----::lpaibsdiiufaeeghihpiiepw
hierarchy_sort_str	2019
callnumber-subject-code	TK
publishDate	2019
allfields	10.1109/ACCESS.2019.2895309 doi (DE-627)DOAJ016090152 (DE-599)DOAJ7d61280f23c14379a47896f2572048c0 DE-627 ger DE-627 rakwb eng TK1-9971 Chao Li verfasserin aut MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks. Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks Electrical engineering. Electronics. Nuclear engineering Yida Xu verfasserin aut Yongjun Xu verfasserin aut Boyu Diao verfasserin aut Zhulin An verfasserin aut In IEEE Access IEEE, 2014 7(2019), Seite 21133-21146 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:7 year:2019 pages:21133-21146 https://doi.org/10.1109/ACCESS.2019.2895309 kostenfrei https://doaj.org/article/7d61280f23c14379a47896f2572048c0 kostenfrei https://ieeexplore.ieee.org/document/8626111/ kostenfrei https://doaj.org/toc/2169-3536 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_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 7 2019 21133-21146
spelling	10.1109/ACCESS.2019.2895309 doi (DE-627)DOAJ016090152 (DE-599)DOAJ7d61280f23c14379a47896f2572048c0 DE-627 ger DE-627 rakwb eng TK1-9971 Chao Li verfasserin aut MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks. Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks Electrical engineering. Electronics. Nuclear engineering Yida Xu verfasserin aut Yongjun Xu verfasserin aut Boyu Diao verfasserin aut Zhulin An verfasserin aut In IEEE Access IEEE, 2014 7(2019), Seite 21133-21146 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:7 year:2019 pages:21133-21146 https://doi.org/10.1109/ACCESS.2019.2895309 kostenfrei https://doaj.org/article/7d61280f23c14379a47896f2572048c0 kostenfrei https://ieeexplore.ieee.org/document/8626111/ kostenfrei https://doaj.org/toc/2169-3536 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_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 7 2019 21133-21146
allfields_unstemmed	10.1109/ACCESS.2019.2895309 doi (DE-627)DOAJ016090152 (DE-599)DOAJ7d61280f23c14379a47896f2572048c0 DE-627 ger DE-627 rakwb eng TK1-9971 Chao Li verfasserin aut MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks. Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks Electrical engineering. Electronics. Nuclear engineering Yida Xu verfasserin aut Yongjun Xu verfasserin aut Boyu Diao verfasserin aut Zhulin An verfasserin aut In IEEE Access IEEE, 2014 7(2019), Seite 21133-21146 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:7 year:2019 pages:21133-21146 https://doi.org/10.1109/ACCESS.2019.2895309 kostenfrei https://doaj.org/article/7d61280f23c14379a47896f2572048c0 kostenfrei https://ieeexplore.ieee.org/document/8626111/ kostenfrei https://doaj.org/toc/2169-3536 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_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 7 2019 21133-21146
allfieldsGer	10.1109/ACCESS.2019.2895309 doi (DE-627)DOAJ016090152 (DE-599)DOAJ7d61280f23c14379a47896f2572048c0 DE-627 ger DE-627 rakwb eng TK1-9971 Chao Li verfasserin aut MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks. Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks Electrical engineering. Electronics. Nuclear engineering Yida Xu verfasserin aut Yongjun Xu verfasserin aut Boyu Diao verfasserin aut Zhulin An verfasserin aut In IEEE Access IEEE, 2014 7(2019), Seite 21133-21146 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:7 year:2019 pages:21133-21146 https://doi.org/10.1109/ACCESS.2019.2895309 kostenfrei https://doaj.org/article/7d61280f23c14379a47896f2572048c0 kostenfrei https://ieeexplore.ieee.org/document/8626111/ kostenfrei https://doaj.org/toc/2169-3536 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_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 7 2019 21133-21146
allfieldsSound	10.1109/ACCESS.2019.2895309 doi (DE-627)DOAJ016090152 (DE-599)DOAJ7d61280f23c14379a47896f2572048c0 DE-627 ger DE-627 rakwb eng TK1-9971 Chao Li verfasserin aut MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks. Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks Electrical engineering. Electronics. Nuclear engineering Yida Xu verfasserin aut Yongjun Xu verfasserin aut Boyu Diao verfasserin aut Zhulin An verfasserin aut In IEEE Access IEEE, 2014 7(2019), Seite 21133-21146 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:7 year:2019 pages:21133-21146 https://doi.org/10.1109/ACCESS.2019.2895309 kostenfrei https://doaj.org/article/7d61280f23c14379a47896f2572048c0 kostenfrei https://ieeexplore.ieee.org/document/8626111/ kostenfrei https://doaj.org/toc/2169-3536 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_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 7 2019 21133-21146
language	English
source	In IEEE Access 7(2019), Seite 21133-21146 volume:7 year:2019 pages:21133-21146
sourceStr	In IEEE Access 7(2019), Seite 21133-21146 volume:7 year:2019 pages:21133-21146
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks Electrical engineering. Electronics. Nuclear engineering
isfreeaccess_bool	true
container_title	IEEE Access
authorswithroles_txt_mv	Chao Li @@aut@@ Yida Xu @@aut@@ Yongjun Xu @@aut@@ Boyu Diao @@aut@@ Zhulin An @@aut@@
publishDateDaySort_date	2019-01-01T00:00:00Z
hierarchy_top_id	728440385
id	DOAJ016090152
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">DOAJ016090152</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310080837.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2019.2895309</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ016090152</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ7d61280f23c14379a47896f2572048c0</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">Chao Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs</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">Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Link scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">power allocating</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">minimum frame length</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">successive interference cancellation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">underwater acoustic networks</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">Yida Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yongjun Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Boyu Diao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhulin An</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">7(2019), Seite 21133-21146</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:7</subfield><subfield code="g">year:2019</subfield><subfield code="g">pages:21133-21146</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2019.2895309</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/7d61280f23c14379a47896f2572048c0</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/8626111/</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">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">7</subfield><subfield code="j">2019</subfield><subfield code="h">21133-21146</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Chao Li
spellingShingle	Chao Li misc TK1-9971 misc Link scheduling misc power allocating misc minimum frame length misc successive interference cancellation misc underwater acoustic networks misc Electrical engineering. Electronics. Nuclear engineering MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs
authorStr	Chao Li
ppnlink_with_tag_str_mv	@@773@@(DE-627)728440385
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK1-9971
illustrated	Not Illustrated
issn	21693536
topic_title	TK1-9971 MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs Link scheduling power allocating minimum frame length successive interference cancellation underwater acoustic networks
topic	misc TK1-9971 misc Link scheduling misc power allocating misc minimum frame length misc successive interference cancellation misc underwater acoustic networks misc Electrical engineering. Electronics. Nuclear engineering
topic_unstemmed	misc TK1-9971 misc Link scheduling misc power allocating misc minimum frame length misc successive interference cancellation misc underwater acoustic networks misc Electrical engineering. Electronics. Nuclear engineering
topic_browse	misc TK1-9971 misc Link scheduling misc power allocating misc minimum frame length misc successive interference cancellation misc underwater acoustic networks 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	MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs
ctrlnum	(DE-627)DOAJ016090152 (DE-599)DOAJ7d61280f23c14379a47896f2572048c0
title_full	MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs
author_sort	Chao Li
journal	IEEE Access
journalStr	IEEE Access
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2019
contenttype_str_mv	txt
container_start_page	21133
author_browse	Chao Li Yida Xu Yongjun Xu Boyu Diao Zhulin An
container_volume	7
class	TK1-9971
format_se	Elektronische Aufsätze
author-letter	Chao Li
doi_str_mv	10.1109/ACCESS.2019.2895309
author2-role	verfasserin
title_sort	mlops: a sic-based minimum frame length with optimized power scheduling for uans
callnumber	TK1-9971
title_auth	MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs
abstract	Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks.
abstractGer	Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks.
abstract_unstemmed	Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks.
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_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	MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs
url	https://doi.org/10.1109/ACCESS.2019.2895309 https://doaj.org/article/7d61280f23c14379a47896f2572048c0 https://ieeexplore.ieee.org/document/8626111/ https://doaj.org/toc/2169-3536
remote_bool	true
author2	Yida Xu Yongjun Xu Boyu Diao Zhulin An
author2Str	Yida Xu Yongjun Xu Boyu Diao Zhulin An
ppnlink	728440385
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1109/ACCESS.2019.2895309
callnumber-a	TK1-9971
up_date	2024-07-03T18:55:29.654Z
_version_	1803585249251164160
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">DOAJ016090152</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310080837.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2019.2895309</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ016090152</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ7d61280f23c14379a47896f2572048c0</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">Chao Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs</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">Due to the large propagation delay and scarce spectrum resource of the underwater wireless acoustic channels, it is essential to design efficient and reliable multiuser scheduling scheme for underwater network communication systems. The successive interference cancellation (SIC) technology that supports multiple parallel transmissions can improve spectrum efficiency, which is vital for the underwater acoustic networks (UANs). The SIC technology has been widely studied in the underwater network communication systems. However, there is no appropriate technology solving the link scheduling problem in the SIC-based UANs. In this paper, we propose a link-scheduling model for SIC-based UANs and formulate the problem of minimizing the transmission delay and overall network power consumption by combining transmitters scheduling and power allocating. We also present a polynomial-time algorithm named UMLOPS with the complexity of O(n) for unified traffic load, and for weighted traffic load, we present a universal algorithm named WMLOPS with the complexity of O(n<sup<3</sup<), where n denotes the number of source nodes. The extensive simulation results reveal that both scheduling frame length and aggregate power consumption of MLOPS significantly outperform those of the existing time-division multiple access protocols in underwater sensor equipped aquatic swarm architecture networks.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Link scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">power allocating</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">minimum frame length</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">successive interference cancellation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">underwater acoustic networks</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">Yida Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yongjun Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Boyu Diao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhulin An</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">7(2019), Seite 21133-21146</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:7</subfield><subfield code="g">year:2019</subfield><subfield code="g">pages:21133-21146</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2019.2895309</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/7d61280f23c14379a47896f2572048c0</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/8626111/</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">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">7</subfield><subfield code="j">2019</subfield><subfield code="h">21133-21146</subfield></datafield></record></collection>
score	7.399583

Nicht das Richtige dabei?

Schreiben Sie uns!

MLOPS: A SIC-Based Minimum Frame Length With Optimized Power Scheduling for UANs

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?