128 search results - page 2 / 26 » Routing in Socially Selfish Delay Tolerant Networks |
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
ICC
2009
IEEE
13 years 3 months ago
2009
IEEE
Conventional routing algorithms in mobile ad hoc networks (MANETs), i.e., multi-hop forwarding, assume the existence of contemporaneous source-destination paths and are not scalabl...
CSE
2009
IEEE
14 years 3 days ago
2009
IEEE
—In this paper, we propose to leverage social graphs from Online Social Networks (OSN) to improve the forwarding efficiency of mobile networks, more particularly Delay Tolerant ...
ESA
2007
Springer
13 years 9 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...