• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.227-234
• /
• 2009

OSGi technology has applied to Home Network, but now it is loaded into even heterogeneous devices in various domains. Therefore, it is necessary to cooperate with each other framework for offering effective services in distributed OSGi frameworks. However until now, OSGi specification doesn't provide any methodthat can share the services registered on remote OSGi frameworks. In order to solve this problem, there have been several researches that used existing distributed middleware technologies such as JXTA and Web Services. However these technologies have some weakness, that is, they consume lots of computing resources and need additional process to transform the services. A middleware called R-OSGi uses only OSGi technology for sharing remote OSGi services, but R-OSGi may have a communication bottleneck and SPOF (Single Point of Failure) problem, because it has a central service registry. In this paper we present RSP (Remote Service Provider), which is a P2P-based effective service sharing scheme on distributed OSGi framework. RSP doesn't need to install additional software nor have the additional transformation process of the service representation, because it uses only OSGi technology. In addition it doesn't have any bottleneck problem and improves scalability by providing the service discovery mechanism using P2P. RSP can also access remote services transparently and it can guarantee reliability by sending an immediate notice about changes of the remote services.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.205-227
• /
• 2002

Our study is focused on a multiple-agent system to provide efficient collaborative work by automating the conference calling process with the help of intelligent agents. Automating the meeting scheduling requires a careful consideration of the individual official schedule as well as the privacy and personal preferences. Therefore, the automation of conference calling needs the distributed processing task where a separate calendar management process is associated for increasing the reliability and inherent parallelism. This paper describes in detail the design and implementation issues of a multiple-agent system for conference calling that allows the convener and participants to minimize their efforts in creating a meeting. Our system is based on the client-sewer model. In the sewer side, a scheduling agent, a negotiating agent, a personal information managing agent, a group information managing agent, a session managing agent, and a coordinating agent are operating. In the client side, an interface agent, a media agent, and a collaborating agent are operating. Agents use a standardized knowledge manipulation language to communicate amongst themselves. Communicating through a standardized knowledge manipulation language allows the system to overcome heterogeneity which is one of the most important problems in communication among agents for distributed collaborative computing. The agents of our system propose the dates on which as many participants as possible are available to attend the conference using the forward chaining algorithm and the back propagation network algorithm.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.30-41
• /
• 2002

We focus on the mobile agents which are considered as new paradigm to solve information retrieval of large volumes of data in the distributed and heterogeneous environment. The mobile agent moves the computation to data instead of large volumes of data to computations. In this paper, we propose an information retrieval model, which can effectively search data in the distributed and heterogeneous environment, using mobile agents. Our model is applied to the design and implementation of an Q&A(Question and Answer) retrieval system. Our Q&A retrieval system, called QASSMA(Q&A Search System using Mobile Agents), uses mobile agents to retrieve articles from Q&A boards and newsgroups that exist in the heterogeneous and distributed environment. QASSMA has the following features and advantages. First, the mobile retrieval agent moves to the destination server to retrieve articles to reduce the retrieval time by eliminating data traffics from the server to the client host. Also it can reduce the traffic that was occurred in the centralized network system, and reduce the usage of resources by sending its agent and running in the destination host. Finally, the mobile retrieval agent of QASSMA can add and update dynamically the class file according to its retrieval environment, and support other retrieval manner. In this paper, we have shown that our Q&A retrieval system using mobile agents is more efficient than the retrieval system using static agents by our experiments.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.297-302
• /
• 2008

In case of display a lot of information from mobile devices, those systems are being developed that display the information from mobile devices on remote devices such as TV using the mobile devices as remote controllers because it is difficult to display a lot of information on mobile devices due to their limited bandwidth and small screen sizes. A lot of cost is required to design and develop interfaces for these systems corresponding to each of remote display devices. In this paper, a mobile environment based remote display system for displays at real times is proposed for continuous monitoring of status data for unique 'Mote IDs'. Also, remote data are collected and monitored through sensor network devices such as ZigbeX by applying status perception based remote displays at real times through processing ubiquitous computing environment data, and remote display applications at real times are implemented through PDA wireless mobiles. The system proposed in this paper consists of a PDA for remote display and control, mote embedded applications programming for data collections and radio frequency, server modules to analyze and process collected data and virtual prototyping for monitoring and controls by virtual machines. The result of the implementations indicates that this system not only provides a good mobility from a human oriented viewpoint and a good usability of accesses to information but also transmits data efficiently.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.501-510
• /
• 2006

Software streaming allows the execution of stream-enabled software on desktop or portable computing devices like PC, PDA, laptop, cellular phone, etc., even while the transmission/streaming from the server may still be in progress. In this paper, we present an efficient streaming system called Software On-Demand(SOD) streaming system to transmit stream-enabled applications in addition to automatic installation of program registry, environment variables, configuration files, and related components. In particular, we design and implement a SOD system in Linux to provide the user with the instant look-and-click software execution environment such that software download and installation are internally proceeded in a completely user-transparent way. Therefore, the SOD system relieves the user from the tricky, failure-prone installation business. In addition, the software developer now obtains a new, powerful means to advertise and propagate their software products since the user can use software packages via user-friendly UI window or web browser by look-and-click interactive operation. In the paper, we also make a couple of SOD streaming experiments using a spectrum of popular softwares. Based on the analysis of the experiment results, we also propose two performance improvement schemes.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.699-708
• /
• 2002

