• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.197-206
• /
• 2003

With the growing usage of the networks, the world-wide Internet has become the main means to exchange data and carry out transactions. It has also become the main means to attack hosts. To solve the security problems which occur in the network such as Internet, we import software products of network security elements like an IDS (Intrusion Detection System) and a firewall. In this paper, we have designed and constructed the General Simulation Environment of Network Security model composed of multiple IDSes and a firewall which coordinate by CNP (Contract Net Protocol) for the effective detection of the intrusion. The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls tie execution of agents or a contractee, who performs intrusion detection. In the Network Security model, each model of simulation environment is hierarchically designed by DEVS (Discrete EVent system Specification) formalism. The purpose of this simulation is to evaluate the characteristics and performance of CNP architecture with rete pattern matching algorithm and the application of rete pattern matching algorithm for the speeding up the inference cycle phases of the intrusion detection expert system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.4
• /
• pp.90-99
• /
• 2002

Grid makes it possible to cooperate with other network area by sharing and using distributed resources. In order to manage effectively large-scale Grid network resources, Grid NOC needs monitoring architecture that can manage distributed resources in one time. Being restricted within specific managing area conventional network management system has limitation in extension of managing area and in general management of heterogeneous resource. In this paper, we design a monitoring architecture that can take in the situation and has scalability. In the monitoring architecture the network areas publish information in a common directory service, and then Grid NOC can connect to the network areas directly by using this information. Therefore, it makes us possible to manage overall large-scale resource of Grid network reducing load.

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

Mobile agent technology has been the subject of much attention in the last few years, mainly due to the proliferation of distributed software technologies combined with the distributed AI research field. In this paper, we present a design of communication networks of agents that cooperate with each other for forwarding messages to the specific mobile agent in order to make the overall system location transparent. In order to make the material accessible to general intelligent system researchers, we present the general ideas abstractly in terms of the graph theory. In particular, a proxy network is defined as a directed acyclic graph satisfying some structural conditions. In turns out that the definition ensures some kind of reliability of the network, in the sense that as long as at most one proxy agent is abnormal, there agent exists a communication path, from every proxy agent to the target agent, without passing through the abnormal proxy. As the basis for the implementation of this scheme, an appropriate initial proxy network is specified and the dynamic nature of the network is represented by a set of graph transformation rules. It is shown that those rules are sound, in the sense that all graphs created from the initial proxy network by zero or more applications of the rules are guaranteed to be proxy networks. Finally, we will discuss some implementation issues.

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

Distributed Autonomous Robotic System (DARS) is defined as a system that independent autonomous robots in the restricted environments infer their status from pre-assigned conditions and operate their jobs through the cooperation with each other. In the DARS, a robot contains sensor part to percept the situation around themselves, communication part to exchange information, and actuator part to do a work. Especially, in order to cooperate with other robots, communicating with other robots is one of the essential elements. Because Bluetooth has many advantages such as low power consumption, small size module package, and various standard protocols, Bluetooth is rated as one of the efficient communicating technologies which can apply to small-sized robot system. In this paper, we will develop Bluetooth communicating system for autonomous robots such as DARS robots. For this purpose, The Bluetooth communication system must have several features. The first, this system should be separated from other robot parts and operate spontaneously and independently. In other words, this communication system should have the ability to organize and maintain and reorganize a network scheme. The next, this system had better support any kinds of standard interfaces in order to guarantee flexible applicability to other embedded system. We will discuss how to construct and what kind of procedure to develop the network system.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.13-21
• /
• 2005

Many multicast applications, such as video-on-demand and video conferencing, desire quality of service (QoS) support from an underlying network. The differentiated services (DiffServ) approach will bring benefits for theses applications. However, difficulties arise while integrating native IP multicasting with DiffServ, such as multicast group states in the core routers and a heterogeneous QoS requirement within the same multicast group. In addition, a missing per-flow reservation in DiffServ and a dynamic join/leave in the group introduce heavier and uncontrollable traffic in a network. In this paper, we propose a distributed and stateless admission control in the edge routers. We also use a mobile agents-based approach for dynamic resource availability checking. In this approach, mobile agents act in a parallel and distributed fashion and cooperate with each other in order to construct the multicast tree satisfying the QoS requirements.

