Chapters

15 DTN Social Routing: Community and Forwarding Decisions

emerging-paradigms
adhoc
dtn
social

15.1 Start With the Decision

This section: Start With the Decision — A popular node is not always the best carrier for a given community.

A popular node is not always the best carrier for a given community. Social routing must balance group relevance, spread, and delivery cost.

15.2 Route Overview

This section: Route Overview — This is part 2 of 2.

This is part 2 of 2. Review DTN Social Routing: Contact and Utility Models for the preceding evidence.

15.3 Learning Objectives

This section: Learning Objectives

  • Explain community-aware SocialCast forwarding.
  • Evaluate social metrics and replication trade-offs.

15.4 Chapter Roadmap

This section: Chapter Roadmap

  • SocialCast: Social-Based DTN Routing
  • Figure Summary: SocialCast Workflow
  • Figure Summary: Gamma Trade-off
  • Resource-Aware Teaching Score Calculation
  • Checkpoint: SocialCast Discipline
  • Test Your Understanding
  • Resource-Aware Teaching Score Explorer
  • SocialCast Advantages for IoT
  • Knowledge Check
  • Quiz: SocialCast Protocol
  • Community Mesh Routing
  • Case Study: Community-Managed Mesh Links
  • Concept Relationships
  • See Also
  • Interactive Quiz: Match Concepts
  • Interactive Quiz: Sequence the Steps
  • Common Pitfalls
  • Social Contacts Are Not Stable
  • Social Centrality Without Full Map
  • Social Routing Beyond Humans
  • Contact Tracking Privacy Risks
  • Label the Diagram
  • Code Challenge
  • Summary
  • What’s Next
  • Key Takeaway

15.5 SocialCast: Social-Based DTN Routing

This section: SocialCast: Social-Based DTN Routing — SocialCast extends CAR by exploiting social network structures for packet dissemination.

Time: ~15 min | Difficulty: Advanced | Unit: P04.C01.U04

SocialCast workflow showing a publisher creating a bounded set of replicas, carriers forwarding only to higher-utility nodes, and subscribers receiving matching content
Figure 15.1: SocialCast bounded-replication workflow for DTN publish-subscribe delivery

SocialCast extends CAR by exploiting social network structures for packet dissemination.

15.5.1 SocialCast Concepts

Key Insight: People with similar interests tend to be colocated periodically.

Application: Publish-subscribe in DTN

  • Publishers: Generate content
  • Subscribers: Want to receive content matching interests
  • Carriers: Mobile nodes whose interest-specific contact predictions help transport messages toward subscribers

This section:

SocialCast creates a fixed number of replicas at publication time. A copy moves only when a neighbor’s interest-specific utility exceeds the current carrier’s by the configured hysteresis margin ϵ\epsilon; it is delivered directly to an interested subscriber when encountered.

15.5.2 Selection Workflow: SocialCast Protocol

Message Replication Strategy:

  1. Create gamma replicas at publisher
  2. Forward only when the SocialCast margin is met:
    • Transfer a copy when the neighbor’s utility for the message’s interest exceeds the current carrier’s utility by the configured hysteresis margin ϵ\epsilon; deliver directly to interested subscribers when encountered.
  3. Carriers hold messages until:
    • Finding even better carrier, OR
    • Encountering subscriber
  4. Replicas never increase (bounded replication)
  5. TTL prevents infinite lifetime

Key Properties:

  • Bounded replicas: Only gamma copies exist (doesn’t grow like epidemic)
  • Selective forwarding: Only when interest-specific utility exceeds the current carrier’s by the configured hysteresis margin ϵ\epsilon
  • Upgrade path: Replicas “climb” to better carriers over time
  • Subscriber participation: Subscribers with high utility can act as carriers

15.5.3 SocialCast Performance

Delivery and overhead vs replicas:

Inspect Figure 15.2 and look for the range where delivery gain begins to flatten while copy costs continue rising.

Chart summarizing how SocialCast delivery improves with gamma from 2 to 10 replicas while copy overhead also rises, with the 5 to 10 replica range highlighted as the usual operating zone
Figure 15.2: SocialCast delivery and overhead trade-off as gamma increases

Read Figure 15.2 from the first added copy to the marked gamma range. Delivery rises at first, then the gain starts to flatten near five to ten copies. Storage, contact time, and energy still rise after that point. In the illustrative trace, bounded copies give 88% to 93% delivery with 200% to 350% overhead. In that illustrative trace, epidemic spread gives 95% delivery with 800% to 1,200% overhead. Those values describe one case, not a default. Choose gamma from the delivery need and resource limits, then test whether each later copy adds a new contact path worth its cost.

This section:

