Scalability study of the ad hoc on-demand distance vector routing protocol (2003)
Cached
Download Links
- [research.hp.com]
- [www.hpl.hp.com]
- [www.hpl.hp.com]
- DBLP
Other Repositories/Bibliography
| Venue: | International Journal of Network Management |
| Citations: | 30 - 1 self |
BibTeX
@ARTICLE{Lee03scalabilitystudy,
author = {Sung-ju Lee and Elizabeth M. Belding-royer and Charles E. Perkins},
title = {Scalability study of the ad hoc on-demand distance vector routing protocol},
journal = {International Journal of Network Management},
year = {2003},
volume = {13},
pages = {97--114}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract — As mobile networking continues to experience increasing popularity, the need to connect large numbers of wireless devices will become more prevalent. Many recent proposals for ad hoc routing have certain characteristics which may limit their scalability to large networks. This paper examines five different combinations of modifications which may be incorporated into virtually any on-demand protocol in order to improve its scalability. The scalability of current on-demand routing protocols is evaluated through the selection of a representative from this class of protocols. The performance of the un-modified on-demand protocol is compared against that of it combined with each of the scalability modifications. Each scheme’s behavior is analyzed in networks as large as 10,000 nodes through detailed simulation. Based on the observations, conclusions are drawn as to the expected scalability improvement which can be achieved by each modification. I.
