• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.4-6
• /
• 2003

MANET(Mobile Ad hoc NETwork)은 기간망(infrastructure network)에 대한 의존 없이 필요에 따라 노드(node)들이 자발적으로 임시적인 네트워크를 형성해 데이터를 주고 받는 형태이다. 지금까지 MANET에 관한 대부분의 연구는 노드들이 네트워크에 합류하기 전에 IP주소를 할당받는다는 가정하에 이루어졌다. 기존의 네트워크에서는 IPv4주소의 부족으로 모든 노드에게 영구적으로 IP주소를 할당 할 수 없어 동적으로 IP주소를 할당할 필요가 있을 때 DHCP를 이용해 노드들에게 IP주소를 할당했다. 그러나 MANET의 경우 노드의 이동성으로 인해 중앙집중화 된 DHCP 서버로의 접근을 항상 보장할 수 없다 그러므로 본 논문에서는 MANET의 노드들에게 유일한 IP주소를 동적으로 할당하기 위한 토큰-기반 동적 주소 할당 프로토콜을 제안하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1189-1194
• /
• 2005

An Ad-hoc network which do not use wired and base station system is composed the group of mobile and wireless nodes. That is various type of restriction. The biggest restriction is depend on the confined energy of battery. The network is devide more than two, if one of nodes consumed all energy that node can no longer participate to network. In recent years, the many number of studies research not only energy saving but also the networks lifetime extension which is to solve this problem. In this paper, we examine a AODV routing protocol which is modified to improve networks lifetime in mobile ad-hoc network. The one of improvement for AODV protocol is maximize the networks lifetime as apply Energy Mean Value algorithm which considerate node energy. We show the effectiveness for modified AODV(New-AODV) compared with AODV using NS-2(Network Simulator 2) the various performance metrics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.898-904
• /
• 2007

I must receive node discernment address for communication between node that participate to network in MANETs(Mobile Ad-hoc Networks). Address is created by node confidence or different node. I achieve address redundancy check (Duplicate Address Detection) to examine whether this address is available unique address. However, this method happens problem that MANETs' extensity drops. This paper can manage by group unit binding transfer nodes to group in MANETs. I suggest method that apply special quality of cluster that exchange subordinate decrease and mobility government official of control message are easy in address assignment protocol minimize time required in redundancy check and solves extensity problem. Method that propose in this paper shows excellent performance according to node number increase than wave and MANETConf [2] through simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.431-435
• /
• 2005

Mobile Ad-Hoc network is the network(MANET) of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move and communicate freely each other. Recently, many researches for mobility management of mobile nodes are actively carried out by using the location information of mobile nodes. The location management is an important issue in MANET because location information of mobile node is frequently changed in MANET. In this paper, an adaptive mobility management scheme using fuzzy-logic based GQS by considering the mobile locality is proposed in order to manage location information of mobile nodes in MANET efficiently. The proposed scheme selects mobility databases adaptively from GQS by considering the locality of mobile node. The performance of the mobility management scheme proposed in this paper is evaluated by an analytic model and compared with that of existing UQS based mobility management scheme.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.104-108
• /
• 2007

Ad hoc networks are a type of mobile network that function without any fixed infrastructure. One of the weaknesses of ad hoc network is that a route used between a source and a destination is to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable link cost. This paper proposes a method for improving the low power distributed MAC. This method is based on the context awareness of the each nodes energy in clustering. We propose to select a new scheme to optimize energy conserving between the clustering nodes in MANET. And this architecture scheme would use context-aware considering the energy related information such as energy, RF strength, relative distances between each node in mobile ad hoc networks. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.1-3
• /
• 2004

본 논문에서는 Core Based Tree(CBT) 알고리즘과 개미 집단 알고리즘의 특성을 융합하여 Mobile Ad hoc Network(MANET)에 맞는 멀티캐스팅 알고리즘, Ad hoc network Multicasting with Ant System (ANMAS)을 제안한다. ANMAS는 개미 알고리즘의 간접적 정보 전달 및 평가 방법을 통해 멀티캐스팅에 필요한 위상정보를 수집하여 견고한 멀티캐스팅 그룹을 형성함으로서 기존의 알고리즘에 비해 효율적이며 실험결과를 통해 이를 확인할 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.890-893
• /
• 2008

