• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.276-284
• /
• 2005

In the mobile computing environment, caching data at the client's side is a useful technique for improving the performance. For caching to be effective, the cache contents must be consistent with those stored in the server. That is, unfortunately, difficult to enforce due to the frequent disconnection and mobility of clients. In the literature, the basic approach adopted is for the sever to periodically broadcast invalidation reports(IRs) that contain information about objects that have been updated recently. However IR-based cache maintenance scheme has a main drawback. Any client who has been disconnected longer than w seconds has to discard all cached items even some of them may still be valid. In this paper, we propose two main schemes which can adapt clients' losing IR messages by long disconnection. First, the client sends its disconnection time when connection is re-established, and the server uses this information to decide the size of broadcast window w dynamically. Second, the server maintains IR messages for a given period of time and a client who has been disconnected longer than w seconds can verify its cache consistency individually. Compared to previous IR-based schemes, our schemes can significantly reduce cache missing and uplink request and improve the throughput by reducing response time.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.476-493
• /
• 2003

Data broadcast is an effective data transmission method from a data base server to numerous mobile clients due to the restrictions on mobile environment such as low wireless communication bandwidth and energy shortage of mobile devices. There are various broadcast methods based on clients' data access frequencies or semantic relationship of data. The broadcast schedule based only on the access frequencies does not consider semantic relations of data, so that when a client needs to access a series of semantically related data, the client has to listen to the wireless channel for a long time. On the other hand, the broadcast schedule based only on semantic relationship of data makes data access time longer when clients highly request specific data which are not semantically related but frequently accessed. In this paper, we present an efficient data broadcast method based on not only data access frequencies but also semantic relationship to improve mobile clients' query response time. The new hybrid broadcast method we propose creates a data broadcast schedule according to the data access frequencies and then the schedule is adjusted to reflect semantic relationship of data. We show our method is efficient by experimental performance analysis.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.56-70
• /
• 2005

The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.81-87
• /
• 2016

With the rapid growth of the up-to-date smartphone and wireless network technologies, huge and various types of smart applications using these technologies are actively developed recently. Especially, multiplex types of smart applications using smartphone are developed and diffused with the rapid development of the ubiquitous sensor network technology using various sensors and the mobile computing technology that enables us to get network services at any time in any places. In this paper, we design a smart application that can accurately diagnose and process the current state of the local environment, objects, and persons remotely based on the context information such as local ecology, circumstances, medical or healthcare records and realtime sound or motion pictures using up-to-date samrtphone technology on the USN based mobile computing environment.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.149-159
• /
• 2000

In mobile computing environments, invalidation and propagation method based on broadcasting is used to transmit the information for cache maintenance of mobile hosts. Previous researches generally adopted invalidation method that easily adapts to the limited network bandwidth and the frequent disconnection. But the invalidation of frequently accessed data causes the contention on the wireless network with the increasing cache requests. Although the propagation method can reduce the cache requests, the high probability of broken message or loss of message is the main factor that degrades the system performance. To resolve these problems, we propose adaptive cache maintenance scheme that dynamically adjusts the broadcasting ratio of invalidation and propagation, according to the wireless network connection states. The proposed scheme broadcasts the propagation message in stable connection state, so it can reduce the cache requests and server response time. With the decreasing available network bandwidth by the frequent partial disconnection and disconnection, the proposed scheme dynamically increases the broadcasting ratio of the invalidation messages to minimize the broken message or the loss of message probability. Consequently, the proposed scheme resolves the problems which arise in the invalidation or propagation method in mobile computing environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.285-287
• /
• 2017

Currently, the world of data communication is not simply communication between server and user in a wired way, but using wireless environment, various devices communicate with each other in a wider and diverse environment to generate a large amount of data. In this environment, IoT is now located deep in our lives, and IoT technologies are used in many tasks, but the data used in IoT is exposed without sufficient protection from malicious behavior. Most of these devices do not have enough computing power to cope with malicious attacks. In this paper, we aim to make all devices that have sufficient computing power and safety from simple sensors to be able to have security according to the situation. The proposed technology is based on the importance of the device and computing power, and it is possible to select the encryption technology selectively and to improve security.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.633-640
• /
• 2001

