• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.297-309
• /
• 2007

We introduce two distributed IP address auto-configuration mechanisms for mobile ad hoc networks. RADA (Random ADdress Allocation) is based on random IP address selection, while LiA (Linear Address Allocation) assigns new addresses sequentially, using the current maximum IP address. An improved version of LiA, hewn as LiACR (Linear Address Allocation with Collision Resolution) further reduces the control overhead. Simulation results show that, when many nodes join a network during a short period, RADA assigns addresses more quickly than LiA and LiACR. However, RADA uses the address space less efficiently, due to its random allocation of IP addresses. Hence, RADA is particularly useful in battlefield scenarios or rescue operations where fast setup is needed, while LiA and LiACR are more suitable for ad hoc networks that are moderate, confined and subject to some form of governance control, such as that orchestrated by a wireless service provider.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.4
• /
• pp.203-210
• /
• 2017

Address resolution protocol (ARP) is used for binding a logical address to a physical address in many network technologies. However, since ARP is an stateless protocol, it always abused for performing ARP-based attacks. Researchers presented many technologies to improve ARP protocol, but most of them require a high implementation cost or scarify the network performance for improving security of ARP protocol. In this paper, we present an address auto-resoultion (AAR) network system to neutralize the ARP-based attacks. The AAR turns off the communication function of ARP messages(e.g. request and reply), but does not disable the ARP table. In our system, the MAC address of destination was designed to be derived from destination IP address so that the ARP table can be managed statically without prior knowledge (e.g., IP and MAC address pairs). In general, the AAR is safe from the ARP-based attacks since it disables the ARP messages and saves network traffics due to so.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.4 s.334
• /
• pp.7-14
• /
• 2005

Earlier researches have typically concentrated on discovering IP network topology, which implies that the connectivity of all Ethernet devices is ignored. But automatic discovery of Physical topology Plays a crucial role in enhancing the manageability of modem Metro Ethernet mesh networks due to the benefits of Ethernet services, including: Ease of use, Cost Effectiveness and flexibility. Because of proprietary solutions targeting specific product families and related algorithm which depends on Layer 2 forwarding table information it is impossible to discover physical topology in the Ethernet mesh networks. To cope with these shortcomings, in this paper we propose a novel and practical algorithmic solution that can discover accurate physical topology in the Ethernet mesh networks. Our algorithm divides the Ethernet mesh networks into bridged networks and host networks and those bridges located in boundary are named edge bridges. Our algorithm uses the standard spanning tree protocol MIB information for the bridged networks and uses the standard Layer 2 forwarding table MIB information for the host networks. As using the standard MIB information to discover physical topology we can offer interoperability guarantee in the Ethernet mesh networks composed of the various vendors' products.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.111-117
• /
• 2004

In distributed-computing environments, there is a strong demand for the authentication and the access control of distributed-shared resources. I have presented role-based access control (RBAC) concept that is in the spotlight recently. RBAC model shows the standardized access control of complicated organization's resources. In RBAC, senior role has junior role's permission by virtue of role hierarchy. But, junior role cannot perform the permission, which is granted to the senior or other role groups. Inheritances of permissions in role hierarchies are static. In order to tackle this problem, I propose a dynamic role assignment, which classified into passive role assignment and active role assignment, and design dynamic role assignment protocol and implement role assignment server.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.201-210
• /
• 2009

Studies on human-centered services are approaching their highest peak with the emergence of a new concept of the network environment, a ubiquitous environment. Among these ubiquitous service technologies, services related to health care are very closely related to the current social environment. In this paper, With social aging and changes in ubiquitous IT environment, studies on health care, which is among the essential application services and which has been defined as a key application technology, and studies related to it have been conducted. In addition, healthcare services, which are essentially applicable to the ubiquitous environment, were suggested by analyzing existing healthcare studies and drawing from them the requirements for such. This paper proposes management protocol for serious case except from health care research. This system is constructed database using RFID, it has location information. It provides procedures to consistently monitor the status of patients and process the outcome in real-time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.377-380
• /
• 2010

MANET(Mobile Ad-hoc Network) has been proposed as a infrastructure-less network using distributed algorithm for remote environment monitoring and control. The mobility of MANET would make the topology change frequently compared with a static network and a node is resource-constrained. Hence, to improve the routing protocol in MANET, energy efficient routing protocol is required as well as considering the mobility would be needed. In this paper, we extend RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure by a modifying the level of cluster. We call this network protocol CACH-RODMRP. Our contribution consists estimating the optimal level of clustering depth with considering node position and reducing the network residual energy. The simulation results of proposal algorithm show that the energy is significantly reduced compared with the previous clustering based routing algorithm for the MANET.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.774-784
• /
• 2009

A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at each node to prolong the network lifetime. To improve the sensitivity of wireless sensor networks, an efficient scheduling algorithm and energy management technology for minimizing the energy consumption at each node is desired. ill this paper, we propose energy-aware routing mechanism for maximum lifetime and to optimize the solution quality for sensor network maintenance and to relay node from its adjacent cluster heads according to the node"s residual energy and its distance to the base station. Proposed protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of where the sink is located outside or inside the cluster. Simulation results of proposed scheme show that our mechanism balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime. To verify propriety using NS-2, proposed scheme constructs sensor networks adapt to current model and evaluate consumption of total energy, energy consumption of cluster head, average energy dissipation over varying network areas with HEED and LEACH-C.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.688-696
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) is a network localized mobility management protocol that is independent of global mobility management protocols. In a single mobility domain (LMD), the mobile node (MN) is not involved in any IP mobility-related signaling and uses only its PMIPv6 home address for all its communication. Subsequently, when the MN moves into another LMD, the MN must change its PMIPv6 home address. In such a circumstance, host-based mobility signaling is activated. Thus, the nature of the network-based mobility of the PMIPv6 cannot be retained. Additionally, if the MN does not support global mobility, it cannot maintain communication with its correspondent node (CN). In this paper, we propose a solution for global mobility support in PMIPv6 networks, called Global-PMIPv6 that allows current communication sessions of a MN without mobility protocol stacks to be maintained, even when the MN moves into another LMD. Thus, Global-PMIPv6 retains the advantages of the PMIPv6 for global mobility support. We then evaluate and compare network performance between our proposed solution and PMIPv6.

• Convergence Security Journal
• /
• v.19 no.5
• /
• pp.19-24
• /
• 2019

It is impossible to apply the routing protocol in the wired environment because MANET consists of only mobile nodes. Therefore, routing protocols considered these characteristics are required. In particular, if malicious nodes are not excluded in the routing phase, network performance will be greatly reduced. In this paper, we propose intrusion detection technique based on region to improve routing performance. In the proposed technique, the whole network is divided into certain areas, and then attack detection within the area using area management node is performed. It is a proposed method that can detect attack nodes in the path through cooperation with each other by using completion message received from member nodes. It also applied a method that all nodes participating in the network can share the attack node information by storing the detected attack node and sharing. The performance evaluation of the proposed technique was compared with the existing security routing techniques through the experiments and the superior performance of the proposed technique was confirmed.