27,490 research outputs found

    Evaluation study of IEEE 1609.4 performance for safety and non-safety messages dissemination

    Get PDF
    The IEEE 1609.4 was developed to support multi-channel operation and channel switching procedure in order to provide both safety and non-safety vehicular applications. However, this protocol has some drawback because it does not make efficient usage of channel bandwidth resources for single radio WAVE devices and suffer from high bounded delay and lost packet especially for large-scale networks in terms of the number of active nodes. This paper evaluates IEEE 1609.4 multi-channel protocol performance for safety and non-safety application and compare it with the IEEE 802.11p single channel protocol. Multi-channel and single channel protocols are analyzed in different environments to investigate their performance. By relying on a realistic dataset and using OMNeT++ simulation tool as network simulator, SUMO as traffic simulator and coupling them by employing Veins framework. Performance evaluation results show that the delay of single channel protocol IEEE 802.11p has been degraded 36% compared with multi-channel protocol

    Secure Vehicular Communication Systems: Implementation, Performance, and Research Challenges

    Get PDF
    Vehicular Communication (VC) systems are on the verge of practical deployment. Nonetheless, their security and privacy protection is one of the problems that have been addressed only recently. In order to show the feasibility of secure VC, certain implementations are required. In [1] we discuss the design of a VC security system that has emerged as a result of the European SeVeCom project. In this second paper, we discuss various issues related to the implementation and deployment aspects of secure VC systems. Moreover, we provide an outlook on open security research issues that will arise as VC systems develop from today's simple prototypes to full-fledged systems

    MHAV: multitier heterogeneous adaptive vehicular network with LTE and DSRC

    Get PDF
    Enabling cooperation between vehicles form vehicular networks, which provide safety, traffic efficiency and infotainment. The most vital of these applications require reliability and low latency. Considering these requirements, this paper presents a multitier heterogeneous adaptive vehicular (MHAV) network. Comprising of transport operator or authority owned vehicles in high tier and all the other privately owned vehicles in low tier, integrating cellular network with dedicated short range communications. The proposed framework is implemented and evaluated in Glasgow city center model. Simulation results demonstrate that the proposed architecture outperforms previous multitier architectures in terms of latency while offloading traffic from cellular networks

    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

    SDDV: scalable data dissemination in vehicular ad hoc networks

    Get PDF
    An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations

    Optimisation of Mobile Communication Networks - OMCO NET

    Get PDF
    The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

    Detecting Traffic Conditions Model Based On Clustering Nodes Situations In VANET

    Get PDF
    In the last decade, cooperative vehicular network has been one of the most studied areas for developing the intelligent transportation systems (ITS). It is considered as an important approach to share the periodic traffic situations over vehicular ad hoc networks (VANETs) to improve efficiency and safety over the road. However, there are a number of issues in exchanging traffic data over high mobility of VANET, such as broadcast storms, hidden nodes and network instability. This paper proposes a new model to detect the traffic conditions using clustering traffic situations that are gathered from the nodes (vehicles) in VANET. The model designs new principles of multi-level clustering to detect the traffic condition for road users. Our model (a) divides the situations of vehicles into clusters, (b) designs a set of metrics to get the correlations among vehicles and (c) detects the traffic condition in certain areas. These metrics are simulated using the network simulator environment (NS-3) to study the effectiveness of the model

    Dynamics of Rumor Spreading in Complex Networks

    Full text link
    We derive the mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks. These equations are solved numerically by means of a stochastic approach. First, we present analytical and Monte Carlo calculations for homogeneous networks and compare the results with those obtained by the numerical method. Then, we study the spreading process in detail for random scale-free networks. The time profiles for several quantities are numerically computed, which allow us to distinguish among different variants of rumor spreading algorithms. Our conclusions are directed to possible applications in replicated database maintenance, peer to peer communication networks and social spreading phenomena.Comment: Final version to appear in PR
    • 

    corecore