Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications
One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, co...
Ausführliche Beschreibung
Autor*in: |
Minjoong Rim [verfasserIn] Seungyeob Chae [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2017 |
---|
Übergeordnetes Werk: |
In: Mobile Information Systems - Hindawi Limited, 2015, (2017) |
---|---|
Übergeordnetes Werk: |
year:2017 |
Links: |
Link aufrufen |
---|
DOI / URN: |
10.1155/2017/7954631 |
---|
Katalog-ID: |
DOAJ006107885 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | DOAJ006107885 | ||
003 | DE-627 | ||
005 | 20230225160944.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230225s2017 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1155/2017/7954631 |2 doi | |
035 | |a (DE-627)DOAJ006107885 | ||
035 | |a (DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
050 | 0 | |a TK5101-6720 | |
100 | 0 | |a Minjoong Rim |e verfasserin |4 aut | |
245 | 1 | 0 | |a Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications |
264 | 1 | |c 2017 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. | ||
653 | 0 | |a Telecommunication | |
700 | 0 | |a Seungyeob Chae |e verfasserin |4 aut | |
773 | 0 | 8 | |i In |t Mobile Information Systems |d Hindawi Limited, 2015 |g (2017) |w (DE-627)486725774 |w (DE-600)2187808-0 |x 1875905X |7 nnns |
773 | 1 | 8 | |g year:2017 |
856 | 4 | 0 | |u https://doi.org/10.1155/2017/7954631 |z kostenfrei |
856 | 4 | 0 | |u https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c |z kostenfrei |
856 | 4 | 0 | |u http://dx.doi.org/10.1155/2017/7954631 |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/1574-017X |y Journal toc |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/1875-905X |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_165 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_171 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
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_636 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2037 | ||
912 | |a GBV_ILN_2038 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2057 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2068 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2108 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2118 | ||
912 | |a GBV_ILN_2119 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2144 | ||
912 | |a GBV_ILN_2147 | ||
912 | |a GBV_ILN_2148 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_2522 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4336 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |j 2017 |
author_variant |
m r mr s c sc |
---|---|
matchkey_str |
article:1875905X:2017----::rmbsdadmcesihnefrneaclaincosrmsomsie |
hierarchy_sort_str |
2017 |
callnumber-subject-code |
TK |
publishDate |
2017 |
allfields |
10.1155/2017/7954631 doi (DE-627)DOAJ006107885 (DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c DE-627 ger DE-627 rakwb eng TK5101-6720 Minjoong Rim verfasserin aut Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications 2017 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. Telecommunication Seungyeob Chae verfasserin aut In Mobile Information Systems Hindawi Limited, 2015 (2017) (DE-627)486725774 (DE-600)2187808-0 1875905X nnns year:2017 https://doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c kostenfrei http://dx.doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/toc/1574-017X Journal toc kostenfrei https://doaj.org/toc/1875-905X 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_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2017 |
spelling |
10.1155/2017/7954631 doi (DE-627)DOAJ006107885 (DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c DE-627 ger DE-627 rakwb eng TK5101-6720 Minjoong Rim verfasserin aut Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications 2017 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. Telecommunication Seungyeob Chae verfasserin aut In Mobile Information Systems Hindawi Limited, 2015 (2017) (DE-627)486725774 (DE-600)2187808-0 1875905X nnns year:2017 https://doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c kostenfrei http://dx.doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/toc/1574-017X Journal toc kostenfrei https://doaj.org/toc/1875-905X 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_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2017 |
allfields_unstemmed |
10.1155/2017/7954631 doi (DE-627)DOAJ006107885 (DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c DE-627 ger DE-627 rakwb eng TK5101-6720 Minjoong Rim verfasserin aut Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications 2017 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. Telecommunication Seungyeob Chae verfasserin aut In Mobile Information Systems Hindawi Limited, 2015 (2017) (DE-627)486725774 (DE-600)2187808-0 1875905X nnns year:2017 https://doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c kostenfrei http://dx.doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/toc/1574-017X Journal toc kostenfrei https://doaj.org/toc/1875-905X 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_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2017 |
allfieldsGer |
10.1155/2017/7954631 doi (DE-627)DOAJ006107885 (DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c DE-627 ger DE-627 rakwb eng TK5101-6720 Minjoong Rim verfasserin aut Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications 2017 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. Telecommunication Seungyeob Chae verfasserin aut In Mobile Information Systems Hindawi Limited, 2015 (2017) (DE-627)486725774 (DE-600)2187808-0 1875905X nnns year:2017 https://doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c kostenfrei http://dx.doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/toc/1574-017X Journal toc kostenfrei https://doaj.org/toc/1875-905X 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_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2017 |
allfieldsSound |
10.1155/2017/7954631 doi (DE-627)DOAJ006107885 (DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c DE-627 ger DE-627 rakwb eng TK5101-6720 Minjoong Rim verfasserin aut Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications 2017 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. Telecommunication Seungyeob Chae verfasserin aut In Mobile Information Systems Hindawi Limited, 2015 (2017) (DE-627)486725774 (DE-600)2187808-0 1875905X nnns year:2017 https://doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c kostenfrei http://dx.doi.org/10.1155/2017/7954631 kostenfrei https://doaj.org/toc/1574-017X Journal toc kostenfrei https://doaj.org/toc/1875-905X 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_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2017 |
language |
English |
source |
In Mobile Information Systems (2017) year:2017 |
sourceStr |
In Mobile Information Systems (2017) year:2017 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Telecommunication |
isfreeaccess_bool |
true |
container_title |
Mobile Information Systems |
authorswithroles_txt_mv |
Minjoong Rim @@aut@@ Seungyeob Chae @@aut@@ |
publishDateDaySort_date |
2017-01-01T00:00:00Z |
hierarchy_top_id |
486725774 |
id |
DOAJ006107885 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ006107885</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230225160944.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1155/2017/7954631</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ006107885</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c</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">TK5101-6720</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Minjoong Rim</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</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">One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance.</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Seungyeob Chae</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">Mobile Information Systems</subfield><subfield code="d">Hindawi Limited, 2015</subfield><subfield code="g">(2017)</subfield><subfield code="w">(DE-627)486725774</subfield><subfield code="w">(DE-600)2187808-0</subfield><subfield code="x">1875905X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2017</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1155/2017/7954631</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1155/2017/7954631</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1574-017X</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1875-905X</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_165</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_171</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_224</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_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</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_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</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_4035</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_4242</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_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</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_4336</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="j">2017</subfield></datafield></record></collection>
|
callnumber-first |
T - Technology |
author |
Minjoong Rim |
spellingShingle |
Minjoong Rim misc TK5101-6720 misc Telecommunication Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications |
authorStr |
Minjoong Rim |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)486725774 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
DOAJ |
remote_str |
true |
callnumber-label |
TK5101-6720 |
illustrated |
Not Illustrated |
issn |
1875905X |
topic_title |
TK5101-6720 Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications |
topic |
misc TK5101-6720 misc Telecommunication |
topic_unstemmed |
misc TK5101-6720 misc Telecommunication |
topic_browse |
misc TK5101-6720 misc Telecommunication |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Mobile Information Systems |
hierarchy_parent_id |
486725774 |
hierarchy_top_title |
Mobile Information Systems |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)486725774 (DE-600)2187808-0 |
title |
Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications |
ctrlnum |
(DE-627)DOAJ006107885 (DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c |
title_full |
Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications |
author_sort |
Minjoong Rim |
journal |
Mobile Information Systems |
journalStr |
Mobile Information Systems |
callnumber-first-code |
T |
lang_code |
eng |
isOA_bool |
true |
recordtype |
marc |
publishDateSort |
2017 |
contenttype_str_mv |
txt |
author_browse |
Minjoong Rim Seungyeob Chae |
class |
TK5101-6720 |
format_se |
Elektronische Aufsätze |
author-letter |
Minjoong Rim |
doi_str_mv |
10.1155/2017/7954631 |
author2-role |
verfasserin |
title_sort |
frame-based random access with interference cancellation across frames for massive machine type communications |
callnumber |
TK5101-6720 |
title_auth |
Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications |
abstract |
One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. |
abstractGer |
One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. |
abstract_unstemmed |
One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance. |
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_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
title_short |
Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications |
url |
https://doi.org/10.1155/2017/7954631 https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c http://dx.doi.org/10.1155/2017/7954631 https://doaj.org/toc/1574-017X https://doaj.org/toc/1875-905X |
remote_bool |
true |
author2 |
Seungyeob Chae |
author2Str |
Seungyeob Chae |
ppnlink |
486725774 |
callnumber-subject |
TK - Electrical and Nuclear Engineering |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.1155/2017/7954631 |
callnumber-a |
TK5101-6720 |
up_date |
2024-07-03T19:01:23.930Z |
_version_ |
1803585620735426560 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ006107885</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230225160944.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1155/2017/7954631</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ006107885</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJbcfe5fdff8204b639fb5f743b5d2190c</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">TK5101-6720</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Minjoong Rim</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Frame-Based Random Access with Interference Cancellation across Frames for Massive Machine Type Communications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</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">One of the main requirements for next generation mobile or wireless communication systems is to effectively support a large number of machine type communication devices for Internet of things applications. In order to improve the random access capability in frame-based slotted Aloha environments, coded random access techniques have been proposed, in which multiple copies of a packet are transmitted per frame and the copies are cancelled out from the received signal if any single copy is successfully received. They, however, may increase the transmission power by sending multiple copies per frame. Above all, for systems with a small number of slots per frame, they may not be able to improve the performance by readily reaching a congested state. This paper proposes a new frame-based random access scheme, which sends at most one copy of a packet per frame but uses interference cancellation to improve the performance. If a successfully received packet is a retransmitted one, the previously transmitted signals for the packet can be cancelled out from the received signals for trying to decode other received packets. The proposed scheme has different characteristics than coded random access schemes and can be also combined with them to further improve the performance.</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Seungyeob Chae</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">Mobile Information Systems</subfield><subfield code="d">Hindawi Limited, 2015</subfield><subfield code="g">(2017)</subfield><subfield code="w">(DE-627)486725774</subfield><subfield code="w">(DE-600)2187808-0</subfield><subfield code="x">1875905X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2017</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1155/2017/7954631</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/bcfe5fdff8204b639fb5f743b5d2190c</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1155/2017/7954631</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1574-017X</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1875-905X</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_165</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_171</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_224</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_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</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_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</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_4035</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_4242</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_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</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_4336</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="j">2017</subfield></datafield></record></collection>
|
score |
7.4020987 |