Peer-to-peer data structures for cooperative traffic information systems

Rybicki, Jedrzej; Scheuermann, Björn; Mauve, Martin

doi:10.1016/j.pmcj.2011.06.002

Cited by 5 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Being a multi-hop information dissemination mechanism, aggregation schemes are rivaled by Geocast dissemination mechanisms, cellular data networks including recent proposals for peer-to-peer network overlays [98], [99], and roadside infrastructure units. While these approaches all come with their unique drawbacks, their combination can benefit the overall application.…”

Section: Discussion and Open Issuesmentioning

confidence: 99%

In-Network Aggregation for Vehicular <italic>Ad Hoc</italic> Networks

Dietzel

Petit

Kargl

et al. 2014

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

In-network aggregation mechanisms for vehicular ad hoc networks (VANETs) aim at improving communication efficiency by summarizing information that is exchanged between vehicles. Summaries are calculated, while data items are generated in and forwarded through the network. Due to its high bandwidth saving potential, aggregation is a vital building block for many of the applications envisioned in VANETs. At the same time, the specific environment of VANETs calls for novel approaches to aggregation, which address their challenging requirements. In this paper, we survey and structure this active research field. We propose a generic model to describe and classify the proposed approaches, and we identify future research challenges.

show abstract

Section: Discussion and Open Issuesmentioning

confidence: 99%

In-Network Aggregation for Vehicular <italic>Ad Hoc</italic> Networks

Dietzel

Petit

Kargl

et al. 2014

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…There are few changes between Mobile Chord and Cross-Layer Mobile Chord in the simulation, and the relationship between groups is still a concern. GraphTIS [152] is another traffic information system based on P2P overlay and cellular network, It is a modification of another old traffic information system PeerTIS [149] (e.g., CAN), the network is represented by a Graph (i.e., key neighbor graph), the vertices represent the road and the edges represent the intersections between roads, the graph is divided into a lot of sous graphs, each peer is responsible for one sub-graph. The roads between sous graphs represent the link between peers in the overlay.…”

Section: Overlay Independent Techniques For Vanet Car Torrent Techniquementioning

confidence: 99%

“…Peers on Wheels [3] PAV [147] Mobile Chord [148] PeerTIS [149] P2PBISSVAN [150] CL Mchord [151] GraphTIS [152] LAar-VANET [153] P2PPT [154] Two-Tiers Overlay Techniques SP2POMBRPSCV [155] EIBSDVNP2PS [156] SPP2PHML [158] Multi-Layered Overlay Techniques UML-Chord [159] Figure 20: Taxonomic of structured overlays techniques for VANET.…”

Section: Structured Overlays Techniques For Vanet One-tier Overlay Te...mentioning

confidence: 99%