By Topic

On Scalability of Routing Tables in Dense Flat-Label Wireless Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li-Yen Chen ; Microsoft Corp., Redmond, WA, USA ; Momcilovic, P.

Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. This paper investigates the size of routing tables as the number of nodes in the network increases. A routing protocol in a flat-label network is information-efficient if the amount of information at individual nodes required to route packets does not increase with the network size. It is shown that the shortest-path and straight-line routing algorithms are not information-efficient, i.e., these protocols can be implemented only when nodes' memory increases with the network size. On the other hand, it is established that there exists an information-efficient algorithm that routes packets correctly even if each node in the network is capable of storing information on a fixed number of destinations only.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 7 )