More replicas improve delivery because more carriers can discover useful contacts. The benefit flattens after roughly 5-10 replicas, while storage, bandwidth, and energy cost continue to rise.

Optimal Configuration:

  • gamma = 5-10 for most scenarios
  • In the illustrative trace, bounded replication balances 88–93% delivery with 200–350% overhead.
  • In the same illustrative trace, epidemic routing delivers 95% with 800–1,200% overhead.

TTL Impact:

Longer TTL values usually improve delivery in sparse networks because a copy has more time to encounter a better carrier or subscriber. The trade-off is buffer pressure: every extra hour of TTL keeps stale data in constrained devices longer.

Selection Workflow: Resource-Aware Teaching Score

Scenario: A smart city deploys sensors on delivery vehicles for air quality monitoring. Calculate which vehicle should carry pollution alerts to city hall.

Given:

  • Vehicle A: Delivers to suburbs, encounters city hall area 1x/week
  • Vehicle B: Downtown route, passes city hall 3x/day
  • Vehicle C: Mixed route, passes city hall 1x/day
  • Current carrier: Vehicle A (teaching score U_A = 0.379 after calculation)
  • Message: PM2.5 alert for city hall environmental office

Steps:

  1. Calculate the resource-aware teaching score for each vehicle:

    • Teaching score for this resource-aware example (not SocialCast’s published utility): U(X, Dest) = alpha x normalized encounter-frequency score + beta x Freshness + gamma x Battery. SocialCast instead predicts colocation with subscribers of an interest and change in connectivity.
    • Freshness means freshness of each carrier’s encounter evidence.
    • Weights: alpha=0.6 (normalized encounter-frequency score), beta=0.3 (data freshness), gamma=0.1 (resources)

  2. Compute encounter-frequency scores:

    • Compute encounter-frequency scores s = min(1, encounter rate/(3/day)): A=(1/7)/3=1/21≈0.0476, B=3/3=1, C=1/3≈0.3333.

  3. Calculate total utilities:

    • U_A = 0.6(1/21)+0.3(0.9)+0.1(0.8)=0.379
    • U_B = 0.900
    • U_C = 0.6(1/3)+0.3(0.8)+0.1(0.7)=0.510

  4. Apply a configured forwarding margin to this teaching score:

    • Current: U_A = 0.379
    • Vehicle A encounters B: transfer only if U_B exceeds U_A by the configured margin ϵ\epsilon.
    • Vehicle A encounters C: transfer only if U_C exceeds U_A by ϵ\epsilon.
    • B is the stronger modeled carrier; whether to transfer to C depends on the configured margin.

Result: The resource-aware teaching score ranks B highest. A transfer decision requires the configured margin; these encounter rates do not establish delivery probability.

Key Insight: SocialCast uses interest-specific predictions of subscriber colocation and connectivity change, with a hysteresis margin to limit oscillation. This separate resource-aware teaching score ranks carriers from stated encounter-frequency, freshness, and resource inputs.

This section:

Blueprint Bina, Architecture and system-design domain expertCheckpoint: SocialCast Discipline

You now know:

  • SocialCast creates gamma replicas once, then moves existing copies only when a neighbor’s interest-specific utility exceeds the current carrier’s by the configured hysteresis margin ϵ\epsilon; it does not grow the copy count like epidemic routing.
  • The illustrated 5–10 replica setting aims for 88–93% delivery with 200–350% overhead in this trace, versus the illustrated epidemic 800–1,200% overhead.
  • Transfer a copy when the neighbor’s utility for the message’s interest exceeds the current carrier’s utility by the configured hysteresis margin ϵ\epsilon; deliver directly to interested subscribers when encountered.

This section:

Test Your Understanding

15.6 Resource-Aware Teaching Score Explorer

This section: Resource-Aware Teaching Score Explorer

Adjust the weights and node parameters to see how the utility score changes:

15.7 Selection Workflow: SocialCast Advantages for IoT

This section: Selection Workflow: SocialCast Advantages for IoT

Why SocialCast Works Well:

  1. Interest-based grouping: IoT devices often have natural clusters

    • Smart home devices in same household
    • Wearables owned by same person
    • Sensors monitoring same phenomenon

  2. Predictable mobility: Many IoT devices follow patterns

    • Wearables: user’s daily routine
    • Vehicles: repeated routes
    • Drones: scheduled flight paths

  3. Resource efficiency: Bounded replication suits energy-constrained IoT

  4. Scalability: Local utility decisions scale better than global knowledge

Example IoT Applications:

  • Smart city: Traffic sensors publish updates, delivered to vehicles in area
  • Wildlife monitoring: tracking collars exchange data via high-mobility carriers
  • Wearable health: Health data from many users aggregated via mobile phone carriers

