• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.608-615
• /
• 2009

As RFID tag prices have rapidly been declining because of the advance of RFID technology, each tag is attached to an individual item, not a packing box only, for managing the item much more precisely. However, some mechanisms are essential to handle a very large amount of tag data quickly because readers and middlewares processing RFID data have limited hardware resources. In this paper, we design and implement a new mobile agent-based distributed software tools to satisfy this requirement efficiently. These tools provide a convenient environment enabling required data to be pre-processed repeatedly in transit by transferring a mobile agent including its specified data collection policy to numerous mobile readers. This behavior can significantly reduce the elapsed time required for processing huge volumes of tag data at the readers and middlewares with their very high recognition rates compared with the existing one to process the data by fixed readers after having arrived at the destination

• Convergence Security Journal
• /
• v.4 no.3
• /
• pp.47-55
• /
• 2004

Currently used to manage a whole bunch of networks is the Client/Server Network Management Technique in which a central manager system supports a number of managed ones. Unfortunately it has a big drawback: wasting network resources, most of all bandwidth, which is mainly caused by too much traffic between the central manager system and the managed ones. In a way to overcome this weak point, we have designed a new type of system, a Configuration Management System (CMS), based on code mobility which has been used in distributed network management systems. In this thesis we have compared the CMS with the currently used network management system, identified class to make Mobile Code, and analyzed the techniques of other network management systems in order to verify the validity of the new system.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.31-38
• /
• 2004

In mobile agent environments, migration of an agent occurs continuously due to the mobility of agents. So cascaded delegation can occur among places for delegating the privilege to execute the agent. Because the existing delegation scheme considers only the delegation between two places that participate in migration of an agent, it does not support secure cascaded delegation. In this paper, we propose a cascaded delegation scheme that provides agents with secure cascaded delegation in mobile agent environments. Depending on the trust-relationship among places, the proposed scheme achieves the goal by nesting each delegation token or by nesting only initial token signed by creator of the agent within the signed part of the next immediate delegation token. And we prove that the proposed scheme is secure against the attack of replaying a message and the attack of substituting a delegation token.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1C
• /
• pp.25-34
• /
• 2004

In mobile agent environments, cascaded delegations among places occur frequently due to the mobility of agents. Cascaded delegation in mobile agent environments can be defined as the process whereby the delegated place delegates the rights of the delegating place further. The representative study for delegation in mobile agent environments is Berkovits et al.'s study. Their study only defines the messages that is sent between the place executing the agent and the place where the agent migrates. Because their study considers only the delegation between two places which participate in migration of an agent, it is inadequate in the situation that the cascaded delegation is necessary. In other words, the relationships among the messages sent from and to places is necessary. However, their study does not exist the relationships. In this paper, we propose a delegation scheme that provides agents with secure cascaded delegation. The proposed scheme achieves the goal by nesting each delegation token within the signed part of the next immediate delegation token. We prove that the proposed scheme is secure against the attack of replaying a message and of substituting a delegation token.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.49-58
• /
• 2007

Hierarchical Mobile IPv6 (HMIPv6) has been proposed by Internet Engineering Task Force (IETF) to compensate for such problems as handover latency and signaling overhead in employing Mobile IPv6 (MIPv6). HMIPv6 supports micro-mobility within a domain and introduces a new entity, namely mobility anchor point (MAP) as a local home agent. However, HMIPv6 causes load concentration at a particular MAP and longer handover latency when inter-domain handover occurs. In order to solve such problems, this paper establishes a virtual domain (VD) of a higher layer MAP and proposes a MAP changing algorithm in which the routing path changes between mobile node (MN) and correspondent node(CN) according to the mobile position and the direction of the MN before inter-domain handover occurs. The proposed algorithm not only enables complete handover binding-update of the on-link care of address (LCoA) only when inter-domain handover occurs, but concentrated load of a particular MAP is distributed as well. This is because the MNs registered with higher layer MAP and lower layer MAP coexist in the VD. We simulate the performance of the proposed algorithm and compare with HMIPv6.

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

GPS/GIS and RFID technologies have been changing the paradigm af our society toward ubiquitous era. Especially, geographically distributed mobile agents with transporting objects need to be automatically recognizable and traceable under certain conditions. To do this, fundamental theories and technologies are required to specify and verify spatial and temporal behaviors of agents on geographical space. This paper presents a new formal method, called Calculus of Real-Time Distribution, Mobility, and Interaction (CaRDMI), for this purpose. For specification, CaRDMI defines a map, mobile agents with transporting objects. The movement of on agent is represented by a path on the map, consisting of a list of nodes and a list of edges with spatial and temporal constraints. Interactive constraints among agents are represented by synchronization modes on objects at nodes. These constraints are distinguishable features of CaRDMI from other methods. Especially, many-to-many timed synchronization constraints are noticeable. For verification, CaRDMI presents the spatial, temporal and interactive deduction rules and the spatial and temporal equivalence relations.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.48-52
• /
• 2005

