• International Journal of Computer Science & Network Security
• /
• v.21 no.11
• /
• pp.59-66
• /
• 2021

Many incidents of Carbon Monoxide (CO) poisoning have occurred because of people being unaware of its presence. There are currently available systems on the market, but they are limited to measuring CO in a certain area and lack vital functions. Additionally, little to no evidence-based information on their quality was available. Thus, a mobile application for detecting CO gas leakage in a vehicle and critical features to assist victims was developed. A usability and functionality test were conducted to determine the product's quality utilizing nine usability and six functionality task scenarios (n=5). Then, a System Usability Scale test was performed to obtain system satisfaction, usability, and learnability (n=50). The usability and functionality test shows that all the tasks given for both tests were 100% successful. The overall score obtained for SUS was 71.4, which indicates good acceptance and usability. Around 20% of respondents claimed that they would need the support of a technical person to be able to use the application and that they needed to learn a lot of things before they could use the application, which indicates the overall high learnability of the application. The result provides empirical evidence that the CO gas leakage detection mobile application is successful and receives good usability, functionality, acceptability, learnability, and satisfaction assessments. DetGas could benefit automobile owners and other stakeholders by mitigating the risk and harm associated with gas leaking that exceeds the safe limit.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.128-130
• /
• 1997

In the paper a problem of search for a moving robot by another moving robot is considered. The problem is formalized as minmax and maxmin task also as a game.

• The Journal of Information Systems
• /
• v.24 no.3
• /
• pp.75-94
• /
• 2015

Purpose While new versions of mobile applications could offer users better computing environment, users are not always comfortable with them for various reasons. Considering making update decisions is important task for users, it is crucial for us to understand users' behavior and attitude on app updates. The purpose of this study is to explain why mobile users succumb to both reactance toward the update and satisfaction to the current version, ultimately leading them to feel the regret by employing three theoretical perspectives including regret theory, status quo bias theory and the dual model. Design/methodology/approach Survey data collected from 204 mobile users was used to test the research model using partial least squares analysis. The results have shown that both reactance toward the update and satisfaction to the current version have negative impacts on individuals' decisions to update, which leading to their regret after updating the applications Findings By integrating both status quo bias and regret theory in the model, this study tried to explain why mobile users feel regret in application update settings. More specifically, this study has proposed a novel framework that introduces an individual's update decision on mobile applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7C
• /
• pp.696-703
• /
• 2002

In traditional approaches to IN load control, there has been a focus on the protection of individual SCPs. On the other hand, the load control of network level can be achieved by using a mobile agent technology, which is a software element responsible for moving from one system to another and performing their task. In this thesis, we propose an mobile agent mechanism and two mobile agent migration procedures and analyze the performance of the Call Gapping mechanism and the mobile agent mechanism. The mobile agent mechanism showed that the SCP load control rate and attempt the number of attempted call failure were better than those of Call Gapping mechanism. Also, the amount of SS NO.7 traffics was reduced in the case of an overload condition.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.46-55
• /
• 2008

As a mobility support for IP have studied, Internet Engineering Task Force(IETF) standardized the Mobile IPv6(MIPv6) protocol. When a mobile node moves between subnets, MIPv6 maintains connectivity to network and supports seamless communication, and these processes are called a Handover. Whenever the mobile node moves between subnets, the Handover is performed. The mobile node can not communicate during the Handover. This period is Galled Handover latency. To reduce this latency, mipshop working group standardizes Fast Handovers for Mobile IPv6(FMIPv6), but latency which the mobile node registers its new care-of address to a home agent and a correspondent node is still long. To solve this problem, we propose a scheme that the mobile node registers the new care-of address to the home agent and initiates Return Routability procedure in advance during layer 2 handover, based on FMIPv6 and IEEE 802.11. We analyze MIPv6, FMIPv6 and the proposed scheme in term of packet transmission cost during the Handover. Compared to MIPv6 the proposed scheme gains 79% improvement, while it gains 31% improvement compared to FMIPv6.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.50-58
• /
• 2001

Modern day networks are increasingly moving towards peer to peer architecture where routing tasks will not be limited to some dedicated routers, but instead all computers in a network will take part in some routing task. Since there are no specialized routers, each node performs some routing tasks and information passes from one neighbouring node to another, not in the form of dumb data, but as intelligent virtual agents or active code that performs some tasks by executing at intermediate nodes in its itinerary. The mobile agents can run, and they are free to d other tasks as the agent will take care of the routing tasks. The mobile agents because of their inherent 'intelligence'are better able to execute complex routing tasks and handle unexpected situations as compared to traditional routing techniques. In a modern day dynamic network users get connected frequently, change neighbours and disconnect at a rapid pace. There can be unexpected link failure as well. The mobile agent based routing system should be able to react to these situations in a fact and efficient manner so that information regarding change in topology propagates quickly and at the same time the network should not get burdened with traffic. We intend to build such a system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5442-5463
• /
• 2016

Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1162-1167
• /
• 2003

This paper presents a simple sensor network consists of a group of sensors, RF components, and microprocessors, to perform a distributed sensing and information transmission using wireless links. In the proposed sensor network, though each sensor node has a limited capability and a simple signal-processing engine, a group of sensor nodes can perform a various tasks through coordinated information sharing and wireless communication in a large working area. Using the capability of self-localization and tracking, we show the sensor network can be applied to localization and navigation of mobile robot in which the robot has to be coordinated effectively to perform given task in real time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.680-699
• /
• 2015

The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.3
• /
• pp.39-45
• /
• 2009

In this paper we present a cleaning robot system for an autonomous mobile robot. Our robot performs goal reaching tasks into unknown indoor environments by using sensor fusion. The robot's operation objective is to clean floor or any other applicable surface and to build a map of the surrounding environment for some further purpose such as finding the shortest path available. Using its cleaning robot system for an autonomous mobile robot can move in various modes and perform dexterous tasks. Performance of the cleaning robot system is better than a fixed base redundant robot in avoiding singularity and obstacle. Sensor fusion using the clean robot improves the performance of the robot with redundant freedom in workspace and Map-Building. In this paper, Map-building of the cleaning robot has been studied using sensor fusion. A sequence of this alternating task execution scheme enables the clean robot to execute various tasks efficiently. The proposed algorithm is experimentally verified and discussed with a cleaning robot, KCCR.