• 대한음성학회:학술대회논문집
• /
• 대한음성학회 2004년도 춘계 학술대회 발표논문집
• /
• pp.235-238
• /
• 2004

Frame erasures cause speech quality degradation in wireless communication networks or packet networks. The degradation becomes worse when consecutive frame erasures occur. Speech coders have a frame erasure concealment(FEC) mechanism to compensate for frame erasures. It is meaningful to evaluate the performance of FEC mechanisms for frame erasures that occur in communications networks. In this paper, various frame erasures are designed. And the FEC algorithms of speech coders are evaluated and analyzed with the Perceptual Evaluation of Speech Quality(PESQ). It is found that the performances vary in accordance with frame erasure types, frame erasure rates, and utterance lengths.

• 한국멀티미디어학회논문지
• /
• 제18권12호
• /
• pp.1468-1474
• /
• 2015

Efficient spectrum sharing is an important issue in Device-to-Device (D2D) communications underlaying cellular networks as it can mitigate the interference to cellular users and improve the performance of the systems. In this paper, we formulate the radio resource allocation in D2D communications as a mixed nonlinear integer programing. We show the formulated problem is NP-hard and thus a polynomial time algorithm to solve is not possible. Since such a problem is very hard to obtain the optimal solution within a short running time, we instead propose a fast heuristic suboptimal algorithm to mitigate the interference caused to cellular users and improve the performance of the systems. Simulation results are provided to evaluate the performance of the proposed algorithm.

• Journal of Communications and Networks
• /
• 제5권1호
• /
• pp.55-64
• /
• 2003

Mobile IP has several inefficiencies, and was not originally designed for situations where both peers are highly mobile. We present a mobility management solution that retains compatibility with existing Internet protocols, whilst increasing the efficiency of communications between two GPRS mobile hosts. Our proposal eradicates triangle routing and minimizes handover latency. We show by numerical analysis that the routing optimization improves the performance of TCP controlled data flows, reducing buffering requirements and minimizing the recovery time after a handover occurs.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2002년도 춘계학술발표논문집 (하)
• /
• pp.1539-1542
• /
• 2002

Many routing protocols have been proposed for mobile ad-hoc networks, but most protocols do not consider the physical location of the communicating nodes. In this paper we propose adaptive zoning approach with multiple hosts for reducing the number of route request messages. The proposed approach makes the sub-request zone has shorter interval than the existing schemes between the source and destination. This results in significantly lower routing overhead than the existing schemes as verified by computer simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1884-1903
• /
• 2019

Device-to-Device (D2D) communications can provide proximity based services in the future 5G cellular networks. It allows short range communication in a limited area with the advantages of power saving, high data rate and traffic offloading. However, D2D communications may reuse the licensed channels with cellular communications and potentially result in critical interferences to nearby devices. To control the interference and improve network throughput in overlaid D2D cellular networks, a novel channel assignment approach is proposed in this paper. First, we characterize the performance of devices by using Poisson point process model. Then, we convert the throughput maximization problem into an optimal spectrum allocation problem with signal to interference plus noise ratio constraints and solve it, i.e., assigning appropriate fractions of channels to cellular communications and D2D communications. In order to mitigate the interferences between D2D devices, a cluster-based multi-channel assignment algorithm is proposed. The algorithm first cluster D2D communications into clusters to reduce the problem scale. After that, a multi-channel assignment algorithm is proposed to mitigate critical interferences among nearby devices for each D2D cluster individually. The simulation analysis conforms that the proposed algorithm can greatly increase system throughput.

• 한국멀티미디어학회논문지
• /
• 제13권12호
• /
• pp.1798-1804
• /
• 2010

TCP with AIMD mechanism, one of the most popular protocols in internet, can solve congestion control in wired networks. This protocol, however, is not efficient in wireless networks. This paper proposes a new mechanism namely General AIMD with Congestion Window Upper Bound in which congestion window is limited by an upper bound. By applying optimization theory, we find an optimal policy for congestion window upper bound to maximize network throughput.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.183-192
• /
• 2014

This paper proposes a payment-based power control scheme using non-cooperative game with a novel pricing function in cognitive radio networks (CRNs). The proposed algorithm considers the fairness of power control among second users (SUs) where the value of per SU' signal to noise ratio (SINR) or distance between SU and SU station is used as reference for punishment price setting. Due to the effect of uncertainty fading environment, the system is unable to get the link gain coefficient to control SUs' transmission power accurately, so the quality of service (QoS) requirements of SUs may not be guaranteed, and the existence of Nash equilibrium (NE) is not ensured. Therefore, an alternative iterative scheme with sliding model is presented for the non-cooperative power control game algorithm. Simulation results show that the pricing policy using SUs' SINR as price punishment reference can improve total throughput, ensure fairness and reduce total transmission power in CRNs.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.494-498
• /
• 2011

Satellite digital multimedia broadcasting (S-DMB) systems use gap fillers (GFs) to provide wireless multimedia services to non-line-of-sight locations. GFs act as repeaters, and S-DMB systems require GF networks in order to guarantee mobile reception. Each GF covers a cell or sector. In order to provide contiguous coverage of an area comprising two or more cells or sectors, multiple GFs are needed. However, when multiple GFs are situated close to each other, interference is likely to occur. As a result, in this study, we have investigated system-level environments for planning the design of interference-free GF networks in S-DMB systems. Our investigations revealed that S-DMB services are unavailable because of quality deterioration caused by interference when the delay attributable to a GF and the satellite signals exceeds ${\pm}$256 chips and the distance between the GF and its reception terminal is greater than 4.6 km. On the basis of this analysis, we conducted a field test that confirmed that the above-mentioned time delay can be controlled in such a way as to ensure high quality S-DMB services.

• 한국광학회:학술대회논문집
• /
• 한국광학회 2003년도 제14회 정기총회 및 03년 동계학술발표회
• /
• pp.246-247
• /
• 2003

In recent years, soaring traffic volumes over optical communications networks lead to the rapid advances in information communications equipments. In backbone communications networks, there has been an advance in high-density transmission through DWDM, which can simultaneously transmit numerous signals with different wavelengths. When the channel spacing is narrower, the cross-talk between channels an important parameter that guarantees to the high performance of a whole system, becomes critical. (omitted)

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.747-749
• /
• 2000

A new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT) is presented. The proposed scheme can reduce the average delay of non-real-time (NRT) class while maintaining the QoS of real-time (RT) classes. Our scheme can also reflect the traffic fluctuation of networks with a small processing burden.