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
처리량을 향상하고 대역폭을 재사용하기 위해 클러스터링 기술을 사용하면 다중 홉 무선 네트워크의 노드를 효과적으로 관리할 수 있습니다. 그러나 이러한 네트워크에서는 숨겨진 단말 간섭으로 인해 시스템 성능이 저하되고 평균 패킷 지연 시간이 늘어납니다. 따라서 본 연구에서는 숨겨진 터미널 문제를 해결하기 위한 새로운 2단계 클러스터 기반 코드 할당 기법을 제시합니다. 하위 수준에서는 각 클러스터에서 사용되는 코드 수를 계산하기 위해 5가지 기본 및 최적화된 클러스터 내 코드 할당 방식을 개발합니다. 높은 수준에서는 최소한의 코드 세트 수를 얻기 위해 두 가지 클러스터 간 코드 할당 방식(대략적 제어 및 미세 제어)이 제안됩니다. 우리 방식의 장점은 낮은 실행 시간, 낮은 코드 재할당 가능성, 낮은 오버헤드를 포함합니다. 또한 제안된 방식을 사용하면 토폴로지가 다양할 때 직교 코드를 지역적으로 업데이트할 수 있습니다. 실험 결과는 제안된 방식이 기존 기술보다 성능이 우수하다는 것을 보여줍니다. 5가지 기본 클러스터 내 코드 할당 방식 중 숨겨진 단말 간섭을 피하기 위해 직교 코드 수 측면에서 원홉 이웃 수를 늘리는 순서 기준이 가장 좋습니다. 최적화된 클러스터 내 코드 할당 방식은 일반적으로 다른 방식에 비해 직교 코드를 적게 얻습니다. 클러스터 간 코드 할당 방식의 경우, 대략적인 제어는 코드 할당 시간이 더 짧습니다. 그러나 세분화된 제어에는 더 적은 직교 코드가 필요합니다.
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.
부
Chyi-Ren DOW, Cheng-Min LIN, Da-Wei FAN, "Avoidance of Hidden Terminal Problems in Cluster-Based Wireless Networks Using Efficient Two-Level Code Assignment Schemes" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 2, pp. 180-190, February 2001, doi: .
Abstract: To enhance throughput and reuse bandwidth, clustering techniques can effectively manage nodes in multi-hop wireless networks. However, in such networks, hidden terminal interference degrades the system performance and increases the average packet delay time. Therefore, this work presents novel two-level cluster-based code assignment techniques to resolve the hidden terminal problems. At the low level, five basic and an optimized intra-cluster code assignment schemes are developed to calculate the number of codes used in each cluster. At the high level, two inter-cluster code assignment schemes (coarse-grained and fine-grained controls) are proposed to obtain the minimal number of code sets. The merits of our schemes include low execution time, low probability of code re-assignment, and low overhead. Furthermore, the proposed schemes allow us to regionally update orthogonal codes when the topology varies. Experimental results demonstrate that the proposed schemes outperform conventional techniques. Among the five basic intra-cluster code assignment schemes, the ordering criteria of increasing number of one-hop neighbors is the best in terms of the number of orthogonal codes to avoid hidden terminal interference. The optimized intra-cluster code assignment scheme generally obtains fewer orthogonal codes than other schemes. For inter-cluster code assignment schemes, the coarse-grained control has a lower code allocation time. However, the fine-grained control requires fewer orthogonal codes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_2_180/_p
부
@ARTICLE{e84-b_2_180,
author={Chyi-Ren DOW, Cheng-Min LIN, Da-Wei FAN, },
journal={IEICE TRANSACTIONS on Communications},
title={Avoidance of Hidden Terminal Problems in Cluster-Based Wireless Networks Using Efficient Two-Level Code Assignment Schemes},
year={2001},
volume={E84-B},
number={2},
pages={180-190},
abstract={To enhance throughput and reuse bandwidth, clustering techniques can effectively manage nodes in multi-hop wireless networks. However, in such networks, hidden terminal interference degrades the system performance and increases the average packet delay time. Therefore, this work presents novel two-level cluster-based code assignment techniques to resolve the hidden terminal problems. At the low level, five basic and an optimized intra-cluster code assignment schemes are developed to calculate the number of codes used in each cluster. At the high level, two inter-cluster code assignment schemes (coarse-grained and fine-grained controls) are proposed to obtain the minimal number of code sets. The merits of our schemes include low execution time, low probability of code re-assignment, and low overhead. Furthermore, the proposed schemes allow us to regionally update orthogonal codes when the topology varies. Experimental results demonstrate that the proposed schemes outperform conventional techniques. Among the five basic intra-cluster code assignment schemes, the ordering criteria of increasing number of one-hop neighbors is the best in terms of the number of orthogonal codes to avoid hidden terminal interference. The optimized intra-cluster code assignment scheme generally obtains fewer orthogonal codes than other schemes. For inter-cluster code assignment schemes, the coarse-grained control has a lower code allocation time. However, the fine-grained control requires fewer orthogonal codes.},
keywords={},
doi={},
ISSN={},
month={February},}
부
TY - JOUR
TI - Avoidance of Hidden Terminal Problems in Cluster-Based Wireless Networks Using Efficient Two-Level Code Assignment Schemes
T2 - IEICE TRANSACTIONS on Communications
SP - 180
EP - 190
AU - Chyi-Ren DOW
AU - Cheng-Min LIN
AU - Da-Wei FAN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2001
AB - To enhance throughput and reuse bandwidth, clustering techniques can effectively manage nodes in multi-hop wireless networks. However, in such networks, hidden terminal interference degrades the system performance and increases the average packet delay time. Therefore, this work presents novel two-level cluster-based code assignment techniques to resolve the hidden terminal problems. At the low level, five basic and an optimized intra-cluster code assignment schemes are developed to calculate the number of codes used in each cluster. At the high level, two inter-cluster code assignment schemes (coarse-grained and fine-grained controls) are proposed to obtain the minimal number of code sets. The merits of our schemes include low execution time, low probability of code re-assignment, and low overhead. Furthermore, the proposed schemes allow us to regionally update orthogonal codes when the topology varies. Experimental results demonstrate that the proposed schemes outperform conventional techniques. Among the five basic intra-cluster code assignment schemes, the ordering criteria of increasing number of one-hop neighbors is the best in terms of the number of orthogonal codes to avoid hidden terminal interference. The optimized intra-cluster code assignment scheme generally obtains fewer orthogonal codes than other schemes. For inter-cluster code assignment schemes, the coarse-grained control has a lower code allocation time. However, the fine-grained control requires fewer orthogonal codes.
ER -