On the Adaptive Determination of the Number of Preambles in RACH for MTC
Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be empl...
Ausführliche Beschreibung
Autor*in: |
Jinho Choi [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2016 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: IEEE communications letters - New York, NY : IEEE, 1997, 20(2016), 7, Seite 1385-1 |
---|---|
Übergeordnetes Werk: |
volume:20 ; year:2016 ; number:7 ; pages:1385-1 |
Links: |
---|
DOI / URN: |
10.1109/LCOMM.2016.2546238 |
---|
Katalog-ID: |
OLC198069608X |
---|
LEADER | 01000caa a2200265 4500 | ||
---|---|---|---|
001 | OLC198069608X | ||
003 | DE-627 | ||
005 | 20230714205913.0 | ||
007 | tu | ||
008 | 160816s2016 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1109/LCOMM.2016.2546238 |2 doi | |
028 | 5 | 2 | |a PQ20160815 |
035 | |a (DE-627)OLC198069608X | ||
035 | |a (DE-599)GBVOLC198069608X | ||
035 | |a (PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0 | ||
035 | |a (KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 620 |a 004 |q DNB |
100 | 0 | |a Jinho Choi |e verfasserin |4 aut | |
245 | 1 | 0 | |a On the Adaptive Determination of the Number of Preambles in RACH for MTC |
264 | 1 | |c 2016 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
520 | |a Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. | ||
650 | 4 | |a Indexes | |
650 | 4 | |a access delay | |
650 | 4 | |a Simulation | |
650 | 4 | |a RACH procedure | |
650 | 4 | |a Random variables | |
650 | 4 | |a Throughput | |
650 | 4 | |a Maximum likelihood estimation | |
650 | 4 | |a Machine-type communications | |
650 | 4 | |a Bandwidth | |
773 | 0 | 8 | |i Enthalten in |t IEEE communications letters |d New York, NY : IEEE, 1997 |g 20(2016), 7, Seite 1385-1 |w (DE-627)224842838 |w (DE-600)1360382-6 |w (DE-576)058070435 |x 1089-7798 |7 nnns |
773 | 1 | 8 | |g volume:20 |g year:2016 |g number:7 |g pages:1385-1 |
856 | 4 | 1 | |u http://dx.doi.org/10.1109/LCOMM.2016.2546238 |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_70 | ||
951 | |a AR | ||
952 | |d 20 |j 2016 |e 7 |h 1385-1 |
author_variant |
j c jc |
---|---|
matchkey_str |
article:10897798:2016----::nhaatvdtriainfhnmeopem |
hierarchy_sort_str |
2016 |
publishDate |
2016 |
allfields |
10.1109/LCOMM.2016.2546238 doi PQ20160815 (DE-627)OLC198069608X (DE-599)GBVOLC198069608X (PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0 (KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin DE-627 ger DE-627 rakwb eng 620 004 DNB Jinho Choi verfasserin aut On the Adaptive Determination of the Number of Preambles in RACH for MTC 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. Indexes access delay Simulation RACH procedure Random variables Throughput Maximum likelihood estimation Machine-type communications Bandwidth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 7, Seite 1385-1 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:7 pages:1385-1 http://dx.doi.org/10.1109/LCOMM.2016.2546238 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 7 1385-1 |
spelling |
10.1109/LCOMM.2016.2546238 doi PQ20160815 (DE-627)OLC198069608X (DE-599)GBVOLC198069608X (PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0 (KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin DE-627 ger DE-627 rakwb eng 620 004 DNB Jinho Choi verfasserin aut On the Adaptive Determination of the Number of Preambles in RACH for MTC 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. Indexes access delay Simulation RACH procedure Random variables Throughput Maximum likelihood estimation Machine-type communications Bandwidth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 7, Seite 1385-1 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:7 pages:1385-1 http://dx.doi.org/10.1109/LCOMM.2016.2546238 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 7 1385-1 |
allfields_unstemmed |
10.1109/LCOMM.2016.2546238 doi PQ20160815 (DE-627)OLC198069608X (DE-599)GBVOLC198069608X (PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0 (KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin DE-627 ger DE-627 rakwb eng 620 004 DNB Jinho Choi verfasserin aut On the Adaptive Determination of the Number of Preambles in RACH for MTC 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. Indexes access delay Simulation RACH procedure Random variables Throughput Maximum likelihood estimation Machine-type communications Bandwidth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 7, Seite 1385-1 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:7 pages:1385-1 http://dx.doi.org/10.1109/LCOMM.2016.2546238 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 7 1385-1 |
allfieldsGer |
10.1109/LCOMM.2016.2546238 doi PQ20160815 (DE-627)OLC198069608X (DE-599)GBVOLC198069608X (PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0 (KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin DE-627 ger DE-627 rakwb eng 620 004 DNB Jinho Choi verfasserin aut On the Adaptive Determination of the Number of Preambles in RACH for MTC 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. Indexes access delay Simulation RACH procedure Random variables Throughput Maximum likelihood estimation Machine-type communications Bandwidth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 7, Seite 1385-1 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:7 pages:1385-1 http://dx.doi.org/10.1109/LCOMM.2016.2546238 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 7 1385-1 |
allfieldsSound |
10.1109/LCOMM.2016.2546238 doi PQ20160815 (DE-627)OLC198069608X (DE-599)GBVOLC198069608X (PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0 (KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin DE-627 ger DE-627 rakwb eng 620 004 DNB Jinho Choi verfasserin aut On the Adaptive Determination of the Number of Preambles in RACH for MTC 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. Indexes access delay Simulation RACH procedure Random variables Throughput Maximum likelihood estimation Machine-type communications Bandwidth Enthalten in IEEE communications letters New York, NY : IEEE, 1997 20(2016), 7, Seite 1385-1 (DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 1089-7798 nnns volume:20 year:2016 number:7 pages:1385-1 http://dx.doi.org/10.1109/LCOMM.2016.2546238 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 20 2016 7 1385-1 |
language |
English |
source |
Enthalten in IEEE communications letters 20(2016), 7, Seite 1385-1 volume:20 year:2016 number:7 pages:1385-1 |
sourceStr |
Enthalten in IEEE communications letters 20(2016), 7, Seite 1385-1 volume:20 year:2016 number:7 pages:1385-1 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Indexes access delay Simulation RACH procedure Random variables Throughput Maximum likelihood estimation Machine-type communications Bandwidth |
dewey-raw |
620 |
isfreeaccess_bool |
false |
container_title |
IEEE communications letters |
authorswithroles_txt_mv |
Jinho Choi @@aut@@ |
publishDateDaySort_date |
2016-01-01T00:00:00Z |
hierarchy_top_id |
224842838 |
dewey-sort |
3620 |
id |
OLC198069608X |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC198069608X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714205913.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160816s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/LCOMM.2016.2546238</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160815</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC198069608X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC198069608X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin</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="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Jinho Choi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the Adaptive Determination of the Number of Preambles in RACH for MTC</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Indexes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">access delay</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RACH procedure</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random variables</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maximum likelihood estimation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine-type communications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bandwidth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE communications letters</subfield><subfield code="d">New York, NY : IEEE, 1997</subfield><subfield code="g">20(2016), 7, Seite 1385-1</subfield><subfield code="w">(DE-627)224842838</subfield><subfield code="w">(DE-600)1360382-6</subfield><subfield code="w">(DE-576)058070435</subfield><subfield code="x">1089-7798</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:7</subfield><subfield code="g">pages:1385-1</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/LCOMM.2016.2546238</subfield><subfield code="3">Volltext</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_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">20</subfield><subfield code="j">2016</subfield><subfield code="e">7</subfield><subfield code="h">1385-1</subfield></datafield></record></collection>
|
author |
Jinho Choi |
spellingShingle |
Jinho Choi ddc 620 misc Indexes misc access delay misc Simulation misc RACH procedure misc Random variables misc Throughput misc Maximum likelihood estimation misc Machine-type communications misc Bandwidth On the Adaptive Determination of the Number of Preambles in RACH for MTC |
authorStr |
Jinho Choi |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)224842838 |
format |
Article |
dewey-ones |
620 - Engineering & allied operations 004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
1089-7798 |
topic_title |
620 004 DNB On the Adaptive Determination of the Number of Preambles in RACH for MTC Indexes access delay Simulation RACH procedure Random variables Throughput Maximum likelihood estimation Machine-type communications Bandwidth |
topic |
ddc 620 misc Indexes misc access delay misc Simulation misc RACH procedure misc Random variables misc Throughput misc Maximum likelihood estimation misc Machine-type communications misc Bandwidth |
topic_unstemmed |
ddc 620 misc Indexes misc access delay misc Simulation misc RACH procedure misc Random variables misc Throughput misc Maximum likelihood estimation misc Machine-type communications misc Bandwidth |
topic_browse |
ddc 620 misc Indexes misc access delay misc Simulation misc RACH procedure misc Random variables misc Throughput misc Maximum likelihood estimation misc Machine-type communications misc Bandwidth |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
IEEE communications letters |
hierarchy_parent_id |
224842838 |
dewey-tens |
620 - Engineering 000 - Computer science, knowledge & systems |
hierarchy_top_title |
IEEE communications letters |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)224842838 (DE-600)1360382-6 (DE-576)058070435 |
title |
On the Adaptive Determination of the Number of Preambles in RACH for MTC |
ctrlnum |
(DE-627)OLC198069608X (DE-599)GBVOLC198069608X (PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0 (KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin |
title_full |
On the Adaptive Determination of the Number of Preambles in RACH for MTC |
author_sort |
Jinho Choi |
journal |
IEEE communications letters |
journalStr |
IEEE communications letters |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology 000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2016 |
contenttype_str_mv |
txt |
container_start_page |
1385 |
author_browse |
Jinho Choi |
container_volume |
20 |
class |
620 004 DNB |
format_se |
Aufsätze |
author-letter |
Jinho Choi |
doi_str_mv |
10.1109/LCOMM.2016.2546238 |
dewey-full |
620 004 |
title_sort |
on the adaptive determination of the number of preambles in rach for mtc |
title_auth |
On the Adaptive Determination of the Number of Preambles in RACH for MTC |
abstract |
Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. |
abstractGer |
Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. |
abstract_unstemmed |
Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
container_issue |
7 |
title_short |
On the Adaptive Determination of the Number of Preambles in RACH for MTC |
url |
http://dx.doi.org/10.1109/LCOMM.2016.2546238 |
remote_bool |
false |
ppnlink |
224842838 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1109/LCOMM.2016.2546238 |
up_date |
2024-07-04T03:35:09.033Z |
_version_ |
1803617943201775616 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC198069608X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714205913.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160816s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/LCOMM.2016.2546238</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160815</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC198069608X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC198069608X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c960-a5baf847e63107bc67840f2925f989700d34ea8e732d22bacba574fc7b85df6d0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0326031320160000020000701385ontheadaptivedeterminationofthenumberofpreamblesin</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="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Jinho Choi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the Adaptive Determination of the Number of Preambles in RACH for MTC</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Recently, in the Long Term Evolution-Advanced (LTE-A) system, a random access method, called random access (RACH) procedure, has been proposed for machine-type communications (MTC) to support a number of devices. Since the RACH procedure is similar to multichannel ALOHA, the fast retrial can be employed. In this letter, when the fast retrial is used for the RACH procedure, we propose an adaptive approach that can adaptively decide the number of preambles to maximize the throughput without knowing the number of devices and the access probability.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Indexes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">access delay</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RACH procedure</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random variables</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Throughput</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maximum likelihood estimation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine-type communications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bandwidth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE communications letters</subfield><subfield code="d">New York, NY : IEEE, 1997</subfield><subfield code="g">20(2016), 7, Seite 1385-1</subfield><subfield code="w">(DE-627)224842838</subfield><subfield code="w">(DE-600)1360382-6</subfield><subfield code="w">(DE-576)058070435</subfield><subfield code="x">1089-7798</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:7</subfield><subfield code="g">pages:1385-1</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/LCOMM.2016.2546238</subfield><subfield code="3">Volltext</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_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">20</subfield><subfield code="j">2016</subfield><subfield code="e">7</subfield><subfield code="h">1385-1</subfield></datafield></record></collection>
|
score |
7.4015617 |