Effects of Small Transfers and Traffic Patterns on Performance and Cache Efficacy of Ad Hoc Routing (2003)
| Citations: | 4 - 1 self |
BibTeX
@MISC{Wang03effectsof,
author = {Shao-Cheng Wang and Ahmed Helmy and I. Introduction},
title = {Effects of Small Transfers and Traffic Patterns on Performance and Cache Efficacy of Ad Hoc Routing},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Routing protocols in ad hoc networks can be generally categorized as proactive and reactive. Previous studies [1] have shown that on-demand (reactive) routing protocols perform a lot better in terms of high throughput and low overhead especially with node mobility. On-demand protocols (e.g.DSR, AODV) employ efficient route caching mechanisms to avoid unnecessary route discovery floods and robust route maintenance mechanisms to deal with frequent route breaks. Most performance studies of ad hoc routing use long-lived randomly assigned connections that usually last throughout the simulation duration. These connections emulate file transfer (ftp) or user-specific constant bit rate (CBR) applications. Such simulations mainly capture route maintenance/repair phase in addition to the initial route discovery/setup phase of the routing protocols. However, for short-lived small transfers routing protocols may exhibit significantly different behavior. Small transfers may include resource discovery...