The Mobile agent-based distributed systems become obtaining significant popularity as a potential vehicle to allow software components to be executed on heterogeneous environments despite mobility of users and computations. However, as these systems generally force mobile agents to use only common functionalities provided in every execution environment, the agents may not access environment-specific resources. In this paper, we propose a new framework using Aspect Oriented Programming technique to accommodate a variety of static resources as well as dynamic ones whose amount is continually changed at runtime even in the same execution environment. Unlike previous works, this framework divides roles of software developers into three groups to relieve application programmers from the complex and error prone parts of implementing dynamic adaptation and allowing each developer to only concentrate on his own part. Also, the framework enables policy decision makers to apply various adaptation policies to dynamically changing environments for adjusting mobile agents to the change of their resources.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.5
• /
• pp.81-88
• /
• 2007

To support the movement of a mobile network consisting of several mobile nodes, the IETF NEMO working group proposed NEMO basic support protocol using bi-directional tunneling between the home agent and the mobile router. Since NEMO basic support protocol is based on bi-directional tunneling, all communications to and from mobile nodes are suffer from inefficient routing all the cases. To solve the routing inefficiency problem, several proposals are proposed. However, those proposals results in new problems, such as binding update storm and changes in existing protocol. Especially, binding update storm problem may cause the delay in binding update, this subsequently causes the difficulty for a real time service and the handoff delay on the movement of mobile network. In this paper, we propose a new binding update scheme which reduces binding update latency and the handoff delay through the distribution of the transmission time of binding update messages. The performance of the proposed scheme is also evaluated to demonstrate its efficiency. Simulation results show that the proposed scheme can efficiently reduce the binding update latency.

• Journal of Soil and Groundwater Environment
• /
• v.15 no.5
• /
• pp.23-31
• /
• 2010

For an efficient remediation of Pb-contaminated soil (S-1) in a clay shooting range, a soil washing test was performed with mineral acid, organic acid, chelating agent, and chloride. The Pb extraction efficiency of extractant (0.1 M) used in the washing test showed the order of HCl > $Na_2$-EDTA > NTA > DTPA > citric acid > malic acid > succinic acid > acetic acid > $CaCl_2$ > $MgCl_2$, for S-1 soil. As compared to initial Pb concentration, extraction efficiency by the concentration of extractant was 93.35%, 80.80%, 73.92%, and 24.57% in S-1 soil for HCl (0.5 M, pH 1.10), $Na_2$-EDTA (0.01 M, pH 3.99), citric acid (0.5 M, pH 1.27), and $MgCl_2$ (0.1 M, pH 8.82), respectively. S-1 soil had 56.83% of residue form and 43.17% of non-residue form (18.04% of exchangeable form), respectively. Although the concentrations of these fractions sharply decreased after HCl washing, since the exchangeable forms with relatively large mobility are still distributed as high as 18.78% (to Pb total content in residual soils) in S-1 soil, it is necessary to devise a proper management plan for residual soils after soil washing application.

• Journal of Life Science
• /
• v.31 no.1
• /
• pp.59-65
• /
• 2021

Prunus mume Sieb. et Zucc is distributed throughout Asia and has traditionally been used as medicine and food. P. mume is known to contain large amounts of various organic acids, minerals, and phenol components. To date, the trend of P. mume research has focused only on the effects of antioxidant, anticancer and antibacterial, with only a few studies have focused on angiogenesis. Angiogenesis is a common characteristic of metastatic cancer through which oxygen and nutrients are delivered to the cells and tissues. In the present study, angiogenesis-inhibiting activity was investigated by evaluating the total polyphenol and flavonoid contents of the P. mume butanol fraction (PBF) and their ability to inhibit VEGF-induced human umbilical vein endothelial cells (HUVECs) proliferation, migration, invasion, and capillary formation. The polyphenols (12.81 mg GAE/g) and flavonoids (28.4 mg QE/g) of the PBF exhibited high antioxidant activity. The results of this study showed that PBF did not inhibit the proliferation of HUVECs at concentrations of 25-200 ㎍/ml and did not exhibit toxicity to normal cells. However, PBF inhibited the VEGF-induced mobility, invasion, and capillary formation of HUVECs. These results show that PBF inhibits the angiogenesis of HUVECs induced by VEGF. Therefore, PBF could serve as a therapeutic agent for the inhibition of angiogenesis.