Scalability of routing tables in wireless networks Conference Paper

abstract

• Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. The paper investigates the size of routing tables as the number of nodes in the network increases. A routing protocol is information-efficient if the amount of information at individual nodes required to route packets does not increases 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 routing algorithm - routing is feasible even if each node in the network is capable of storing information on a fixed number of destinations. 2007 IEEE.

name of conference

• IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications

authors

• Momcilovic, Petar

published proceedings

• INFOCOM 2007, VOLS 1-5

author list (cited authors)

• Momcilovic, P.

citation count

• 0

complete list of authors

• Momcilovic, Petar

publication date

• January 2007

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Infocom. Proceedings  Journal

keywords

• 46 Information And Computing Sciences
• 4605 Data Management And Data Science
• 4606 Distributed Computing And Systems Software

Digital Object Identifier (DOI)

• 10.1109/INFCOM.2007.150

International Standard Book Number (ISBN) 10

• 1424410479

International Standard Book Number (ISBN) 13

• 978-1-4244-1046-0

start page

• 1262

end page

• 1270

URL

• http://dx.doi.org/10.1109/infcom.2007.150