• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.404-415
• /
• 2002

In this paper, we address the issue of ensuring consistency of multiple data items requested in a certain order by read-only transactions in a wireless data broadcast environment. To handle the inherent property in a data broadcast environment that data can only be accessed strictly sequential by users, we explore a predeclaration-based query optimization and devise two practical transaction processing methods in the context of local caching. We also evaluate the performance of the proposed methods by an analytical study Evaluation results show that the predeclaration technique we introduce reduces response time significantly and adapts to dynamic changes in workload.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.685-692
• /
• 2007

Recent advances in wireless communications and electronics have enabled the development of low-cost, low-power, multi-functional sensors. A typical wireless sensor network (WSN) consists of a large number of sensor nodes that can measure and process data while communicating through wireless channels. In this paper, we propose a hybrid query processing (HQP) algorithm for user queries submitted to the WSN. Unlike previous algorithms that consider continuous queries only, HQP supports both continuous queries and ad-hoc queries. Specially. HQP tries to reduce energy consumption of ad-hoc queries by using query results cached at each sensor node which are created during the execution of the previous continuous query. HQP can also exploit a trade-off between energy consumption and data accuracy. We evaluate the performance of HQP under a variety of WSN configurations.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.297-306
• /
• 2004

Push-based broadcasting in wireless information services is a very effective technique to disseminate information to a massive number of clients when the number of data items is small. When the database is large, however, it nay be beneficial to integrate a pull-based (client-to-server) backchannel with the push-based broadcast approach, resulting in a hybrid data delivery. In this paper, we analyze the performance behavior of a predeclaration-based transaction processing, which was originally devised for a push-based data broadcast, in the hybrid data delivery through an extensive simulation. Our results show that the use of predeclaration-based transaction processing can provide significant performance improvement not only in a pure push data delivery, but also in a hybrid data delivery.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.280-282
• /
• 2001

무선 어플리케이션 서비스 시스템 구축시 가장 중요한 역할을 담당하는 장비는 WAP(Wireless Application Protocol) 프록시 서버이다 WAP 프록시 서버는 WAP 프로토콜과 인터넷 TCP/IP 프로토콜을 중간에서 변환해 주는 역할을 한다. 따라서, 무선 단말기로부터 요청은 WAP 프록시 서버를 통해 유선망의 서버로 보내지게 되고, 서버로부터 보내진 무선 콘텐츠는 다시 WAP 프록시 서버를 통해 무선 단말기로 전해진다. 이때, 무선 컨텐츠가 WAP 프록시 서버에 캐싱된다면, 동일한 무선 콘텐츠 요청시, 유선망을 거치지 않고도 WAP 프록시 서버에서 무선 컨텐츠를 서비스 할 수 있을 것이다. 본 논문에서는 WAP 프록시 서버에 캐싱 기능을 추가하여, 그 성능을 분석하였다. 성능 측정을 위해 C와 서블릿으로 측정 모듈을 작성 했으며, 웹 브라우저를 통해 실시간으로 측정 결과를 확인 가능하도록 하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.76-78
• /
• 2003

기존 유선 인터넷과 달리 무선 인터넷은 낮은 대역폭. 빈번하게 접속이 끊기는 현상, 단말기내의 낮은 컴퓨팅 파워 및 작은 화면, 사용자의 이동성 등의 특성에 따른 많은 제약점들을 갖고 있다. 또한 무선 인터넷 서버는 급증하는 사용자에 따른 대용량 트래픽을 처리할 수 있도록 확장성이 있어야 한다. 이에 위의 문제를 캐싱(Caching)과 압축(Transcoding, Distillation)으로 해결하는 방법으로 무선 프록시 서버를 사용한다. TranSend는 클러스터링 기반의 무선 프록시 서버로 제안된 것이나 시스템적인(Systematic) 방법으로 확장성을 보장하지 못하는 단점을 가진다. 이에 본 논문에서는 시스템적인 방법으로 확장성을 보장하는 클러스터링 기반의 무선 인터넷 프록시 서버를 제안한다. 16대의 컴퓨터를 사용하여 실험을 수행하였고 실험 결과 TranSend 시스템에 비해 32.17%의 성능 향상을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.789-798
• /
• 2016

