Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

NETCOOP
2009
Springer

favoriteEmaildiscussreport

212views Computer Networks» more NETCOOP 2009»

Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing

14 years 25 days ago

Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing

Download www-sop.inria.fr

This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performance measures. We then study competitive and cooperative operation of DTNs and derive the structure of optimal and of equilibrium policies.

Eitan Altman

Real-time Traffic

Computer Networks | Delay Tolerant Networks | NETCOOP 2009 | Simple Probabilistic Arguments | Two-hop Forwarding Policy |

claim paper

Related Content

» Fixed point opportunistic routing in delay tolerant networks

» Efficient routing in delay tolerant networks with correlated node mobility

» DelayTolerant Cooperative Diversity Routing MANET

» Stability and Delay Analysis for MultiHop SingleSink Wireless Sensor Networks

» Pi a practical incentive protocol for delay tolerant networks

» Low Bound of EnergyLatency TradeOff of Opportunistic Routing in MultiHop Networks

» Cross Layer Routing for Multihop Cellular Networks

» DelayEnergy Aware Routing Protocol for Sensor and Actor Networks

» Reliable and energyefficient routing protocol in dense wireless sensor networks

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	NETCOOP
Authors	Eitan Altman

Comments (0)