OAK

Ad hoc 네트워크에서의 양방향 경로탐색을 이용한 경로복구 개선 방안

Metadata Downloads
Abstract
In the growth of information technology, user requirements have been diversified in telecommunication environments. Because ad hoc network makes nodes communicate each other without infrastructure system and previous configuration, it comes into the spotlight that is suitable to ubiquitous society.
Of several research areas, routing protocol has been studied which can solve Link-Failure problem due to node movements. Though Many researches have been conducted by means of local repair improvement, multipath searching and link-failure detection, it couldn't present the primary solution.
This study proposes the Bidirectional Route Recovery method based on AODV which attempts to solve the control traffic problem and improve data delivery ratio. It can be used in all of the network area because upstream/downstream nodes send route error message and route request message to source/destination. Restricting the flooding of route request messages, it attempts to minimize the costs of local repair.
It simulates this method for performance evaluation. In scenarios which variate the node numbers and node speed, it measures the control traffic and data delivery ratio. Proposed method shown the good performance regardless of the node numbers and node speed. Specially, it can apply to the small/medium network and V2V(Vehicle-to-Vehicle) application.
Author(s)
한호연
Issued Date
2009
Awarded Date
2009-02
Type
Thesis
Keyword
Ad hocRouting protocolAODVBidirectional Searching
URI
http://dspace.hansung.ac.kr/handle/2024.oak/6060
Affiliation
한성대학교 대학원
Advisor
남두희
Degree
Master
Publisher
한성대학교 대학원
Appears in Collections:
IT융합공학과 > 1. Thesis
Authorize & License
  • Authorize공개
Files in This Item:
  • There are no files associated with this item.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.