306 search results - page 53 / 62 » Routing Algorithms for Anycast Messages |
145
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
159
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
143
click to vote
SENSYS
2004
ACM
15 years 9 months ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
135
click to vote
CCGRID
2001
IEEE
15 years 8 months ago
2001
IEEE
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
165
click to vote
MIDDLEWARE
2005
Springer
15 years 9 months ago
2005
Springer
Distributed publish/subscribe systems are naturally suited for processing events in distributed systems. However, support for expressing patterns about disparate events and algorit...