National Changhua University of Education Institutional Repository : Item 987654321/15998

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 30013746 Online Users : 385

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Management > Department of Information Management > Periodical Articles > Item 987654321/15998

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

Title:	A Highly Topology Adaptable Ad Hoc Routing Protocol with Complementary Preemptive Link Breaking Avoidance and Path Shortening Mechanisms 同標題
Authors:	Cheng, Rei-Heng;Wu, Tung-Kuang;Yu, Chang-Wu
Contributors:	資訊管理學系
Keywords:	Ad hoc networks;Dynamic routing;Dynamic link breaking avoidance;Dynamic path shortening;AODV
Date:	2010-07
Issue Date:	2013-04-22T07:38:39Z
Publisher:	SpringerLink
Abstract:	Ad-hoc on-demand distance vector routing (AODV) is a well-known routing protocol for mobile ad hoc networks. The original AODV protocol works in a semi-dynamic fashion, by establishing a route on demand and using that route until it breaks. However, to suit the changing network topology of ad hoc networks, more aggressive and adaptable routing strategies are required. A number of researches have proposed improving AODV performance by locally repairing broken links, predicting and replacing potentially vulnerable links, or shortening a link through removing redundant nodes from the transmission path. Although local repair may relieve some problems, it usually results in longer paths and thus a considerable performance drop in heavy traffic conditions. There are also issues regarding packet loss and communication delay due to route rebuilding once the link is broken. Predicting and replacing potentially vulnerable links may require special hardware, additional tables to maintain, or other extra overhead. Finally, path shortening may result in shorter and more efficient routes, but there is no guarantee that the new paths will be robust. This paper proposes integrating preemptive link breaking avoidance and path shortening mechanisms into a modified AODV protocol. However, the difficult issue lies in determining the right timing to initiate the two independent mechanisms so that the two dynamically and complementarily operating mechanisms can work together to improve the routing performance. Through numerical analysis and simulation, we have arranged a simple parameter setting for controlling the activation of each mechanism at the appropriate time. The proposed combination is a highly dynamic ad hoc routing protocol that is capable of adapting itself to the changing network topology and achieving extremely good performance in various routing performance metrics. Extensive simulations show that each of the two schemes alone improves AODV performance. More importantly, the integrated protocol performs even better in terms of data delivery rate, average delay time, and network overhead. To be more specific, in the best cases our protocol can reduce up to 82% in control overhead and 66% in delay time, while achieving 12% more in data delivery rate comparing to AODV.
Relation:	Wireless Networks, 16(5): 1289-1311
Appears in Collections:	[Department of Information Management] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	715	View/Open

Loading...