DRIVE - Disseminating Resource Information in VEhicular and other - - PowerPoint PPT Presentation

drive disseminating resource information in vehicular and
SMART_READER_LITE
LIVE PREVIEW

DRIVE - Disseminating Resource Information in VEhicular and other - - PowerPoint PPT Presentation

DRIVE - Disseminating Resource Information in VEhicular and other mobile peer-to-peer networks Bo Xu Ouri Wolfson University of Illinois at Chicago wolfson@cs.uic.edu DRIVE objective Enable dramatic improvement of the travel experience


slide-1
SLIDE 1

DRIVE - Disseminating Resource Information in VEhicular and other mobile peer-to-peer networks Bo Xu Ouri Wolfson University of Illinois at Chicago

wolfson@cs.uic.edu

slide-2
SLIDE 2

December 31, 2007 Ouri Wolfson, UIC 2

DRIVE objective

Enable dramatic improvement of the

travel experience – based on information

Real-time information to traveler has

not changed much in 40 years

slide-3
SLIDE 3

December 31, 2007 Ouri Wolfson, UIC 3

Sensor-networked Transportation

Vehicle sensors: speed, fuel, cameras, airbag, anti-lock brakes I nfrastructure sensors: speed detectors on road, parking slots, traffic lights, toll booth Wireless Networking: tens Mbps, 50-100 meters (802.11, UWB, Bluetooth, CALM)

slide-4
SLIDE 4

December 31, 2007 Ouri Wolfson, UIC 4

Application examples

Safety

Vehicle in front has a malfunctioning brake light Vehicle is about to run a red light Patch of ice at milepost 305 Vehicle 100 meters ahead has suddenly stopped Replay accident based on sensor traces Infrastructure transmits speed-limit; dependent on

vehicle type (works in France)

slide-5
SLIDE 5

December 31, 2007 Ouri Wolfson, UIC 5

Application examples (cont.)

Improve efficiency/convenience/mobility:

What is the average speed a mile ahead of me? Are there any accidents ahead? What parking slots are available around me? Taxi cab: what customers around me need service? Customer: What Taxi cabs are available around me? Transfer protection: transfer bus requested to wait for

passengers

Cab sharing opportunities

slide-6
SLIDE 6

December 31, 2007 Ouri Wolfson, UIC 6

Ride sharing – untapped potential

4% increase in ridesharing – offset 2000 congestion

increase

Example – most arriving airport passengers go

downtown

Initial efforts

Washington DC “slugging” Illinois ride-sharing program at UIC, Prof. Nelson’s lab

Wireless/short-range Peer-to-Peer communication

enables real-time matchmaking

Eliminates need for 3rd party mediation, business model

slide-7
SLIDE 7

December 31, 2007 Ouri Wolfson, UIC 7

Application examples (cont.)

Beyond transportation:

Sighting of enemy vehicle in downtown

Mosul in last hour?

Cockroach robots in disaster areas Disseminate ticket-availability before a

sporting event

slide-8
SLIDE 8

December 31, 2007 Ouri Wolfson, UIC 8

How to enable these applications?

Develop product that performs them Develop standards to build them Develop a platform for building them

slide-9
SLIDE 9

December 31, 2007 Ouri Wolfson, UIC 9

Platform components

Communication system: Intra-vehicle, vehicle-to-

vehicle, and vehicle-to-infrastructure

Prototypes: Cartalk, UC Irvine

Data Management: collect, organize, integrate,

model, disseminate, query

Software tools:

Data mining Travel-time prediction Trip planning Regional planning ……

slide-10
SLIDE 10

December 31, 2007 Ouri Wolfson, UIC 10

Research issues in data management

Sensor data acquisition, modeling, fusion,

dissemination

Data usage strategies Participation incentives Remote Querying Data Integration of sensor and higher level

information (maps, trip plans, ride-sharing profiles)

slide-11
SLIDE 11

December 31, 2007 Ouri Wolfson, UIC 11

The players

Moving/stationary objects with processing and communication

power

Personal digital assistants (pda’s) Computers in vehicles Processors embedded in the infrastructure

Resources -- examples

Gas stations Parking slots Cabs Ride-share partners Malfunctioning brake-light Accident at a time/location

Resource reports are generated by infrastructure or moving objects sensors

Collect, Organize, Disseminate, information about resources

slide-12
SLIDE 12

December 31, 2007 Ouri Wolfson, UIC 12

Spatial and Temporal Resources

Spatial resources

Examples: gas station at 342 State st., patch of ice at

milepost 97, Italian restaurant at 300 Morgan St.

The importance/relevance of information decays with

distance

Possible relevance function: - β ⋅d

Temporal resources

Examples: Price of IBM stock at 2pm, DJI average at 10am The importance/relevance of information decays with age Possible relevance function: - α ⋅t

slide-13
SLIDE 13

December 31, 2007 Ouri Wolfson, UIC 13

Spatio-temporal Resources

Spatio-temporal resources: specific to time and location

Traffic conditions, available parking spaces, occurrence of

car accidents, taxi cab customers, ride-share partners

The importance/relevance of a resource-availability

report decays with age and distance

Possible relevance function: -α ⋅t - β ⋅d Each resource-availability report includes create-time

and home-location --- sensor fusion tool

slide-14
SLIDE 14

December 31, 2007 Ouri Wolfson, UIC 14

Relevance-ranked resource-type lists

location

time

location

time

Hazards and alerts Parking Information Traffic Conditions Taxi cab customers

Moving Object Memory: Each resource list keeps top K resources

location

time

location

time

slide-15
SLIDE 15

December 31, 2007 Ouri Wolfson, UIC 15

Opportunistic Resource Dissemination (ORD)

Each vehicle has an interest profile:

ranked list of resource-types relevance-threshold in each type

Two vehicles exchange local database information

when they encounter each other (i.e. come within transmission range)

Least relevant resources that do not fit in allocated

memory are purged out

slide-16
SLIDE 16

December 31, 2007 Ouri Wolfson, UIC 16

Exchanging and purging resources

Sears Tower (NE), 10:30am Halstead & Taylor, 10:24am Navy Pier, 10:20am Madison & Clark, 10:25am

Before exchange

Sears Tower (NE), 10:30am Madison & Clark, 10:25am Sears Tower (NE), 10:30am Madison & Clark, 10:25am

After exchange

Cab customers

slide-17
SLIDE 17

December 31, 2007 Ouri Wolfson, UIC 17

Localized spatio-temporal diffusion

Ensured by relevance-ranking and limited memory allocation

slide-18
SLIDE 18

December 31, 2007 Ouri Wolfson, UIC 18

How fast/far a resource is disseminated?

In a pure Mobile Opportunistic p2p system, the answer depends on:

Memory allocation to the resource type Relevance threshold Transmission (randevous) range Traffic speed Vehicle density Resource density Average resource availability time

slide-19
SLIDE 19

December 31, 2007 Ouri Wolfson, UIC 19

Other possible relevance functions

Nonlinear Other factors

Travel Direction (gas station, malfunctioning

brake-light)

Transmit-time, in addition to create-time

(analogous to transaction/valid time)

slide-20
SLIDE 20

December 31, 2007 Ouri Wolfson, UIC 20

Advertising spatial resources

Gas stations, restaurants, ATM’s, etc.,

announce continuously

An announced resource item is acquired by

the vehicles within the wireless coverage of the stationary site

Different location-based-services paradigm

than

Cellular-service provider database Geographic web searching

slide-21
SLIDE 21

December 31, 2007 Ouri Wolfson, UIC 21

Further research in data dissemination – mathematical model

Spread resembles epidemiological models of

(Bailey 75) but there are important differences

Spatio-temporal relevance function Interaction of multiple infectious-diseases

(resources)

Should answer: given resource report generated

at (0,0,0), what is the probability that a vehicle at (x,y,t) receives it

Y

X

Time

slide-22
SLIDE 22

December 31, 2007 Ouri Wolfson, UIC 22

Further research in data acquisition(2)

Data granularity/aggregation-level of sensor-data

Raw: multiple applications, more b/w Abstractions/aggregations: less b/w, application specific

Sensor fusion

fuse sensors of same kind from different vehicles fuse different sensor-data, e.g. computer vision -- laser

range-finding

Resource-exchange modalities

Broadcast vs. 1:1 Push vs. pull

slide-23
SLIDE 23

December 31, 2007 Ouri Wolfson, UIC 23

Research issues in data management

Sensor data acquisition, fusion, dissemination Data usage strategies Participation incentives Remote Querying Data Integration, Moving Objects Databases

slide-24
SLIDE 24

December 31, 2007 Ouri Wolfson, UIC 24

Another resource classification

Competitive (parking slots, cab-customers) Semi-competitive (ride-sharing partners) Noncompetitive (malfunctioning brake

lights, speed of a vehicle at (x,y,t))

slide-25
SLIDE 25

December 31, 2007 Ouri Wolfson, UIC 25

Problem

Information by itself is not sufficient to

capture resource

If move to obsolete resources may

waste time compared to blind search

slide-26
SLIDE 26

December 31, 2007 Ouri Wolfson, UIC 26

Strategies for capturing (semi-) competitive resources

