• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.42-48
• /
• 2002

In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7C
• /
• pp.691-699
• /
• 2006

Despite of the in-depth effort to cantrol the variability in IP networks, quality of service (QoS) is still not guaranteed in the IP networks. Thus, it is necessary to deal with the audible artifacts caused by packet lasses. To overcame the packet loss problem, most speech coding standard have their own embedded packet loss concealment (PLC) algorithms which adapt extrapolation methods utilizing the dependency on adjacent frames. Since many low bit rate CELP coders use predictive schemes for increasing coding efficiency, however, error propagation occurs even if single packet is lost. In this paper, we propose an efficient PLC algorithm with consideration about the speech characteristics of lost frames. To design an efficient PLC algorithm, we perform several experiments on investigating the error propagation effect of lost frames of a predictive coder. And then, we summarize the impact of packet loss to the speech characteristics and analyze the importance of the encoded parameters depending on each speech classes. From the result of the experiments, we propose a new PLC algorithm that mainly focuses on reducing the error propagation time. Experimental results show that the performance is much higher than conventional extrapolation methods over various frame erasure rate (FER) conditions. Especially the difference is remarkable in high FER condition.

• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.311-318
• /
• 2015

This dissertation proposes method for development technology of voice and SMS(Short Message Service) alarming system based on modbus protocol. The proposed technology is composed of the following 3 stages; hardware development based on microprocessor, development of input and output driver for modem, mp3 decoder, making modbus protocol stack. In the stage of hardware development based on microprocessor, we develop hardware which receives alarm from modbus master and transmit sms message, play mp3. In the stage of development of input / ouput device driver such as modem, mp3 decoder, we develop program which control each devices. In the stage of making modbus protocol stack, voice and sms alarm system is made for receiving alarm via modbus protocol. To evaluate performance of proposed technology, we issued alarm to voice and sms alarming system on purpose. As a result, response speed of detecting alarm was 10.7ms, communication distance was 1.2Km, operating temperature was from $-25^{\circ}C$ to $70^{\circ}C$, we confirmed supporting modbus protocol. And we verified that proposed voice and sms alarming system in the thesis has a performance to be used as an industrial building alarming system.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.773-780
• /
• 2005

Recently, the telecommunication network is in a transition toward the BcN (Broadband convergence Networks) that integrates the Internet, the telecommunication and the broadcasting. The BcN makes it possible to provide of 4he third-party application by using the Open API The Parlay X API is an example of the Open API and the Parlay X API is grafted in the Web Service and is abstracted from the Parlay API. So, the Parlay X API does not only have advantages of a Web Service, but also disadvantages of the Web Service. The main disadvantage of the Web Service is that it does not support the any QoS mechanism. In this paper, we propose the architecture that solves the reliability among the QoS issues for the Web Service. The proposed mechanism adopts the Asynchronous architecture for the reliable Web Service and improves the performance of the retransmission between the client and the server using the expected response time. We perform the performance evaluation through the simulation in older to compare with the existing mechanism. Consequently, we can confirm that the performance of the proposed mechanism performs better than the existing mechanism.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.53-63
• /
• 2000

The mobile computing service market is increasing rapidly due to the development of low-cost wireless network technology and the high-performance mobile computing devices. In recent years, several methods have been proposed to effectively deal with restrictions of the mobile computing environment such as limited bandwidth, frequent disconnection and short-lived batteries. Amongst those methods, much study is being done on the caching method - among the data transmitted from a mobile support station, it selects those that are likely to be accessed in the near future and stores them in the local cache of a mobile host. Existing cache replacement methods have some limitations in efficiency because they do not take into consideration the characteristics of user mobility and spatial attributes of geographical data. In this paper, we show that the value and the semantic of the data, which are stored in the cache of a mobile host, changes according to the movement of the mobile host. We argue it is because data that are geographically near are better suited to provide an answer to a users query in the mobile environment. Also, we define spatial location of geographical data has effect on, using the spatial attributes of data. Finally, we propose two new cache replacement methods that efficiently support user mobility and spatial attributes of data. One is based on the location of data and the other on the meaningful region of data. From the comparative analysis of the previous methods and that they improve the cache hit ratio. Also we show that performance varies according to data density using this, we argue different cache replacement methods are required for regions with varying density of data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.64-77
• /
• 2013

