410 search results - page 76 / 82 » Upgrading Shortest Paths in Networks |
CORR
2004
Springer
14 years 11 months ago
2004
Springer
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...
100
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
88
Voted
ICNP
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
100
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
110
click to vote
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...