• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1152-1167
• /
• 2018

In this paper, I propose an application layer cooperative congestion control scheme for safety message broadcast in vehicular networks, called CMS, that adaptively controls a vehicle's safety message rate and transmit timing based on the channel congestion state. Motivated by the fact that all vehicles should transmit and receive an application layer safety message in a periodic manner, I directly exploit the message itself as a means of estimating the channel congestion state. In particular, vehicles can determine wider network conditions by appending their local channel estimation result onto safety message transmissions and sharing them with each other. In result CMS realizes cooperative congestion control without any modification of the existing MAC protocol. I present extensive NS-3 simulation results which show that CMS outperforms conventional congestion control schemes in terms of the packet collision rate and throughput, especially in a high-density traffic environment.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.33-38
• /
• 2012

As underwater channel is very complex and time-varying, don't supports good-quality for communication service. In this paper, a multi-carrier CDMA(MC-CDMA) system for the reliability and robust service in the underwater acoustic channel is proposed and analyzed for its performance. Applied variable rate algorithm to the proposed system gets a channel state information from relationship between SINR and user data-rate. Using channel state information make spectrum usage more efficient and overall system performance improved. In this paper, the performance of proposed system analyzed by simulation. And Pseudo-Random spread codes used in the system are discussed.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.475-479
• /
• 2010

The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the bit to the corresponding probability of erroneous decision. In conjunction with multilevel bit mappings, the clipping value can be calculated with the parameters of the number of transmit antennas, $N_t$; number of bits per constellation point, $M_c$; and variance of the channel noise, $\sigma^2$, per real dimension in the Rayleigh fading channel. Analyses and simulations show that the bit error performance of the proposed method is better than that of the conventional fixed-value method.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.475-476
• /
• 2007

The stress induced leakage currents will affect data retention in synapse transistors and the stress current, transient current is used to estimate to fundamental limitations on oxide thicknesses. The synapse transistor made by thin silicon oxides has represented the neural states and the manipulation which gaves unipolar weights. The weight value of synapse transistor was caused by the bias conditions. Excitatory state and inhibitory state according to weighted values affected the channel current. The stress induced leakage currents affected excitatory state and inhibitory state.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2529-2543
• /
• 2019

Scanning electron microscopy (SEM) image can link with the microscopic world through reflecting interaction between electrons and materials. The SEM images are easily subject to blurring distortions during the imaging process. Inspired by the fact that dark channel prior captures the changes to blurred SEM images caused by the blur process, we propose a method to evaluate the SEM images sharpness based on the dark channel prior. A SEM image database is first established with mean opinion score collected as ground truth. For the quality assessment of the SEM image, the dark channel map is generated. Since blurring is typically characterized by the spread of edge, edge of dark channel map is extracted. Then noise is removed by an edge-preserving filter. Finally, the maximum gradient and the average gradient of image are combined to generate the final sharpness score. The experimental results on the SEM blurred image database show that the proposed algorithm outperforms both the existing state-of-the-art image sharpness metrics and the general-purpose no-reference quality metrics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1421-1425
• /
• 1999

A restoration scheme is presented when a failure occurs at nodes or links on the ATM network. Each node on the network contains the same topology information for resources on the network by Exchanging NSE(Network State Element) which has the network state information through RCC(Routing Control Channel). We also propose a new establishing algorithm that set up a new alternate path reflecting the state of the network changed dynamically at the source node. In the result of applying our scheme, the rates of restoration can be improved and the number of messages decreased so that fast recovering could be possible by reducing traffics on the network by lowering the rates of the call-setup failure at the stage of CAC(Connection Admission Control).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3945-3964
• /
• 2015

Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.580-592
• /
• 2012

In this paper, a new compressive feedback (CF) scheme based on distributed compressed sensing (DCS) for time-corrected MIMO channel is proposed. First, the channel state information (CSI) is approximated by using a subspace matrix, then, the approximated CSI is compressed using a compressive matrix. At the base station, the approximated CSI can be robust recovered with simultaneous orthogonal matching pursuit (SOMP) algorithm by using forgone CSIs. Simulation results show our proposed DCS-CF method can improve the reliability of system without creating a large performance loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.506-513
• /
• 2003

Most existing space-time coding (STC) schemes have been developed for flat fading channels. To obtain antenna diversity gain, they rely on channel state information (CSI) required at the receiver through channel estimation techniques. This paper proposes a new decision feedback decoding scheme for Alamouti-based space-time block coding (STBC) transmission over time-selective fading channels. In wireless channels, time-selective fading effects arise mainly due to Doppler shift and carrier frequency offset, Modelling the time-selective fading channels as the first-order Gauss-Markov processes, we use recursive algorithms such as Kalman filtering, LMS and RLS algorithms for channel tracking. The proposed scheme consists of the symbol decoding stage and channel tracking algorithms. Computer simulations confirm that the proposed scheme shows the better performance and robustness to time-selectivity.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.8-18
• /
• 2016

In this paper, we propose a number of blind equalization approaches for time-varying andmulti-path channels. The approaches employ cost reference particle filter (CRPF) as the symbol estimator, and additionally employ either least mean squares algorithm, recursive least squares algorithm, or $H{\infty}$ filter (HF) as a channel estimator such that they are jointly employed for the strategy of "Rao-Blackwellization," or equally called "mixture filtering." The novel feature of the proposed approaches is that the blind equalization is performed based on direct channel estimation with unknown noise statistics of the received signals and channel state system while the channel is not directly estimated in the conventional method, and the noise information if known in similar Kalman mixture filtering approach. Simulation results show that the proposed approaches estimate the transmitted symbols and time-varying channel very effectively, and outperform the previously proposed approach which requires the noise information in its application.