• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.125-130
• /
• 2020

At the end of 1997, the volatility of the exchange rate intensified as the nation's exchange rate system was converted into a free-floating exchange rate system. As a result, managing the exchange rate is becoming a very important task, and the need for forecasting the exchange rate is growing. The exchange rate prediction model using the existing exchange rate prediction method, statistical technique, cannot find a nonlinear pattern of the time series variable, and it is difficult to analyze the time series with the variability cluster phenomenon. And as the number of variables to be analyzed increases, the number of parameters to be estimated increases, and it is not easy to interpret the meaning of the estimated coefficients. Accordingly, the exchange rate prediction model using artificial neural network, rather than statistical technique, is presented. Using DNN, which is the basis of deep learning among artificial neural networks, and LSTM, a recurrent neural network model, the number of hidden layers, neurons, and activation function changes of each model found the optimal exchange rate prediction model. The study found that although there were model differences, LSTM models performed better than DNN models and performed best when the activation function was Tanh.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.36-44
• /
• 2014

Exploiting the energy-delay tradeoff for energy saving is critical for developing green wireless communication systems. In this paper, we investigate the delay-constrained energy-efficient packet transmission. We aim to minimize the energy consumption of multiple randomly arrived packets in an additive white Gaussian noise channel subject to individual packet delay constraints, by taking into account the practical on-off circuit power consumption at the transmitter. First, we consider the offline case, by assuming that the full packet arrival information is known a priori at the transmitter, and formulate the energy minimization problem as a non-convex optimization problem. By exploiting the specific problem structure, we propose an efficient scheduling algorithm to obtain the globally optimal solution. It is shown that the optimal solution consists of two types of scheduling intervals, namely "selected-off" and "always-on" intervals, which correspond to bits-per-joule energy efficiency maximization and "lazy scheduling" rate allocation, respectively. Next, we consider the practical online case where only causal packet arrival information is available. Inspired by the optimal offline solution, we propose a new online scheme. It is shown by simulations that the proposed online scheme has a comparable performance with the optimal offline one and outperforms the design without considering on-off circuit power as well as the other heuristically designed online schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.105-110
• /
• 2015

In cognitive radio networks, when the signal-to-noise ratio (SNR) of the link between a primary transmitter and receiver is sufficiently high, the primary transmission does not frequently demand cooperation because direct transmission of the primary communication is usually successful. Therefore, there are few opportunities for a secondary transmitter to cooperate with the primary user system in exchange for an opportunity to share the spectrum. This article proposes a scheme in which the secondary system can deliberately degrade the SNR of the primary transmission, making it so that the primary system needs cooperation from the secondary nodes, and thereby increases opportunities for spectrum sharing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2450-2469
• /
• 2018

In this paper, we develop a spatiotemporal model to analysis of cellular user in underlay D2D communication by using stochastic geometry and queuing theory. Firstly, by exploring stochastic geometry to model the user locations, we derive the probability that the SINR of cellular user in a predefined interval, which constrains the corresponding transmission rate of cellular user. Secondly, in contrast to the previous studies with full traffic models, we employ queueing theory to evaluate the performance parameters of dynamic traffic model and formulate the cellular user transmission mechanism as a M/G/1 queuing model. In the derivation, Embedded Markov chain is introduced to depict the stationary distribution of cellular user queue status. Thirdly, the expressions of performance metrics in terms of mean queue length, mean throughput, mean delay and mean dropping probability are obtained, respectively. Simulation results show the validity and rationality of the theoretical analysis under different channel conditions.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.12-20
• /
• 2015

Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1767-1775
• /
• 2015

There are various kinds of applications for wireless sensor network, and each application has difference requirements such as throughput. Topology control is the key issue to minimize energy consumption by solving communication collision and radio interference. However, existing topology control algorithms cannot support application requirement because communication efficiency and network connectivity are the main issues of topology control. In this paper, we propose a topology control algorithm that support throughput requirement of an application.

• Journal of Sensor Science and Technology
• /
• v.27 no.3
• /
• pp.175-181
• /
• 2018

In this paper, we introduce a new dimming control method in a visible light communication (VLC) system wherein byteinversion is adopted for flicker-free transmission. In the VLC transmitter, the original and the inverted data were sent sequentially and the remnant time in one period was used for the dimming control of the LED light. In the VLC receiver, only the original data was recovered using the gating signal whose width was the same as the length of the original data. In our experiments, the dimming control ranges were measured to be 22%-53%, 11%-76%, and 5%-88% of the CW LED light when the data rates were 9.6, 19.2, and 38.4 kbps, respectively. In this system, we used a 240-Hz sync pulse whose period was 4.16 ms, which was shorter than the maximum flickering time period of 5 ms that is generally considered to be safe. This configuration is very simple and useful in constructing indoor wireless sensor networks using the flicker-free LED lamps with dimming control capability.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.1
• /
• pp.79-85
• /
• 2017

Vehicular ad-hoc networks (VANETs) cause link disconnection problems due to the rapid speed and the frequent moving direction change of vehicles. Link disconnection in vehicle-to-vehicle communication is an important issue that must be solved because it decreases the reliability of packet forwarding. From the characteristics of VANETs, greedy forwarding protocols using the position information based on the inter-vehicle distance have gained attention. However, greedy forwarding protocols do not perform well in the urban environment where the direction of the vehicle changes greatly. It is because greedy forwarding protocols select the neighbor vehicle that is closest to the destination vehicle as the next transmission vehicle. In this paper, we propose a greedy anycast forwarding (GAF) protocol to improve the reliability of the inter-vehicle communication. The proposed GAF protocol combines the greedy forwarding scheme and the anycast forwarding method. Simulation results show that the GAF protocol can provide a better packet delivery rate than existing greedy forwarding protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4326-4341
• /
• 2016

In this paper, an adjustable multiple relay selection (MRS) scheme for cooperative communication with amplify-and-forward (AF) relay under frequency selective channels is proposed. In the proposed scheme, the relays are ordered firstly by the steady-state mean square error (MSE), then the relays are sequentially selected out from N relays and the number of cooperating relays is adjusted dynamically according to the steady-state mean square joint error (MSJE). The aim of this work is to dynamically estimate the optimum number N_o of cooperating relays. Optimum means the minimum number of cooperating relays, N_o, achieving the minimum level of steady-state MSJE. Numerical results verify the analyses and show that the scheme can adaptively adjust the number of cooperating relays, and outperform conventional relay selection schemes. Hence, the proposed scheme provides better tradeoff between BER performance and spectral efficiency and to save more energy in cooperative wireless networks.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.4760-4765
• /
• 2010

Time out-medium access control (T-MAC) protocol is one of the well-known MAC protocols designed for wireless sensor networks (WSN), and is proposed to enhance the poor performance of the S-MAC protocol. In this paper, we are reviewed about security vulnerability in T-MAC, and analyzed the power which is consumed at each stage of T-MAC protocol according to vulnerability of denial of service (DoS) and replay problem. From our analytical results, it can be considered the need of power efficient authentication scheme which provides the reliability, efficiency, and security for a general T-MAC communication. This is the case study of possible DoS vulnerability and its power consumption in T-MAC.