• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.4
• /
• pp.177-185
• /
• 2005

NAND-type flash memory is becoming increasingly popular as a large data storage for mobile computing devices. Since flash memory is an order of magnitude more expensive than magnetic disks, data compression can be effectively used in managing flash memory based storage systems. However, compressed data management in NAND-type flash memory is challenging because it supports only page-based I/Os. For example, when the size of compressed data is smaller than the page size. internal fragmentation occurs and this degrades the effectiveness of compression seriously. In this paper, we present an efficient flash compression layer (FCL) for NAND-type flash memory which stores several small compressed pages into one physical page by using a write buffer Based on prototype implementation and simulation studies, we show that the proposed scheme offers the storage of flash memory more than $140\%$ of its original size and expands the write bandwidth significantly.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.285-296
• /
• 2002

When a client requests a set of data items at once, it is crucial to reduce the total time elapsed till the client receives all data items requested. This paper describes a data broadcasting technique that reduces access time for multiple data accesses from clients. The impact of the relative position of each data item in a broadcast schedule is dependent on the degree of data replication between data requests from clients. The relative broadcast frequencies for data items are affected by the degree of access skewness from clients. This paper proposes a technique for generation of a hierarchical data broadcast schedule, which can support multiple data accesses effectively by considering the data sharing among client requests and data access skewness together. Simulation results show that the proposed technique consistently performs better than the previous research results in various environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.984-994
• /
• 2003

This paper proposes a novel blind adaptive algorithm for computing the weight vector of an antenna array system. The new technique utilizes a Generalized On-Off algorithm to obtain the weight vector maximizing the SINR(Signal to Interference plus Noise Ratio) of the received signal. It is observed that the proposed algorithm generates a suboptimal weight vector with a linear computational load(O(6N+8)). From the various simulations, it is confirmed that, when the signal environment becomes adverse, e.g., low Processing Gain, and/or wide angular spread. the proposed algorithm outperforms the conventional one in terms of the communication capacity by about 3 times. Applying the proposed algorithm to satellite tracking systems as well as IS2000 1X mobile communication system, we have found that both communication capacity and communication quality are significantly improved.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.15-25
• /
• 2003

Wireless ad-hoc networks are only composed with mobile devices. Unlike the traditional wired networks, those devices are mostly operated with battery power. Since the battery-operated power is limited, the efficient energy resource managements becomes an important issue in wireless ad-hoc networks and various studies that considered these characteristics are progressed. One of those studies is an energy efficient routing using coordinators. In this method. only devices elected as coordinator participate in data transmissions in ad-hoc networks, while other devices remain in sleep node. The overall energy consumption of a system can be reduced. In order to minimize energy consumption of a total network, previous results try to maximize the number of nodes in sleep mode. However, minimizing the number of coordinators does not ensure to increase the system lifetime. In this thesis, we propose an algorithm that can elect coordinators with considering the amount of necessary energy to transmit assigned data and a connectivity of nodes in the networks. The result of proposed coordinator election algorithm can increase the system lifetime of an Ad-hoc network from the results of existing coordinator election algorithms.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.65-73
• /
• 2009

IEEE802.11 Wireless LAN(WLAN) is being widely used in public space such as airport, and increases the networking boundary in campus and enterprise, and it has lastly attracted considerable attention for mesh network and converged network with other 3G mobile communication networks. In WLAN, load balancing among Access Points(AP) is an important issue for efficient resource management or supporting the Quality of Service(QoS) of traffic, but most researches focused on the AP selection in network entry or roaming of Stations(STA). In this paper, we propose an AP-Initiated Flow Redirection(FR) for AP load balancing by monitoring AP's availability in the true sense. When the AP's resource becomes almost saturated, that is used more than a specific threshold, the AP queries the roaming possible neighbor APs about their availability and calculates the distribution of traffic load with statistical methods such as entropy or chi-square. Finally, the AP decides flows and new APs for redirection and performs it. Our simulation results show that our FR mechanism increases the performance in the various views.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.27-33
• /
• 2010

This paper applies Bayesian Markov inferred localization techniques for determining ZigBee mobile device's position. To evaluate its accuracy, we compare it with conventional technique, map-based localization. While the map-based localization technique referring to database of predefined locations and their RSSI data, the Bayesian Markov inferred localization is influenced by changes of time, direction and distance. All determinations are drawn from the estimation of Received Signal Strength (RSS) using ZigBee modules. Our results show the relationship between RSSI and distance in indoor ZigBee environment and higher localization accuracy of Bayesian Markov localization technique. We conclude that map-based localization is not suitable for flexible changes in indoors because of its predefined condition setup and lower accuracy comparing to distance-based Markov Chain inference localization system.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.886-901
• /
• 2000

Verification of the safety of untrusted codes becomes an important issue in the mobile computing environment and the safety-critical software systems. Recently, it is very common to run the codes attached to the electronic mails or downloaded from the web browsers. We propose the verification method of the machine code property. The code producer delivers the machine code and its property, then the code consumer checks whether the delivered code satisfies the delivered property. The safety of source codes is verified by the well-defined compiler systems but the verification mechanism for machine codes is not well defined yet. We design an intermediate language etySECK and propose the verification method of the property of etySECK programs. And then we prove the soundness of our system which is the type system with effect extension.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.9
• /
• pp.4160-4168
• /
• 2011

The development of computing technology and the increase of using mobile smart devices have brought about changes in our daily life. It makes accessing the internet more easy, and also increases the convenience of our daily life and the variety of information. In this paper, a system for marking the absence using a smart-phone is developed, which is one of the means to increase the convenience of our daily life. Usually the conventional system for the same purpose uses a smart card, so that there are some drawbacks in the system such as attendance by proxy. To compensate the drawbacks, the system proposed in this paper uses a smart-phone belonging to an individual and an instant authentication key to mark the absence that is generated at the time when it is required. It makes the proposed system being more effectively used in marking the absence.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.315-319
• /
• 2015

This paper addresses the design and implementation of an Android application for real-time precise motion control. To provide stable real-time performance, we implemented the application in two parts: Android service in the form of a daemon process, which periodically transfers a set of position commands for all motors through a real-time fieldbus, and Android UI application, which generates and delivers the set of position commands to the Android service. To support such a real-time motion control application, we use multi-core partitioning, which partitions the processor cores into a real-time partition to be used by the real-time motion control service and a non-real-time partition to be used by the Android application, and set up a shared buffer between them for communication. Our experiments show that we can obtain a motion control period of 2 ms with 99% task activation jitters less than ${\pm}55{\mu}s$ for a configuration where each of the four threads controls two motors in a group.