4037 search results - page 182 / 808 » Routing without ordering |
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
VTC
2007
IEEE
14 years 4 months ago
2007
IEEE
—Coupling Vehicular Ad Hoc Networks (VANETs) with wired networks such as the Internet via access points creates a difficult mix of highly mobile nodes and a static infrastructur...
PDCAT
2007
Springer
14 years 4 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
ICMCS
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first pro...
ANCS
2005
ACM
14 years 3 months ago
2005
ACM
This paper investigates the suitability of emerging tiled-architectures, equipped with low-latency on-chip networks, for high-performance network routing. In this paper, we presen...