• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.21-28
• /
• 2006

In this paper, we introduce the mobile grid architecture using kernel-based managements. Mobile grid paradigm is used to allow mobile users to access distributed resources in a transparent, secure and effective way. Each mobile grid user requests job submission, searches for suitable resources to run Job, executes the job to the allocated system resources, and receives the results of the requested job. There are a number of challenging issues when taking mobile environment into account, such as limited performance of mobile devices and mobility of mobile device. To resolve these issues, we design and implement the kernel-based management system for mobile grid application to overcome the limited resources of mobile devices. Also, we show the efficiency of the suggested architecture using the performance evaluation.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.285-294
• /
• 2006

The requirements of Computer Supported Cooperative Work supporting efficient cooperative or collaborative works between multi-users have been increasing in distributed environments. The various technical sections such as group communication technology and distributed processing technology should be provided in Cooperative Work. The replicated development of Cooperative Work applications of a number of common requirements increases development costs enormously and duplicated investment parts. Therefore, systematical development environments are required to develop these common requirements and applications efficiently in Cooperative Work applications development. In this study, we propose the hierarchical role-based coordination model that improves the coordination model of legacy mobile agent to be appropriate in Cooperative Work applications, and design the development environment for Cooperative Work applications based on mobile agent. The proposed hierarchical role-based coordination model provides multi-layered group concepts of mobile agent, and enables implementation of efficient coordination policy per group. Additionally, it supports efficient Cooperative Work application development by role assignment per group unit.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.1-10
• /
• 1999

A mobile computing environment is one that support user's mobility through the wireless communication technology. Users access the database and get results what they want by running mobile transactions. To run the mobile transaction correctly and to maintain the consistency I database, we need a concurrency control method to schedule transactions, a caching method to manage the cache, and a recovery method to construct a fault tolerant system. A mobile computing system is based on the existing distributed system, but we can't use recovery methods of the existing distributed system directly because of the user's mobility and the features of wireless media. So this paper presents a recovery mechanism to construct a fault tolerant mobile computing systems. Especially. we develop and analyze a recovery algorithm for server failure among types of failure which can arise in mobile computing environments.

• Journal of Web Engineering
• /
• v.19 no.1
• /
• pp.29-62
• /
• 2020

In highly dynamic IoT environments, the connection statuses of IoT resources and the availability of IoT-based services change frequently. Therefore, to successfully build distributed service registries for managing and finding the information about available services in an effective manner, it is crucial to minimize the overhead of message exchanges between registries and to reduce the time overhead for identifying the capabilities of available IoT resources and the services that can be provided by utilizing these capabilities. In this paper, we propose a lightweight messaging approach that uses hierarchical Bloom filters to efficiently represent service information to be exchanged and managed by distributed service registries for IoT environments with high mobility. We also propose a method for serializing the dimensions of a Bloom-filter-encoded search space. We conducted experiments to demonstrate the improvement in the service discovery performance, the reduction in message traffic among service registries, and the decrease in the latency when synchronizing distributed service registries.

• Educational Technology International
• /
• v.13 no.1
• /
• pp.49-77
• /
• 2012

The development of mobile devices and network technology is changing the ways in which people communicate with one another. Mobile text message has emerged as one of the most frequently used form of communication, which also gave rise to various non-verbal texts such as emoticons. Nonetheless, the use of text messages has largely been denied in education because text messages often involve colloquial and non-verbal texts considered inappropriate or grammatically incorrect by the teacher. In efforts to provide a theoretical framework to better understand mobile e-text communication, this research compared the practical usages of non-verbal texts in the mobile e-learning environment. The study developed three types of text messages according to the degree of using non-verbal texts and their phraseology as instructors' messages, which were then distributed to 259 students via mobile text messaging. The perceptions of students were analyzed using a semantic differential scale and a questionnaire. The results showed clear differences in students' perceptions of non-verbal text and traditional text, and that optimally designed non-verbal texts turned out to encourage the students' interaction the most out of the three types of text messages. Following the discussion of the results, an expanded theoretical framework beyond Ong's concepts of orality and literacy is also suggested to understand the evolution of mobile e-text communication in education.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.2025-2035
• /
• 2014

The read range of UHF mobile readers can be extended by a booster for mobile RFID readers (BoMR). But in an environment where multiple BoMRs are installed, the read success rate may be decreased due to signal interference. This paper proposes three arbitration methods based on interference estimation with the purpose of enhancing the read success rate. A central arbitration server manages global information in centralized arbitration method (CAM) without broadcast/multicast communication facility. In fully distributed arbitration method (FDAM), all the arbitration messages are broadcasted from a BoMR to every BoMR, and each BoMR decides with broadcasted global information. Events in FDAM are serialized naturally with broadcasted messages. Cluster Distributed Arbitration Method (CDAM) forms clusters with multicasted BoMRs and a selected BoMR acts as an arbiter in the cluster. Such effects as lengthened read range, improved the read success rates of readers can be obtained by the proposed methods without any hardware modification. In order to evaluate the arbitration methods, the RFID system is modeled by using the DEVS formalism and simulated by using the DEVSim++.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.121-127
• /
• 2011

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.9
• /
• pp.589-594
• /
• 2013

As the concept of web characteristics represented by openness and mind sharing grows more and more popular, device log data generated by both users and developers have become increasingly complicated. For such reasons, a log data processing mechanism that automatically produces meaningful data set from large amount of log records have become necessary for mobile device UX(User eXperience) analysis. In this paper, we define the attributes of to-be-analyzed log data that reflect the characteristics of a mobile device and collect real log data from mobile device users. Along with the MapReduce programming paradigm in Hadoop platform, we have performed a mobile device User eXperience analysis in a distributed processing environment using the collected real log data. We have then demonstrated the effectiveness of the proposed analysis mechanism by applying the various combinations of Map and Reduce steps to produce a simple data schema from the large amount of complex log records.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.268-271
• /
• 2004

Today, the vehicle is used the mean of transportation as well as the mobile office with the third digital life space. So telematics is an emerging industry that has tremendous future potential. It is necessary the essential contents for telematics services : navigation map for navigation, POI, real-time traffic information etc. In this paper, we proposed the telematics contents server to manage the telematics contents with efficient performance in distributed environment. The telematics contents server transforms and stores the essential contents and provide it to user through standard interface. The telematics contents server is middleware to offer a rapid essential telematics contents management, client connectivity, and communications. It is useful for the telematics service provider to build telematics system under distributed environment.