Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Connectivity requirements for vehicular networks with single-hop broadcasting
In a vehicular ad hoc network (VANET), an information can generally be disseminated by using either a multi-hop broadcasting protocol or a single-hop broadcasting protocol. While in our earlier work we analyze the connectivity requirements in a network that employs a multi-hop broadcasting protocol, in this paper we extend our analysis to model the connectivity in a network that uses a single-hop broadcasting protocol. Our goal is to develop a model that is able to describe the relationship among the flow rate, the broadcast rate, and the network connectivity. As an initial step, in this paper, we determine the fundamental relation between the flow rate and the network connectivity.
Connectivity requirements for vehicular networks with single-hop broadcasting
In a vehicular ad hoc network (VANET), an information can generally be disseminated by using either a multi-hop broadcasting protocol or a single-hop broadcasting protocol. While in our earlier work we analyze the connectivity requirements in a network that employs a multi-hop broadcasting protocol, in this paper we extend our analysis to model the connectivity in a network that uses a single-hop broadcasting protocol. Our goal is to develop a model that is able to describe the relationship among the flow rate, the broadcast rate, and the network connectivity. As an initial step, in this paper, we determine the fundamental relation between the flow rate and the network connectivity.
Connectivity requirements for vehicular networks with single-hop broadcasting
Panichpapiboon, Sooksan (Autor:in) / Pattara-atikom, Wasan (Autor:in)
01.10.2009
563134 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Vehicular Ad-hoc networks (VANETs): A survey on connectivity
American Institute of Physics | 2023
|Optimal Connectivity-Based Deployment of Roadside Units for Vehicular Networks in Urban Areas
British Library Online Contents | 2016
|