Subtopic Deep Dive
Social Network Analysis in Opportunistic Networks
Research Guide
What is Social Network Analysis in Opportunistic Networks?
Social Network Analysis in Opportunistic Networks applies graph theory metrics like centrality and community detection to contact traces for optimizing routing in delay-tolerant environments.
Researchers construct contact graphs from mobility traces to compute betweenness centrality and tie strengths for routing decisions (Daly and Haahr, 2007). This approach leverages social structures to forward messages via stable contacts rather than flooding. Over 20 papers since 2007 explore these methods, with Daly and Haahr (2007) cited 1148 times.
Why It Matters
Social-aware routing reduces message overhead by 50% compared to epidemic protocols in urban traces, as shown by Daly and Haahr (2007). Li et al. (2010) demonstrate that incorporating social selfishness improves delivery ratios in DTNs. Spyropoulos et al. (2010) taxonomy highlights applications in emergency response and VANETs where stable social ties enable reliable forwarding despite partitions.
Key Research Challenges
Social Selfishness Modeling
Nodes prioritize strong ties, reducing cooperation in epidemic routing (Li et al., 2010). This degrades delivery ratios unless social metrics adjust forwarding. Accurate selfishness models from traces remain inconsistent across datasets.
Dynamic Contact Graph Evolution
Contact graphs change rapidly in mobile settings, invalidating static centrality measures (Daly and Haahr, 2007). Real-time recomputation burdens resource-limited devices. Leguay et al. (2006) note urban mobility challenges persistent graph stability.
Scalability of Centrality Computation
Betweenness centrality scales poorly with network size in opportunistic traces (Spyropoulos et al., 2010). Approximations introduce routing errors. Keränen et al. (2009) simulator reveals high computation costs in large-scale evaluations.
Essential Papers
The ONE simulator for DTN protocol evaluation
Ari Keränen, Jörg Ott, Teemu Kärkkäinen · 2009 · 2.3K citations
Delay-tolerant Networking (DTN) enables communication in sparse mobile ad-hoc networks and other challenged environments where traditional networking fails and new routing and application protocols...
Social network analysis for routing in disconnected delay-tolerant MANETs
Elizabeth Daly, Mads Haahr · 2007 · 1.1K citations
Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide goo...
A Survey on Nongeostationary Satellite Systems: The Communication Perspective
Hayder Al-Hraishawi, Houcine Chougrani, Steven Kisseleff et al. · 2022 · IEEE Communications Surveys & Tutorials · 270 citations
The next phase of satellite technology is being characterized by a new\nevolution in non-geostationary orbit (NGSO) satellites, which conveys exciting\nnew communication capabilities to provide non...
Routing in Flying Ad Hoc Networks: Survey, Constraints, and Future Challenge Perspectives
Omar Sami Oubbati, Mohammed Atiquzzaman, Pascal Lorenz et al. · 2019 · IEEE Access · 262 citations
International audience
Routing for disruption tolerant networks: taxonomy and design
Thrasyvoulos Spyropoulos, Rao Naveed Bin Rais, Thierry Turletti et al. · 2010 · Wireless Networks · 230 citations
Communication networks, whether they are wired or wireless, have traditionally been assumed to be connected at least most of the time. However, emerging applications such as emergency response, spe...
Opportunistic content distribution in an urban setting
Jérémie Leguay, Anders Lindgren, James Scott et al. · 2006 · 190 citations
International audience
Computer Network Simulation with ns-3: A Systematic Literature Review
Lelio Campanile, Marco Gribaudo, Mauro Iacono et al. · 2020 · Electronics · 147 citations
Complexity of current computer networks, including e.g., local networks, large structured networks, wireless sensor networks, datacenter backbones, requires a thorough study to perform analysis and...
Reading Guide
Foundational Papers
Start with Daly and Haahr (2007) for core social routing via centrality, then Keränen et al. (2009) for ONE simulator to test protocols, and Spyropoulos et al. (2010) for routing taxonomy.
Recent Advances
Li et al. (2010) on social selfishness; Sobin et al. (2016) survey extends to data dissemination.
Core Methods
Contact graph construction, betweenness centrality, community detection via ONE simulator (Keränen et al., 2009; Daly and Haahr, 2007).
How PapersFlow Helps You Research Social Network Analysis in Opportunistic Networks
Discover & Search
Research Agent uses searchPapers('social network analysis opportunistic routing') to find Daly and Haahr (2007), then citationGraph reveals 100+ citing works like Li et al. (2010), and findSimilarPapers expands to social selfishness studies.
Analyze & Verify
Analysis Agent applies readPaperContent on Daly and Haahr (2007) to extract centrality algorithms, verifyResponse with CoVe checks claims against traces, and runPythonAnalysis computes betweenness on sample contact data with NetworkX for statistical verification; GRADE scores evidence strength for routing gains.
Synthesize & Write
Synthesis Agent detects gaps in dynamic centrality via contradiction flagging across Spyropoulos et al. (2010) and Li et al. (2010); Writing Agent uses latexEditText for graph sections, latexSyncCitations for 20+ refs, latexCompile for PDF, and exportMermaid diagrams contact graph evolutions.
Use Cases
"Analyze contact traces for betweenness centrality in ONE simulator datasets"
Research Agent → searchPapers('ONE simulator social centrality') → Analysis Agent → runPythonAnalysis(NetworkX betweenness on Keränen et al. 2009 traces) → matplotlib plot of top-k routers.
"Write LaTeX survey section on social routing in DTNs citing Daly 2007"
Synthesis Agent → gap detection(Daly Haahr 2007 + Li 2010) → Writing Agent → latexEditText('routing section') → latexSyncCitations(15 papers) → latexCompile → PDF with centrality diagram.
"Find GitHub repos implementing social-aware DTN routing from papers"
Research Agent → citationGraph(Daly Haahr 2007) → Code Discovery → paperExtractUrls → paperFindGithubRepo → githubRepoInspect → list of 5 repos with centrality code.
Automated Workflows
Deep Research workflow scans 50+ papers via searchPapers on 'social centrality DTN', structures report with centrality metrics taxonomy from Spyropoulos et al. (2010). DeepScan applies 7-step CoVe to verify Daly and Haahr (2007) claims against ONE simulator outputs (Keränen et al., 2009). Theorizer generates hypotheses on tie strength evolution from Leguay et al. (2006) urban traces.
Frequently Asked Questions
What is Social Network Analysis in Opportunistic Networks?
It uses centrality and community detection on contact graphs to guide routing in disconnected DTNs (Daly and Haahr, 2007).
What methods are used?
Betweenness centrality and tie strength from traces prioritize forwarding (Daly and Haahr, 2007; Li et al., 2010).
What are key papers?
Daly and Haahr (2007, 1148 citations) introduces social routing; Keränen et al. (2009, 2285 citations) provides ONE simulator; Li et al. (2010) covers selfishness.
What open problems exist?
Dynamic centrality updates and selfishness in large-scale traces lack scalable solutions (Spyropoulos et al., 2010).
Research Opportunistic and Delay-Tolerant Networks with AI
PapersFlow provides specialized AI tools for Computer Science researchers. Here are the most relevant for this topic:
AI Literature Review
Automate paper discovery and synthesis across 474M+ papers
Code & Data Discovery
Find datasets, code repositories, and computational tools
Deep Research Reports
Multi-source evidence synthesis with counter-evidence
AI Academic Writing
Write research papers with AI assistance and LaTeX support
See how researchers in Computer Science & AI use PapersFlow
Field-specific workflows, example queries, and use cases.
Start Researching Social Network Analysis in Opportunistic Networks with AI
Search 474M+ papers, run AI-powered literature reviews, and write with integrated citations — all in one workspace.
See how PapersFlow works for Computer Science researchers