An On-Demand Routing Algorithm for Mobile Wireless Networks

Yan, Huai-Zhi,Ajith P.K,Park, Dong-Won,Joo, Gi-Ho 배재대학교 공학연구소 2005 공학논문집 Vol.7 No.1

An ad hoc network is a collection of wireless mobile nodes forming a temporary network without the centralized administration. Due to the limited transmission range of wireless work interface, multiple networks “hops” maybe needed for one node to exchange data with adjacent node. In recent years, a variety of new routing protocol about ad hoc network was developed. This paper presents a new routing protocol based on the Dynamic Source Routing which is not suitable for the high mobility ad hoc network. The Enhanced DSR adapts quickly to routing changes when node movement is frequent. When a trunk route is broken, this protocol will utilize the alternative route saved in the route to discovery quickly the new route. It improves the performance of the existing DSR algorithm, so that the negative impacts from weakness of DSR are reduced.

An On Demand Routing Algorithm for Mobile Wireless Networks

Yan, Huai-Zhi,Ajith, P.K.,Park, Dong-Won,Joo, Gi-Ho 배재대학교 공학연구소 2005 공학논문집 Vol.7 No.1

An and hoc network is a collection of wireless mobile nodes forming a temporary network without the centralized administration. Due to the limited transmission range of wireless work interface, multiple networks "hops" maybe needed for one node to exchange data with adjacent node. In recent years, a variety of new routing protocol about ad hoc network was developed. This paper presents a new routing protocol based on the Dynamic Source Routing which is not suitable for the high mobility ad hoc network. The Enhanced DR adapts quickly to routing changes when node movement is frequent. When a trunk route is broken, this protocol will utilize the alternative route saved in the route to discovery quickly the new route. It improves the performance of the existing DSR algorithm, so that the negative impacts from weakness of DSR are reduced.

단방향 링크를 지원하는 이동 Ad Hoc 라우팅 프로토콜

이광배,김현유,정근원,Lee, Kwang-Bae,Kim, Hyun-Ug,Jung, Kun-Won 한국전기전자학회 2001 전기전자학회논문지 Vol.5 No.1

본 논문에서는 단방향 링크를 포함하는 이동 Ad Hoc 망에 대해 비대칭 경로를 지원하는 동적 소스 라우팅 프로토콜을 제안하였다. 기존의 동적 소스 라우팅 프로토콜은 양방향 링크로 구성된 대칭경로만을 지원하도록 구현되어있다. 그러나 실제적인 무선환경에서는 단말의 비대칭성이나 무선환경 특성등에 기인한 단방향 링크가 존재할 수 있다. 따라서 본 논문에서는 좀 더 일반적인 무선환경에 맞는 이동 Ad Hoc 망 라우팅 프로토콜을 구현하기 위하여 단방향 링크를 지원하도록 하였다. 특히 이동성으로 인한 경로 실패를 인식한 경우, 신속한 경로 재설정을 수행하기 위해 다중경로유지 기법을 사용하였다. 성능평가는 평균 경로설정시간 및 평균 데이터수신율에 대해 수행하였으며, 그 값을 얻기 위해 경로 상에 중간노드캐쉬의 사용여부 및 서로 다른 이동성과 연결성을 제공하는 시나리오를 고려하여, 100초 단위로 900초까지 성능평가를 수행하였다. In this paper, we propose a dynamic source routing protocol supporting asymmetric paths for mobile Ad Hoc networks that contain unidirectional links. At present, the existing dynamic source routing protocol supports only symmetric paths that consist of bidirectional links for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile terminals or current wireless environment. Thus, we implement a mobile Ad Hoc routing protocol supporting unidirectional links, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected. For performance evaluation, we consider the following factors: average route discovery time and average data reception rate. In order to obtain the factors of the performance evaluation, we did simulation for 900 seconds in the step of 100 seconds with the following scenarios: usage of route cache in intermediate nodes on route path, and different mobility/connection patterns.

Low-Rate WPAN에서 경로탐색을 위한 위치기반 라우팅 메카니즘

이재조,허준,홍충선,이대영,Lee, Jae-Jo,Heo, Joon,Hong, Choong-Seon,Lee, Dae-Young 한국통신학회 2004 韓國通信學會論文誌 Vol.29 No.9B

최근 Low-Rate WPAN 기술에 관한 많은 연구가 진행되고 있다. Low-Rate WPAN 은 사용자가 실질적으로 인식하지 못하는 상황에서도 주변환경에 존재하는 많은 수의 센서를 통해 컴퓨터를 이용한 개선된 서비스제공에 목적을 두고있다. Low-Rate WPAN 환경을 구성하는 센서 디 B} 이스는 빈번한 이동성을 가지게 되고 새로운 경로 탐색을 위한 메카니즘을 필요로 하게 되므로, 본 논문에서는 센서 디바이스의 위치정보를 이용한 Low-Rate WPAN 환경에서의 효율척언 라우팅 메카니즘을 제안한다. 제안한 메카니즘은 기존 방법들에 비해 라우팅 메시지 수를 감소시킬 수 있음을 시뮬레이션을 통해 입증한다. Many researchers are now working in the Low-Rate WPAN environment. Low-Rate WPAN has as its goal the enhancing computer use by making many sensors available throughout the physical environment, but making them effectively invisible to the user. Low-Rate WPAN environment consists of wireless sensor devices that may move often. Movement of hosts results in a change in routes and the need of some mechanism for determining new routes. This paper suggests an approach to utilize location information to improve performance of a routing mechanism for Low-Rate WPAN Environment. Accordingly, we proved that the proposed mechanism results in a significant reduction in a number of routing messages when comparing with existing mechanisms.