Since various terminals and different networks get involved in playing of a multimedia presentation, the case that the presentation QoS at a destination should be different from the QoS of multimedia data at a source occurs frequently. For playing the multimedia presentation, the multimedia data at a source should be transcoded into the multimedia data satisfying the QoS required at the terminal. The problem of generating the transcoding path is that, for a given multimedia presentation, different transcoding paths depending the terminal and networks should be generated. That is, a fixed transcoding path cannot be applied to a multimedia presentation. Instead, whenever the terminal and network to play the presentation get determined, a proper transcoding path should be regenerated automatically. In this paper, the algorithm for generating the transcoding path and the method for checking the playability of the generated path are proposed. The generating algorithm adopted the technique of Context Free Grammar in describing the set of transcoding resources and a user's transcoding rules in order to utilize the well-known compiler techniques. For the playability check, a method of computing the transcoding time and the delay time between data units are proposed. Finally all the proposed methods were implemented in the stream engine, called Transcore and the presentation-authoring tool, called VIP, we had developed. And the test results with a sample scenario were presented at the last.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.1-13
• /
• 2009

Intrusion detection is a process that identifies the attacks and responds to the malicious intrusion actions for the protection of the computer and the network resources. Due to the fast development of the Internet, the types of intrusions become more complex recently and need immediate and correct responses because the frequent occurrences of a new intrusion type rise rapidly. Therefore, to solve these problems of the intrusion detection systems, we propose a sequential pattern miner for analysis of the alert data in order to support intelligent and automatic detection of the intrusion. Sequential pattern mining is one of the methods to find the patterns among the extracted items that are frequent in the fixed sequences. We apply the prefixSpan algorithm to find out the alert sequences. This method can be used to predict the actions of the sequential patterns and to create the rules of the intrusions. In this paper, we propose an extended prefixSpan algorithm which is designed to consider the specific characteristics of the alert data. The extended sequential pattern miner will be used as a part of alert data analyzer of intrusion detection systems. By using the created rules from the sequential pattern miner, the HA(high-level alert analyzer) of PEP(policy enforcement point), usually called IDS, performs the prediction of the sequence behaviors and changing patterns that were not visibly checked.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.19-31
• /
• 2014

In this paper, a parallel backoff delay procedure on multiple IEEE 802.15.4 channels and a channel searching method considering the frequency spectrum of WiFi traffic are studied for IEEE 802.15.4 nodes to avoid the interference from WiFi traffic. In order to search the channels being occupied by WiFi traffic, we analyzed the methods measuring the powers of adjacent channels simultaneously, checking the duration of measured power levels greater than a threshold, and finding the same periodicity of sampled RSSI data as the beacon frame by signal processing. In an wireless channel overlapped with IEEE 802.11 network, the operation of CSMA-CA algorithm for IEEE 802.15.4 nodes is explained. A method to execute a parallel backoff procedure on multiples IEEE 802.15.4 channels by an IEEE 802.15.4 device is proposed with the description of its algorithm. When we analyze the data measured by the experimental system implemented with the proposed method, it is observed that medium access delay times increase at the same time in the associated IEEE 802.15.4 channels that are adjacent each other during the generation of WiFi traffic. A channel evaluation function to decide the interference from other traffic on an IEEE 802.15.4 channel is defined. A channel searching method considering the channel evaluations on the adjacent channels together is proposed in order to search the IEEE 802.15.4 channels interfered by WiFi, and the experimental results show that it correctly finds the channels interfered by WiFi traffic.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.53-59
• /
• 2016

Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.33-39
• /
• 2016

With recent advances in sensor technology, CMOS-based semiconductor devices and networking protocol, the areas for application of wireless sensor networks greatly expanded and diversified. Such diversification of uses for wireless sensor networks creates a multitude of beneficial possibilities for several industries. In the application of wireless sensor networks for monitoring systems' data transmission process from the sensor node to the sink node, transmission through multi-hop paths have been used. Also mobile sink techniques have been applied. However, high energy costs, unbalanced energy consumption of nodes and time gaps between the measured data values and the actual value have created a need for advancement. Therefore, this thesis proposes a new model which alleviates these problems. To reduce the communication costs due to frequent data exchange, a State Prediction Model has been developed to predict the situation of the peripheral node using a geographic autocorrelation of sensor nodes constituting the wireless sensor networks. Also, a Risk Analysis Model has developed to quickly alert the monitoring system of any fatal abnormalities when they occur. Simulation results have shown, in the case of applying the State Prediction Model, errors were smaller than otherwise. When the Risk Analysis Model is applied, the data transfer latency was reduced. The results of this study are expected to be utilized in any efficient communication method for wireless sensor network monitoring systems where all nodes are able to identify their geographic location.