• Title/Summary/Keyword: Zone Routing Protocol

Search Result 40, Processing Time 0.02 seconds

A Study on Secure Routing using Secure Zone and Nodes Authentication in Wireless Ad Hoc Network (Wireless Ad Hoc Network에서 보안 영역과 노드 인증을 이용한 보안 라우팅 기법에 관한 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.3
    • /
    • pp.161-169
    • /
    • 2014
  • Wireless Ad Hoc Network is suitable for emergency situations such as and emergency, disaster recovery and war. That is, it has a characteristic that can build a network and use without help of any infrastructure. However, this characteristic is providing a cause of many security threats. In particular, routing attack is not applied the existing routing methods as it is and it is difficult to determine accurately whether nodes that participate in routing is malicious or not. The appropriate measure for this is necessary. In this paper, we propose a secure routing technique through a zone architecture-based node authentication in order to provide efficient routing between nodes. ZH node is elected for trust evaluation of the member nodes within each zone. The elected ZH node issues a certification of the member nodes and stores the information in ZMTT. The routing involvement of malicious nodes is blocked by limiting the transfer of data in the nodes which are not issued the certification. The superior performance of the proposed technique is confirmed through experiments.

Unidirectional Routing Protocol using Dynamic Source Routing for Mobile Ad Hoc Networks (이동 Ad Hoc 망에 대해 동적 소스 라우팅을 이용하는 단방향 라우팅 프로토콜)

  • Gwak, Seung-Uk;Lee, Gwang-Bae;Kim, Hyeon-Uk
    • The KIPS Transactions:PartC
    • /
    • v.8C no.4
    • /
    • pp.459-468
    • /
    • 2001
  • 실제적인 이동 Ad Hoc 망에서는 단말의 비대칭성이나 무선환경 특성으로 인해 단방향 링크가 존재할 수 있다. 그러나 현재 Zone 라우팅 프로토콜이외의 기존의 이동 Ad Hoc 라우팅 프로토콜은 양방향 링크들만을 지원하도록 구현되어 있다. 따라서 본 논문에서는 가장 대표적인 라우팅 프로토콜인 DSR(Dynamic Source Routing) 프로토콜이 단방향 링크를 포함하는 이동 Ad Hoc 망에서 구동될 수 있도록 동적 소스 라우팅을 이용한 새로운 단방향 라우팅 프로토콜을 제안한다. 단방향 링크 상에서 효율적으로 구동하기 위해서 제안한 단방향 라우팅 프로토콜은 새로운 경로발견 및 경로유지 방법을 사용하였다. 성능평가를 위해서 미국 버클리 대학의 NS-2 시뮬레이터 프로그램에 제안한 내용을 코드로 삽입시켰으며, 성능평가 파라미터를 얻기 위해 카네기멜론 대학에서 제공한 이동 패턴파일과 연결 패턴파일을 조합하여 사용하였다. 성능평가 항목으로 데이터수신율 및 평균경로 설정시간을 고려하였으며, 제안된 3가지 경로설정 방식들에 대해 비교·평가하였다.

  • PDF

Fan-shaped Search Zone Routing Protocol for Ship Ad Hoc Networks (선박 애드 혹 네트워크를 위한 부채꼴 탐색구역 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.521-528
    • /
    • 2008
  • Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

A Propagated-Mode LISP-DDT Mapping System (전달모드 LISP-DDT 매핑 시스템에 관한 연구)

  • Ro, Soonghwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2211-2217
    • /
    • 2016
  • The Locator/Identifier Separation Protocol (LISP) is a new routing architecture that implements a new semantic for IP addressing. It enables the separation of IP addresses into two new numbering spaces: Endpoint Identifiers (EIDs) and Routing Locators (RLOCs). This approach will solve the issue of rapid growth of the Internet's DFZ (default-free zone). In this paper, we propose an algorithm called the Propagated-Mode Mapping System to improve the map request process of LISP-DDT.

Enhanced Packet Transmission in Ad-hoc Networks using Unicast with Temporary Routing (애드혹 네트워크에서 임시 경로 설정 유니캐스트를 기반으로 한 향상된 멀티 홉 전송 기법)

  • Ko, Sung-Hyun;Yoo, Sung-Jae;Jung, Sou-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.131-140
    • /
    • 2011
  • Smart packet agent is an application that is proposed to provide routing protocol and service module in ubiquitous network environment. However, it uses multi-hop broadcast, thus it causes increasing network traffic, low-speed data transmission, and the unnecessary joining nodes. In this paper, a transmit technique that uses unicast-based multi-hop to have lower network traffic and faster transmission time than the multi-hop broadcast technique. In our scheme, u-Zone Master establishes temporary routing paths by calculating moving nodes' hop-counter. Therefore, it reduces smart packet agent's network traffic and retransmission rate. Besides, this paper proposed an UDP transmission that bases on sliding window. Hence, the Stop & Wait transmission speed is improved. The results, which are taken by analyzing performance prove that the proposed scheme has better performance.

An Energy-efficient Data Dissemination Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 데이타 전달 프로토콜)

  • Yi, Seung-Hee;Lee, Sung-Ryoul;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.165-174
    • /
    • 2006
  • Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

A Location-Aided Cooperative Transmission Method in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 위치도움 협력 전송 방법)

  • Son, Dong-Hwan;Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.23-28
    • /
    • 2008
  • In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

  • PDF

A Reliable Route Selection Algorithm in Mobile Ad-hoc Networks (이동 애드혹 네트워크에서의 안정 경로 선택 알고리즘)

  • Kim, Won-Ik;Suh, Young-Joo;An, Syung-Og
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.314-323
    • /
    • 2002
  • The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been Proposed. However, when theme protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoc networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable route that is impervious to route failures by topological changes by mobile hoots. For reliable route selection, the concept of virtual zone (stable zone and caution zone) is proposed. The zone is located in a mobile node'transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

Reliable Gossip Zone for Real-Time Communications in Wireless Sensor Networks

  • Li, Bijun;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.244-250
    • /
    • 2011
  • Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.