• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.739-742
• /
• 2000

In this paper, we evaluate the throughput and delay performance of a wireless Local Area Network(WLAN) employing the OFDM-based IEEE 802.lla Medium Access Control(MAC) protocol by compute. simulations under wireless indoor. channel. Packet Error Rate(PER) is also investigated for the various Eb/No. It is shown that, with soft-decision Viterbi decoder, throughput and delay performance are close to those of error-free channel at Eb/No above 8dB and PER is about 2${\times}$10$\^$-5/ at Eb/No=10dB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1136-1144
• /
• 2010

In this paper, the effects of HARQ feedback error are evaluated in IEEE 802.16m system when the HARQ and ARQ interactions that utilize the HARQ feedback information is used. Also, the HARQ and ARQ interaction scheme considering HARQ feedback errors are proposed. The HARQ and ARQ interaction scheme improve the system throughput by using the HARQ feedback information instead of the ARQ feedback message, which reduce retransmission time. However, errors in the HARQ feedback information generate severe performance degradation. Especially, the local NAK errors between HARQ feedback error critically degrade the performance, because the local NAK errors lead the loss of ARQ blocks. We propose a channel state-based schemes for HARQ and ARQ interactions to mitigate the throughput degradation due to HARQ feedback errors. Simulation results show that the proposed scheme improves the throughput and the delay performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.216-222
• /
• 2004

Frequency selective fading is a limiting factor for transmission rate and performance in high-speed multimedia communications. In this paper, we propose a turbo coded adaptive quadrature amplitude modulation (QAM) system for efficient high-speed transmission. By making use of a user-friendly simulation platform of SPW, the proposed turbo coded adaptive QAM system(TuAQAM) is developed and its performance is evaluated in terms of throughput and BER performance. Two channel models having delay spreads of 700ns and 1400ns are created for the simulations. It is shown that the proposed TuAQAM system provides a performance improvement of approximately 3dB and improved throughput for the channel model whose delay spread is 700ns. Similarly, a performance improvement is also achieved for the channel model whose delay spread is 1400ns.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.434-442
• /
• 2012

Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1272-1281
• /
• 1994

CDMA technique has been largely focused for Wireless Data Network and PCN. ALOHA protocol also has been proven to be effective for Packet Radio Network regardless of low throughput due to channel colisions. In this paper, we evaluate the performance of CDMA_ALOHA scheme, denoted as S_CDMA_ALOHA(Soltted_CDAM_ALOHA) and MS_CDMA_ALOHA(Minislotted_CDMA_ALOHA) system, by analytic and simulation method. The superiority of the CDMA_ALOHA systems over conventional Slotted ALOHA system are clearely demonstrated for throughput, delay and stability performances. The MS_CDMA_ALOHA scheme provides better delay and throughput performance than the S_CDMA_ALOHA scheme.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.6
• /
• pp.879-888
• /
• 1999

A Study on the ARQ scheme of data error control is important for more reliable information transmission. Since performance difference is large by the long transmission delay time in satellite communication, the performances of SR ARQ and conventional type-I hybrid ARQ with fixed code rate are investigated by using the parameters of packet length, channel capacity, BER, and transmission delay time especially. BCH code is used in type-I hybrid ARQ for FEC method. This paper presents the throughput analyses according to such various parameters as BCH code rate, window size, data rate and round-trip delay time. Especially we derive a performance equation of type-I hybrid ARQ with the factor of the transmission delay time using the equation of SAW ARQ. Also, the performance of type-I hybrid ARQ specially considering transmission delay time is analyzed through numerical analysis and computer simulation so we can get a important characteristics variation.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.365-373
• /
• 2001

We propose a new channel reservation protocol which can reduce message delay by using a counter for detection of d source conflict in a WDM single-hop network with non-equivalent propagation delay. A source convict occurs when a source node has the right to transmit more than or equal to two messages simultaneously, which are transmitted using different wavelengths. In such a case, the source node has to newly obtain the right to transmit the message. In the proposed protocol, by using a source conflict counter a source node can detect a source conflict before a wave-length assignment is performed. Therefore, the source node can start a procedure to newly obtain the right to transmit the message which cannot be transmitted due to a source conflict. We analyse the throughput performance by taking the effect of a source conflict into account, and show that the approximate analysis and the computer simulated results are close. Also, from computer simulated results, we show that our proposed protocol can reduce mean message delay dramatically without degrading throughput performance as the offered load becomes large.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.11-17
• /
• 2003

In this paper, we presented the dynamic random access channel allocation method under the priority based scheduling policy in order to improve the system performance of HIPERLAN/2 standardized by ETSI According to the scheduling policy, AP scheduler primarily allocates the resource to the collision MT This scheduling policy bring about decreasing the transmission delay of collision MT Dynamic RCH(random access channel) allocation method decreases the collision probability by increasing the number of RCH slots in case of low traffic. While it increases the maximum throughput by increasing the number of the data transmission slots in case of high traffic Therefore dynamic allocation method of RCH slots decreases the scheduling delay and increases the throughput When we evaluate the performance of presented method based on standards, we saw that the presented method improve the performance of the MAC protocol in terms of throughput and transmission delay.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.139-150
• /
• 1997

For high-speed networks, a new ring protocal is proposed in this paper. A ring network combined with destination removal can achieve much higher network throughput than the channel transmission rate. However, such a network exhibits fairness problems. Over a past few years, global fairness algorithms such as ATMR and Metaring have been proposed to solve such problems. But the ring access time delay and fairness in such networks are sensitive to the network parameters such as network size and traffic distribution. In addition to guaranteeing fair ring access to all nodes, there are several other important performance aspects in such networks. The one is that fairness is enforced while node throughputs are kept as high as possible. And another performance measure is access delay and more specifically Head-Of-Line(HOL) delay, i.e., the amount of time the first cell in the transmission buffer of a node has to wait before it accesses the ring. HOL delay is a mijor component in the transmission jitter of the synchronous traffic transmission. A key idea of the proposed ring protocol is to find the nodes that have much more chances to access the ring than any other nodes in the independently distributed node architecture. Since destined by many cells need to share a part of the bandwidths with the next node for the fairness in as much as performance degradation does not become critical. To investigate the performance behavior of the proposed ring protocol for various network condition,s several performance parameters wuch as ring access time delay, and throughput are compared with those of the ATMR and Metaring protocols using simulation package, SIMAN.