Group aware cooperative routing for opportunistic networks under resource constraints

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Global Communications Conference

• Publication date

  2012-12-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/GLOCOM.2012.6504030
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Routing in Socially Selfish Delay Tolerant Networks

  2010cited by this paper
• On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks

  2010cited by this paper
• CREST: An Opportunistic Forwarding Protocol Based on Conditional Residual Time

  2009cited by this paper
• Encounter: based routing in DTNs

  2009influential reference
• An optimal probabilistic forwarding protocolin delay tolerant networks

  2009cited by this paper
• Epidemic Routing for Partially-Connected Ad Hoc Networks

  2009cited by this paper
• Predict and relay: an efficient routing in disruption-tolerant networks

  2009cited by this paper
• The ONE simulator for DTN protocol evaluation

  2009cited by this paper
• Optimal Buffer Management Policies for Delay Tolerant Networks

  2008cited by this paper
• Delegation forwarding

  2008cited by this paper
• DTN routing as a resource allocation problem

  2007cited by this paper
• Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility

  2007cited by this paper
• Opportunistic networking: data forwarding in disconnected mobile ad hoc networks

  2006cited by this paper
• MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks

  2006cited by this paper
• Spray and wait: an efficient routing scheme for intermittently connected mobile networks

  2005influential reference
• Practical Routing in Delay-Tolerant Networks

  2005cited by this paper
• Routing in a delay tolerant network

  2004cited by this paper
• Probabilistic routing in intermittently connected networks

  2003influential reference
• LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility

  2000influential reference

• Caching algorithms for broadcasting and multicasting in disruption tolerant networks

  2016cites this paper
• Efficient caching scheme for data access in disruption tolerant networks

  2015cites this paper