Sciweavers

189 search results - page 28 / 38
» Shortest Paths Without a Map
Sort
View
ICNP
2006
IEEE
14 years 1 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...
INFOCOM
2005
IEEE
14 years 1 months ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...
INFOCOM
2007
IEEE
14 years 2 months ago
Connectivity-Aware Routing (CAR) in Vehicular Ad-hoc Networks
— Vehicular ad hoc networks using WLAN technology have recently received considerable attention. We present a position-based routing scheme called Connectivity-Aware Routing (CAR...
Valery Naumov, Thomas R. Gross
NETWORKING
2004
13 years 9 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda