• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.283-298
• /
• 2006

The TPR-tree is the time-parameterized indexing scheme that supports the querying of the current and projected future positions of such moving objects by representing the locations of the objects with their coordinates and velocity vectors. If this index is, however, used in environments that directions and velocities of moving objects, such as vehicles, are very often changed, it increases the communication cost between the server and moving objects because moving objects report their position to the server frequently when the direction and the velocity exceed a threshold value. To preserve the communication cost regularly, there can be used a manner that moving objects report their position to the server periodically. However, the periodical position report also has a problem that lineal time functions of the TPR-tree do not guarantee the accuracy of the object's positions if moving objects change their direction and velocity between position reports. To solve this problem, we propose the query processing scheme and the data structure using road networks for predicting uncertainty positions of moving objects, which is reported to the server periodically. To reduce an uncertainty of the query region, the proposed scheme restricts moving directions of the object to directions of road network's segments. To remove an uncertainty of changing the velocity of objects, it puts a maximum speed of road network segments. Experimental results show that the proposed scheme improves the accuracy for predicting positions of moving objects than other schemes based on the TPR-tree.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.133-142
• /
• 2011

When TCP operates in multi-hop wireless networks, it suffers from severe performance degradation due to the different characteristics of wireless networks and wired networks. This is because TCP reacts to wireless packet losses by unnecessarily decreasing its sending rate assuming the losses as congestion losses. Although several loss differentiation algorithms (LDAs) have been proposed to avoid such performance degradation, their detection accuracies are not high as much as we expect. In addition the schemes have a tendency to sacrifice the detection accuracy of congestion losses while they improve the detection accuracy of wireless losses. In this paper, we suggest a new sender-based loss differentiation scheme which enhances the detection accuracy of wireless losses while minimizing the sacrifice of the detection accuracy of congestion losses. Our scheme estimates the rate of queue usage which is highly correlated with the congestion in the network path between a TCP sender and a receiver, and it distinguishes congestion losses from wireless losses by comparing the estimated queue usage with a certain threshold. In the extensive experiments based on a network simulator, QualNet, we measure and compare each detection accuracy of wireless losses and congestion losses, and evaluate the performance enhancement in each scheme. The results show that our scheme has the highest accuracy among the LDAs and it improves the most highly TCP performance in multi-hop wireless networks.

• Journal of Internet Computing and Services
• /
• v.24 no.1
• /
• pp.1-7
• /
• 2023

Recently, the technology of device-to-device(D2D) communication has been receiving big attention to improve the system performance since the amount of high quality/large capacity data traffic from smart phones and various devices of Internet of Things increase rapidly in 5G/6G based next generation cellular networks. However, even though the system performance of macro cells increase by reusing the frequency, the performance of macro user equipments(MUEs) decrease because of the strong interference from D2D user equipments(DUEs). Therefore, this paper proposes a dynamic channel management(DCM) scheme for DUEs to guarantee the performance of MUEs as the number of DUEs increases in next generation downlink cellular networks. In the proposed D2D DCM scheme, macro base stations dynamically assign subchannels to DUEs based on the interference information and signal to interference and noise ratio(SINR) of MUEs. Simulation results show that the proposed D2D DCM scheme outperforms other schemes in terms of the mean MUE capacity as the threshold of the SINR of MUEs incareases.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.2
• /
• pp.100-106
• /
• 2005

OFDM is one of the promising modulation candidates for a fourth generation broadband mobile communication system because of its robustness against inter-symbol inteference(ISI). The OFDM transmission technique has the inherent flexibility to adapt the modulation scheme on each subcarrier according to the signal-to-noise ratio(SNR). In this paper, the adaptive modulation scheme of OFDM system is proposed in broadband mobile channel. The proposed algorithm allocates initially the number of bits in each subcarrier using the threshold SNR according to the target BER and controls the total number of target bits using the well-known algorithm of Chow et al. In addition, the subcarriers of the proposed algorithm are clustered in blocks, that the signalling overhead can be reduced for the bit allocation of subcarriers. For the simulated experiments, this paper presents an evaluation for the effects of target BER, the various numbers of subcarriers in the subband block, and Doppler frequency on the performance of adaptive OFDM in broadband mobile channel.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.147-154
• /
• 2014

There have been company researches for TCP-Westwood algorithms in wireless TCP environment with high packet loss rate. Because the TCP-Westwood algorithm adjusts the congestion window according to the ABE(Available Bandwidth Estimation), the algorithm has a problem which the accuracy of ABE decreases as the error rate increases. To solve such a problem, the proposed scheme in this paper adopts the existing packet pattern based algorithm that the ABE is ignored when the arriving interval time of ACK is longer than a given interval time and uses new algorithm that the ABE is reallocated to a given allowable ABE when the ABE is over the allowable range. The proposed scheme shows the simulation result that the ABE is closest to the setting bandwidth for simulation compared to the existing algorithms.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.4 s.119
• /
• pp.440-447
• /
• 2007

The switched diversity, although its performance is a little inferior to the selection diversity, is widely used due to its advantage that only one RF circuit is required for its operation without respect to the number of antennas in use. In this paper, we propose an application of the antenna switched diversity to a spread spectrum system with adaptive modulation and derived the optimal antenna switching threshold to maximize the average transmission bit rate. We also compared the performances of the proposed system with those of the two cases using a single antenna and the selection diversity with two antennas in terms of the average number of bits per symbol(BPS), the probability of no transmission, and the average BER. The performance analysis shows that, if the number of paths in a multipath channel environment increases, the performance of the proposed scheme becomes closer to that of the selection diversity based system in terms of the average BPS. Furthermore, the proposed scheme produces as almost high the probability of no transmission as the selection diversity based system for the case of low average SNR, although the former yields a little higher probability of no transmission than the latter fer the case of high average SNR.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.941-950
• /
• 2011

In this paper, we analysis the end-to-end performance of the incremental cooperative communication with relay selection. In the conventional cooperative scheme, the source(S) broadcasts the signal to the relay(R) and the destination(D) at 1st phase, and the R forwards the signal to the D at 2nd phase. Although this scheme can improve performance and provide diversity gain, it suffers from decreasing spectrum efficiency. In order to overcome this problem, the incremental cooperative model can be used. In this paper, we study two incremental cooperative method : the first uses ARQ with threshold SNR and the second uses HARQ with channel coding. we also evaluated performance of the incremental cooperative communication based on the R arrangement by using both methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.270-277
• /
• 2006

In the wireless adaptive modulation and coding(AMC) systems, the modulation type of user's connection can be changed dynamically. and the ongoing connection might fail due to the change of modulation. In this paper, we approach the AMC-induced CAC problem by focusing on the guaranteed connection. Three kinds of calls, new, handoff, and modulation-changed calls, are considered. We propose a modified guard channel CAC scheme that allows the modulation-changed and handoff calls to use the guard channel. Then we analyze a Markov model for the CAC scheme with long-term AMC in mind. According to the simulation results, the proposed approach reduces the call dropping probability for modulation-changed calls, which suggests the threshold of guard channels can be determined based on the proposed approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.823-833
• /
• 2003

To satisfy the requirements of the real-time Internet services, queue management and scheduling schemes should be enhanced to accommodate the delay and jitter characteristic of them. Although the existing queue management schemes can address the congestion problems of TCP flows, they have some problems in supporting real-time services. That is, they show performance degradation when burst traffics are continuously going into the system after the queue is occupied at a predefined threshold level. In addition, under the congestion state, they show large jitter, which is not a desirable phenomenon for real-time transmissions. To resolve these problems, we propose a SDRED (State Dependent Random Early Detection) and dynamic scheduling scheme that can improve delay and jitter performances by adjusting RED parameters such as ma $x_{th}$ and $w_{q}$ according to the queue status. The SDRED is designed to adapt to the current traffic situation by adjusting the max,$_{th}$ and $w_{q}$ to four different levels. From the simulation results, we show that the SDRED decreases packet delays in a queue and has more stable jitter characteristics than the existing RED, BLUE, ARED and DSRED schemes.mes.mes.