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
802.16d 메시 네트워크의 인지 동작을 위해 채널 호핑 MAC(Medium Access Control) 프로토콜이 제안되었습니다. 제안 내용에는 주로 제어 메시지 송수신을 위한 채널 접근의 채널 호핑 알고리즘, 인지 연산에서의 대역폭 할당 알고리즘, 인지 강화 프레임 구조, 스펙트럼 센싱 결과 보고 방법, 재직 검출 방법 등이 포함된다. 다른 연구에 비해 제어 메시지 송수신을 위한 채널 호핑 알고리즘은 별도의 공통 제어 채널과 메쉬 클러스터 운영이 필요하지 않아 비용 효율적이고 운영이 간단합니다. 분석에 따르면 이 알고리즘을 사용하면 사용 가능한 채널이 있는 메시 노드가 비콘 및 네트워크 구성 정보를 수신할 수 있는 공정한 기회를 갖게 됩니다. 수치 결과를 통해 제안된 채널 호핑 알고리즘은 메시 클러스터 방식에 비해 한 홉 이웃이 수신한 데이터 스케줄링 제어 메시지를 얻는 데 최대 3배의 이득을 가져 대역폭을 최소화하는 장점이 있음을 알 수 있다. 할당 충돌. 대역폭 할당 알고리즘은 802.16d 메시 표준에 정의된 대역폭 적용 및 승인을 위한 70방향 핸드셰이크 프레임워크를 자세히 설명하며 인지 작업에서 동적 리소스 할당을 가능하게 합니다. 채널 호핑 MAC 프로토콜의 타당성은 시뮬레이션을 통해 확인됩니다. 그리고 시뮬레이션 결과는 매개변수 세트를 사용하여 약 XNUMX%의 정규화된 총 포화 처리량을 달성할 수 있음을 보여줍니다.
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.
부
Ming-Tuo ZHOU, Hiroshi HARADA, "A Channel-Hopping MAC Protocol for Cognitive IEEE 802.16d Mesh Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 12, pp. 3417-3428, December 2010, doi: 10.1587/transcom.E93.B.3417.
Abstract: A channel-hopping medium access control (MAC) protocol is proposed for cognitive operation of the 802.16d Mesh networks. The proposal mainly includes a channel-hopping algorithm of channel accessing for control messages transmission and reception, an algorithm of bandwidth allocation in cognitive operation, a cognition-enhanced frame structure, a method of spectrum sensing results reporting, and a method of incumbent detection. Compared to other studies, the channel-hopping algorithm for control messages transmission and reception requires no extra common control channels and operation of mesh clusters, thus it is more cost-effective and simpler in operation. Analysis shows that with this algorithm a Mesh node with any available channels has fair opportunities to receive beacon and network configuration information. Numerical results show that, compared to the mesh cluster method, the proposed channel-hopping algorithm has gain, e.g., as high as 3 times, in getting the data scheduling control messages received by one-hop neighbors, thus it has advantages in minimizing bandwidth allocation collisions. The algorithm of bandwidth allocation details the three-way handshake framework for bandwidth application and grant that is defined in 802.16d Mesh standard, and it enables dynamical resource allocations in cognitive operations. The feasibility of the channel-hopping MAC protocol is confirmed by simulations. And simulation results show that with the parameters set, a normalized aggregate saturation throughput of about 70% is achievable.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.3417/_p
부
@ARTICLE{e93-b_12_3417,
author={Ming-Tuo ZHOU, Hiroshi HARADA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Channel-Hopping MAC Protocol for Cognitive IEEE 802.16d Mesh Networks},
year={2010},
volume={E93-B},
number={12},
pages={3417-3428},
abstract={A channel-hopping medium access control (MAC) protocol is proposed for cognitive operation of the 802.16d Mesh networks. The proposal mainly includes a channel-hopping algorithm of channel accessing for control messages transmission and reception, an algorithm of bandwidth allocation in cognitive operation, a cognition-enhanced frame structure, a method of spectrum sensing results reporting, and a method of incumbent detection. Compared to other studies, the channel-hopping algorithm for control messages transmission and reception requires no extra common control channels and operation of mesh clusters, thus it is more cost-effective and simpler in operation. Analysis shows that with this algorithm a Mesh node with any available channels has fair opportunities to receive beacon and network configuration information. Numerical results show that, compared to the mesh cluster method, the proposed channel-hopping algorithm has gain, e.g., as high as 3 times, in getting the data scheduling control messages received by one-hop neighbors, thus it has advantages in minimizing bandwidth allocation collisions. The algorithm of bandwidth allocation details the three-way handshake framework for bandwidth application and grant that is defined in 802.16d Mesh standard, and it enables dynamical resource allocations in cognitive operations. The feasibility of the channel-hopping MAC protocol is confirmed by simulations. And simulation results show that with the parameters set, a normalized aggregate saturation throughput of about 70% is achievable.},
keywords={},
doi={10.1587/transcom.E93.B.3417},
ISSN={1745-1345},
month={December},}
부
TY - JOUR
TI - A Channel-Hopping MAC Protocol for Cognitive IEEE 802.16d Mesh Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3417
EP - 3428
AU - Ming-Tuo ZHOU
AU - Hiroshi HARADA
PY - 2010
DO - 10.1587/transcom.E93.B.3417
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2010
AB - A channel-hopping medium access control (MAC) protocol is proposed for cognitive operation of the 802.16d Mesh networks. The proposal mainly includes a channel-hopping algorithm of channel accessing for control messages transmission and reception, an algorithm of bandwidth allocation in cognitive operation, a cognition-enhanced frame structure, a method of spectrum sensing results reporting, and a method of incumbent detection. Compared to other studies, the channel-hopping algorithm for control messages transmission and reception requires no extra common control channels and operation of mesh clusters, thus it is more cost-effective and simpler in operation. Analysis shows that with this algorithm a Mesh node with any available channels has fair opportunities to receive beacon and network configuration information. Numerical results show that, compared to the mesh cluster method, the proposed channel-hopping algorithm has gain, e.g., as high as 3 times, in getting the data scheduling control messages received by one-hop neighbors, thus it has advantages in minimizing bandwidth allocation collisions. The algorithm of bandwidth allocation details the three-way handshake framework for bandwidth application and grant that is defined in 802.16d Mesh standard, and it enables dynamical resource allocations in cognitive operations. The feasibility of the channel-hopping MAC protocol is confirmed by simulations. And simulation results show that with the parameters set, a normalized aggregate saturation throughput of about 70% is achievable.
ER -