• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.707-715
• /
• 2003

In this paper, we propose a new MAC(Medium Access Control) protocol using Movable-boundary, which tries to guarantee Qos for multimedia traffic in the slotted CDMA system. In this scheme, the traffic scheduler assigns channel resource according to the packet priority per service class and adapts the Movable-boundary concept in which the minimum resource is assigned to each traffic class; the remaining resource if it is available can be assigned dynamically according to the temporal demand of other traffic classes. For performance analysis, we performed computer simulations to obtain throughput and packet loss rate and compared the results with Fixed-boundary system. We observed that the error rate of voice traffic could be maintained below a prescribed value while bursty traffic such as video source shares the same channel. In comparison with Fixed-boundary scheme, our protocol exhibits better throughput and packet loss rate performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1147-1150
• /
• 2006

Stream Control Transmission Protocol (SCTP) uses the 32-bit checksum in the common header, by which a corrupted SCTP packet will be regarded as a lost packet and then discarded. This may result in degradation of SCTP's throughput performance over wireless networks. This paper proposes a new chunk checksum scheme for SCTP, in which each data chunk contains its own checksum field and SACK chunk carry corresponding Transmission Sequence Number (TSN) with timestamp for every corruption event. The proposed chunk checksum scheme is introduced with the following three purposes: 1) to distinguish the chunk corruptions from the chunk losses; 2) to avoid the unnecessary halving of the congestion window (cwnd) in the case of chunk corruption; 3) to avoid the unwanted timeouts which can be induced in conventional SCTP in the case that the retransmitted data chunks are corrupted again in wireless networks. Simulation results show that the proposed chunk checksum scheme could improve the SCTP throughput in the wireless environments with a high bit error rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.6
• /
• pp.402-410
• /
• 1986

The Media Access Control(MAC) Technologies in IEEE 802 Local Area Network(LAN) reference model include CSMA/CD, Token Ring and Token Bus methodes. The channel throughput of LAN can be affected by some parameters such as channel length, transmission rate and packet size, and station numbers. In this paper, the effect of these parameters to channel throughput are analyzed by normalized parameters. And the token ring and token bus method are analyzed by using the normalized parameter, and relatinonship bwtween channel thorughput and parameters is discussed. Finally, results are compared.

• Aerospace Engineering and Technology
• /
• v.12 no.2
• /
• pp.118-122
• /
• 2013

In this study, We show that multiple UAVs (Unmaned Air Vehicle) have datalink system which includes the IEEE 802.11b technology. we are predicting and calculating to the number of the UAV and data rate between UAV and ground control system, using the IEEE 802.11 standards which include the transmit/receive the delay time and theoretical maximum throughput (TMT).

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.445-454
• /
• 2009

Cooperative transmission protocols are always designed to achieve the largest diversity gain and the network capacity simultaneously. The concept of diversity-multiplexing tradeoff (DMT) in multiple input multiple output (MIMO) systems has been extended to this field. However, DMT constrains a better understanding of the asymptotic interplay between transmission rate, outage probability (OP) and signal-to-noise ratio. Another formulation called the throughput-reliability tradeoff (TRT) was then proposed to avoid such a limitation. By this new rule, Azarian and Gamal well elucidated the asymptotic trends exhibited by the OP curves in block-fading MIMO channels. Meanwhile they doubted whether the new rule can be used in more general channels and protocols. In this paper, we will prove that it does hold true in decode-and-forward cooperative protocols. We deduce the theoretic OP curves predicted by TRT and demonstrate by simulations that the OP curves will asymptotically overlap with the theoretic curves predicted by TRT.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.87-95
• /
• 1991

The exact solution of the closed queueing networks(CQN) is known only for the product form (BCMP) queueing networks. Various computational algorithms are available to derive system throughput(the rate at which a system completes units of computational work) of the networks. However, the computational expense of an exact solution is often excessive when there are multiple classes of cutomers. Instead of computing the exact values, it may be sufficient to derive bounds on the performance measures. Techniques for obtaining bounds on BCMP queueing networks have appeared in the past years. This paper also presents bounds on throughput in CQN models with multiple classes of customers.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.151-161
• /
• 2012

This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given deadline is formulated. The convergence of the proposed iterative coordinate descent method for the problem is proved and the short-term throughput maximizing offline power allocation policy is found. Examples for interference regions with known sum capacities are given with directional water-filling interpretations. Next, stochastic data arrivals are addressed. Finally, online and/or distributed near-optimal policies are proposed. Performance of the proposed algorithms are demonstrated through simulations.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.568-580
• /
• 2014

To enhance the utilization of the traffic channels of a network (instead of allocating radio channel to an individual user), a channel or a group of channels are allocated to a user group. The idea behind this is the statistical distribution of traffic arrival rates and the service time for an individual user or a group of users. In this paper, we derive the blocking probability and throughput of a subscriber station of Worldwide Interoperability for Microwave Access (WiMAX) by considering both the connection level and packet-level traffic under a complete partition scheme. The main contribution of the paper is to incorporate the traffic shaping scheme onto the incoming turbulent traffic. Hence, we have also analyzed the impact of the drain rate of the buffer on the blocking probability and throughput.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.104-113
• /
• 2013

A high-throughput Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) decoder architecture is proposed for 60GHz multi-gigabit wireless personal area network (WPAN) applications. Two novel techniques which can apply to our selected QC-LDPC code are proposed, including a four block-parallel layered decoding technique and fixed wire network. Two-stage pipelining and four block-parallel layered decoding techniques are used to improve the clock speed and decoding throughput. Also, the fixed wire network is proposed to simplify the switch network. A 672-bit, rate-1/2 QC-LDPC decoder architecture has been designed and implemented using 90-nm CMOS standard cell technology. Synthesis results show that the proposed QC-LDPC decoder requires a 794K gate and can operate at 290 MHz to achieve a data throughput of 3.9 Gbps with a maximum of 12 iterations, which meet the requirement of 60 GHz WPAN applications.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.92-101
• /
• 2012

In this paper, we propose a distributed transmit power control algorithm for optimal end-to-end throughput in wireless multihop networks. Considering a solidarity property of link rates consisting of a multihop link and the fact that the multihop end-to-end throughput is determined by the minimum link rate, the proposed scheme controls the transmit power to make all link rates be equal and so maximizes the end-to-end throughput of multihop link. In addition, in the proposed scheme the transmit node calculates its transmit power autonomously in a distributed manner just through the information sharing with its neighbor nodes and so decreases the information sharing overhead. Simulation results show that the proposed scheme achieves significant improvements in terms of end-to-end throughput and power consumption compared with the conventional maximum equal power allocation scheme.