711 search results - page 77 / 143 » Distributed Energy-conserving Routing Protocols |
112
click to vote
IPSN
2004
Springer
15 years 6 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
124
click to vote
OPODIS
2007
15 years 2 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
166
click to vote
ICDCS
1998
IEEE
15 years 5 months ago
1998
IEEE
Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communication support facilities (such as base stations). The topo...
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
131
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...