• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.860-863
• /
• 2005

Ad-Hoc networks are a new generation of networks offering unrestricted mobility without any underlying infrastructure. Primary applications of Ad-Hoc networks are in military, tractical and other security sensitive operations, where the environment is hostile. Hence, security is a critical issue. In this paper, we ahve identified certain misbehaviors caused by mallicious node for reactive routing protocol. We also discuss the intrusion detection and intrusion prevention model to prevent several identified attacks in the networks

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.479-481
• /
• 2003

최근에 유.무선 환경에서의 통합적인 망 구성이 이루어지고 있다. 최근 무선 환경에서의 단말기간의 라우팅 기능을 제공하는 Ad Hoc 네트워크에 대한 관심이 고조되고 있으며 이에 대한 많은 연구가 수행되고 있다. 본 연구에서는 Ad Hoc 네트워크에서의 라우팅 관련 문제들을 살펴보고, 문제를 해결하기 위한 방안으로 ARAN 프로토콜을 이용하여 이동 노드에서 상호간의 인증에 필요한 보안 프로토콜을 연구하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.191-194
• /
• 2006

본 논문에서는 이동 통신망하에서의 Ad Hoc 네트워크에서의 프로토콜을 분석 비교하고, 유비쿼터스 환경하에서의 Ad Hoc 환경하에서의 정보보안 대책을 분석하고자 한다. 이러한 분석을 통하여 차세대 멀티미디오통신하에서의 유선망과 이동망과의 정보를 교환할 대 발생할 수 있는 데이터의 정보를 보호 할 수 있는 알고리즘과 프로토콜을 제안하고 분석한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.745-747
• /
• 2001

인터넷과 개인휴대통신의 발달과 더불어 유.무선 인증서비스는 PKI틀 기반으로 다양하게 구현되고 있다. 그러나 유.무선이 혼재된 형태의 통신망에서 Client간의 통신에 필요한 인증체계에 대한 연구는 초기단계이며 특히, Ad Hoc 통신망과 같이 가변적인 Topology를 형성하는 특수한 상황에서 지속적인 인증서비스를 제공할 수 있는 연구는 미미한 실정이다. 국가비상사태와 같은 긴급을 요하는 상황에서 신속히 구성되는 무선 Ad Hoc 통신망을 기반으로 한 인증체계를 구축하기 위하여 인증서 검증모델을 중심으로 유.무선PKI 통합모델을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.495-502
• /
• 2013

In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.49-56
• /
• 2009

In this paper, we propose a method of energy level, node degree and selection information based CDS(Connected Dominating Set) construction algorithm for more efficient routing in ad-hoc wireless networks. Constructing CDS in ad-hoc wireless network, it is necessary to make more efficient algorithm that is faster, more simple and has low power consumption. A CDS must be minimized because nodes in the CDS consume more energy in order to handle various bypass traffics than nodes outside the set. It is better not to reconstruct CDS after constructing the most efficient CDS. To overcome this problem, we proposed the CDS construction algorithms based on EL+ND+Sel method. We compared and estimated the performance in each situation of EL + ND and EL + ND + Sel.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.356-363
• /
• 2012

Power Aware Routing Protocol of MANET(Mobile Ad-hoc Network) minimized the power consumption of each node and helped to extend the lifetime of the network. But due to the nature of the protocol, it tends to increase the transmission delay, so multimedia transmissions were difficult to be applied. In this paper, a delay-power aware routing protocol is proposed considering the delay transmission delay that can be applied to ad hoc network. The proposed protocol consider two conflicting index, transmission delay and power consumption at the same time, maintaining a certain level of delay transmission delay while minimizes the power consumption. It is observed from the simulation results compared to not-considering delay transmission delay that the proposed protocol decrease transmission delay by 30% while the power consumption less than 10% increase.

• 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 KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1177-1188
• /
• 2004

Multi-agent systems have been developed for supporting intelligent collaboration of distributed and independent software entities and are be-ing widely used for various applications. For the collaboration among agents, conversation policies (or interaction protocols) mutually agreed by agents are used. In today's dynamic electronic market environment, there can be frequent changes in conversation policies induced by the changes in transaction methods in the market, and thus, the importance of ad hoc conversation policies is increasing. In existing agent platforms, they allow the use of only several standard or fixed conversation policies, which requires inevitable re implementation for ad hoc conversation policies and leads to inefficiency and intricacy. This paper designs an agent platform that supports ad hoc conversation policies and presents the prototype implementation. The suggested system includes an exchangeable and interpretable conversation policy model, a meta conversation procedure for exchanging new conversation policies, and a mechanism for performing actual transactions with exchanged conversation policies in run time in an adaptive way.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.