In this paper, we propose a cache algorithm based on user's context for enterprise/urban smallcell environments. The smallcell caching method is to store mobile users' data traffic at a storage which is equipped in smallcell base station and it has an effect of reducing core networks traffic volume. In our algorithm, contrary to existing smallcell cache algorithms, the cache storage is equipped in a edge server by using a concept of the Mobile Edge Computing. In order to reflect user's characteristics, the edge server classifies users into several groups based on user's context. Also the edge server changes the storage size and the cache replacement frequency of each group to improve the cache efficiency. As the result of performance evaluation, the proposed algorithm can improve the cache hit ratio by about 11% and cache efficiency by about 5.5% compared to the existing cache algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.248-256
• /
• 2003

Space-time coding was designed for an efficient transmit diversity technique to improve performance of wireless communication. For the transmit diversity using space-time coding, the receiver requires to estimate channel parameters corresponding to each transmit antennas. In this paper, we propose an efficient channel estimation scheme based on trigonometric polynomial approximation in OFDM systems with transmit diversity using space-time coding. The proposed scheme is more efficient than the conventional scheme in terms of the computational complexity. For QAM modulation, when the size of FFH is 128, the conventional scheme with significant tap caching of 7 requires 9852 complex multiplications for TU, HT and BU channels. But the proposed scheme requires 2560, 7680 and 3584 complex multiplications for TU, HT and BU channels, respectively. Especially, for channels with smaller Doppler frequency and delay spreads, the proposed scheme has the improved BER performance and complexity. In addition, we evaluate the performance of maximum delay spread estimation in unknown channel. The performance of the proposed scheme is investigated by computer simulation in various multi-path fading environments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.399-412
• /
• 2006

A clustering based wireless internet proxy server with cooperative caching has a problem of minimizing overall performance because some servers become overloaded if client request pattern is Hot-Spot or uneven. We propose a self-learning based adaptive clustering scheme to solve the poor performance problems of the existing clustering in case of Hot-Spot or uneven client request pattern. In the proposed scheme, requests are dynamically redistributed to the other servers if some servers supposed to handle the requests become overloaded. This is done by a self-learning based method based dynamic weight adjustment algorithm so that it can be applied to a situation with even various request pattern or a cluster of hosts with different performance. We performed experiments in a clustering environment with 16 PCs and a load balancer. Experimental results show the 54.62% performance improvement of the proposed schemes compared to the existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1295-1304
• /
• 2010

This paper proposes a fault-tolerant data aggregation which provides energy efficient and reliable data collection in wireless sensor networks. The traditional aggregation scheme does not provide the countermeasure to packet loss or the countermeasure scheme requires a large amount of energy. The proposed scheme applies caching and re-transmission based on the track topology to the adaptive timeout scheduling. The proposed scheme uses a single-path routing based on the traditional tree topology at normal, which reduces the dissipated energy in sensor nodes without any countermeasure against packet loss. The proposed scheme, however, retransmits the lost packet using track topology under event occurrences in order to fulfill more accurate data aggregation. Extensive simulation work under various workloads has revealed that the proposed scheme decrease by 8% in terms of the dissipated energy and enhances data accuracy 41% when the potential of event occurrence exists as compared with TAG data aggregation. And the proposed scheme decrease by 53% in terms of the dissipated energy and shows a similar performance in data accuracy when the potential of event occurrence exists as compared with PERLA data aggregation.

• Journal of Industrial Convergence
• /
• v.18 no.2
• /
• pp.69-75
• /
• 2020

Industrial IoT has much interested in wireless mesh networks (WMNs) due to cost effectiveness and coverage. According to the advance in caching technology, WMNs have been researched to overcome the throughput degradation of multihop environment. However, there is few researches of cache power consumption models for WMNs. In particular, a wired line based cache power consumption model in content-centric networks is not still proper to WMNs. In this paper, we split the amount of cache power from the idle power consumption of CPU, and then the cache hit ratio proportional power consumption model (CHR-model) is proposed. The proposed CHR-model provides more accurate power consumption in WMNs, compared with the conventional cache power efficiency based consumption model (CPE-model). The proposed CHR-model can provide a reference model to improve energy-efficient cache operation for Industrial IoT.