The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Routing in Socially Selfish Delay Tolerant Networks
Abstract
Existing routing algorithms for Delay Tolerant Networks(DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to allow user selfishness and provide better routing performance in an efficient way. To select a forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, resulting in a better forwarding strategy than purely contact-based approaches. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves better routing performance with low transmission cost.
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
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
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
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
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
Discriminant Analysis and Statistical Pattern Recognition.
Hawkins, D. M., & McLachlan, G. J. (1993) · Journal of the American Statistical Association · doi:10.2307/2290355 · Cited by 2,633
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
MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.228 · Cited by 2,042
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
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
Predicting tie strength with social media
Gilbert, E., & Karahalios, K. (2009) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1518701.1518736 · Cited by 1,382
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 - SIGCOMM '03 · doi:10.1145/863956.863960 · Cited by 1,288
Discriminant Analysis and Statistical Pattern Recognition
McLachlan, G. J. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/0471725293 · Cited by 1,267
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks
Zhong, S., Chen, J., & Yang, Y. R. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209220 · Cited by 1,219
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
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
Pocket switched networks and human mobility in conference environments
Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., & Diot, C. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking - WDTN '05 · doi:10.1145/1080139.1080142 · Cited by 946
Bubble rap: social-based forwarding in delay tolerant networks
Hui, P., Crowcroft, J., & Yoneki, E. (2008) · Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1374618.1374652 · Cited by 814
A Nonparametric Estimate of a Multivariate Density Function
Loftsgaarden, D. O., & Quesenberry, C. P. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700079 · Cited by 781
Multicasting 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
Self-citationVADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
Zhao, J., & Cao, G. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.298 · Cited by 486
Self-citationErramilli, V., Crovella, M., Chaintreau, A., & Diot, C. (2008) · Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1374618.1374653 · Cited by 359
CRAWDAD: A Community Resource for Archiving Wireless Data at Dartmouth
Kotz, D., & Henderson, T. (2005) · IEEE Pervasive Computing · doi:10.1109/mprv.2005.75 · Cited by 268
Incentive-aware routing in DTNs
Shevade, U., Song, H. H., Qiu, L., & Zhang, Y. (2008) · 2008 IEEE International Conference on Network Protocols · doi:10.1109/icnp.2008.4697042 · Cited by 218
The diameter of opportunistic mobile networks
Chaintreau, A., Mtibaa, A., Massoulie, L., & Diot, C. (2007) · Proceedings of the 2007 ACM CoNEXT conference on - CoNEXT '07 · doi:10.1145/1364654.1364670 · Cited by 183
Jaramillo, J. J., & Srikant, R. (2007) · doi:10.1145/1287853.1287865 · Cited by 168
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
Dawande, M., Kalagnanam, J., Keskinocak, P., Salman, F. S., & Ravi, R. (2000) · Journal of Combinatorial Optimization · doi:10.1023/a:1009894503716 · Cited by 148
Thwarting Blackhole Attacks in Disruption-Tolerant Networks using Encounter Tickets
Li, F., Wu, J., & Srinivasan, A. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5062170 · Cited by 131
Practical security for disconnected nodes
Seth, A., & Keshav, S. (2005) · IEEE Workshop on Secure Network Protocols (NPSec) · doi:10.1109/npsec.2005.1532050 · Cited by 110
Semantic constraints for trust transitivity
Jøsang, A., & Pope, S. (2005) · Cited by 98
Cited by
Trust Management for SOA-Based IoT and Its Application to Service Composition
Chen, I.-R., Guo, J., & Bao, F. (2016) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2014.2365797 · Cited by 415
Trust-Based Service Management for Social Internet of Things Systems
Chen, I.-R., Bao, F., & Guo, J. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2420552 · Cited by 395
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
Cho, J.-H., Chan, K., & Adali, S. (2015) · ACM Computing Surveys · doi:10.1145/2815595 · Cited by 342
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
Metadata
- Authors
- Li, Q., Zhu, S., & Cao, G.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-9
- OpenAlex
- W2079274032
- Cited by
- 351
- References
- 30
- FWCI
- 41.63
- 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.