A sociality-aware approach to computing backbone in mobile opportunistic networks
Authors:
- Tong LiuTLTong Liu
- Yanmin ZhuYZYanmin Zhu
- Ruobing JiangRJRuobing Jiang
- Bo LiBLBo Li
- 1 January 2015
- journal article
- Published by Elsevier in Ad Hoc Networks
- Vol. 24, 46-56
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Spatiotemporal routing algorithm in opportunistic networks2008
- Probabilistic Routing Protocol for Intermittently Connected Mobile Ad hoc Network (PROPICMAN)2007
- Opportunistic networking: data forwarding in disconnected mobile ad hoc networksIEEE Communications Magazine, 2006
- Power laws, Pareto distributions and Zipf's lawContemporary Physics, 2005
- MV routing and capacity building in disruption tolerant networks2005
- Probabilistic routing in intermittently connected networksACM SIGMOBILE Mobile Computing and Communications Review, 2003
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functionsMathematical Programming, 1984
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977