Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Improved algorithms and analysis for secretary problems and generalizations
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Practical routing in delay-tolerant networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Scalable routing in delay tolerant networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Diversity of forwarding paths in pocket switched networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
The hiring problem and Lake Wobegon strategies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Forwarding in opportunistic networks with resource constraints
Proceedings of the third ACM workshop on Challenged networks
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Delay tolerant bulk data transfers on the internet
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
A low-energy, multi-copy inter-contact routing protocol for disaster response networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
PassItOn: an opportunistic messaging prototype on mobile devices
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Using Haggle to create an electronic triage tag
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Peoplerank: social opportunistic forwarding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Retiring replicants: congestion control for intermittently-connected networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Max-contribution: on optimal resource allocation in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
CPMC: an efficient proximity malware coping scheme in smartphone-based mobile networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Locus: a location-based data overlay for disruption-tolerant networks
Proceedings of the 5th ACM workshop on Challenged networks
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
Strangers help friends to communicate in opportunistic networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Practical routing in a cyclic MobiSpace
IEEE/ACM Transactions on Networking (TON)
A dynamic multicast tree based routing scheme without replication in delay tolerant networks
Journal of Parallel and Distributed Computing
Utility-based forwarding: a comparison in different mobility scenarios
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
A routing protocol for socially selfish delay tolerant networks
Ad Hoc Networks
FAN: friendship based anonymous routing in wireless social mobile networks of malicious communities
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
CAF: Community aware framework for large scale mobile opportunistic networks
Computer Communications
Social-aware multicast in disruption-tolerant networks
IEEE/ACM Transactions on Networking (TON)
Fairness-related challenges in mobile opportunistic networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data delivery scheme for intermittently connected mobile sensor networks
Computer Communications
Evaluating opportunistic networks in disaster scenarios
Journal of Network and Computer Applications
Universal scheme improving probabilistic routing in delay-tolerant networks
Computer Communications
Decentralized checking of context inconsistency in pervasive computing environments
The Journal of Supercomputing
Threshold based locking routing strategy for delay tolerant network
Wireless Networks
Delay-tolerant bulk data transfers on the internet
IEEE/ACM Transactions on Networking (TON)
Contact quality based forwarding strategy for delay tolerant network
Journal of Network and Computer Applications
ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing with multi-level cross-community social groups in mobile opportunistic networks
Personal and Ubiquitous Computing
Hi-index | 0.00 |
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low costs and delays in such networks is thus challenging. Most forwarding algorithms avoid the cost associated with flooding the network by forwarding only to nodes that are likely to be good relays, using a quality metric associated with nodes. However it is non-trivial to decide whether an encountered node is a good relay at the moment of encounter. Thus the problem is in part one of online inference of the quality distribution of nodes from sequential samples, and has connections to optimal stopping theory. Based on these observations we develop a new strategy for forwarding, which we refer to as delegation forwarding. We analyse two variants of delegation forwarding and show that while naive forwarding to high contact rate nodes has cost linear in the population size, the cost of delegation forwarding is proportional to the square root of population size. We then study delegation forwarding with different metrics using real mobility traces and show that delegation forwarding performs as well as previously proposed algorithms at much lower cost. In particular we show that the delegation scheme based on destination contact rate does particularly well.