English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6487/11649
Visitors : 28690281      Online Users : 211
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/15989

Title: A Low Overhead Dynamic Route Repairing Mechanism for Mobile Ad Hoc Networks
Authors: Yu, Chang-Wu;Wu, Tung-Kuang;Cheng, Rei-Heng
Contributors: 資訊管理學系
Keywords: Dynamic route repairing;Ad hoc networks;Routing protocols;AODV;DSR;NS-2
Date: 2007-03
Issue Date: 2013-04-22T07:38:18Z
Publisher: Elsevier
Abstract: Ad hoc networks are wireless networks with no fixed infrastructure. Each mobile node in the network functions as a router that discovers and maintains routes for other nodes. These nodes may move arbitrarily, therefore network topology changes frequently and unpredictably. Many routing protocols have been designed for ad hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Theoretical analysis reveals that, in a given circumstance, our proposed protocol can find a backup route in more than 60% of time. Simulation results also demonstrate that our protocol achieves better (or as good) in terms of the packet delivery rate, control packet overhead and communication delay than the major ad hoc routing protocols under light and moderate traffic conditions.
Relation: Computer Communications, 30(5): 1152-1163
Appears in Collections:[資訊管理學系所] 期刊論文

Files in This Item:

File SizeFormat

All items in NCUEIR are protected by copyright, with all rights reserved.


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback