Intelligent Information Spreading Protocol for Vehicular Ad Hoc Networks Gerhath, Gabor ; Koves, Balint ; Laborczi, Peter ; Torok, Adam
Publication details: Bryssel ITS in daily life: 16th world congress and exhibition on intelligent transport systems and services, Stockholm 21-25 September 2009. Paper, 2009Description: 9 sSubject(s): Bibl.nr: VTI P1835:16 [World]Location: Abstract: In Vehicular Ad hoc Networks (VANETs) the high amount of traffic information carried and flooded along the road network leads to frequent appearance of broadcast storms and superfluous forwarding. These negative effects are usually reduced by using rate adaptivity in the dissemination mechanisms. However, in certain cases due to the lack of context-aware information, the current protocols employing distributed spatial adaptivity will fail to achieve the desired performance. This paper introduced a dissemination protocol for reducing superfluous forwarding: not only temporally but also spatially. This paper describes the problem and gives a graph theoretical model-based algorithm. The behavior of a dissemination protocol with spatial-awareness is explored through simulations. The approach performs better than the previous solutions in terms of channel utilization, while the travel time of vehicles remained unaffected.| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Statens väg- och transportforskningsinstitut | Available |
In Vehicular Ad hoc Networks (VANETs) the high amount of traffic information carried and flooded along the road network leads to frequent appearance of broadcast storms and superfluous forwarding. These negative effects are usually reduced by using rate adaptivity in the dissemination mechanisms. However, in certain cases due to the lack of context-aware information, the current protocols employing distributed spatial adaptivity will fail to achieve the desired performance. This paper introduced a dissemination protocol for reducing superfluous forwarding: not only temporally but also spatially. This paper describes the problem and gives a graph theoretical model-based algorithm. The behavior of a dissemination protocol with spatial-awareness is explored through simulations. The approach performs better than the previous solutions in terms of channel utilization, while the travel time of vehicles remained unaffected.