• Journal of the Korea Institute of Military Science and Technology
• /
• v.8 no.4 s.23
• /
• pp.68-76
• /
• 2005

In this paper, Ad-hoc network is a collection of mobile nodes without any wired infrastructure. Design of efficient routing protocols in ad-hoc network is a challenging issue. An AODV routing protocol for wireless ad hoc networks one that searches for and attempts to discover a route to some destination node. We propose a technique that reduce the number of Routing packet. Our technique use variable values reflecting the condition of network. This also contributes to improve throughput.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.269-272
• /
• 2003

Ad hoc 네트워크에 대한 상업적인 관심이 지속적으로 증가함에 따라, 최근 Ad hoc 네트워크에 QoS (Quality of Service)를 지원하기 위한 많은 연구가 이루어지고 있다. 지금까지의 연구는 대부분 QoS 기반 라우팅 프로토콜과 자원 예약 (resource reservation) 그리고 QoS MAC (Medium Access Control) 프로토콜에 관한 것이었다. Ad hoc 네트워크에 QoS를 제공하기 위해서는 위의 요소들이 상호 협력하여 동작하고 Ad hoc 네트워크의 특성이 충분히 고려된 005 모델에 관한 연구가 절실히 필요하다. 본 논문에서는 Ad hoc 네트워크에서 종단 사용자간 (end-to-end) 005를 제공하기 위한 서비스 모델의 설계와 구현방법에 대해 제안하였다.

• Electronics and Telecommunications Trends
• /
• v.18 no.2 s.80
• /
• pp.11-24
• /
• 2003

이동 Ad Hoc 네트워크는 고정적이고 계층적인 인프라스트럭처 네트워크와는 비교되는, 이동 노드만으로 구성된 자율적이고 수평적인 네트워크이다. 이동 Ad Hoc 네트워크의 이동 노드는 중재자의 도움 없이 능동적인 연결 설정이 가능하고 네트워크의 참여 또는 이탈이 자유로우며 에너지원의 공급이 제한되어 빈번하게 네트워크의 토폴로지를 변화시킨다. 이러한 망의 특성상 이동 Ad Hoc 네트워크 기술은 하위 계층의 전파 전파, 전파 간섭 및 전력 제어에서부터 링크 계층의 다중 접속 및 자원 할당, 네트워크 계층의 라우팅, 트랜스포트 계층의 연결 설정 및 유지, 그리고 보안 및 상위 계층 애플리케이션에 이르기까지 다양한 기술적 해결 요구사항을 갖는다. 본 고에서는 이러한 Ad Hoc 네트워크의 특징과 특성을 살펴보고 관련 주요 요소 기술과 과거부터 현재까지 이동 Ad Hoc 네트워크 기술 분야에서 진행되어온 연구동향을 살펴본다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.665-670
• /
• 2000

무선 ad-hoc 네트워크는 중앙의 특별한 관리 체계 없이 유선망과 기지국을 가지지 않는 이동 호스트로 구성된 네트워크를 말한다. 이러한 ad-hoc 네트워크는 잦은 망 구성의 변화, 라우터의 수, 사용 자원 등 기존 유선 네트워크와는 다른 특징들을 가지게 된다. 따라서 기존의 유선망에서 사용하던 라우팅 프로토콜을 ad-hoc 네트워크에 적용시키는 데에는 많은 문제점들이 발생한다. 이 논문에서는 ad-hoc 네트워크의 환경을 고려하여 적은 지연시간과 오버헤드를 발생시키는 MHCRP 라우팅 프로토콜을 제안하고자 한다. 제안하는 모델은 ad-hoc 네트워크 내의 이동 호스트들을 멀티 홉을 갖는 클러스터로 묶어, 클러스터 헤드로 하여금 자신의 멤버 호스트와 이웃 클러스터의 헤드의 정보를 유지하게 하여, 경로 설정에 대한 요구가 있을 때에 적은 지연 시간과 적은 패킷으로 목적지까지의 최단 경로를 설정할 수 있는 계층적인 경로 설정 방법을 제시한다.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.9-17
• /
• 2001

Ad-Hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communicate support facilities (such as base stations). The topology of an Ad-Hoc network changes due to the movement of mobile host. which may lead to sudden packet loss. Recently, a large amount of research has focused on the routing protocols needed in such an environment. but researches about Internet traffic performance analysis were unexhausted. Accordingly, we have simulated Ad-Hoc mobile network that using AODV routing protocol and Ad-Hoc mobile network topology size and node speed as simulation estimation-factor to analysis traffic performance. As the result of the simulation, we identify that TCP /Reno was more sensitive than TCP/Sack about node speed and a number of the node.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.45-53
• /
• 2004

Ad-Hoc network is wireless network architecture without infrastructure. We encounter new types of security problems in Ad-Hoc networks because such networks have little or no support from infrastructure. Thus, wireless communications need security mechanisms in order to guarantee the integrity and the privacy of the communication, as well as the authentication of the entities involved. Many practical systems have been proposed. The most familiar system is the Diffie-Hellman key distribution system. This algorithm allows the establishment of a cryptographic secret key between two entities. If more than two users want to compute a common key, then a group key agreement system is used. This paper discusses several group key agreement systems and presents two efficient fault tolerant methods to perform successful group key agreement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1188-1193
• /
• 2007

This paper proposes a secure data forwarding scheme on source routing-based ad-hoc networks. The scheme uses two hash-key chains generated from a trusted third party to generate Message Authentication Codes for data integrity The selected MAC keys are delivered to the ad-hoc node using a pre-shared secret between the trusted third party and a node. The proposed scheme does not require the PKI, or the provisioning of the pre-shared secrets among the ad-hoc nodes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.150-155
• /
• 2006

A hybrid Ad-hoc network connected to the Internet needs an IP address configuration to communicate with the Internet. Most of proposed address autoconfiguration algorithms are node based. The node based address autoconfiguration algorithms waste bandwidth and consume much battery in mobile ad-hoc networks. In this paper, we propose the address allocation algorithm in hybrid Mobile ad-hoc network (MANET). The proposed algorithm reduces network traffic by transferring address configuration packet to the internet gateway by unicast method. Moreover, our IP address configuration algorithm also reduces battery consumption and address configuration time by decreasing number of configuration packets on internet gateway.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.5
• /
• pp.71-80
• /
• 2009

Ad-hoc network consists f mobile nodes, which they are together in the communication. However, if some misbehaving nodes are in network, it is faced to many threats. Therefore, detection and management of misbehaving node are necessary to make confident in Ad-hoc networks. To solve this problem, we use Node Weight Management Server(NWMS), which it manage each node's weight in local area. When NWMS detect misbehaving node, it adds the node's weight and if the node's weight exceeds threshold then NWMS broadcasts the node's information to isolate in network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.5
• /
• pp.632-639
• /
• 2012

Ad-hoc networks can be used various environment, which it is difficult to construct infrastructures, such as shadowing areas, disaster areas, war area, and so on. In order to support to considerable and various wireless services, more spectrum resources are needed. However, efficient utilization of the frequency resource is difficult because of spectrum scarcity and the conventional frequency regulation. Ad-hoc networks employing cognitive radio(CR) system that guarantee high spectrum utilization provide effective way to increase the network capacity. In conventional CR based ad-hoc network, it uses constant threshold value to detect primary user signal, so the results become not reliable. In this paper, to solve this problem, we apply adaptive threshold value to the CR based ad-hoc network, and adaptive threshold is immediately changed by SNR(Signal to Noise Ratio). From the simulation results, we confirmed that proposed algorithm has the greatly better detection probabilities than conventional CR based ad-hoc network.