• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.1-8
• /
• 2004

A simple AMC (Adaptive Modulation and Coding) technique using ARQ (Automatic Repeat Request) for a MIMO (Multiple Input Multiple Output) system is proposed which does not require the additional feedback. In addition, the proposed AMC technique is different from the conventional technique in the aspect of considering the MCS (Modulation and Coding Scheme) level from the previous packet. The proposed technique can discard fewer amounts of unsuitable packets than the conventional technique. In the proposed system not only same rate control method for transmit antennas but also individual rate control method can be applied. The performance of the proposed technique is verified under a MIMO-OFDM (Orthogonal Frequency Division Multiplexing) system based on WLAN (Wireless Local Area Network), IEEE 802.11a. The results of the computer simulation show that a MIMO system with the proposed technique achieves higher throughput than one with a fixed transmission rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.406-415
• /
• 2005

The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.581-593
• /
• 2002

In this paper, we proposed an Adaptive RIO scheme to solve the problem of RIO scheme that occurs when admission control is performed for QoS guarantee of Assured Service in Differentiated Services. To prevent an early random drop of the admitted In-profile packet, proposed Adaptive RIO scheme updates parameters of RIO scheme every time interval according to the estimated numbers of maximum packet arrivals of In-profile traffic and total traffic during the next time interval. The numbers of maximum packet arrivals during the next time interval are estimated based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. We found from simulation results that, compared with RIO scheme, proposed Adaptive RIO scheme can improve performance of the throughput for In-profile traffic when admission control is performed or congestion occurs.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.218-226
• /
• 2016

Coordination among users is an inevitable but time-consuming operation in wireless networks. It severely limit the system performance when the data rate is high. We present FC-MAC, a novel MAC protocol that can complete a contention within one contention slot over a joint frequency-code domain. When a node takes part in the contention, it generates randomly a contention vector (CV), which is a binary sequence of length equal to the number of available orthogonal frequency division multiplexing (OFDM) subcarriers. In FC-MAC, different user is assigned with a distinct signature (i.e., PN sequence). A node sends the signature at specific subcarriers and uses the sequence of the ON/OFF states of all subcarriers to indicate the chosen CV. Meanwhile, every node uses the redundant antennas to detect the CVs of other nodes. The node with the minimum CV becomes the winner. The experimental results show that, the collision probability of FC-MAC is as low as 0.05% when the network has 100 nodes. In comparison with IEEE 802.11, contention time is reduced by 50-80% and the throughput gain is up to 200%.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.387-396
• /
• 2016

Multiuser communication has been an important research area of underwater acoustic communications and networking. This paper studies the use of adaptive orthogonal frequency-division multiple access (OFDMA) in a downlink scenario, where a central node sends data to multiple distributed nodes simultaneously. In practical implementations, the instantaneous channel state information (CSI) cannot be perfectly known by the central node in time-varying underwater acoustic (UWA) channels, due to the long propagation delays resulting from the low sound speed. In this paper, we explore the CSI feedback for resource allocation. An adaptive power-bit loading algorithm is presented, which assigns subcarriers to different users and allocates power and bits to each subcarrier, aiming to minimize the bit error rate (BER) under power and throughput constraints. Simulation results show considerable performance gains due to adaptive subcarrier allocation and further improvement through power and bit loading, as compared to the non-adaptive interleave subcarrier allocation scheme. In a lake experiment, channel feedback reduction is implemented through subcarrier clustering and uniform quantization. Although the performance gains are not as large as expected, experiment results confirm that adaptive subcarrier allocation schemes based on delayed channel feedback or long term statistics outperform the interleave subcarrier allocation scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3C
• /
• pp.255-263
• /
• 2010

In this paper, we present an efficient cooperative transmission scheme for high speed 60GHz WPAN system. In 60GHz, the cooperative transmission with relay is effective scheme because signals are exceedingly attenuated according to the distance and the transmission is impossible when there is no LOS between transmitter and receiver. Moreover, the reliability of signal in destination can be improved by receiving data from a relay as well as a transmitter. However, the overall data rate is reduced because transmission time is more required for relay. To solve this problem, we propose a cooperative transmission scheme with RS-CC serial concatenated codes. In the proposed cooperative transmission scheme, the relay can reduce the transmission data size because the only parity bits of systematic RS code are transmitted after encoding by CC. But the computational complexity is increased at the relay and the destination.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.905-915
• /
• 2007

This paper proposes a filter-based algorithm to adaptively adjust the contention window in IEEE 802.11 DCF. The proposed mechanism is focused on the general and realistic environments that have various conditions regarding to noise, media types and network load. For this flexible adaptation, Filter-based DCF(FDCF) takes a more realistic policy such as median filter concept in the image processing technologies. We can handle these various environments by adjusting the contention window size according to the result of filtering based on history-buffer. We can ignore temporarily and randomly occurred transmission failures due to noise errors and collisions in noisy environments. In addition, by changing the reference number and history-buffer size, FDCF can be extended as a general solution including previous proposed mechanism. We have confirmed that the proposed mechanism can achieve the better performance than those of previous researches in aspects of the throughput and the delay in the realistic environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.549-552
• /
• 2005

Multiple wireless devices in wired and wireless heterogeneous networks communicate with counterparts via a single access point (AP). In this case, the AP becomes a bottleneck of the network, therefore buffer overflows occur frequently and result in TCP performance degradation. In this paper, a new algorithm that prevents buffer overflows at AP and enhances TCP fairness is proposed. Depending on the buffer usage of AP, the new algorithm adaptively controls each TCP senders' transmission rate, prevents buffer overflows and thus guarantees improved TCP fairness. It is proved that the algorithm makes better of TCP throughput and fairness by preventing buffer overflows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1093-1105
• /
• 2012

We propose an interference space reuse (ISR) algorithm for the MU-MIMO design in 3-cell downlink interference channels. Also, we provide a strategy for the adoption of the ISR scheme in the cellular network. In the multicell interference channels, the cell edge users may undergo severe interferences and their signals should be protected from the interferers for reliable transmissions. However, the intra cell users do not only experience small interferences but also they require small transmission power for stable communication. We provide a vector design algorithm based on ISR, where intra cell users are served through reusing the cell edge users' interference space. The performance enhancement reaches 20% compared to the fractional frequency reuse (FFR) scheme combined with IA through the scheduling between the cell edge users and the intra cell users. Also, it can be used to enhance the cell edge throughput when the quality of service (QoS) requirements of the intra cell users are fixed.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.393-406
• /
• 2009

This paper introduces two functions added to the current version of ns-2 simulator for better accuracy of IEEE 802.15.4 network simulations. The first one is to automatically place hidden nodes over the ring topology in which the coordinator is centered, when the number of hidden nodes and total number of nodes is given. Collisions of signals can be distinguished into the trace file according to the ways of participation of hidden nodes. The second one is the CCA deferment algorithm described in IEEE 802.15.4-2006 standard which is not implemented in the current version of ns-2. Owing to these additional functions, we can carry out the precise analysis of the performance effects of hidden nodes and CCA deferment algorithm on 802.15.4 networks. Simulation results present at least 66% of performance degradation in throughput and drastic increase of collision probability up to 90% from 65% by just a single hidden node. Besides, 2006 standard for CCA deferment algorithm gives 19% lower collision probability and 38% higher performance.