Sciweavers

139 search results - page 6 / 28
» On the Evolution of Selfish Routing
Sort
View
CIIT
2007
161views Communications» more  CIIT 2007»
13 years 11 months ago
Using a two-timer scheme to detect selfish nodes in mobile ad-hoc networks
The cooperation of wireless nodes in ad hoc networks is crucial to ensure the proper working of the whole network due to the absence of infrastructure. Misbehaving nodes can drama...
H. Lui, José G. Delgado-Frias, Sirisha Medi...
EVOW
2010
Springer
14 years 4 months ago
Evolving Individual Behavior in a Multi-agent Traffic Simulator
Abstract. In this paper, we illustrate the use of evolutionary agents in a multiagent system designed to describe the behavior of car drivers. Each agent has the selfish objective ...
Ernesto Sánchez, Giovanni Squillero, Albert...
TWC
2010
13 years 4 months ago
Pi: a practical incentive protocol for delay tolerant networks
Delay Tolerant Networks (DTNs) are a class of networks characterized by lack of guaranteed connectivity, typically low frequency of encounters between DTN nodes and long propagatio...
Rongxing Lu, Xiaodong Lin, Haojin Zhu, Xuemin Shen...
WICOMM
2008
139views more  WICOMM 2008»
13 years 9 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
WICON
2008
13 years 11 months ago
Quality of routing congestion games in wireless sensor networks
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
Costas Busch, Rajgopal Kannan, Athanasios V. Vasil...