Example (Threshold Driven)– Go to the

resource if its availability-report relevance is higher than a threshold th

How much does TD save compared to

Blind Search ?

slide-27
SLIDE 27

December 31, 2007 Ouri Wolfson, UIC 27

Information Guided Resource Discovery

slide-28
SLIDE 28

December 31, 2007 Ouri Wolfson, UIC 28

On average, TD captures the resource up to twice as fast as BS

slide-29
SLIDE 29

December 31, 2007 Ouri Wolfson, UIC 29

Another strategy example

Consider spatial-clustering of resources

slide-30
SLIDE 30

December 31, 2007 Ouri Wolfson, UIC 30

Further research in Spatio-temporal resource-capture strategies

Develop and analyze information-guided

spatio-temporal strategies (game theoretic approach?)

How much does information improve

resource utilization?

Do invalidation messages help? If so, how should they be treated w.r.t.

availability-reports?

slide-31
SLIDE 31

December 31, 2007 Ouri Wolfson, UIC 31

Research issues in data management

Sensor data acquisition, fusion, dissemination Data usage strategies Participation incentives Remote Querying Data Integration, Moving Objects Databases

slide-32
SLIDE 32

December 31, 2007 Ouri Wolfson, UIC 32

Problem

The mobile opportunistic p2p scheme

heavily depends on wide participation

Why should a vehicle/pda provide and

transfer resources?

slide-33
SLIDE 33

December 31, 2007 Ouri Wolfson, UIC 33

Possible incentive model

Virtual currency -- tokens Producer-paid resources (road-emergency call, gas station)

Each report (advertisement) sent has a token-budget On transfer between vehicles:

Carrier withdraws flat commission Rest of budget split equally

Consumer-paid resources (parking slots, cab customer, traffic-

incident). 2 modes:

Consumer mode – pays amount proportional to relevance Broker mode – cannot view resource, speculative

Tamper-resistant security module

Stores resource-reports and tokens Executes p2p protocol

slide-34
SLIDE 34

December 31, 2007 Ouri Wolfson, UIC 34

Research in incentive models

Other virtual currency models Pricing and negotiation Cost optimizations in such models

For example, minimize advertisement cost per potential

customer

Distributed reputation models Transactions and atomicity issues Security

eavesdropping fake resources tampering to gain unfair advantage, create havoc

slide-35
SLIDE 35

December 31, 2007 Ouri Wolfson, UIC 35

Research issues in data management

Sensor data acquisition, fusion, dissemination Data usage strategies Dissemination incentives Remote Querying Data integration, Moving Objects Databases

slide-36
SLIDE 36

December 31, 2007 Ouri Wolfson, UIC 36

Spatio-temporal resource query modes

Moving object queries local database Moving object queries a region R,

i.e. all the moving objects in R

slide-37
SLIDE 37

December 31, 2007 Ouri Wolfson, UIC 37

Examples and Issues

Queries that find all the resources within a

particular geographic area

find all the available parking spaces within the UIC

eastern campus

find all the cab requests within five blocks of the Sears

Tower

How to determine the set of objects to which

the query is sent?

How to disseminate the query? How to collect the answers?

slide-38
SLIDE 38

December 31, 2007 Ouri Wolfson, UIC 38

Determination of Query Destination Area – Possible answer

queried region maximum boundary queried region maximum boundary

slide-39
SLIDE 39

December 31, 2007 Ouri Wolfson, UIC 39

Remote Query Approach

Query dissemination

Query originator sends the query into the

destination area.

The query is flooded to all the moving

  • bjects within the area.

Answer delivery

Each object in the destination area sends

the answer back to the query originator

Query originator consolidates the answers.

slide-40
SLIDE 40

December 31, 2007 Ouri Wolfson, UIC 40

How is query originator v found?

Via the infrastructure using node-id

May be costly

In p2p mode

v sends future trajectory in query

slide-41
SLIDE 41

December 31, 2007 Ouri Wolfson, UIC 41

Two Cases

Each object knows the trajectories of

each other object

Trajectories exchanged as resources

Each object does not know the

trajectories of other objects except that

  • f the querying object
slide-42
SLIDE 42

December 31, 2007 Ouri Wolfson, UIC 42

Known Trajectories

Encounter graph: each edge represents the

time interval during which two objects can communicate

A B C D [9:30, 9:35] [13:15, 13:20] [10:00, 10:10] [11:20, 11:26] [8:30, 8:32]

slide-43
SLIDE 43

December 31, 2007 Ouri Wolfson, UIC 43

Known Trajectories

A revised Djikstra algorithm is used to find

the shortest path between the querying moving object and

the query destination area (for query dissemination)

