• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.115-131
• /
• 2008

Small mobile devices have become commonplace in our everyday life, from cellular phones to PDAs. Discovering dense regions for the mobile devices is one of the problems of grate practical importance. It can be used in monitoring movement of vehicles, concentration of troops, etc. In this paper, we propose a novel algorithm on continuously clustering a large set of mobile objects. We assume that a mobile object reports its position only if it is too far away from the expected position and thus the location data received may be imprecise. To compute the location of each individual object could be costly especially when the number of objects is large. To reduce the complexity of the computation, we want to first cluster objects that are in proximity into a group and treat the members in a group indistinguishable. Each individual object will be examined only when the inaccuracy causes ambiguity in the final results. We conduct extensive experiments on various data sets and analyze the sensitivity and scalability of our algorithms.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.9
• /
• pp.263-272
• /
• 2023

Industrial Internet of Things (IIoT) is an important factor in increasing production efficiency in industrial sectors, along with data collection, exchange and analysis through large-scale connectivity. However, as traffic increases explosively due to the recent spread of IIoT, an allocation method that can efficiently process traffic is required. In this thesis, I propose a two-stage task offloading decision method to increase successful task throughput in an IIoT environment. In addition, I consider a hybrid offloading system that can offload compute-intensive tasks to a mobile edge computing server via a cellular link or to a nearby IIoT device via a Device to Device (D2D) link. The first stage is to design an incentive mechanism to prevent devices participating in task offloading from acting selfishly and giving difficulties in improving task throughput. Among the mechanism design, McAfee's mechanism is used to control the selfish behavior of the devices that process the task and to increase the overall system throughput. After that, in stage 2, I propose a multi-armed bandit (MAB)-based task offloading decision method in a non-stationary environment by considering the irregular movement of the IIoT device. Experimental results show that the proposed method can obtain better performance in terms of overall system throughput, communication failure rate and regret compared to other existing methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.289-300
• /
• 2010

Recently, diverse information which are location, call history, SMS history, photographs, and video can be collected constantly from mobile devices such as cellular phone, smart phone, and PDA. There are many researchers who study services for searching and abstraction of personal daily life with contextual information in mobile environment. In this paper, we introduce MyLifeBrowser which is developed in our previous work. Also, we explain LPS and correction of GPS coordinates as extensions of previous work and show LPS performance test and evaluate the performance of expanded keywords. MyLifeBrowser which provides searching personal information in mobile device and support of detecting related information according to a fragmentary keyword and common knowledge in ConceptNet. It supports the functionality of searching related locations using Bayesian network that is designed by the authors. In our experiment, we visualize real data through MyLifeBrowser and show the feasibility of LPS server and expanded keywords using both Bayesian network and ConceptNet.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.533-542
• /
• 2001

In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.115-129
• /
• 2007

The ubiquitous and autonomic computing environments is open and dynamic providing the universal wireless access through seamless integration of software and system architectures. The ubiquitous computing have to offer the user-centric pervasive services according to the wireless access. Therefore the roaming services with the predefined security associations among all of the mobile devices in various networks is especially complex and difficult. Furthermore, there has been little study of security coordination for realistic autonomic system capable of authenticating users with different kinds of user interfaces, efficient context modeling with user profiles on Smart Cards, and providing pervasive access service by setting roaming agreements with a variety of wireless network operators. This paper proposes a Roaming Coordinator-based security management framework that supports the capability of interoperator roaming with the pervasive security services among the push service based network domains. Compared to traditional mobile systems in which a Universal Subscriber Identity Module(USIM) is dedicated to one service domain only, our proposed system with Roaming Coordinator is more open, secure, and easy to update for security services throughout the different network domains such as public wireless local area networks(PWLANs), 3G cellular networks and wireless metropolitan area networks(WMANs).

• Journal of Internet Computing and Services
• /
• v.11 no.3
• /
• pp.43-51
• /
• 2010

In this paper, we evaluate the system throughput and the method of optimal wireless resource allocation for the access zone (AZ) and relay zone (RZ) in downlink when the cell coverage is extended using the non-transparent Relay Station (RS) in a 2-hop cellular relay system based on IEEE802.16j, which uses the OFDMA-TDD structure. For the analyses, we first introduce the MAC (Media Access Control) frame structure in the non-transparent mode, then we investigate the interfering elements in both AZ and RZ for the network devices such as the Mobile Station (MS) and RS. Through computer simulation, we analyze the cell coverage extension and system throughput in terms of the distance between Base Station (BS) and RS, then we present the amount of the optimal allocation of wireless resource for the AZ and RZ in downlink using our results.

• Journal of Computing Science and Engineering
• /
• v.7 no.3
• /
• pp.168-176
• /
• 2013

Long-term evolution (LTE) is emerging as a major candidate for 4G cellular networks to satisfy the increasing demands for mobile broadband services, particularly multimedia delivery. Multiple-input multiple-output (MIMO) technology combined with orthogonal frequency division multiple access and more efficient modulation/coding schemes (MCS) are key physical layer technologies in LTE networks. However, in order to fully utilize the benefits of the advances in physical layer technologies, the MIMO configuration and MCS need to be dynamically adjusted to derive the promised gains of 4G at the application level. This paper provides a performance evaluation of video traffic with variations in the physical layer transmission parameters to suit the varying channel conditions. A quantitative analysis is provided using the perceived video quality as a video quality measure (evaluated using no-reference blocking and blurring metrics), as well as transmission delay. Experiments are performed to measure the performance with changes in modulation and code rates in poor and good channel conditions. We discuss how an adaptive scheme can optimize the performance over a varying channel.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.21-28
• /
• 2009

In this paper, we consider the Femtocell based enterprise wireless network using 2G/3G/4G cellular network technologies. And, we apply the open network service API which enable an easy development of ISP or enterprise services to P2P enterprise services. Based on the proposed scheme, enterprise services can be always connected at anywhere and anytime via heterogeneous devices. By using a qualitative analysis, we evaluate the performance of the proposed scheme and compare with that of the famous P2P service - Skype. Results show that the proposed scheme requests smaller servers and flows with enhanced service quality.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.422-426
• /
• 2007

Personal mobile devices equipped with non-volatile storage such as MP3 player, PMP, cellular phone, and USB memory require safety for the stored data on the devices. One of the safety requirements is secure deletion, which is removing stored data completely so that the data can not be restored illegally. In this paper, we study how to design the secure deletion on Flash memory, commonly used as storage media for mobile devices. We consider two possible secure deletion policy, named zero-overwrite and garbage-collection respectively, and analyze how each policy affects the performance of Flash memory file systems. Then, we propose an adaptive file deletion scheme that exploits the merits of the two possible policies. Specifically, the proposed scheme applies the zero-overwrite policy for small files, whereas it employs the garbage-collection policy for large files. Real implementation experiments show that the scheme is not only secure but also efficient.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.33-46
• /
• 2003

A Home Location Register(HLR) database system manages each subscriber's location information, which continuously changes in a cellular network. For this purpose, the HLR database system provides table management, index management, and backup management facilities. In this thesis, we propose using a two-level index method for the mobile directory number(MDN) as a suitable method and a chained bucket hashing method for the electronic serial number(ESN). Both the MDN and the ESN are used as keys in the HLR database system. We also propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the R-tree index method. The insertion and deletion overhead of the chained bucket hashing method is less than that of the modified linear hashing method. In the proposed backup method, we use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration-location operations. For a million subscribers, proposed techniques support reduction of memory size(more than 62%), directory operations (2500,000 times), and backup operations(more than 80%) compared with current techniques.