The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam makalah ini, algoritma penugasan sub-pembawa dinamik (DSA) dinamik yang terpencar untuk rangkaian adhoc dan selular berasaskan pembahagian frekuensi ortogon (OFDMA) yang beroperasi dalam mod dupleks pembahagian masa (TDD) dicadangkan untuk menyelesaikan masalah nod yang tersembunyi dan terdedah. dalam kawalan capaian media (MAC). Kaedah ini mengurangkan gangguan saluran bersama (CCI), dan dengan itu meningkatkan daya pemprosesan keseluruhan rangkaian. CCI yang dikurangkan dan peningkatan daya tampung boleh dicapai, jika selektiviti masa dan kekerapan saluran pudar berbilang laluan dan timbal balik saluran yang ditawarkan oleh TDD dieksploitasi sepenuhnya. Pemilihan masa dan kekerapan saluran biasanya merupakan masalah utama dalam komunikasi mudah alih. Walau bagaimanapun, dalam konteks penetapan saluran untuk rangkaian berasaskan OFDMA dalam mod TDD, pemilihan masa dan kekerapan saluran adalah kunci untuk mengurangkan gangguan. Dalam mekanisme penetapan saluran yang dicadangkan, beberapa kelompok sub-pembawa diperuntukkan untuk penghantaran data antara pemancar dan penerima hanya jika saluran yang sepadan bagi sub-pembawa tersebut yang memautkan pemancar ini kepada penerima yang berpotensi menjadi mangsa pudar. Di samping itu, algoritma yang dicadangkan berfungsi dalam cara terdesentralisasi sepenuhnya dan, oleh itu, ia dapat menyokong komunikasi ad hoc dan multihop dengan berkesan serta organisasi kendiri rangkaian. Keputusan berangka menunjukkan bahawa daya pemprosesan yang diperolehi oleh pendekatan yang dicadangkan untuk kualiti perkhidmatan tertentu adalah lebih tinggi daripada kaedah konvensional dalam sebarang prasyarat senario geografi adhoc.
Van-Duc NGUYEN
Harald HAAS
Kyandoghere KYAMAKYA
Jean-Chamerlain CHEDJOU
Tien-Hoa NGUYEN
Seokho YOON
Hyunseung CHOO
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Van-Duc NGUYEN, Harald HAAS, Kyandoghere KYAMAKYA, Jean-Chamerlain CHEDJOU, Tien-Hoa NGUYEN, Seokho YOON, Hyunseung CHOO, "Decentralized Dynamic Sub-Carrier Assignment for OFDMA-Based Adhoc and Cellular Networks" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 12, pp. 3753-3764, December 2009, doi: 10.1587/transcom.E92.B.3753.
Abstract: In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3753/_p
Salinan
@ARTICLE{e92-b_12_3753,
author={Van-Duc NGUYEN, Harald HAAS, Kyandoghere KYAMAKYA, Jean-Chamerlain CHEDJOU, Tien-Hoa NGUYEN, Seokho YOON, Hyunseung CHOO, },
journal={IEICE TRANSACTIONS on Communications},
title={Decentralized Dynamic Sub-Carrier Assignment for OFDMA-Based Adhoc and Cellular Networks},
year={2009},
volume={E92-B},
number={12},
pages={3753-3764},
abstract={In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.},
keywords={},
doi={10.1587/transcom.E92.B.3753},
ISSN={1745-1345},
month={December},}
Salinan
TY - JOUR
TI - Decentralized Dynamic Sub-Carrier Assignment for OFDMA-Based Adhoc and Cellular Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3753
EP - 3764
AU - Van-Duc NGUYEN
AU - Harald HAAS
AU - Kyandoghere KYAMAKYA
AU - Jean-Chamerlain CHEDJOU
AU - Tien-Hoa NGUYEN
AU - Seokho YOON
AU - Hyunseung CHOO
PY - 2009
DO - 10.1587/transcom.E92.B.3753
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2009
AB - In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.
ER -