Sciweavers

39 search results - page 2 / 8
» A New Look at Selfish Routing
Sort
View
SODA
2004
ACM
118views Algorithms» more  SODA 2004»
13 years 7 months ago
The maximum latency of selfish routing
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
Tim Roughgarden
ESAS
2004
Springer
13 years 9 months ago
Advanced Detection of Selfish or Malicious Nodes in Ad Hoc Networks
Abstract. The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node ma...
Frank Kargl, Andreas Klenk, Stefan Schlott, Michae...
CONEXT
2008
ACM
13 years 7 months ago
EGOIST: overlay routing using selfish neighbor selection
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
Georgios Smaragdakis, Vassilis Lekakis, Nikolaos L...
LCN
2002
IEEE
13 years 10 months ago
A First Look at Wired Sensor Networks for Video Surveillance Systems
Sensor networks are a major new area of research. Some sensor applications, such as video surveillance, will need to be tethered for reasons of bandwidth and power requirements. T...
Vijay Chandramohan, Kenneth J. Christensen
WICOMM
2008
139views more  WICOMM 2008»
13 years 5 months ago
Struggling against selfishness and black hole attacks in MANETs
Since mobile ad hoc networks (MANETs) are infrastructureless and multi-hop by nature, transmitting packets from any node to another usually relies on services provided by intermed...
Djamel Djenouri, Nadjib Badache