15.8 Knowledge Check

This section: Knowledge Check

Quiz: SocialCast Protocol

15.9 Community Mesh Routing

This section: Community Mesh Routing

Case Study: Community-Managed Mesh Links

Community Wi-Fi mesh networks are not automatically DTNs, and they are not formal SocialCast deployments. They are still useful design analogies because administrators often route content through people and links they trust to be available at predictable times.

How the analogy maps to social routing:

  • Utility function: local operators know which rooftop links, relays, or users are reliable.
  • Encounter probability: evening usage windows and scheduled maintenance create predictable contact opportunities.
  • Bounded replication: popular files are cached on a small number of reliable mirrors instead of copied everywhere.
  • Utility climbing: content moves from peripheral nodes toward better-connected local hubs before crossing weak links.

Design lesson: social routing should be treated as an engineering trade-off, not a magic replacement for connectivity. It works best when contact patterns are predictable, resources are scarce, and forwarding decisions can be made from recent local evidence. Before using SocialCast-like logic in production, collect trace data from the target environment and validate delivery, latency, energy, and privacy impact.

15.11 See Also

This section: See Also

DTN Fundamentals

Store-carry-forward foundation.

DTN Epidemic Routing

Flooding baseline for comparison.

DTN Applications

ZebraNet and DakNet deployments.

Ad Hoc Routing: Reactive (DSR)

Connected network on-demand routing.

Multi-Hop Fundamentals

Relay and forwarding concepts.
Interactive Quiz: Match Concepts
Interactive Quiz: Sequence the Steps

Common Pitfalls

This section: Common Pitfalls

Social routing relies on contact history as a predictor of future contacts. Work schedules, commuting patterns, and social behavior change over weeks and months. Routing decisions based on stale contact history (months old) may be less accurate than routing based on current network state. Implement contact history decay to weight recent contacts more heavily.

Betweenness centrality requires global network graph knowledge — knowing all nodes and their interconnections. In a distributed DTN, this information is unavailable. Practical social routing uses local approximations (encounter counts, two-hop neighbor counts) that underestimate true centrality.

Social routing exploits human mobility patterns (workplace, home, social events). Animal tracking, vehicle networks, or robot swarms have different mobility patterns that may not exhibit the community structure social routing exploits. Always validate that the target environment exhibits social-like contact patterns before applying social routing.

Social routing requires nodes to share and track contact history. This creates detailed records of who met whom and when — personal location data. Deployments must consider privacy implications and anonymization techniques. Publishing contact graphs can reveal sensitive information about individuals’ movements.

Label the Diagram
Code Challenge

15.12 Checkpoint: Summary

This section: Checkpoint: Summary

This chapter covered context-aware and social-based DTN routing:

  • Context-Aware Routing (CAR) uses utility functions combining colocation, mobility, social, and resource evidence to choose carriers; in the chapter’s illustrative trace, it gives 88–93% delivery with 200–350% overhead.
  • Resource-Aware Teaching Score: This separate example ranks carriers using normalized encounter-frequency, mobility, and resource inputs; it is not a calibrated delivery probability
  • Colocation Prediction: Kalman filters use past encounter history to predict future contact probabilities, enabling “smart” forwarding
  • SocialCast Protocol: Creates bounded gamma replicas and transfers copies when interest-specific utility exceeds the current carrier’s by hysteresis margin ϵ\epsilon, delivering directly to interested subscribers
  • Performance Optimization: In the illustrative trace, gamma = 5–10 copies gives 88–93% delivery with 200–350% overhead, versus 95% delivery and 800–1,200% overhead for epidemic replication.
  • IoT Suitability: SocialCast works well for IoT due to natural device clustering, predictable mobility patterns, resource efficiency, and local decision scalability

15.14 Key Takeaway

This section: Key Takeaway — Social routing uses repeated contact patterns, communities, or central nodes to improve DTN forwarding.

Social routing uses repeated contact patterns, communities, or central nodes to improve DTN forwarding. It only works when those patterns are real, measured, and acceptable from a privacy and governance standpoint.

15.15 Continue Your Route

This section: Continue Your Route — This is the last part of this chapter.

This is the last part of this chapter. Return to DTN Social Routing: Contact and Utility Models or continue from the emerging-paradigms module index.

Find help

3 reviewed answers.

Where should I start in a module?

Open the module page from the sidebar to see its chapters in order. Use the module map to return to a topic you need.

Modules and paths

Reviewed

What can I try when a project does not work?

Check the symptom, then work through the diagnostic steps. Keep the error message and the smallest example that reproduces it.

When you are stuck

Reviewed

How do interactive examples work?

Use the interactive guide to check how examples and simulations work before changing your project.

Interactive examples guide

Reviewed