1592 search results - page 179 / 319 » Source-Tree Routing in Wireless Networks |
111
Voted
PERCOM
2003
ACM
15 years 6 months ago
2003
ACM
We investigate the performance issues of destinationsequenced distance vector (DSDV) and ad-hoc on-demand distance vector (AODV) routing protocols for mobile ad hoc networks. Four...
148
Voted
PIMRC
2008
IEEE
15 years 7 months ago
2008
IEEE
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
MOBICOM
2003
ACM
15 years 6 months ago
2003
ACM
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e....
107
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
104
Voted
CAMAD
2006
IEEE
15 years 4 months ago
2006
IEEE
Abstract-- In this paper we discuss the exploitation of aggregated mobility patterns and physical proximity of nodes in a so-called ambient network, i.e., a wireless network with h...