The shortest path between an object in the query

destination area and the querying moving object (for answer delivery)

A B C D [9:30, 9:35] [13:15, 13:20] [10:00, 10:10] [11:20, 11:26] [8:30, 8:32]

slide-44
SLIDE 44

December 31, 2007 Ouri Wolfson, UIC 44

Unknown Trajectories

Question: How does a moving object decide

whether or not to forward a message to its encountered neighbor?

A B A B A B A B A B A B A B A B

destination area Should I forward to B?

slide-45
SLIDE 45

December 31, 2007 Ouri Wolfson, UIC 45

Unknown Trajectories

Answer: Forward iff θ is smaller than a

certain threshold (critical angle)

A B A B C A B θ A B C A B A B C A B θ A B C

slide-46
SLIDE 46

December 31, 2007 Ouri Wolfson, UIC 46

Choosing the Critical Angle

20 40 60 80 100 120 140 160 180 20 40 60 80 100 minimum critical angle (degree) traffic density (nodes/square mile) life-time = 600 life-time = 800

slide-47
SLIDE 47

December 31, 2007 Ouri Wolfson, UIC 47

Query Processing Modes (1)

Response to originator by each queried vehicle Query originator/ consolidates

slide-48
SLIDE 48

December 31, 2007 Ouri Wolfson, UIC 48

Query Processing Modes (2)

Response to leader by each queried vehicle; leader

consolidates and responds to originator

Query originator

slide-49
SLIDE 49

December 31, 2007 Ouri Wolfson, UIC 49

Hierarchical solution

subregion subregion subregion

Query Processing Modes (3)

slide-50
SLIDE 50

December 31, 2007 Ouri Wolfson, UIC 50

Further research in Remote Querying

Comparison of query processing modes;

coping with high mobility

Other query types, aggregate/imprecise

(average speed a mile ahead)

How to determine the set of objects to which the

query is sent?

How to disseminate the query? How to collect the answers?

How/when to use cellular/infrastructure in

communication of queries and answers?

slide-51
SLIDE 51

December 31, 2007 Ouri Wolfson, UIC 51

Research issues in data management

Sensor data acquisition, fusion, dissemination Data usage strategies Dissemination incentives Remote Querying Integration of sensor and higher level data

slide-52
SLIDE 52

December 31, 2007 Ouri Wolfson, UIC 52

Moving Objects Database Technology

Query/ trigger examples:

  • During the past year, how many times was bus# 5 late by more than 10 minutes

at station 20, or at some station (past query)

  • Send me message when helicopter in a given geographic area (trigger)
  • Trucks that will reach destination within 20 minutes (future query)
  • Taxi cabs within 1 mile of my location (present query)
  • Average speed on highway, one mile ahead
  • Tracking for “context awareness”

GPS GPS GPS

Wireless link

slide-53
SLIDE 53

December 31, 2007 Ouri Wolfson, UIC 53

Applications

Location Based Services e.g., “Closest gas station” Digital Battlefield Transportation (taxi, courier, emergency response, municipal

transportation, traffic control)

Supply Chain Management, logistics Context-awareness, augmented-reality, fly-through

visualization

Location- or Mobile-Ecommerce and Marketing Mobile workforce management Air traffic control (www.faa.gov/freeflight) Dynamic allocation of bandwidth in cellular network

Currently built in an ad hoc fashion

slide-54
SLIDE 54

December 31, 2007 Ouri Wolfson, UIC 54

Further research in Moving Objects Databases

Location modeling/management Linguistic issues Uncertainty/Imprecision Indexing Synthetic datasets Compression/data-reduction Joins and data mining (similarity of trajectories)

slide-55
SLIDE 55

December 31, 2007 Ouri Wolfson, UIC 55

Relevant Work

Resource discovering protocols

SLP, Jini, Salutation, UPnP Rely on a dedicated directory server Not suitable for high mobility environments

Epidemic replication/routing (Demers 87, Vahdat 00,

Khelil 02)

Regular data/messages, not spatial-temporal

Sensor networks (Bonnet 00, Intanagonwiwat 00,

Mandden 02)

Sensors are stationary

Epidemiology (Bailey 75)

slide-56
SLIDE 56

December 31, 2007 Ouri Wolfson, UIC 56

Conclusion

sensor-rich-environment + short-range wireless Computer Science research issues:

Sensor data acquisition/fusion/dissemination Data usage strategies Dissemination incentives Remote Querying Integration of sensor and higher level data

slide-57
SLIDE 57

December 31, 2007 Ouri Wolfson, UIC 57

Future Work

Privacy/security considerations Experiments based on a road network

and Monarch/ns-2