6,108 research outputs found

    A Simple and Robust Dissemination Protocol for VANETs

    Get PDF
    Several promising applications for Vehicular Ad-hoc Networks (VANETs) exist. For most of these applications, the communication among vehicles is envisioned to be based on the broadcasting of messages. This is due to the inherent highly mobile environment and importance of these messages to vehicles nearby. To deal with broadcast communication, dissemination protocols must be defined in such a way as to (i) prevent the so-called broadcast storm problem in dense networks and (ii) deal with disconnected networks in sparse topologies. In this paper, we present a Simple and Robust Dissemination (SRD) protocol that deals with these requirements in both sparse and dense networks. Its novelty lies in its simplicity and robustness. Simplicity is achieved by considering only two states (cluster tail and non- tail) for a vehicle. Robustness is achieved by assigning message delivery responsibility to multiple vehicles in sparse networks. Our simulation results show that SRD achieves high delivery ratio and low end-to-end delay under diverse traffic conditions

    The Dynamics of Vehicular Networks in Urban Environments

    Full text link
    Vehicular Ad hoc NETworks (VANETs) have emerged as a platform to support intelligent inter-vehicle communication and improve traffic safety and performance. The road-constrained, high mobility of vehicles, their unbounded power source, and the emergence of roadside wireless infrastructures make VANETs a challenging research topic. A key to the development of protocols for inter-vehicle communication and services lies in the knowledge of the topological characteristics of the VANET communication graph. This paper explores the dynamics of VANETs in urban environments and investigates the impact of these findings in the design of VANET routing protocols. Using both real and realistic mobility traces, we study the networking shape of VANETs under different transmission and market penetration ranges. Given that a number of RSUs have to be deployed for disseminating information to vehicles in an urban area, we also study their impact on vehicular connectivity. Through extensive simulations we investigate the performance of VANET routing protocols by exploiting the knowledge of VANET graphs analysis.Comment: Revised our testbed with even more realistic mobility traces. Used the location of real Wi-Fi hotspots to simulate RSUs in our study. Used a larger, real mobility trace set, from taxis in Shanghai. Examine the implications of our findings in the design of VANET routing protocols by implementing in ns-3 two routing protocols (GPCR & VADD). Updated the bibliography section with new research work

    Persistent Localized Broadcasting in VANETs

    Get PDF
    We present a communication protocol, called LINGER, for persistent dissemination of delay-tolerant information to vehicular users, within a geographical area of interest. The goal of LINGER is to dispatch and confine information in localized areas of a mobile network with minimal protocol overhead and without requiring knowledge of the vehicles' routes or destinations. LINGER does not require roadside infrastructure support: it selects mobile nodes in a distributed, cooperative way and lets them act as "information bearers", providing uninterrupted information availability within a desired region. We analyze the performance of our dissemination mechanism through extensive simulations, in complex vehicular scenarios with realistic node mobility. The results demonstrate that LINGER represents a viable, appealing alternative to infrastructure-based solutions, as it can successfully drive the information toward a region of interest from a far away source and keep it local with negligible overhead. We show the effectiveness of such an approach in the support of localized broadcasting, in terms of both percentage of informed vehicles and information delivery delay, and we compare its performance to that of a dedicated, state-of-the-art protoco

    Models and Performance of VANET based Emergency Braking

    Get PDF
    The network research community is working in the field of automotive to provide VANET based safety applications to reduce the number of accidents, deaths, injuries and loss of money. Several approaches are proposed and investigated in VANET literature, but in a completely network-oriented fashion. Most of them do not take into account application requirements and no one considers the dynamics of the vehicles. Moreover, message repropagation schemes are widely proposed without investigating their benefits and using very complicated approaches. This technical report, which is derived from the Master Thesis of Michele Segata, focuses on the Emergency Electronic Brake Lights (EEBL) safety application, meant to send warning messages in the case of an emergency brake, in particular performing a joint analysis of network requirements and provided application level benefits. The EEBL application is integrated within a Collaborative Adaptive Cruise Control (CACC) which uses network-provided information to automatically brake the car if the driver does not react to the warning. Moreover, an information aggregation scheme is proposed to analyze the benefits of repropagation together with the consequent increase of network load. This protocol is compared to a protocol without repropagation and to a rebroadcast protocol found in the literature (namely the weighted p-persistent rebroadcast). The scenario is a highway stretch in which a platoon of vehicles brake down to a complete stop. Simulations are performed using the NS_3 network simulation in which two mobility models have been embedded. The first one, which is called Intelligent Driver Model (IDM) emulates the behavior of a driver trying to reach a desired speed and braking when approaching vehicles in front. The second one (Minimizing Overall Braking Induced by Lane change (MOBIL)), instead, decides when a vehicle has to change lane in order to perform an overtake or optimize its path. The original simulator has been modified by - introducing real physical limits to naturally reproduce real crashes; - implementing a CACC; - implementing the driver reaction when a warning is received; - implementing different network protocols. The tests are performed in different situations, such as different number of lanes (one to five), different average speeds, different network protocols and different market penetration rates and they show that: - the adoption of this technology considerably decreases car accidents since the overall average maximum deceleration is reduced; - network load depends on application-level details, such as the implementation of the CACC; - VANET safety application can improve safety even with a partial market penetration rate; - message repropagation is important to reduce the risk of accidents when not all vehicles are equipped; - benefits are gained not only by equipped vehicles but also by unequipped ones

    V2X Content Distribution Based on Batched Network Coding with Distributed Scheduling

    Full text link
    Content distribution is an application in intelligent transportation system to assist vehicles in acquiring information such as digital maps and entertainment materials. In this paper, we consider content distribution from a single roadside infrastructure unit to a group of vehicles passing by it. To combat the short connection time and the lossy channel quality, the downloaded contents need to be further shared among vehicles after the initial broadcasting phase. To this end, we propose a joint infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communication scheme based on batched sparse (BATS) coding to minimize the traffic overhead and reduce the total transmission delay. In the I2V phase, the roadside unit (RSU) encodes the original large-size file into a number of batches in a rateless manner, each containing a fixed number of coded packets, and sequentially broadcasts them during the I2V connection time. In the V2V phase, vehicles perform the network coded cooperative sharing by re-encoding the received packets. We propose a utility-based distributed algorithm to efficiently schedule the V2V cooperative transmissions, hence reducing the transmission delay. A closed-form expression for the expected rank distribution of the proposed content distribution scheme is derived, which is used to design the optimal BATS code. The performance of the proposed content distribution scheme is evaluated by extensive simulations that consider multi-lane road and realistic vehicular traffic settings, and shown to significantly outperform the existing content distribution protocols.Comment: 12 pages and 9 figure
    • 

    corecore