3247 search results - page 325 / 650 » Randomized smoothing networks |
191
click to vote
OPODIS
2007
15 years 8 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)....
204
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
224
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
168
click to vote
MOBICOM
2005
ACM
16 years 9 days ago
2005
ACM
— This paper studies how the capacity of a static multi-channel network scales as the number of nodes, n, increases. Gupta and Kumar have determined the capacity of single-channe...
173
click to vote
KIVS
2005
Springer
16 years 7 days ago
2005
Springer
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...