• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.682-686
• /
• 2009

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoint, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.213-222
• /
• 2009

IEEE 802.15.3 HR-WPAN is designed to enable wireless connectivity of high-speed, low-power, low-cost multimedia-capable portable consumer electronic devices. For quality of service, the standard specifies the use of TDMA (Time Division Multiple Access). However, during low contention TDMA gives much lower channel utilization and higher delays than CSMA (Carrier Sensing Multiple Access) because in TDMA, a node can transmit only during its scheduled time slots whereas in CSMA, nodes can transmit at any time as long as there is no contention. By mixing CSMA and TDMA, Hybrid MAC becomes more robust to timing failures, time-varying channel conditions, slot assignment failures and topology changes than a stand-alone TDMA.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.90-99
• /
• 2016

In this work, we investigate differentially encoded blind transceiver design in low signal-to-noise ratio (SNR) regimes for orthogonal frequency-division multiplexing (OFDM) signaling. Owing to the fact that acquisition of channel state information is not viable for short coherence times or in low SNR regimes, we propose a time-spread frequency-encoded method under OFDM modulation. The repetition (spreading) of differentially encoded symbols allows us to achieve a target energy per bit to noise ratio and higher diversity. Based on the channel order, we optimize subcarrier assignment for spreading (along time) to achieve frequency diversity of an OFDM modulated signal. We present the performance of our proposed transceiver design and investigate the impact of Doppler frequency on the performance of the proposed differentially encoded transceiver design. To further improve reliability of the decoded data, we employ capacity-achieving low-density parity-check forward error correction encoding to the information bits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1427-1433
• /
• 2003

This paper presents the routing and wavelength and timeslot assignment problems for a circuit-switched time division multiplexed (TDM) wavelength-routed networks. In this paper, we propose an efficient distributed control protocol for establishing lightpath dynamically. The protocol uses backward reservation to reduce the chance of blocking. We use aggressive reservation method with usable multiple channels and select only one in multiple channel. We show through simulation that the proposed protocol improves the success rate in TDM-based lightpath establishment and the proposed aggressive reservation method improve blocking probability with appropriate reservation channel count.

• Journal of Internet Computing and Services
• /
• v.4 no.5
• /
• pp.61-68
• /
• 2003

In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and Maximizing channel utilization. Data terminals with random data packets are not provided slot reservation with PRMA protocol. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, and contended their quality of service, Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. So the terminal which wants to request for ABR type service, is allocated a minimum bandwidth from system for the first time, If the system have some extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot, As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization high.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.81-90
• /
• 2005

When we transmit signals, which are quantized by the vector quantizer (VQ), through noisy channels, the overall performance of the coding system is very dependent on the employed quantization scheme and the channel error effect. In order to design an optimal coding system, the source and channel coding scheme should be jointly optimized as in the channel-optimized VQ. As a suboptimal approach, we may consider the robust VQ (RVQ). In RVQ, we consider developing an index assignment function for mapping the output of quantizers to channel symbols so that the effect of the channel errors is minimized. Recently, a VQ, which can reduce the encoding complexity and is called the sample-adaptive product quantizer (SAPQ), has been proposed. SAPQ has very similar quantizer structure as to the product quantizer (PQ). However, the quantization performance can be better than PQ. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. In this paper, SAPQ is employed in order to design an RVQ to channel errors by reducing the vector dimension. Discussions on the codebook structure of SAPQ and experiments are introduced in an aspect of robustness to noisy channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1329-1337
• /
• 2001

최근 광대역 통신망을 무선 영역까지 확장하고자 하는 노력의 일환으로 무선 ATM 시스템에 관한 연구가 활발히 이루어지고 있다. 무선 ATM에서는 셀의 반경이 작아져서 핸드오버가 자주 일어나게 되는데 이는 QoS 저하를 야기하며, 핸드오버를 위한 채널이 부족하면 호가 절단되는 현상을 야기하게 된다. 이를 방지하기 위하여 본 논문에서는 QoS 보장이 용이하고, 채널 할당을 효율적으로 할 수 있는 핸드오버 방식을 제안한다. 대부분의 사용자는 일정한 패턴을 따라 이동함을 이용하여 이 패턴에 따라 핸드오버에 필요한 채널을 예약하고, 단말의 이동 시 신속한 핸드오버를 수행하게 된다. 제안한 알고리즘을 사용할 경우 핸드오버 호의 절단율을 줄일 수 있고, 채널 사용도 효율적으로 이루어진다.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.6
• /
• pp.311-318
• /
• 2013

In this paper, we consider a new packet scheduling algorithm for real-time traffic in the HSDPA system that has been introduced for the WCDMA system, in order to provide high transmission rates. The objective of the design is to meet the maximum tolerable delay and consider channel assignment based on the received SIR for real-time traffic users. The proposed scheduling algorithm shows that the users are ranked by the ratios of the bits in the buffer to the residual time for transmission as priority order; then the ranked users are assigned certain number of channels based on the SIR value table. The simulation results show that the proposed algorithm can provide a lower packet drop rate, and satisfy real time quality of service (QoS) requirements.

• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.451-465
• /
• 2016

A Radio labeling of the graph G is a function g from the vertex set V (G) of G to ℤ⁺ such that |g(u) - g(v)| ≥ diam(G) + 1 - d_G(u, v), where diam(G) and d(u, v) are diameter and distance between u and v in graph G respectively. The radio number rn(G) of G is the smallest number k such that G has radio labeling with max{g(v) : v ∈ V(G)} = k. We investigate radio number for some families of generalized caterpillar graphs.

• Korean Journal of Mathematics
• /
• v.23 no.4
• /
• pp.607-618
• /
• 2015

An L(2; 1)-labeling of a graph G is a function f from the vertex set V (G) to the set of all non-negative integers such that ${\mid}f(u)-f(v){\mid}{\geq}2$ if d(u, v) = 1 and ${\mid}f(u)-f(v){\mid}{\geq}1$ if d(u, v) = 2. The ${\lambda}$-number of G, denoted ${\lambda}(G)$, is the smallest number k such that G admits an L(2, 1)-labeling with $k=\max\{f(u){\mid}u{\in}V(G)\}$. In this paper, we consider the square of a cycle and provide exact value for its ${\lambda}$-number. In addition, we also completely determine its edge span.