3247 search results - page 495 / 650 » Randomized smoothing networks |
170
click to vote
ICSNW
2004
Springer
15 years 11 months ago
2004
Springer
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
174
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple nodedisjoint paths f...
160
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
185
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
166
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-c...