Floating Content: Information Sharing in Urban Areas Jussi - - PowerPoint PPT Presentation

floating content
SMART_READER_LITE
LIVE PREVIEW

Floating Content: Information Sharing in Urban Areas Jussi - - PowerPoint PPT Presentation

Aalto University School of Electrical Engineering Floating Content: Information Sharing in Urban Areas Jussi Kangasharju Jrg Ott, Esa Hyyti, Pasi Lassila Tobias Vaegs, Ossi Karkulahti Infrastructure-less Content Sharing Ad-hoc


slide-1
SLIDE 1

Aalto University School of Electrical Engineering

Floating Content:

Information Sharing in Urban Areas

Jussi Kangasharju Jörg Ott, Esa Hyytiä, Pasi Lassila Tobias Vaegs, Ossi Karkulahti

slide-2
SLIDE 2

Aalto University School of Electrical Engineering

Infrastructure-less Content Sharing…

  • Ad-hoc local social network-style information sharing:

Digital graffiti w/o servers and infrastructure

  • Leaves notes, comments, stories, etc. in places
  • Define reach (area of interest) and lifetime
  • Leverage delay-tolerant ad-hoc communication between

mobile devices for information replication & acquisition

slide-3
SLIDE 3

Aalto University School of Electrical Engineering

…in Urban Environments?!

  • Connectivity (to infrastructure)
  • Location privacy
  • Content “privacy”
  • Geographic validity
  • Temporal validity
  • User identification
slide-4
SLIDE 4

Aalto University School of Electrical Engineering

What for?

Coupling in location, decoupling in time

  • Tourists and locals, sharing context information
  • Going out with friends (bars, theme parks, hiking)
slide-5
SLIDE 5

Aalto University School of Electrical Engineering

What for?

  • Ride sharing
  • Flea markets
  • Ticket trading
  • Content sharing
  • Anything

– ephemeral – co-located – loss-tolerant – (time-insensitive)

slide-6
SLIDE 6

Aalto University School of Electrical Engineering

What’s new?

  • Similar concepts have been “floating” around

– Digital graffiti – At least as early as 2005 on something similar to floating content – Geocasting and other approaches in the late 1990’s

  • Often limited in scope
  • Our contribution

– Extended notion of floating content [PerCom 2010 WiP] – Analytical modeling [Infocom 2011] – Thorough evaluation of feasibility – Figuring out how to make this work in practice

slide-7
SLIDE 7

Aalto University School of Electrical Engineering

Floating Model

r a Anchor zone Availability range r Replication range Replication 1 r a Deletion r a 1

slide-8
SLIDE 8

Aalto University School of Electrical Engineering

Floating Protocol

A B Beacon Beacon Request ( ) Summary ( , , ) ( , ) Request ( ) Simultaneous bidirectional

  • peration

Beaconing continues Summary ( , ) ) A B

slide-9
SLIDE 9

Aalto University School of Electrical Engineering

Two-Pronged Approach to Evaluation

  • Analytical modeling

– Not really covered in this talk [Infocom 2011] – Different scenarios, different mobility models – Main result: criticality condition

  • Simulations

– Initially simple simulations to test feasibility [PerCom 2010 WiP] – First result: Need 1 person per 50m2 on average – This agrees with the analytical criticality condition – In this paper: criticality validation + parameter space exploration

slide-10
SLIDE 10

Aalto University School of Electrical Engineering

Simple Analytical Model: Black Box

Anchor zone

1 µ

ν

N

Sojourn time: nodes

Nν µ >1

Criticality condition

slide-11
SLIDE 11

Aalto University School of Electrical Engineering

Evaluation Setup

  • The ONE Simulator: 4500 x 3400m simulation area

– Helsinki City Scenario – Restless nodes (tourists)

  • Moving around along

shortest paths between points of interest

  • On foot, by car
  • Some trams following

regular routes

– 126, 252, 504 nodes – 10m, 50m radio range – r = a = 200m, 500m

slide-12
SLIDE 12

Aalto University School of Electrical Engineering

Contact density distribution

  • Example: 252 nodes, 10m radio

a=r=200m a=r=500m

slide-13
SLIDE 13

Aalto University School of Electrical Engineering

Feasibility

slide-14
SLIDE 14

Aalto University School of Electrical Engineering

Feasibility: Analytical Model Validation

  • Tiny messages, de-facto infinite buffer, one location only
  • Example: 252 nodes, 10m radio, r=a=500m, TTL=1h
  • Holds equally well for other parameter settings

2 4 6 8 10 0.2 0.4 0.6 0.8 1

Criticality value Floating success

slide-15
SLIDE 15

Aalto University School of Electrical Engineering

Feasibility: Floating over time

0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0.2 0.4 0.6 0.8 1 P{Message lifetime >= t} Fraction of TTL t Floating Lifetime Probablity (M) M 50 (500m,500m) M 10 (500m,500m) M 50 (200m,200m) M 10 (200m,200m)

Content sinks early… …or stays around with high probability Anchor zone size dominates

  • ver

radio range

slide-16
SLIDE 16

Aalto University School of Electrical Engineering

Operational Considerations: DoS

slide-17
SLIDE 17

Aalto University School of Electrical Engineering

Operational Considerations: DoS

  • Prioritization functions to encourage locality and modesty

for replication and deletion

– FIFO – RaNDom – Smallest Area First: f(a) – Smallest Volume First: f(a × size) – Small Total resources First: f(a × size × TTL)

slide-18
SLIDE 18

Aalto University School of Electrical Engineering

Performance characterization

  • Helsinki City Scenario
  • Parallel content posted at arbitrary locations

– 126 nodes, 50m radio, 2 Mbit/s net data rate – Message rates: 1, 2, 4 messages per node per hour

  • Mix of floating content messages

– Random message sizes: [100 KB … 1000 KB] – TTL [ 30min … 3 hours] – Anchor zones [ 500m … 2000m ]

slide-19
SLIDE 19

Aalto University School of Electrical Engineering

Findings for 4 Messages/node/hour

slide-20
SLIDE 20

Aalto University School of Electrical Engineering

Conclusion and Next Steps

  • Simple, yet appealing geo cooperation model
  • Workable already for modestly dense scenarios

– Simulations agree well with theoretical modeling

  • Some built-in DoS protection and garbage collection
  • Probabilistic operation and user acceptance?
  • More extensive simulation studies
  • Implementation for Android: real-world experiments