Scalability is one of the toughest challenges in ad hoc networking. Recent work outlines theoretical bounds on how well routing protocols could scale in this environment. However, none of the popular routing solutions really scales to large networks, by coming close enough to these bounds. In this paper, we study the case of link state routing and OLSR, one of the strongest candidates for standardization. We analyze how these bounds are not reached in this case, and we study how much the scalability is enhanced with the use of Fish eye techniques in addition to the link state routing framework. We show that with this enhancement, the theoretical scalability bounds are reached.
|Number of pages
|Journal of Communications and Networks
|Published - Dec 2004
- Ad hoc