Mobile agent is a software program that provides autonomy and mobility for the users in the networked computers by deciding its own movement place. Since mobile agent does not keep up the network connection and migrate its executable code under its own control, it can be often used in the unstable network conditions such as the wireless network and the heavy traffic network. In this paper, we show that the electronic commerce system can be developed efficiently to retrieve and trade the goods in the mobile computing environment by using the mobile agent paradigm. Multiple mobile agents migrate into the market directly, then negotiate and trade autonomously relevant goods and services. The execution result and executable code of the mobile agent are returned to the home place and reported to the users. We show that the mobile agent paradigm is suitable to build the mobile electronic commerce system by designing and prototyping the mobile market system.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.689-697
• /
• 2004

Rapid advances in mobile computing and the availability of wireless communications will soon provide mobile users with the ability to access data regardless of the location of the user or of the data. SRA(Static Replica Allocation) that is traditional scheme has been used for the replication method on the server. This replicates the data on the replica server after a moving host has been transferred to the cell. This strategy is simple and can easily relocate data. However, if a mobile user does not exist in the cell, the replicated data can be deleted in order to maintain data consistency. In addition to, if the mobile host leaves from replicated cell, it is difficult to access data in terms of replication route. Therefore, this paper proposes a new method of relocation based on data consistency strategy called USRAC(User Selection Replica Allocation based on Consistency) and also analyzes access cost according to the moving rate of mobile users, according to the access rate of mobile hosts, and according to the number of cells of mobile users and mobile hosts.

• Spatial Information Research
• /
• v.11 no.1
• /
• pp.41-60
• /
• 2003

It is noted that the paper mapping system for University Building Facility has many limitations in terms of data maintenance, real-time GIS data acquisition, and economic efficiency. The aim of this research was to evaluate an operational potential of an on site real-time mobile GIS technique to resolve the problem faced in the university. The idea is based upon the recent trends in the field of 'Telecommunication and Information Technology' that uses a PDA (personal Digital Assistants), wireless network computing, mobile computing, etc. A real time mobile GIS approach has been adopted, in which a PDA is linked to a wireless internet and field workers record data on the computer at the site and analyse data on site. While there should be a considerable number and variety of factors associated with real-time mobile GIS quality, this research focuses on three criteria that are identified as fundamental to customer requirements; (1) data quarry (2) spatial analysis (3) real-time GIS database building. 'Art--empirical study for a case study facility has been conducted to confirm the validity for the system. The system has been checked experimentally, enabled the field users to quarry the data required simply and execute spatial analysis (buffer, overlay etc.,) accommodating versatile alternatives on the site. Detailed visual maps can be generated over large areas quickly and easily. The PDA interface, in particular, were ideally suited for field users to interactively displaying positional information with attribute data. This system has shown to be quite convenient to maintaining a highly reliable database since it could playa crucial role in documenting at real-time basis temporal and spatial changes occurred in the facilities. It is anticipated that this research output will greatly serve to introduce the reliable and cost-effective facility mapping system in the university by overcoming serious constraints suffered from the past non-real time mobile GIS approach.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.23-29
• /
• 2006

It is difficult to apply conventional security algorithms to the wireless sensor networks composed of nodes that have resource constraints such as memory, computing, power resources limitation. Generally, shared key based algorithms with low resource consumption and short key length are used for broadcast packets in authentication of base station. But it is not suitable that all the nodes hold the same shared key only for packet authentication. Recently, broadcast authentication algorithm for sensor network is proposed, which uses key chain generation by one-way hash function, Message Authentication Code generation by each keys of the key chains and delayed key disclosure. It provides suitable authentication method for wireless sensor networks but may leads to inefficient consequence with respect to network conditions such as broadcast ratio, key chain level, and so on. In this paper, we propose an improved broadcast authentication algorithm that uses key chain link and periodical key disclosure. We evaluated the performance of proposed algorithm using TOSSIM(TinyOS Simulator) in TinyOS. The results show that the proposed algorithm ensures low authentication delay, uses memory and computing resource of receiving nodes efficiently and reduces the amount of packet transmitting/receiving.