• Title/Summary/Keyword: 자율구성 애드혹 네트워크

Search Result 12, Processing Time 0.03 seconds

A Joint Topology Discovery and Routing Protocol for Self-Organizing Hierarchical Ad Hoc Networks (자율구성 계층구조 애드혹 네트워크를 위한 상호 연동방식의 토폴로지 탐색 및 라우팅 프로토콜)

  • Yang Seomin;Lee Hyukjoon
    • 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.

A MIPv6 Address Autoconfiguration Protocol in Mobile Ad-hoc Network (모바일 Ad-Hoc 네트워크에서 MIPv6 주소자동할당 프로토콜)

  • Jo Yeong-Bok;Lee Sang-Ho
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2006.05a
    • /
    • pp.103-106
    • /
    • 2006
  • 모바일 애드 혹 네트워크(Mobile Ad-hoc Network)는 기반 통신시설의 도움 없이 노드들 간에 자율적으로 구성되는 무선 네트워크로 각 노드는 이동성 및 다른 노드에게 패킷을 전달하는 라우팅 기능을 가지고 있다. 현재까지 모바일 애드혹 네트워크의 주된 관심사는 경로설정 문제를 해결하는데 있었다. 모바일 애드혹 네트워크의 라우팅 프로토콜에서 노드에게 할당된 주소가 유일한 것으로 가정하여 사용하지만 경로설정에 앞서 모바일 애드 혹 네트워크에 참여하는 노드에게 어떤 방법으로 유일한 주소를 제공할 것 인가에 대한 연구가 필요하다. 특히 모바일 애드 혹 네트워크는 필요에 따라 노드들이 자발적으로 네트워크를 형성하여 데이터를 주고 받는 형태이기 때문에 노드들에게 동적으로 주소를 할당하는 문제는 매우 중요하다. 따라서 모바일 애드혹 네트워크가 외부망과 연결시 고정 IP을 부여하고 애드혹의 구성하는 노드이 이동성을 고려하여 노드들 간의 분산된 IP 주소 자동 할당 방법을 MIPv6 적용한 프로토콜을 제안한다. 또한 평가방법으로 이동성을 고려하여 네트워크의 크기를 노드의 수를 가지고 비교하여 모바일 애드혹 네트워크를 구성하는 노드의 수를 증가함으로 기존 연구와 비교평가를 위해서 시뮬레이션 환경을 구현하여 실험을 수행하였다. 실험 결과, 이 논문에서 제안한 방법을 사용하면 모바일 애드혹 네트워크의 크기가 커질수록 기존의 방법보다 주소할당 소요시간을 감소시킬 수 있다.

  • PDF

Throughput Analysis of ASO-TDMA in Multi-hop Maritime Communication Network (다중-홉 선박 통신 네트워크를 위한 애드혹 자율 구성 TDMA 방식의 수율 성능 분석)

  • Cho, Kumin;Yun, Changho;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.741-749
    • /
    • 2012
  • Ad Hoc Self-Organizing TDMA (ASO-TDMA) has been proposed as a specification to support the multi-hop data communication service for ships over VHF band. It allows for organizing a multi-hop ad-hoc network in a distributed manner by sharing the radio resources among the ships navigating along the route. In this paper, Markov chain analysis is given to provide the average throughput performance for ASO-TDMA protocol Furthermore, the analytical results are verified with computer simulation, which shows that there exists the optimal transmission rate to maximize the average throughput as the subframe size and the number of ships are varying in each hop region.

A Routing Mechanism for Reducing Data Loss Using Alternate Path in Wireless Ad-­hoc Networks (무선 Ad­-hoc 네트워크 환경에서 대체 경로를 이용한 데이터 손실 감소 기법)

  • 이상림;김인숙;김문정;엄영익
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.529-531
    • /
    • 2003
  • 최근 이동성을 가진 노드들에 의해 자율적으로 구성되는 무선 애드 혹 네트워크(Ad­hoc Network)에 대한 연구가 진행되고 있다. 무선 애드 혹 네트워크 환경을 위한 라우팅 프로토콜은 크게 테이블 기반 라우팅 프로토콜. 요구 기반 라우팅 프로토콜. 그리고 혼합형 라우팅 프로토콜로 구분된다. 특히 무선 애드 혹 네트워크의 요구 기반 라우팅 프로토콜 상에서 한 노드에 여러 데이터가 한꺼번에 집중될 경우 데이터 집중화 현상으로 데이터의 손실이 발생될 수 있다. 이를 해결하기 위해 본 논문에서는 대체 경로를 이용하여 데이터의 손실을 줄이는 라우팅 기법을 제시한다. 제안 기법은 향후 데이터 트래픽이 많이 발생하는 네트워크에 응용될 수 있다.

  • PDF

