The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Mobile Data Offloading through Opportunistic Communications and Social Participation
Abstract
3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communications is a promising solution to partially solve this problem, because there is almost no monetary cost for it. We propose to exploit opportunistic communications to facilitate information dissemination in the emerging Mobile Social Networks (MoSoNets) and thus reduce the amount of mobile data traffic. As a case study, we investigate the target-set selection problem for information delivery. In particular, we study how to select the target set with only k users, such that we can minimize the mobile data traffic over cellular networks. We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. Our simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload mobile data traffic by up to 73.66 percent for a real-world mobility trace. Moreover, to investigate the feasibility of opportunistic communications for mobile phones, we implement a proof-of-concept prototype, called Opp-off, on Nokia N900 smartphones, which utilizes their Bluetooth interface for device/service discovery and content transfer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Understanding individual human mobility patterns
González, M. C., Hidalgo, C. A., & Barabási, A.-L. (2008) · Nature · doi:10.1038/nature06958 · Cited by 6,059
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
A delay-tolerant network architecture for challenged internets
Fall, K. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863960 · Cited by 3,082
Chandrasekhar, V., Andrews, J., & Gatherer, A. (2008) · IEEE Communications Magazine · doi:10.1109/mcom.2008.4623708 · Cited by 3,022
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
Directed diffusion for wireless sensor networking
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808417 · Cited by 2,359
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
Goldenberg, J., Libai, B., & Muller, E. (2001) · Marketing Letters · doi:10.1023/a:1011122126881 · Cited by 1,995
Inferring friendship network structure by using mobile phone data
Eagle, N., Pentland, A. (., & Lazer, D. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0900282106 · Cited by 1,856
Network models of the diffusion of innovations
Valente, T. (1996) · Computational and Mathematical Organization Theory · doi:10.1007/bf00240425 · Cited by 1,630
Mining knowledge-sharing sites for viral marketing
Richardson, M., & Domingos, P. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775057 · Cited by 1,612
Delay-tolerant networking: an approach to interplanetary Internet
Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., Scott, K., & Weiss, H. (2003) · IEEE Communications Magazine · doi:10.1109/mcom.2003.1204759 · Cited by 1,416
Energy consumption in mobile phones: a measurement study and implications for network applications
Balasubramanian, N., Balasubramanian, A., & Venkataramani, A. (2009) · Proceedings of the 9th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1644893.1644927 · Cited by 1,101
Information diffusion through blogspace
Gruhl, D., Guha, R., Liben-Nowell, D., & Tomkins, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988739 · Cited by 1,041
Miluzzo, E., Lane, N. D., Fodor, K., Peterson, R., Lu, H., Musolesi, M., Eisenman, S. B., Zheng, X., & Campbell, A. T. (2008) · Proceedings of the 6th ACM conference on Embedded network sensor systems · doi:10.1145/1460412.1460445 · Cited by 1,032
Impact of Human Mobility on Opportunistic Forwarding Algorithms
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1060 · Cited by 1,023
Self-citationInformation diffusion through blogspace
Gruhl, D., Liben-Nowell, D., Guha, R., & Tomkins, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1046456.1046462 · Cited by 927
An analysis of approximations for maximizing submodular set functions - 1Preprint
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · RePEc: Research Papers in Economics · Cited by 837
Augmenting mobile 3G using WiFi
Balasubramanian, A., Mahajan, R., & Venkataramani, A. (2010) · Proceedings of the 8th international conference on Mobile systems, applications, and services · doi:10.1145/1814433.1814456 · Cited by 587
Social Serendipity: Mobilizing Social Software
Eagle, N., & Pentland, A. (2005) · IEEE Pervasive Computing · doi:10.1109/mprv.2005.37 · Cited by 465
Micro-Blog: sharing and querying content through mobile phones and social participation
Gaonkar, S., Li, J., Choudhury, R. R., Cox, L., & Schmidt, A. (2008) · Proceedings of the 6th international conference on Mobile systems, applications, and services · doi:10.1145/1378600.1378620 · Cited by 405
Pering, T., Agarwal, Y., Gupta, R. K., & Want, R. (2006) · International Conference on Mobile Systems, Applications, and Services · doi:10.1145/1134680.1134704 · Cited by 389
Optimal and scalable distribution of content updates over a mobile social network
Ioannidis, S., Chaintreau, A., & Massoulie, L. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5062058 · Cited by 281
SWIM: A Simple Model to Generate Small Mobile Worlds
Mei, A., & Stefa, J. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5062134 · Cited by 207
Media sharing based on colocation prediction in urban transport
McNamara, L., Mascolo, C., & Capra, L. (2008) · Proceedings of the 14th ACM international conference on Mobile computing and networking · doi:10.1145/1409944.1409953 · Cited by 164
Blue-Fi: enhancing Wi-Fi performance using bluetooth signals
Ananthanarayanan, G., & Stoica, I. G. (2009) · International Conference on Mobile Systems, Applications, and Services · doi:10.1145/1555816.1555842 · Cited by 138
Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks
Drula, C., Amza, C., Rousseau, F. S., et al. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.070110 · Cited by 80
Incentivizing peer-assisted services: a fluid shapley value approach
Misra, V., Ioannidis, S., Chaintreau, A., & Massoulié, L. (2010) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1811039.1811064 · Cited by 72
Cited by
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
Data Offloading Techniques in Cellular Networks: A Survey
Rebecchi, F., Dias de Amorim, M., Conan, V., Passarella, A., Bruno, R., & Conti, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2369742 · Cited by 352
EFFORT: Energy efficient framework for offload communication in mobile cloud computing
Malik, S. U. R., Akram, H., Gill, S. S., Pervaiz, H., & Malik, H. (2021) · Software: Practice and Experience · doi:10.1002/spe.2850 · Cited by 33
Metadata
- Authors
- Han, B., Hui, P., Kumar, V. S. A., Marathe, M. V., Shao, J., & Srinivasan, A.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2012-05
- Volume
- 11
- Issue
- 5
- Pages
- 821-834
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2167718801
- Cited by
- 489
- References
- 29
- FWCI
- 51.89
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.