King Saud University Repository >
King Saud University >
Science Colleges >
College of Computer and Information Sciences >
College of Computer and Information Sciences >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/15143

Title: Efficient Route Discovery Algorithm for MANETs,
Authors: M. Al-Rodhaan
A. Al-Dhelaan
Keywords: Wireless underground sensor networks; Channel modeling; Underground communication; Volumetric water content;
Issue Date: 2010
Abstract: On-demand routing protocols used in mobile ad hoc networks suffer from transmitting a huge number of control packets which increases the overhead. In this new algorithm (ERDA), we try to improve the route discovery algorithm by reducing the routing overhead in the presence of random traffic. ERDA broadcasts any route request travelling within their source node’s neighbourhood region according to the routing algorithm used. However, propagation of the route request is deliberately delayed outside this region to provide the associated chase packet with an opportunity to stop the fulfilled route request and minimise network congestion. The algorithm is adaptive and continuously updates the boundary of each source node’s neighbourhood to improve performance. We provide detailed performance evaluation using simulation modelling. Our result shows that ERDA improves the performance by minimizing the average end-to-end delay as well as the network overhead and congestion level.
URI: http://hdl.handle.net/123456789/15143
Appears in Collections:College of Computer and Information Sciences

Files in This Item:

File Description SizeFormat
Dahelan_Conf_1.docx14.57 kBMicrosoft Word XMLView/Open

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


DSpace Software Copyright © 2002-2009 MIT and Hewlett-Packard - Feedback