Scalability study of the ad hoc on‐demand distance vector routing protocol

TLDR

Mobile networking’s growing popularity demands connecting many wireless devices, yet many ad hoc routing proposals have features that may limit scalability to large networks. The study examines five combinations of modifications that can be added to any on‑demand protocol to enhance its scalability. The authors evaluate scalability by selecting a representative on‑demand protocol, comparing its unmodified performance to each modification, and simulating networks up to 10,000 nodes. The results indicate the expected scalability improvement achievable by each modification. © 2003 John Wiley & Sons, Ltd.

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 that may limit their scalability to large networks. This paper examines five different combinations of modifications that 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 that can be achieved by each modification. Copyright © 2003 John Wiley & Sons, Ltd.