Sciweavers

2063 search results - page 136 / 413
» connection 2007
Sort
View
MOBIHOC
2007
ACM
16 years 4 months ago
Surviving attacks on disruption-tolerant networks without authentication
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...
John Burgess, George Dean Bissias, Mark D. Corner,...
ICNS
2007
IEEE
15 years 10 months ago
A Wireless Mesh Network-based System for Hotspots Deployment and Management
— In recent years Wireless Local Area Networks (WLANs) or hotspots, as they are commonly known, have emerged as a promising networking platform to extend network connectivity in ...
Jorge Hortelano, Juan-Carlos Cano, Carlos Miguel T...
CCS
2007
ACM
15 years 10 months ago
Implementing and testing dynamic timeout adjustment as a dos counter-measure
In this paper we experimentally analyse various dynamic timeout adjustment strategies in server queues as potential counter-measures against degradation of service attacks. Previo...
Daniel Boteanu, Edouard Reich, José M. Fern...
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 5 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 4 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth