The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
Abstract
Applications involving the dissemination of information directly relevant to humans (e.g., service advertising, news spreading, environmental alerts) often rely on publish-subscribe, in which the network delivers a published message only to the nodes whose subscribed interests match it. In principle, publish- subscribe is particularly useful in mobile environments, since it minimizes the coupling among communication parties. However, to the best of our knowledge, none of the (few) works that tackled publish-subscribe in mobile environments has yet addressed intermittently-connected human networks. Socially-related people tend to be co-located quite regularly. This characteristic can be exploited to drive forwarding decisions in the interest-based routing layer supporting the publish-subscribe network, yielding not only improved performance but also the ability to overcome high rates of mobility and long-lasting disconnections. In this paper we propose SocialCast, a routing framework for publish-subscribe that exploits predictions based on metrics of social interaction (e.g., patterns of movements among communities) to identify the best information carriers. We highlight the principles underlying our protocol, illustrate its operation, and evaluate its performance using a mobility model based on a social network validated with real human mobility traces. The evaluation shows that prediction of colocation and node mobility allow for maintaining a very high and steady event delivery with low overhead and latency, despite the variation in density, number of replicas per message or speed.
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
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567
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
Decisions with Multiple Objectives: Preferences and Value Tradeoffs.
Tsoukias, A., Keeney, R. L., & Raiffa, H. (1994) · The Journal of the Operational Research Society · doi:10.2307/2584151 · Cited by 8,370
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,133
Introduction to Time Series and Forecasting
(2002) · Springer Texts in Statistics · doi:10.1007/b97391 · Cited by 3,807
The Analysis of Time Series: An Introduction
Dickey, D. A., & Chatfield, C. (1991) · Technometrics · doi:10.2307/1268794 · Cited by 3,525
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
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
Small worlds: the dynamics of networks between order and randomness
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5722 · Cited by 2,360
Probabilistic routing in intermittently connected networks
Lindgren, A., Doria, A., & Schelén, O. (2003) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/961268.961272 · Cited by 2,288
Small Worlds: The Dynamics of Networks between Order and Randomness
Watts, D. J. (1999) · Princeton University Press eBooks · doi:10.1515/9780691188331 · Cited by 2,105
THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM
Varga, A. (2003) · Cited by 1,934
Routing in a delay tolerant network
Jain, S., Fall, K., & Patra, R. K. (2004) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · doi:10.1145/1015467.1015484 · Cited by 1,779
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
Social network analysis for routing in disconnected delay-tolerant MANETs
Daly, E. M., & Haahr, M. (2007) · Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1288107.1288113 · Cited by 1,151
A digital fountain approach to reliable distribution of bulk data
Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285258 · Cited by 1,138
DTN routing as a resource allocation problem
Balasubramanian, A., Levine, B., & Venkataramani, A. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282422 · Cited by 947
Small Worlds: The Dynamics of Networks between Order and Randomness
Watts, D. J., & Bak, P. (2000) · Physics Today · doi:10.1063/1.1333299 · Cited by 599
Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.172 · Cited by 584
The Analysis of Time Series: An Introduction
Chatfield, C. (1984) · Springer eBooks · doi:10.1007/978-1-4899-2921-1 · Cited by 516
DTN routing as a resource allocation problem
Balasubramanian, A., Levine, B., & Venkataramani, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282422 · Cited by 430
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
Musolesi, M., Hailes, S., & Mascolo, C. (2005) · Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks · doi:10.1109/wowmom.2005.17 · Cited by 386
Self-citationDistributed community detection in delay tolerant networks
Hui, P., Yoneki, E., Chan, S. Y., & Crowcroft, J. (2007) · Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture · doi:10.1145/1366919.1366929 · Cited by 370
Designing mobility models based on social network theory
Musolesi, M., & Mascolo, C. (2007) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1317425.1317433 · Cited by 293
Self-citationA socio-aware overlay for publish/subscribe communication in delay tolerant networks
Yoneki, E., Hui, P., Chan, S., & Crowcroft, J. (2007) · Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems · doi:10.1145/1298126.1298166 · Cited by 255
Cited by
Atzori, L., Iera, A., Morabito, G., & Nitti, M. (2012) · Computer Networks · doi:10.1016/j.comnet.2012.07.010 · Cited by 1,238
Attacks and countermeasures in the internet of vehicles
Sun, Y., Wu, L., Wu, S., Li, S., Zhang, T., Zhang, L., Xu, J., Xiong, Y., & Cui, X. (2017) · Annals of Telecommunications · doi:10.1007/s12243-016-0551-6 · Cited by 103
Security and Privacy in the Internet of Vehicles
Sun, Y., Wu, L., Wu, S., Li, S., Zhang, T., Zhang, L., Xu, J., & Xiong, Y. (2015) · 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI) · doi:10.1109/iiki.2015.33 · Cited by 81
Metadata
- Authors
- Costa, P., Mascolo, C., Musolesi, M., & Picco, G.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2008-06
- Volume
- 26
- Issue
- 5
- Pages
- 748-760
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2170904274
- Cited by
- 478
- References
- 26
- FWCI
- 58.16
- 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.