자율성 및 이동성 갖는 네트워크 구조의 하나인 MANET(Mobile Ad-Hoc Networks)은 각 node들은 그 특성에 따라서 clustering service을 한다. node의 전송과정 중 path access에 대하여 중요성 또한 강조되고 있다. 일반적인 무선 네트워크 상에서의 node들은 clustering을 하게 되는데 그 과정에서 발생되는 여러 가지 문제점을 가지고 전송이 이루어진다. 모든 node들이 송, 수신상의 전송 범위(Beam forming area)가지고 있으며, 이러한 각 node들의 전송범위 내에 전송이 이루어지는 전통적인 전송기술 mechanism을 찾는다. 이러한 전송상황에서의 송신하는 node와 수신된 node간에 발생되고 있는 중복성의 문제점으로 즉, 상호적용에 의한 네트워크 duplicate(overlapping)이 크게 우려가 되고 있다. 이러한 전송상의 전송 범위 중첩, node간의 packet 간섭현상, packet의 중복수신 및 broadcasting의 storming현상이 나타난다. 따라서 본 논문에서는 상황정보의 속성을 이용한 계층적 상호 head node들의 접근된 위치와 연계되는 전송속도, 보존하고 있는 head node들의 에너지 source value, doppler효과를 통한 head node의 이동방향 등 분석한다. 분석된 방법으로 전송상의 계층적 path가 구성된 경험적 path 속성을 통한 네트워크 connectivity 신뢰성을 극대화 할 뿐만 아니라 네트워크의 전송 범위 duplicate을 사전에 줄일 수 있고 전송망의 최적화를 유지할 수 있는 기법의 하나인 상황정보를 이용한 ad hoc network의 ODDMRP(Ontology Doppler effect-based Dynamic Multicast Routing Protocol) clustering 기법을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.799-818
• /
• 2010

In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic and P2P network partition in mobile ad hoc network (MANET). We propose an approach to construct an efficient unstructured P2P overlay over MANET using underlying cluster-based routing (CBRP). One of the peers in the P2P network is used as a root-peer to connect all peers. Each peer maintains connection with physically closer peers such that it can reach the root-peer. The peer constructs a minimum-spanning tree consisting of itself, its directly connected neighbor peers and 2-hop away neighbor peers to remove far away redundant links and to build an overlay closer to the physical network. Due to on-demand nature of inter-cluster routing of CBRP, the positioning algorithm for MANET is used to retrieve the file by a peer from the source peer via shorter path in the physical network. We can show by simulation that our approach performs better in comparison with the existing approach.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.45-50
• /
• 2008

Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. Therefore, in the MANET, a route setup mechanism that makes nodes not within each other's transmission range communicate is required and, for this, the Ad-hoc On-demand Distance Vector (AODV) was proposed as one of the reactive routing protocols well suited for the characteristics of the MANET. AODV uses the hop count as the routing metric and, as a result, a node selects the farthest neighbor node as its next hop on a route, which results in a problem of deteriorating the overall network throughput because of selecting a relatively low data rate route. In this paper, we propose an efficient reactive routing protocol based on the multi-rate aware MAC. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that our proposed mechanism outperforms the existing mechanism.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.870-873
• /
• 2013

본 논문에서는 이동 에드 혹 네트워크(Mobile Ad-hoc network: MANET)에서의 상황인식 기반의 스케쥴링 기법인 DDV(Dynamic Direction Vector)-hop 알고리즘을 제안한다. 기존 MANET에서는 노드의 이동성으로 인한 동적 네트워크 토폴리지, 네트워크 확장성 결여의 대한 취약성을 지니고 있다. 또한 노드들의 이동성에 따라 에너지 소모율이 다르며, 에너지 소모율을 최소화하는 라우팅 기법을 선택하는 것이 중요하다. 따라서 본 논문에서는 계층적 클러스터 단위의 동적이 토폴로지에서 노드가 이동하는 방향성 및 시간에 따른 노드의 이동 속성 정보를 고려하여 클러스터를 생성 및 유지하는 DDV-hop알고리즘을 제안한다. 또한 주어진 노드의 위치정보를 이용하여 토폴로지를 형성함에 있어 보다 에너지 효율적인 경로를 탐색하여 최적화된 경로를 제공함에 연구의 목적이 있다. 주어진 모의실험환경에서 노드의 방향성 및 시간에 따른 이동성을 반영함으로써 에너지 효율적인 클러스터링 및 라우팅 경로 알고리즘이 제공되어 네트워크의 최적화된 에너지 소모 결과를 보여주었다.