11381 search results - page 2133 / 2277 » Connectivity |
147
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
153
Voted
OPODIS
2007
15 years 5 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)....
144
click to vote
OPODIS
2007
15 years 5 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
146
click to vote
WICON
2008
15 years 5 months ago
2008
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
166
Voted
AAAI
2006
15 years 5 months ago
2006
Intrusion attempts due to self-propagating code are becoming an increasingly urgent problem, in part due to the homogeneous makeup of the internet. Recent advances in anomalybased...