Paper Info
Title
Scalability Of Routing Tables In Wireless Networks
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.
Year
DOI
Venue
2007
10.1109/INFCOM.2007.150
INFOCOM 2007, VOLS 1-5
Keywords
Field
DocType
mobile ad hoc networks,routing protocols,wireless networks,scalability,wireless ad hoc network,throughput,wireless application protocol,wireless network,shortest path,routing protocol,lattices
Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Routing table,Distributed computing,Zone Routing Protocol,Routing protocol
Conference
ISSN
Citations 
PageRank 
0743-166X
0
0.34
References 
Authors
11
1
Name
Order
Citations
PageRank
Petar Momcilovic19312.28