peertis a peer to peer traffic information system
play

PeerTIS A Peer-to-Peer Traffic Information System | Jedrzej - PowerPoint PPT Presentation

PeerTIS A Peer-to-Peer Traffic Information System | Jedrzej Rybicki | Bjrn Scheuermann | | Markus Koegel | Martin Mauve | VANETs Limited network capacity ? Limited scalability, connectivity No immediate market penetration


  1. PeerTIS – A Peer-to-Peer Traffic Information System | Jedrzej Rybicki | Björn Scheuermann | | Markus Koegel | Martin Mauve |

  2. VANETs • Limited network capacity ? Limited scalability, connectivity • No immediate market penetration • Benefits: – User-driven, Decentralized

  3. Infrastructure-based Cellular Communication (i.e. UMTS) Assumptions: – Each car connected to cellular Internet (IP-based communication channel between cars)

  4. TIS • Distributed database of traffic measurements

  5. Peer-to-Peer Internet Overlay Over Infrastructure-based networks • Robust and efficient search and data retrieval • Redundant storage • Scalability • Decentralized

  6. The TIS Application • Street segment IDs as keys measurements on the segment as values • Use any DHT and apply it to TIS ?

  7. Cellular Internet Access limitations: • Bandwidth and Latency limitations • Mobile stations limited storage and processing power

  8. Reduce Communication Burden • Non-random access operations / Exhibits locality property

  9. Content Addressable Network (CAN) • Key-values mapped to points in d-dimensional space, key space • One zone/peer • Peer joins – Split • Peer leaves – Merge

  10. CAN continued… • Communication Overlay formed by connecting neighbor peers in the key space. • Routing Table • Greedily forwarding of requests

  11. Naïve Approach (CAN) • Identify relevant road segments • Determine the position of the segments in the key space • Locate responsible peers

  12. A P2P Overlay for TIS (PeerTIS) Improving the Lookup Performance • Keep the relationship between the road segments • No hashing – use geographical coordinates • Looked-up road segments are contiguous – peers in the overlay are closer • More efficient lookups – Multi-hop lookups

  13. Load Distribution • No uniform distribution of segment IDs over the key space (maintain locality) • Homogeneous zone sizes in original CAN • Higher load for peers responsible for dense zones • Solution: Smaller zone sizes in dense areas • Achieved: by considering physical location of cars – not random

  14. Exploiting Temporal Correlations • Subsequent requests/updates by the same peer to the same geographical area (even the same road segment) • Each peer maintain cache of contact data of peers on the planned route – can be directly contacted for update-requests and and update-uploads (own measurement) •

  15. Feasibility VISSIM microscopic traffic simulator to generate car movements, 500km roads, up to 10,000 vehicles • Bandwidth and Latency – UTMS bound 384kB/s upload – GSM/GPRS 42kB/s

  16. • Performance – Number of hops in the overlay – 90% of lookups require 2 hops

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend