Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Routing in delay tolerant networks is a challenging problem due to the intermittent connectivity between nodes resulting in the frequent absence of end-to-end path for any source-destination pair at any given time. Recently, this problem has attracted a great deal of interest and several approaches have been proposed. Since Mobile Social Networks (MSNs) are increasingly popular type of Delay Tolerant Networks (DTNs), making accurate analysis of social network properties of these networks is essential for designing efficient routing protocols. In this paper, we introduce a new metric that detects the quality of friendships between nodes accurately. Utilizing this metric, we define the community of each node as the set of nodes having close friendship relations with this node either directly or indirectly. We also present Friendship-Based Routing in which periodically differentiated friendship relations are used in forwarding of messages. Extensive simulations on both real and synthetic traces show that the introduced algorithm is more efficient than the existing algorithms.
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
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
Cited by
Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks
Alanis, D., Hu, J., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2629671 · Cited by 15
“To elaborate further, Bulut and Szymanski [13] proposed a routing scheme in the context of Delay-Tolerant Networks (DTN) for maximizing the associated routing efficiency by grouping the Mobile Users (MU) into clusters based on their contact history.”
Background
Metadata
- Authors
- Bulut, E., & Szymanski, B. K.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2012-12
- Volume
- 23
- Issue
- 12
- Pages
- 2254-2265
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2049122689
- Cited by
- 199
- References
- 1
- FWCI
- 30.81
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks. https://app.cochat.ai/papers/10.1109/tpds.2012.83
- The paper
- Bulut, E., & Szymanski, B. K. (2012). Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2012.83
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.