In this paper, we propose a joint bandwidth allocation and path selection scheme for IEEE 802.16j networks in uplink with cooperative relaying, and we evaluate the performance of the proposed scheme by using OPNET based simulation in hilly terrain with heavy tree density. The proposed scheme maximizes the system throughput in uplink with cooperative relaying in IEEE 802.16j networks. Then, we transform the proposed scheme into multi-dimensional multiple choice knapsack problem (MMKP) based scheme. We also propose uplink throughput maximization scheme and MMKP based scheme without cooperative relaying. We show that the system throughput of the proposed MMKP based scheme is higher than that of link quality based scheme, and cooperative relaying provides higher system throughput than the conventional case without cooperative relaying in uplink.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.97-106
• /
• 2015

Recently, research on database encryption for data protection and query result authentication methods has been performed more actively in the database outsourcing environment. Existing database encryption schemes are vulnerable to order matching and counting attack of intruders who have background knowledge of the original database domain. Existing query result integrity auditing methods suffer from the transmission overhead of verification object. To resolve these problems, we propose a group-order preserving encryption index and a query result authentication method based on the encryption index. Our group-order preserving encryption index groups the original data for data encryption and support query processing without data decryption. We generate group ids by using the Hilbert-curve so that we can protect the group information while processing a query. Finally, our periodic function based data grouping and query result authentication scheme can reduce the data size of the query result verification. Through performance evaluation, we show that our method achieves better performance than an existing bucket-based verification scheme, it is 1.6 times faster in terms of query processing time and produces verification data that is 20 times smaller.

• Journal of the Korean Vacuum Society
• /
• v.14 no.4
• /
• pp.207-214
• /
• 2005

This paper presents a channel structure for promising high performance pseudomorphic high electron mobility transistor(pHEMT) switching device for design and fabricating of microwave control circuits, such as switches, phase shifters, attenuators, limiters, for application in personal mobile communication systems. Using the designed epitaxial channel layer structure and ETRI's $0.5\mu$m pHEMT switch process, single pole double throw (SPDT) Tx/Rx monolithic microwave integrated circuit (MMIC) switch was fabricated for 2.4 GHz and 5 GHz band wireless local area network (WLAN) systems. The SPDT switch exhibits a low insertion loss of 0.849 dB, high isolation of 32.638 dB, return loss of 11.006 dB, power transfer capability of 25dBm, and 3rd order intercept point of 42dBm at frequency of 5.8GHz and control voltage of 0/-3V These performances are enough for an application to 5 GHz band WLAN systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.5
• /
• pp.401-415
• /
• 2005

Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the resource weighted load distribution policy is proposed for a fair load balance and a more scalable performance in cluster-based transcoding servers. Our proposed policy is based on the resource weighted table and number of maximum supported users, which are pre-computed for each pre-defined grade. We implement the proposed policy on cluster-based transcoding servers and evaluate its fair load distribution and scalable performance with the number of transcoding servers.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.3
• /
• pp.25-33
• /
• 2023

Noise generated during the acquisition and transmission of CT images acts as a factor that degrades image quality. Therefore, noise removal to solve this problem is an important preprocessing process in image processing. In this paper, we remove noise by using a deformable convolutional autoencoder (DeCAE) model in which deformable convolution operation is applied instead of the existing convolution operation in the convolutional autoencoder (CAE) model of deep learning. Here, the deformable convolution operation can extract features of an image in a more flexible area than the conventional convolution operation. The proposed DeCAE model has the same encoder-decoder structure as the existing CAE model, but the encoder is composed of deformable convolutional layers and the decoder is composed of conventional convolutional layers for efficient noise removal. To evaluate the performance of the DeCAE model proposed in this paper, experiments were conducted on CT images corrupted by various noises, that is, Gaussian noise, impulse noise, and Poisson noise. As a result of the performance experiment, the DeCAE model has more qualitative and quantitative measures than the traditional filters, that is, the Mean filter, Median filter, Bilateral filter and NL-means method, as well as the existing CAE models, that is, MAE (Mean Absolute Error), PSNR (Peak Signal-to-Noise Ratio) and SSIM. (Structural Similarity Index Measure) showed excellent results.