• Title/Summary/Keyword: communication networks

Search Result 5,474, Processing Time 0.055 seconds

A PERFORMANCE STUDY OF SPEECH CODERS FOR TELEPHONE CONFERENCING IN DIGITAL MOBILE COMMUNICATION NETWORKS

  • Lee, M.S.;Lee, G.C.;Kim, K.C.;Lee, H.S.;Lyu, D.S.;Shin, D.J.;Lee, Hun
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06a
    • /
    • pp.899-903
    • /
    • 1994
  • This paper describes two methods to assess the output speech, quality of vocoders for telephone conferencing in digital mobile communication networks. The proposed methods are the sentence discrimiantion method and the modified degraded mean opinion score (MDMOS) test. We apply these two methods to Qualcomm code excited linear prediction (QCELP), vector sum excited linear prediction (VSELP) and regular pulse excited-long term predictin (RPE-LTD) voceders to evaluate which vocoding algorithm can process mixed voice signal from two speakers better for telephone conferencing. From the experiments we obtain that the VSELP vocoding algorithm reveals superior output speech quality to the other two.

  • PDF

Topology Characteristics and Generation Models of Scale-Free Networks

  • Lee, Kang Won;Lee, Ji Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.19 no.4
    • /
    • pp.205-213
    • /
    • 2021
  • The properties of a scale-free network are little known; its node degree following a power-law distribution is among its few known properties. By selecting real-field scale-free networks from a network dataset and comparing them to other networks, such as random and non-scale-free networks, the topology characteristics of scale-free networks are identified. The assortative coefficient is identified as a key metric of a scale-free network. It is also identified that most scale-free networks have negative assortative coefficients. Traditional generation models of scale-free networks are evaluated based on the identified topology characteristics. Most representative models, such as BA and Holme&Kim, are not effective in generating real-field scale-free networks. A link-rewiring method is suggested that can control the assortative coefficient while preserving the node degree sequence. Our analysis reveals that it is possible to effectively reproduce the assortative coefficients of real-field scale-free networks through link-rewiring.

Cooperative Communication with Different Combining Techniques in One-Dimensional Random Networks

  • Duy, Tran Trung;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.1
    • /
    • pp.13-19
    • /
    • 2012
  • In this paper, we investigate cooperative transmission in one-dimensional random wireless networks. In this scheme, a stationary source communicates with a stationary destination with the help of N relays, which are randomly placed in a one-dimensional network. We derive exact and approximate expressions of the average outage probability over Rayleigh fading channels. Various Monte-Carlo simulations are presented to verify the accuracy of our analyses.

Optimal Power Control in Cooperative Relay Networks Based on a Differential Game

  • Xu, Haitao;Zhou, Xianwei
    • ETRI Journal
    • /
    • v.36 no.2
    • /
    • pp.280-285
    • /
    • 2014
  • In this paper, the optimal power control problem in a cooperative relay network is investigated and a new power control scheme is proposed based on a non-cooperative differential game. Optimal power allocated to each node for a relay is formulated using the Nash equilibrium in this paper, considering both the throughput and energy efficiency together. It is proved that the non-cooperative differential game algorithm is applicable and the optimal power level can be achieved.

MODELING AND ANALYSIS FOR OPPORTUNISTIC SPECTRUM ACCESS

  • Lee, Yu-Tae;Sim, Dong-Bo
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1295-1302
    • /
    • 2011
  • We present an analytic model of an unslotted opportunistic spectrum access (OSA) network and evaluate its performance such as interruption probability, service completion time, and throughput of secondary users. Numerical examples are given to show the performance of secondary users in cognitive networks. The developed modeling and analysis method can be used to evaluate the performance of various OSA networks.

Traffic Load Analysis of Data Communication Networks for KNICS

  • Lee, C.K.;Lee, D.Y.;Oh, I.S.;Hwang, I.K.;Kim, D.H.
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 2004.10a
    • /
    • pp.595-596
    • /
    • 2004
  • Based on the systems and devices which are being developed in the KNICS project, the data communication network (DCN) which is an essential element for the interfaces among the I&C systems. is designed. The traffic load for each network is calculated at the expected maximum traffic condition. The result shows that the utilizations of all networks satisfy the design requirements.

  • PDF

OFDMA-Based Reliable Multicast MAC Protocol for Wireless Ad-Hoc Networks

  • Kim, Sung-Won;Kim, Byung-Seo
    • ETRI Journal
    • /
    • v.31 no.1
    • /
    • pp.83-85
    • /
    • 2009
  • Compared with unicast, multicast over wireless ad-hoc networks do not support reliability due to their inability to exchange request-to-send/clear-to-send (RTS/CTS) and ACK packets with multiple recipients. Although several media access control (MAC) layer protocols have been proposed to provide reliable multicast, these introduce additional overhead, which degrades system performance. A novel MAC protocol for reliable wireless multicast is proposed in this paper. By adapting orthogonal frequency division multiple access characteristics in CTS and ACK packets, the protocol achieves reliability over wireless multicast with minimized overhead.

  • PDF