Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Reliable geographical multicast routing in vehicular ad-hoc networks

  • Maria Kihl
  • Mihail Sichitiu
  • Ted Ekeroth
  • Michael Rozenberg
Publiceringsår: 2007
Språk: Engelska
Sidor: 315-325
Publikation/Tidskrift/Serie: Wired/Wireless Internet Communications / Lecture Notes in Computer Science
Volym: 4517
Dokumenttyp: Konferensbidrag
Förlag: Springer


Vehicular ad-hoc networks (VANETs) offer a large number of new potential applications without relying on significant infrastructure. Many of these applications benefit from multi-hop relaying of information, thus requiring a routing protocol. Characteristics unique to VANETs (such as high mobility and the need for geographical addressing) make many conventional ad hoc routing protocols unsuitable. Also, some envisioned applications have end-to-end QoS requirements. In this paper we propose a new multicast routing protocol specifically designed for VANETs. Its purpose is to provide a routing service for a future reliable transport protocol. We evaluate its performance using realistic network and traffic models. It is shown that it is possible to implement a reliable multicast routing protocol for VANETs.


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • significant infrastructure
  • QoS
  • multihop relaying
  • vehicular ad-hoc network
  • reliable geographical multicast routing protocol
  • traffic model
  • quality-of-service
  • realistic network


5th International Conference, WWIC 2007, , May 23-25, 2007
  • Tele- och datakommunikationssystem: Performance Analysis of distributed Applications
  • Tele- och datakommunikationssystem-lup-obsolete
  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-540-72694-4

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen