• The Journal of the Acoustical Society of Korea
• /
• v.40 no.6
• /
• pp.578-586
• /
• 2021

We propose a semi-supervised learning method based on Variational AutoEncoder (VAE) and Unsupervised Data Augmentation (UDA) to improve the performance of an end-to-end speech recognizer. In the proposed method, first, the VAE-based augmentation model and the baseline end-to-end speech recognizer are trained using the original speech data. Then, the baseline end-to-end speech recognizer is trained again using data augmented from the learned augmentation model. Finally, the learned augmentation model and end-to-end speech recognizer are re-learned using the UDA-based semi-supervised learning method. As a result of the computer simulation, the augmentation model is shown to improve the Word Error Rate (WER) of the baseline end-to-end speech recognizer, and further improve its performance by combining it with the UDA-based learning method.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2456-2467
• /
• 2018

Wireless multimedia sensor networks (WMSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. The end-to-end delay is very critical metric for QoS guarantees in WMSNs. In WMSNs, due to the transmission errors incurred over wireless channels, it is difficult to obtain reliable delivery of data in conjunction with low end-to-end delay. In order to improve the end-to-end delay performance, the system has to drop few packets during network congestion. In this article, our proposal is based on optimization of end-to end delay for WMSNs. We optimize end-to-end delay constraint by assuming that each packet is allowed fixed number of retransmissions. To optimize the end-to-end delay, first, we compute the performance measures of the system, such as end-to-end delay and reliability for different network topologies (e.g., linear topology, tree topology) and against different choices of system parameters (e.g., data rate, number of nodes, number of retransmissions). Second, we study the impact of the end-to-end delay and packet delivery ratio on indoor and outdoor environments in WMSNs. All scenarios are simulated with multiple run-times by using network simulator-2 (NS-2) and results are evaluated and discussed.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.103-113
• /
• 2010

In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.255-263
• /
• 2009

In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal on orgy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.12
• /
• pp.1-11
• /
• 1991

Multi rate circuit switching ISDN which assumes a star topology consisting of LANs(local area networks) interconnected through a backbone MAN (metropolitan area network) is considered. The stations are classified into two categories data and voice stations they are characterized by different arrival rate and session-length (holding time) statistics. We first model the data and voice terminals as finite-source stations and derive analytically exact expressions for the end-to-end blocking probabilities. For more exact evaluation, these probabilities are calculated in terms of three components:circuit blocking probability, destination busy probability and concurrent busy probability. For large size systems, we develop an develop an iterative algorithm that provides a computationally efficient and fast method for the calculation of the end-to-end blocking probabilities.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1679-1685
• /
• 2022

In this paper, we propose an optimal multi-hop transmission scheme to maximize the end-to-end data rate from the source to the destination node in a wireless powered communication network. The frame structure for multi-hop transmission is presented to transmit multi-hop data while harvesting energy. Then, the transmission time of each node that maximizes the end-to-end transmission rate is determined through mathematical analysis in consideration of different harvested energy and link quality among nodes. We derive an optimization problem through system modeling of the considered wireless powered multi-hop transmission, and prove that there is a global optimal solution by verifying the convexity of this optimization problem. This analysis facilitates to find the optimal solution of the considered optimization problem. The proposed optimal multi-hop transmission scheme maximizes the end-to-end rate by allocating the transmission time for each node that equalizes the transmission rates of all links.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2822-2831
• /
• 1997

A B-ISDN network based on ATM must support several kinds of transport services with different traffic characteristics and service requirements. There is neither link-by-link flow control nor error control in the ATM layer. For different services, different flow/error controls could be performed at the AAL layer or at a higher Iayer(e.g. transport layer). In traditional data networks, the window now control mechanism combined with error control was used prevalently. But, the window flow control mechanism might be useless in ATM networks because the propagation delay is too large compared with the transmission rate. In this paper, we propose a simple flow control mechanism, called RCT(Rate Control for end-to-end Transport), for end-to-end data transport. The RCT shows acceptable performance when the average overload period is bounded by a certain time.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.464-471
• /
• 2013

With the advance of wireless sensor networks, WMSN(Wireless Multimedia Sensor Networks) researches to transfers multimedia data have been studied actively. First of all, three basic protocols, End-to-end, Hop-by-hop, and Unreliable transmission method, are compared to transfer multimedia data using simulations. This paper presents an efficient protocol to transfer multimedia data by overhearing messages of nodes and by transmitting next packets during the unused time interval. The proposed method is verified its performance by simulations and experiments. The results shows that the transmission rate of the proposed method 22% higher than that of End-to-end protocol with half of transmission time. Also the performance of the proposed method is compared with that of PIGAB(Packet Interval Gap based on Adaptive Backoff).

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.42-46
• /
• 2006

As the next generation internet (NGI) is supporting High-speed in Gbps rate with the appearance of advanced network technologies, various applications that require high data rates. have been experimented and operated. By using high speed application services, many kinds of problems can be generated but we cannot easily grasp their reasons. However, if the user monitors the end-to-end one's flow data information (path and data rate in each router, state of each router) he can find them more accurately Until now, we have found out the fact that systems which can network-widely monitor end-to-end flow have not be developed yet, only simple systems which can monitor user's individual flow data at just one node are developed In this study, we suggest and materialize a system which can analyze bandwidth in real time by searching routing paths and measuring packet transfer rate between end-to-end flow data and supported flow traffic of using IPv6.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.376-386
• /
• 2004

In ad hoc networks, loss-based congestion window progression by the traditional means of duplicate ACKs and timeouts causes high network buffer utilization due to large bursts of data, thereby degrading network bandwidth utilization. Moreover, network-oriented feedbacks to handle route disconnection events may impair packet forwarding capability by adding to MAC layer congestion and also dissipate considerable network resources at reluctant intermediate nodes. Here, we propose a new TCP scheme that does not require the participation of intermediate nodes. It is a purely end-to-end scheme using TCP timestamps to deduce link conditions. It also eliminates spurious reductions of the transmission window in cases of timeouts and fast retransmits. The scheme incorporates a receiver-oriented rate controller (rater), and a congestion window delimiter for the 802.11 MAC protocol. In addition, the transient nature of medium availability due to medium contention during the connection time is addressed by a freezing timer (freezer) at the receiver, which freezes the sender whenever heavy contention is perceived. Finally, the sender-end is modified to comply with the receiver-end enhancements, as an optional deployment. Simulation studies show that our modification of TCP for ad hoc networks offers outstanding performance in terms of goodput, as well as throughput.