• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.103-111
• /
• 2010

This paper proposes an efficient data transmission strategy using adaptive-tier low transmission power schedule in a TDMA-based ad hoc MAC protocol. Since the network resource of ad hoc networks has the characteristic of reassignment due to the multiple interferences and the contention-based limited wireless channel, the efficient time slot assignment and low power transmission scheme are the main research topics in developing ad hoc algorithms. Based on the proposed scheme of interference avoidance when neighbor clusters transmit packets, this paper can minimize the total energy dissipation and maximize the utilization of time slot in each ad hoc node. Simulation demonstrates that the proposed algorithm yields 15.8 % lower energy dissipation and 4.66% higher time slot utilization compared to the ones of two-tier conventional energy dissipation model.

• Journal of Korea Water Resources Association
• /
• v.41 no.5
• /
• pp.455-462
• /
• 2008

In this research, a distributed rainfall-runoff model based on physical kinematic wave was developed to simulate temporal and spatial distribution of flood discharge considering grid rainfall and grid based hydrological information. The developed model can simulate temporal change and spatial distribution of surface flow and sub-surface flow during flood period, and input parameters of ASCII format as pre-process can be extracted using GIS such as ArcGIS and ArcView. Output results of ASCII format as post-process can be created to express distribution of discharge in the watershed using GIS. The Namgang Dam Watershed was divided into square grids of 500m resolution and calculated by kinematic wave into an outlet through channel networks to review capability of the developed model. The model displayed precise results to be compared to the hydrograph.

• International Journal of Fluid Machinery and Systems
• /
• v.3 no.4
• /
• pp.315-323
• /
• 2010

This work investigates the influence of water compressibility on pressure pulsations induced by rotor-stator interaction (RSI) in hydraulic machinery, using the commercial CFD solver ANSYS-CFX. A pipe flow example with harmonic velocity excitation at the inlet plane is simulated using different grid densities and time step sizes. Results are compared with a validated code for hydraulic networks (SIMSEN). Subsequently, the solution procedure is applied to a simplified 2.5-dimensional pump-turbine configuration in prototype with different speeds of sound as well as in model scale with an adapted speed of sound. Pressure fluctuations are compared with numerical and experimental data based on prototype scale. The good agreement indicates that the scaling of acoustic effects with an adapted speed of sound works well. With respect to pressure fluctuation amplitudes along the centerline of runner channels, incompressible solutions exhibit a linear decrease while compressible solutions exhibit sinusoidal distributions with maximum values at half the channel length, coinciding with analytical solutions of one-dimensional acoustics. Furthermore, in compressible simulation the amplification of pressure fluctuations is observed from the inlet of stay vane channels to the spiral case wall. Finally, the procedure is applied to a three-dimensional pump configuration in model scale with adapted speed of sound. Normalized Pressure fluctuations are compared with results from prototype measurements. Compared to incompressible computations, compressible simulations provide similar pressure fluctuations in vaneless space, but pressure fluctuations in spiral case and penstock may be much higher.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.396-405
• /
• 2005

Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem; it cannot perform local retransmission efficiently under the bursty-error prone wireless link. In this paper, we propose Enhanced Snoop(E-Snoop) protocol to solve this problem of Snoop protocol. With E-Snoop protocol, packet losses can be noticed by receiving new ACK packets as well as by receiving duplicate ACK packets or local retransmission timeout. Therefore, TCP throughput can be enhanced by fast recognition of bursty packet losses and fast local retransmissions. From the simulation results, E-Snoop protocol can improve TCP throughput more efficiently than Snoop protocol and can yield more TCP improvement especially in the channel with high packet loss rates.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.182-189
• /
• 2016

The focus in this paper is on obtaining tight, simple algebraic-form bounds and invertible expressions for the average symbol error probability (ASEP) of M-ary phase shift keying (MPSK) in a class of composite fading channels. We employ the mixture gamma (MG) distribution to approximate the signal-to-noise ratio (SNR) distributions of fading models, which include Nakagami-m, Generalized-K ($K_G$), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian Q-function, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.253-263
• /
• 2015

Lately, spectrum sensing performance has been improved by using cooperate spectrum sensing which each results of sensing of several secondary users are reported to the fusion center. Using Cognitive Radio, secondary user is able to share a bandwidth allocated to primary user. In this paper, we propose a new decentralized cooperative spectrum sensing scheme which compensates the performance degradation of existing decentralized cooperative spectrum sensing considering the error probability of the channel which sensed result of the secondary user is delivered to the fusion center in decentralized cooperative spectrum sensing. In addition, a sensing threshold optimization of minimizing the error probability of decentralized cooperative spectrum sensing is introduced by deriving the equation and the optimal sensing threshold has been confirmed to maximize the decentralized cooperative spectrum sensing performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.205-214
• /
• 2011

In 3rd generation project partnership long term evolution, wireless multicast techniques which send the same data to multiple users under single frequency networks have attracted much attention. In the multicast system, the transmission mode needs to be selected for efficient data transfer while satisfying the multicast coverage requirement. To achieve this, users' channel state information (CSI) should be available at the transmitter. However, it requires too much uplink feedback resource if all the users are allowed to transmit their CSI at all the time. To solve this problem, in this paper, the multicast coverage prediction is suggested. In the proposed algorithm, each user measures its transition probabilities between the success and the fail state of the decoding. Then, it periodically transmits its CSI to the basestation. Using these feedbacks, the basestation can predict the multicast coverage. From the simulation results, we demonstrate that the proposed scheme can predict the multicast system coverage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.505-516
• /
• 2012

According to distribute of resource of macro cell and reduce distance between transmitter and receiver, Femto cell system is promising to provide costeffective strategy for high data traffic and high spectral efficient services in future wireless cellular system environment. However, the co-channel operation with existing Macro networks occurs some severe interference between Macro and Femto cells. Hence, the interference cancellation or management schemes are imperative between Macro and Femto cells in order to avoid the decrease of total cell throughput. First, we briefly investigate the conventional resource allocation and interference cancellation scheme between Macro and Femto cells. So we found that cell throughput and frequency reuse ware decreased Then, we propose an adaptive resource allocation scheme based on the distribution of Femtocell traffic in order to increase the cell throughput and also maximize the spectral efficiency over the FFR (Fractional Frequency Reuse) based conventional resource allocation schemes. Simulation Results show that the proposed scheme attains a bit similar SINR (Signal to Interference Noise Ratio) distribution but achieves much higher total cell throughput performance distribution over the conventional resource allocation schemes for FFR and future IEEE 802.16m based Femtocell network environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1192-1200
• /
• 2014

This paper proposes a cooperative spectrum sensing algorithm in a maritime cognitive radio network and evaluates the performance of proposed algorithm. In the proposed algorithm, the secondary ships decide whether to transmit the feedback information or not on the basis of the threshold when the number of available feedback information of the ships is limited. The fusion ship detects whether the channel is available or not on the basis of the feedback information. This paper evaluates the proposed algorithm in terms of the detection probability and the number of secondary ships that are fed back in the maritime cognitive radio network. The simulation results show the proposed algorithm significantly reduces the feedback overhead even though the detection probability is somewhat declined.