2,597 research outputs found

    A Scalable Data Dissemination Protocol Based on Vehicles Trajectories Analysis

    Get PDF
    International audienceSince the last decade, the emergence of affordable wireless devices in vehicle ad-hoc networks has been a key step towards improving road safety as well as transport efficiency. Informing vehicles about interesting safety and non-safety events is of key interest. Thus, the design of an efficient data dissemination protocol has been of paramount importance. A careful scrutiny of the pioneering vehicle-to-vehicle data dissemination approaches highlights that geocasting is the most feasible approach for VANET applications, more especially in safety applications, since safety events are of interest mainly to vehicles located within a specific area, commonly called ZOR or Zone Of Relevance, close to the event. Indeed, the most challenging issue in geocast protocols is the definition of the ZOR for a given event dissemination. In this paper, we introduce a new geocast approach, called Data Dissemination Protocol based on Map Splitting (DPMS). The main thrust of DPMS consists of building the zones of relevance through the mining of correlations between vehicles' trajectories and crossed regions. To do so, we rely on the Formal Concept Analysis (FCA), which is a method of extracting interesting clusters from relational data. The performed experiments show,that DPMS outperforms its competitors in terms of effectiveness and efficiency. (C) 2017 Elsevier B.V. All rights reserved

    Improved Bounds on Information Dissemination by Manhattan Random Waypoint Model

    Full text link
    With the popularity of portable wireless devices it is important to model and predict how information or contagions spread by natural human mobility -- for understanding the spreading of deadly infectious diseases and for improving delay tolerant communication schemes. Formally, we model this problem by considering MM moving agents, where each agent initially carries a \emph{distinct} bit of information. When two agents are at the same location or in close proximity to one another, they share all their information with each other. We would like to know the time it takes until all bits of information reach all agents, called the \textit{flood time}, and how it depends on the way agents move, the size and shape of the network and the number of agents moving in the network. We provide rigorous analysis for the \MRWP model (which takes paths with minimum number of turns), a convenient model used previously to analyze mobile agents, and find that with high probability the flood time is bounded by O(NlogM(N/M)log(NM))O\big(N\log M\lceil(N/M) \log(NM)\rceil\big), where MM agents move on an N×NN\times N grid. In addition to extensive simulations, we use a data set of taxi trajectories to show that our method can successfully predict flood times in both experimental settings and the real world.Comment: 10 pages, ACM SIGSPATIAL 2018, Seattle, U

    LunaNet: a Flexible and Extensible Lunar Exploration Communications and Navigation Infrastructure

    Get PDF
    NASA has set the ambitious goal of establishing a sustainable human presence on the Moon. Diverse commercial and international partners are engaged in this effort to catalyze scientific discovery, lunar resource utilization and economic development on both the Earth and at the Moon. Lunar development will serve as a critical proving ground for deeper exploration into the solar system. Space communications and navigation infrastructure will play an integral part in realizing this goal. This paper provides a high-level description of an extensible and scalable lunar communications and navigation architecture, known as LunaNet. LunaNet is a services network to enable lunar operations. Three LunaNet service types are defined: networking services, position, navigation and timing services, and science utilization services. The LunaNet architecture encompasses a wide variety of topology implementations, including surface and orbiting provider nodes. In this paper several systems engineering considerations within the service architecture are highlighted. Additionally, several alternative LunaNet instantiations are presented. Extensibility of the LunaNet architecture to the solar system internet is discussed

    Review of Parameters in Routing Protocols in Vehicular Ad-hoc Networks

    Get PDF
    Vehicular Ad_hoc Network  (VANET) is a sophisticated elegance of devoted cellular network that permits automobiles to intelligently communicate for different   roadside infrastructure. VANETs bring with it some of demanding situations associated with Quality of Service (QoS) and performance. QoS relies upon on many parameters which includes packet transport ratio, bandwidth, postpone variance, records latency, etc. This paper, discuss numerous troubles associated with latency records, bandwidth usage, and transport of packet in VANETs. The demanding situations have been recognized in offering security, reliability and confidentiality of posted records. Finally, numerous packages of VANETs also are introduced in the modern computing scenario

    A scalable data dissemination protocol for both highway and urban vehicular environments

    Get PDF
    Vehicular ad hoc networks (VANETs) enable the timely broadcast dissemination of event-driven messages to interested vehicles. Especially when dealing with broadcast communication, data dissemination protocols must achieve a high degree of scalability due to frequent deviations in the network density. In dense networks, suppression techniques are designed to prevent the so-called broadcast storm problem. In sparse networks, protocols incorporate store-carry-forward mechanisms to take advantage of the mobility of vehicles to store and relay messages until a new opportunity for dissemination emerges. Despite numerous efforts, most related works focus on either highway or urban scenarios, but not both. Highways are mostly addressed with a single directional dissemination. For urban scenarios, protocols mostly concentrate on either using infrastructure or developing methods for selecting vehicles to perform the store-carry-forward task. In both cases, dense networks are dealt with suppression techniques that are not optimal for multi-directional dissemination. To fill this gap, we present an infrastructure-less protocol that combines a generalized time slot scheme based on directional sectors and a store-carry-forward algorithm to support multi-directional data dissemination. By means of simulations, we show that our protocol scales properly in various network densities in both realistic highway and urban scenarios. Most importantly, it outperforms state-of-the-art protocols in terms of delivery ratio, end-to-end delay, and number of transmissions. Compared to these solutions, our protocol presents up to seven times lower number of transmissions in dense highway scenarios
    corecore