• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.89-95
• /
• 2008

The introduction of wireless information technology gives rise to new mobile services in all kinds of areas of out daily life. Mobile healthcare system is a production of composite ICT (Information and Communication Technology) which focused on signal sensing, processing, and communication in wireless environment. The mobile and wireless revolution promises not only expanded access to patient health information, but also improved patient care. In this paper, we describe a surrogate host based mobile healthcare information system which utilized Grid computing for real-time ECG signal processing. The surrogate host provides seamless interface between mobile device and Medical Grid portal. The security extension of GSI (Grid Security Infrastructure) allows mobile users to access Grid portal in a secure and convenient manner. The presented system architecture can be used as a secure enterprise mobile healthcare system for hospital physicians.

• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.279-286
• /
• 2007

The need of contents adaptation in ubiquitous environments is growing to support multiple target platforms for 3D graphics contents. Since 3D graphics deal with a large data set md a high performance, a service adaptation for context changing is required to manipulate graphics contents with a more complicated method in multiple devices such as desktops, laptops, PDAs, mobile phones, etc. In this paper, we suggest a new notion of service adaptation middleware based on service rendering algorithm, which provides a flexible and customized service for user-centric 3D graphics contents. The service adaptation middleware consists of Service Adaptation(SA) for analyzing environments and Service Rendering(SR) for reconfiguring customized services by processing customized data. These adaptation services are able to intelligently and dynamically support the same computer graphics contents with good quality, when user environments are changed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.238-248
• /
• 2007

As the demand of employing various PC software on mobile embedded devices which have limited storages has been increased, software streaming services are needed. However it takes too much time to launch software on them because it is transferred through wireless networks. To address this problem, prefetch algorithms are needed. We examined 'Last successor (LS)' algorithm and PPM-based prefetch algorithm as prefetch algorithms for software streaming services. We present 'Probability-base Multi Successor (PMS)' algorithm which is contrived through analyzing evaluations of previous algorithms and characteristics of software streaming services. While LS has one successor per each block, PMS has N successors based on probability which is calculated by PPM-based prefetch algorithm. The hit rate of PMS is similar to that of PPM-base prefetch algorithm and the space overhead is similar to that of LS. We can get good efficiency at the point of memory usage when PMS is applied to software streaming services.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.195-204
• /
• 2010

Due to improved wireless communication technologies, it is possible to provide multimedia streaming service for mobile device clients like PDAs and cellphones. Wireless networks are serviced on low bandwidth channels and mobile devices work on limited hardware specifications. In these conditions, transcoding technologies are needed to adapt the media for streaming services to given mobile environments. To transcode from the source media to the target media for corresponding grades, transcoding servers perform transcoding jobs as exhausting their resources. Since various transcoding loads occur according to the target transconding grades, an effective transcoding load balancing policy is required among transcoding servers. In addition to transcoding process, servers should maintain QoS streams for mobile clients for total serviced times. It requires real-time requirements to support QoS for various mobile clients. In this paper, a new transcoding load distribution method is proposed. The proposed method can be driven for fair load balance between distributed transcoding servers. Based on estimated transcoding time, movie information and target transcoding bit-rate, it provides fair transcoding load distribution and also performs admission control to support QoS streams for mobile clients.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.466-475
• /
• 2008

Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the transcoding load estimation algorithm is proposed for load balance on the distributed transcoding environments. The proposed algorithm estimates transcoding time from transcoding server information, movie information and target transcoding bit-rate. The estimated transcoding time is proved based on experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1938-1943
• /
• 2005

Network human-robot interface is an important research topic. In home application, users access the robotic system directly via voice, gestures or through the network. Users explore a system by using the services provided by this system and to some extend users are enable to participate in a service as partners. A service may be provided by a robot, a group of robots or robots and other network connected systems (distributed sensors, information systems, etc). All these services are done in the network environment, where uncertainty such as the unstable network connection, the availability of the partners in a service, exists. Moreover, these services are controlled by several users, accessing at different time by different methods. Our research aimed at solving this problem to provide a high available level, flexible coordination system. In this paper, a multi-agent framework is proposed. This framework is validated by using our new concept of slave agents, a responsive multi-agent environment, a virtual directory facilitator (VDF), and a task allocation system using contract net protocol. Our system uses a mixed model between distributed and centralized model. It uses a centralized agent management system (AMS) to control the overall system. However, the partners and users may be distributed agents connected to the center through agent communication or centralized at the AMS container using the slave agents to represent the physical agents. The system is able to determine the task allocation for a group of robot working as a team to provide a service. A number of experiments have been conducted successfully in our lab environment using Issac robot, a PDA for user agent and a wireless network system, operated under our multi agent framework control. The experiments show that this framework works well and provides some advantages to existing systems.

• Information Systems Review
• /
• v.6 no.1
• /
• pp.155-166
• /
• 2004

As the necessity of such mobile wireless terminals as PDAs or Cellular phones drastically increases, the terminals play important role in various business areas. In this paper, a bidding system in mobile wireless environments is constructed. However, with many mobile wireless terminals modifying at the same time their (duplicated) bidding values for a given data item, data coherency for the data item becomes essential. Therefore, in this paper, a bidding system using SyncML data synchronization mechanism is proposed and constructed. SyncML is one of data synchronization mechanisms proposed by the SyncML Initiative, a consortium of mobile wireless mobile technology leaders for universal data synchronization. The bidding system is implemented and tested in LINUX, C++, and PocketPC 2000 emulator programming environments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.647-656
• /
• 2002

Synchronization is the process of making replicated data on multiple devices be consistent, i.e., identical with each other. In Dec. 2000, major handheld computer manufacturers including Nokia, Ericsson, IBM published the SyncML protocol specification. In this paper, we describe the CNU SyncML server for PIMS(Personal Information Management System) service that we developed based on the SyncML specification. The server architecture and capabilities of the frames are presented along with the procedure of message processing by each frame. We put the CNU SyncML server to the conformance tests and interoperability tests to confirm its functionality. The session managing mechanism of the CNU SyncML server showed better performance than our previous implementations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.830-835
• /
• 2006

Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.81-94
• /
• 2005

Recently, wireless LAN circumstance is being widely deployed in Public spots. Many People use Portable equipments such as PDA and laptop computer for multimedia applications, and also demand of mobility support is increasing. However, handoff latency is inevitably occurred between both APs when clients move from one AP to another. To reduce handoff latency. in this paper, we suggest WFH(Weighted Frequent Handoff) using effective data structure. WFH improves cache hit ratio using a new cache replacement algorithm considering the movement pattern of users. It also reduces unessential duplicate traffics. Our algorithm uses FHR(Frequent Handoff Region) that can change pre-authentication lesion according to QoS based user level, movement Pattern and Neighbor Graph that dynamically captures network movement topology.