The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Bubble rap: social-based forwarding in delay tolerant networks
Abstract
In this paper we seek to improve our understanding of human mobility in terms of social structures, and to use these structures in the design of forwarding algorithms for Pocket Switched Networks (PSNs). Taking human mobility traces from the real world, we discover that human interaction is heterogeneous both in terms of hubs (popular individuals) and groups or communities. We propose a social based forwarding algorithm, BUBBLE, which is shown empirically to improve the forwarding efficiency significantly compared to oblivious forwarding schemes and to PROPHET algorithm. We also show how this algorithm can be implemented in a distributed way, which demonstrates that it is applicable in the decentralised environment of PSNs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,624
From molecular to modular cell biology.
Hartwell, L. H., Hopfield, J. J., Leibler, S., & Murray, A. W. (1999) · Nature · doi:10.1038/35011540 · Cited by 3,632 · cited 1×
“communities, by looking for similar relation has also been studied in social network research such as World Wide Web [7], biological networks [9], social networks [25], and the Internet [20].”
BackgroundA 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
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Mobility increases the capacity of ad hoc wireless networks
Grossglauser, M., & Tse, D. N. C. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801403 · Cited by 2,839
Reality mining: sensing complex social systems
Eagle, N., & (Sandy) Pentland, A. (2006) · Personal and Ubiquitous Computing · doi:10.1007/s00779-005-0046-3 · Cited by 2,772
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005) · doi:10.1145/1080139.1080143 · Cited by 2,649
Cited by
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
Hui, P., Crowcroft, J., & Yoneki, E. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.246 · Cited by 1,515
Self-citationMulticasting in delay tolerant networks: a social network perspective
Gao, W., Li, Q., Zhao, B., & Cao, G. (2009) · Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1530748.1530790 · Cited by 537
MobiClique: middleware for mobile social networking
Pietiläinen, A.-K., Oliver, E., LeBrun, J., Varghese, G., & Diot, C. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592678 · Cited by 357
Routing in Socially Selfish Delay Tolerant Networks
Li, Q., Zhu, S., & Cao, G. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462138 · Cited by 351
Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges
Cao, Y., & Sun, Z. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.042512.00053 · Cited by 350
Opportunistic IoT: Exploring the harmonious interaction between human and the internet of things
Guo, B., Zhang, D., Wang, Z., Yu, Z., & Zhou, X. (2013) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2012.12.028 · Cited by 336
Cellular Traffic Offloading through WiFi Networks
Dimatteo, S., Hui, P., Han, B., & Li, V. O. K. (2011) · 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems · doi:10.1109/mass.2011.26 · Cited by 301
Self-citationA Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects
Zhu, Y., Xu, B., Shi, X., & Wang, Y. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.032612.00004 · Cited by 295
Towards real-time community detection in large networks
Leung, I. X. Y., Hui, P., Liò, P., & Crowcroft, J. (2009) · Physical Review E · doi:10.1103/physreve.79.066107 · Cited by 289
Self-citationSMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks
Zhu, H., Lin, X., Lu, R., Fan, Y., & Shen, X. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2020105 · Cited by 284
Conti, M., Das, S. K., Bisdikian, C., Kumar, M., Ni, L. M., Passarella, A., Roussos, G., Tröster, G., Tsudik, G., & Zambonelli, F. (2012) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2011.10.001 · Cited by 275
From opportunistic networks to opportunistic computing
Conti, M., Giordano, S., May, M., & Passarella, A. (2010) · IEEE Communications Magazine · doi:10.1109/mcom.2010.5560597 · Cited by 259
Heuristic Congestion Control for Message Deletion in Delay Tolerant Network
Leela-amornsin, L., & Esaki, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14891-0_26 · Cited by 19
Metadata
- Authors
- Hui, P., Crowcroft, J., & Yoneki, E.
- Venue
- Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
- Publisher
- ACM
- Published
- 2008-05-26
- Pages
- 241-250
- OpenAlex
- W2135712710
- Cited by
- 814
- References
- 34
- FWCI
- 73.96
- Type
- conference paper
- 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.