Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Convex Optimization
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Measurements from an 802.11b Mobile Ad Hoc Network
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
ACM SIGMOBILE Mobile Computing and Communications Review
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Partial vs. Complete Domination: t-Dominating Set
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Modeling spatial and temporal dependencies of user mobility in wireless mobile networks
IEEE/ACM Transactions on Networking (TON)
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Optimal channel choice for collaborative ad-hoc dissemination
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
Markov approximation for combinatorial network optimization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Information dissemination dynamics in delay tolerant network: a bipartite network approach
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Social-aware multicast in disruption-tolerant networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Opportunistic Networking allows wireless nodes to exchange data and information of interest with peers in communication range. These nodes form a large, dynamic, multi-hop network on the fly. Challenging optimization problems arise, such as end-to-end routing, resource allocation (e.g., for buffer space and bandwidth), content placement etc., exacerbated by the lack of end-to-end connectivity. While globally optimal solutions are normally sought in network optimization, node actions and decisions in this context are inherently local. As a result, most solutions proposed rely on local heuristics without any guarantees about their convergence properties towards a desired global outcome. In this paper, we argue that the framework of Markov Chain Monte Carlo (MCMC) optimization can be applied to many problems in Opportunistic Networking, providing efficient local algorithms that provably converge to a globally optimal solution. As a case study, we use the problem of optimal relay selection for group communication (e.g., multicast), based on node contact patterns.