• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.313-317
• /
• 2005

The network ingress filtering is a simple and efficient method for preventing IP source spoofing of fixed nodes. Since mobile hosts cannot communicate with its correspondent nodes if the network ingress filtering is configured in mobile IPv4 network, reverse tunneling was considered as a method for avoiding network ingress filtering. But, unfortunately this method does not solve IP source spoofing of mobile nodes. In this paper, we propose a simple and efficient method for preventing IP source spoofing of mobile nodes assuming that only the mobile hosts connected to foreign agents and the network that foreign agent manages is small.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.455-464
• /
• 2006

In multi-regional mobile agent computing environments, spatial replication-based approach may be used as a representative mobile agent fault-tolerance technique because it allows agent execution to make progress without blocking even in case of agent failures. However, to apply this approach to real mobile agent-based computing systems, it is essential to minimize the overhead of locating and managing mobile agents replicated on each stage. This paper presents a new mobile agent location management protocol SRLM to solve this problem. The proposed protocol allows only the primary among all the replicated workers of each stage to register with its regional server and then, significantly reduces its location updating and message delivery overheads compared with the previous protocols. Also, the protocol addresses the location management problem incurred by electing the new primary among the remaining workers at a stage in case of the primary worker's failure.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.175-186
• /
• 2003

Mobile clients like a PDA need a cache and a spatial index to search and access map data efficiently. When a server transmits spatial objects to a mobile client which has a low storage capacity, some of them can be duplicated in a cache of the mobile client. Moreover, the cost for strong added data in the cache and reconfiguring spatial index is very high in the mobile client with low computing power. The scheme for processing duplicated objects and disturbing tasks of the mobile client which has low computing power is needed. In this paper, we classfy the method for strorng duplicated objects and present the scheme for the both caching objects and reconfiguring a spatial index of cached objects using the clipping technique. We propose the caching system based on an agent in order to distribute the overhead of a mobile client as well as to provide efficiently map services. We design and implement it, and evaluate the performance.

• Convergence Security Journal
• /
• v.3 no.3
• /
• pp.19-24
• /
• 2003

This research presents the development of a certain highly efficient model for group security policy negotiation using mobile agents in the IPSec environment. The conventional IP security systems has some problems. A drawback to these systems is that the required policy between each security area is different. Another problem is not possible to guarantee whether a packet is transmitted through the same path by both directions and is protected by the same policy due to the topology of the network. Unlike conventional systems, the model developed herein can be resolved by using a mobile agent technology. If each domain needs a negotiation of security policy, a mobile agent manages the result of the negotiation in the form of a passport and guarantees the authentication and reliability each other by using the passport.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.439-450
• /
• 2001

Mobile agent is one of the promising ways of overcoming network load and latency. It is also a new software paradigm including those concepts of client/server, applet/servelet, and code-on-demand. In this paper, a new mobile agent concept with flexible replay scheme is proposed, which can deal with embarrassing situation when replying results should be accomplished in various distributed applications. For example, they are 1) a burden of bulky result, 2) a need of different replay scheme dependent on work type, 3) connection failure to the target node, and 4) a need of fast migration to next node to keep the itinerary. Regarding the source node, there may be another situation that it wants to be aware of whether its wi가 is completed or not. Three kinds of reply schemes are proposed for dealing flexibly with such situations. They are based on priority reply list where nodes to be replied are stored according to their priorities. An experimental supply chain management model using the proposed reply schemes is designed and implemented. It is one of good distributed applications appropriate for our reply schemes, because it requires different reply schemes according to work types and it is important to gather required information in time.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.131-137
• /
• 2000

The communication and collaboration of mobile agents are efficient in doing information processing in the Internet. Therefore, this paper proposes an efficient communication mechanism that support to inter-agent communications and collaborations. For the remark mentioned above, a mobile agent system provides an indirect meeting mechanism as well as an extended information pool, which has an effect on decreasing network bandwidth. In addition, some proposed communication methods can support to message multicasting so that those are effectively adapted for a model of group agent. Finally, the proposed mechanism is implemented and analyzed in the MAS, a mobile agent system model developed by the Java language.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.97-108
• /
• 2010

The data security of free-roaming mobile agent is a problem which hasn't been resolved to the mobility and inter-host mapping. totally, especially in theaspect of keeping away truncation attacks. Therefore, when the agent is utilized for user oriented applied technique, the secure execution guarantee of agent is essential. In this paper, it guarantees safe execution from security threats generated by malicious host during the agent's execution. And the secure execution guarantee mechanism of agent is proposed from favorable host is maliciously abused by attacker. Thus, the execution trace protocol mechanism proposed as secure mobile agents execution guarantee. As security analysis of the safety analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4372-4388
• /
• 2014

Robotic sensor network (RSN) contains mobile sensors and robots providing feasible solution for many multi-agent applications. One of the most critical issues in RSN and its application is how to effectively assign tasks. This paper presents a novel connectivity preserving hybrid task allocation strategy to answer the question particularly for RSN. Firstly, we model the task allocation in RSN to distinguish the discovering and allocating processes. Secondly, a fully distributed simple Task-oriented Unoccupied Neighbor Algorithm, named TUNA, is developed to allocate tasks with only partial view of the network topology. A connectivity controller is finally developed and integrated into the strategy to guarantee the global connectivity of entire RSN, which is critical to most RSN applications. The correctness, efficiency and scalability of TUNA are proved with both theoretical analysis and experimental simulations. The evaluation results show that TUNA can effectively assign tasks to mobile robots with the requirements of only a few messages and small movements of mobile agents.

• Journal of Convergence for Information Technology
• /
• v.9 no.6
• /
• pp.13-18
• /
• 2019

This paper proposes efficient and secure two-way authentication protocol for binding update messages between mobile devices and home agents / correspondent nodes in IoT and Mobile IPv6 (MIPv6) environments with limited computing power and resources. Based on the MIPv6 message exchange, the proposed protocol satisfies both the authentication and the public key exchange optimized for both sides of the communication with minimum modification. In the future, we will carry out a performance analysis study by implementing the proposed protocol in detail.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.2
• /
• pp.107-114
• /
• 2024

Mobile ad hoc networks represent self-configuring networks of mobile devices that communicate without relying on a fixed infrastructure. However, traditional routing protocols in such networks encounter challenges in selecting efficient and reliable routes due to dynamic nature of these networks caused by unpredictable mobility of nodes. This often results in a failure to meet the low-delay and low-energy consumption requirements crucial for such networks. In order to overcome such challenges, our paper introduces a novel multi-objective and adaptive routing scheme based on the Q-learning reinforcement learning algorithm. The proposed routing scheme dynamically adjusts itself based on measured network states, such as traffic congestion and mobility. The proposed approach utilizes Q-learning to select routes in a decentralized manner, considering factors like energy consumption, load balancing, and the selection of stable links. We present a formulation of the multi-objective optimization problem and discuss adaptive adjustments of the Q-learning parameters to handle the dynamic nature of the network. To speed up the learning process, our scheme incorporates informative shaped rewards, providing additional guidance to the learning agents for better solutions. Implemented on the widely-used AODV routing protocol, our proposed approaches demonstrate better performance in terms of energy efficiency and improved message delivery delay, even in highly dynamic network environments, when compared to the traditional AODV. These findings show the potential of leveraging reinforcement learning for efficient routing in ad hoc networks, making the way for future advancements in the field of mobile ad hoc networking.