무선 애드-혹 네트워크를 위한 효율적인 서비스 검색 기법

김문정(Moon Jeong Kim),이동훈(Dong Hoon Lee) 한국방송·미디어공학회 2008 방송공학회논문지 Vol.13 No.2

Efficient service discovery mechanism is a crucial feature for the usability of a wireless ad-hoc network. A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration. We propose an efficient service discovery mechanism using non-disjoint multi-path routing protocol for a wireless ad-hoc network. Our scheme has advantages of not only multi-path routing protocol but also cross-layer service discovery. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.

On Optimizing Route Discovery of Topology-based On-demand Routing Protocols for Ad Hoc Networks

Seet, Boon-Chong,Lee, Bu-Sung,Lau, Chiew-Tong The Korea Institute of Information and Commucation 2003 Journal of communications and networks Vol.5 No.3

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

Routing Load Analysis of Broadcast based Reactive Routing Protocols AODV, DSR and DYMO for MANET

Parma Nand,S.C. Sharma 보안공학연구지원센터(IJGDC) 2011 International Journal of Grid and Distributed Comp Vol.4 No.1

A Novel Route Discovery Scheme Equipped with Two Augmented Functions for Ad Hoc Networks

Lee Hae-Ryong,Shin Jae-Wook,Na Jee-Hyeon,Jeong Youn-Kwae,Park Kwang-Roh,Kim Sang-Ha Korea Institute of Information and Telecommunicati 2004 정보통신설비학회논문지 Vol.3 No.1

'The delay and control overhead during route discovery for destinations outside ad hoc networks are major obstacle to achieving scalability in the Internet. To solve this issue, we propose a novel route discovery scheme equipped with two augmented functions. In this paper, the Internet gateway maintains an address cache of Internet nodes frequently accessed from the ad hoc network and replies with an extended Route Response (RREP) message to the Route Request (RREQ) message based on its routing table and the address cache called EXIT(EXternal node Information Table). These augmented functions make the source node determine the location of the destination as fast as possible. Through simulations, the proposed route discovery scheme using both EXIT and extended RREP message shows considerable' reduction in both route discovery time and control message overhead.

이동 ad hoc 네트워크의 이동성을 지원하기 위한 향상된 라우팅 프로토콜

김관웅(Kwan-Woong Kim),김대익(Dae-Ik Kim) 대한전자공학회 2008 電子工學會論文誌-CI (Computer and Information) Vol.45 No.6

이동 ad hoc 네트워크는 기지국 또는 중앙 관리국 없이 주어진 영역 내에서 다중 노드들 사이에 무선 데이터 통신이 이루어지는 자체적인 네트워크이다. 노드의 이동성과 제한된 배터리 수명에 의해 네트워크 토폴로지는 자주 바뀌게 된다. 따라서 경로 탐색 절차에 있어서 가장 신뢰성 있는 경로를 선택하는 것은 ad hoc 네트워크의 성능을 향상시키기 위해 중요하다. 본 논문에서는 수신 신호 세기의 변화를 측정함으로써 AODV (Ad hoc On-demand Distance Vector routing)에 기반을 둔 향상된 라우팅 프로토콜을 제안한다. 라우팅을 결정하기 위해 노드 이동성과 경로의 홉으로 이루어진 새로운 측정 함수가 사용된다. 또한 데이터 전송 중 노드의 움직임에 의한 경로의 단절을 방지하기 위해 LRC (Local Route Change)라는 새로운 라우트 관리 기법을 소개한다. 노드의 움직임을 감지하면, 경로가 단절되기 전에 라우팅 에이전트는 다음 홉 노드를 이웃노드로 변경한다. 시뮬레이션 결과를 통해 제안한 라우팅 기법의 성능이 기존의 AODV 방식보다 우수함을 보인다. Mobile Ad hoc NETworks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad hoc networks. In this paper, an enhanced routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance named as LRC (Local Route Change) is presented. If the node movement is detected, the routing agent switches path to its neighbor node in LRC. Simulation results show that the performance of the proposed routing scheme is superior to previous AODV protocol.

Performance study of Broadcast based Mobile Adhoc Routing Protocols AODV, DSR and DYMO

Parma Nand,S.C. Sharma 보안공학연구지원센터 2011 International Journal of Security and Its Applicat Vol.5 No.1