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

abstract

• 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. 2011 IEEE.

authors

• Momcilovic, Petar

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

author list (cited authors)

• Chen, L., & Momcilovic, P.

citation count

• 0

complete list of authors

• Chen, Li-Yen||Momcilovic, Petar

publication date

• July 2011

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Column-first Routing
• Information-efficient
• Routing Tables
• Scalability
• Wireless Networks

Digital Object Identifier (DOI)

• 10.1109/TIT.2011.2146630

start page

• 4302

end page

• 4314

volume

• 57

issue

• 7

URL

• http://dx.doi.org/10.1109/tit.2011.2146630