With the proliferation of inexpensive and widely available wireless devices, the arena of mobile computing has been expanded dramatically in recent years. Mobile ad hoc networks have been envisioned as the future of wireless networking technology with continuous effort to improve its performance in various areas and one such area is the routing protocols. Various routing protocols are in existence and Self Learning Ad-Hoc Routing protocol is one of them. SARP is a hybrid routing protocol featuring the properties of both vector routing and source routing. It utilizes the usual route discovery and maintenance procedure same as of on-demand routing protocols to discover and maintain routes in the network. During these procedures, a node rebroadcasts excessive numbers of control packet (RREQs, RERRs) in search and maintenance of routes in a network. However, such rebroadcasting is a common and frequent operation in an ad hoc environment with high host mobility. Because radio signals are likely to overlap with others in a geographic area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision to which we refer as broadcast storm problem. So, the main objective in this thesis is to contain unnecessary rebroadcast thereby performing efficient rebroadcasting which further reduces the total energy consumption in ad hoc networks. (Abstract shortened by UMI.) / Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering. / "December 2005."
| Identifer | oai:union.ndltd.org:WICHITA/oai:soar.wichita.edu:10057/743 |
| Date | 12 1900 |
| Creators | Malla, Deependra |
| Contributors | Pendse, Ravi |
| Source Sets | Wichita State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | 513917 bytes, application/pdf |
| Rights | Copyright Deependra Malla, 2005. All rights reserved. |
Page generated in 0.0018 seconds