Authenticated Key Agreement for Ephemeral Ad Hoc Network Using Distance Bounding (애드 혹 네트워크를 위한 거리기반 인증된 키교환 기법)

  • Cho Woo-Won;Kim Bum-Han;Lee Dong-Hoon
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2006.06a
    • /
    • pp.661-664
    • /
    • 2006
  • 무선 이동 Ad hoc 네트워크는 고정된 인프라의 도움 없이 이동 노드들의 협력에 의해 자율적으로 구성되는 독립적이고 융통성 있는 네트워크이다. 최근 상업적인 분야에서도 Ad hoc 네트워크의 응용에 대한 관심이 급증하면서 Ad hoc 네트워크의 보안 문제도 해결되어야 할 기술적 요구사항으로 대두되고 있다. 특히, 이러한 요구사항을 만족시키기 위해 Ad hoc 네트워크상에서 공개키 기반구조(PKI)를 도입하는 것은 고정된 인프라를 사용하지 않는 애드혹 네트워크 특성상 매우 제한적인 기법이다. 또한 password를 기반으로 하는 인증된 키교환을 하기위해서는 모든 사용자가 사전에 password를 공유를 해야 하는 불편함이 있다. 본 논문에서는 인증을 위한 제 3의 신뢰기관이나, 사전 비밀 공유가 필요 없는 인증된 키교환 프로토콜을 제안한다.

  • PDF

Routing Mechanism for Data Transmission QoS in Mobile Ad-hoc Network (무선 애드 혹 네트워크에서의 데이터 전송 QoS를 위한 라우팅 기법)

  • Cha, Hyun-Jong;Yang, Ho-Kyung;Shin, Hyo-Young;Jo, Yong-Gun;Ryou, Hwang-Bin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.9
    • /
    • pp.1829-1836
    • /
    • 2009
  • A wireless Ad-hoc network is willing to send and receive data and for other nodes, and it is a temporal network where the nodes with mobility are automatically constituted. This network has been studied to construct networks in the state where there is no infrastructure. The limited nodes and its frequent moving in a wireless Ad-hoc network have resulted in frequent network disconnection. Therefore, the data transmission rate should be secured in a wireless Ad-hoc network. This study proposes the method to improve QoS of data transmission considering the mobility of nodes that respond to path searching by means of AOMDV routing protocol. By applying the suggested method, it is possible to raise the transmission rate by improving the reliability of transmission path.

PUF-based Secure FANET Routing Protocol for Multi-Drone

  • Park, Yoon-Gil;Lee, Soo-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.9
    • /
    • pp.81-90
    • /
    • 2020
  • In order to operate multi drone efficiently, existing control methods must be improved, and drones must be able to construct communication networks autonomously. FANET(Flying Ad-Hoc Network), which is being considered as an alternative to solving these problems, is based on ad hoc network technology and can be exposed to a variety of security vulnerabilities. However, due to the limited computational power and memory of FANET nodes, and rapid and frequent changes in network topology, it is not easy to apply the existing security measures to FANET without modification. Thus, this paper proposes lightweight security measures applicable to FANET, which have distinct characteristics from existing ad hoc networks by utilizing PUF technology. The proposed security measures utilize unique values generated by non-replicable PUFs to increase the safety of AODV, FANET's reactive routing protocol, and are resistant to various attacks.

Self-organization Networking Scheme for Constructing Infrastructure-less based IoT Network (비인프라 기반 사물인터넷 구축을 위한 자율네트워킹 기법)

  • Youn, Joosang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.1
    • /
    • pp.196-201
    • /
    • 2018
  • Recently, various infrastructure-less IoT networking schemes have been studied to construct local IoT networks based on self-organization. This is, because RPL protocol, which is to support infrastructure based network construction is used to construct local IoT networks. Thus, a self-organization networking and ad hoc path between client and server in local IoT networks is not supported in basis RPL protocol. In this paper, we propose a self-organization networking scheme which support infrastructure-less based IoT network construction in low-power and lossy network based IoT environments consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Through simulation, we show that the proposed self-organization networking scheme improves the performance, in terms of the number of packets generated for end-to end data transmission and the end-to-end delay, compared to basis RPL protocol.

Query Routing in Road-Based Mobile Ad-Hoc Networks (도로 기반 이동 애드 혹 망에서 질의 처리 방법)

  • Hwang So-Young;Kim Kyoung-Sook;Li Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.259-266
    • /
    • 2005
  • Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.

An Inter-Session Opportunistic Network Coding-aware Multipath Routing Protocol (세션간 네트워크 코딩 기회를 인식하는 다중 경로 라우팅 프로토콜)

  • Choi, Tae-Jong;Kang, Kyung-Ran;Cho, Young-Jong;Bang, June-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.536-549
    • /
    • 2012
  • An ad hoc network consists of nodes with limited energy. Therefore, the data transmission can fail abruptly due to lack of energy of transmitting node. A previous work PAMP proposed to build multiple low-energy paths to support stable packet delivery exploiting the nodes with low energy. It has energy-reservation scheme and multi-path selection scheme for stationary wireless ad hoc networks. In this paper, we propose an extended version of PAMP by incorporating network coding opportunity in path selection process. The simulation results show that our proposed scheme shows better packet delivery ratio and lower energy consumption compared with PAMP and a legacy energy-aware multipath routing protocol REAR.