• Journal of Information Technology Services
• /
• v.3 no.1
• /
• pp.101-115
• /
• 2004

The phrase "Ubiquitous Computing" has become popular ever since Mark Weiser used it in an article. It is to realize a computerized environment in which small computers are embedded and cooperate with each other. This environment will support many activities of our daily life. In a Ubiquitous Computing environment, various devices will be connected to the network from houses and buildings. Therefore it is necessary to ensure network security and to protect private data from tapping, falsification and the disguising of identity by others. This study reviews the Ubiquitous Computing technologies in detail and outlines the design concept of the Stream Cipher Algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.508-522
• /
• 2011

Femtocell is an economical solution to provide high speed indoor communication instead of the conventional macro-cellular networks. Especially, OFDMA femtocell is considered in the next generation cellular network such as 3GPP LTE and mobile WiMAX system. Although the femtocell has great advantages to accommodate indoor users, interference management problem is a critical issue to operate femtocell network. Existing OFDMA resource management algorithms only consider optimizing system-centric metric, and cannot manage the co-channel interference. Moreover, it is hard to cooperate with other femtocells to control the interference, since the self-configurable characteristics of femtocell. This paper proposes a novel interference-aware resource allocation algorithm for OFDMA femtocell networks. The proposed algorithm allocates resources according to a new objective function which reflects the effect of interference, and the heuristic algorithm is also introduced to reduce the complexity of the original problem. The Monte-Carlo simulation is performed to evaluate the performance of the proposed algorithm compared to the existing solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.222-236
• /
• 2019

Wireless content caching in small cell networks has recently been considered as a promising way to alleviate the congestion of the backhaul in emerging heterogenous cellular network. However, how to select files which are cached in SBSs and how to make SBSs work together is an important issue for cooperative cache research for the propose of reducing file download time. In this paper, a Cooperative-Greedy strategy (CGS) among cache-enabled small base stations (SBSs) in small cell network is proposed, in order to minimize the download time of files. This problem is formulated as a Chinese restaurant game.Using this game model, we can configure file caching schemes based on file popularity and the spectrum resources allocated to several adjacent SBSs. Both the existence and uniquencess of a Nash equilibrium are proved. In the theoretical analysis section, SBSs cooperate with each other in order to cache popular files as many as possible near UEs. Simulation results show that the CGS scheme outperforms other schemes in terms of the file-download time.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1593-1608
• /
• 2009

If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

• CELLMED
• /
• v.5 no.2
• /
• pp.11.1-11.5
• /
• 2015

Traditional East Asian Medicine (TEAM) prescriptions typically consist of several herbs based on the assumption that the herbs operate synergistically and/or cooperate on several related pathways simultaneously. This is a general concept that is widely accepted in TEAM, but it has not been tested systematically. To check this assumption statistically, we have text mined traditional Korean medicine text the Inje-ji(仁濟志, Collections of benevolent savings), a text that contains more than 5000 herb-cocktail prescriptions. We created herb-pairing network based on herb-herb pairing specificity and performed a systematic network analysis. Herbs were shown to be used selectively with other herbs and not randomly. Moreover, herb pairs were more specifically associated with symptoms than were single herbs. Single herbs and combinations of herbs specifically used for diabetes mellitus were successfully identified. As conclusion, herb-pairings in TEAM are not randomly constructed; instead, each herb was selectively used with other herbs. In terms of statistical significance, herb pairs were more specifically associated with symptoms than were single herbs alone. Collectively, these results suggest that it may be important to understand the interactions among multiple ingredients contained in herb pairs rather than trying to identify a single compound to resolve symptoms.