In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
Matthew Andrews, Baruch Awerbuch, Antonio Fern&aac...
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proxi...
Seungjoon Lee, Bobby Bhattacharjee, Suman Banerjee
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...
Mikael Degermark, Andrej Brodnik, Svante Carlsson,...
An ad-hoc network is formed when a group of wireless nodes pledge to help each other in passing packets based upon a pre-agreed protocol. Temporally Ordered Routing Algorithm (TOR...