2,382 research outputs found
Routing And Communication Path Mapping In VANETS
Vehicular ad-hoc network (VANET) has quickly become an important aspect of the intelligent transport system (ITS), which is a combination of information technology, and transport works to improve efficiency and safety through data gathering and dissemination. However, transmitting data over an ad-hoc network comes with several issues such as broadcast storms, hidden terminal problems and unreliability; these greatly reduce the efficiency of the network and hence the purpose for which it was developed. We therefore propose a system of utilising information gathered externally from the node or through the various layers of the network into the access layer of the ETSI communication stack for routing to improve the overall efficiency of data delivery, reduce hidden terminals and increase reliability. We divide route into segments and design a set of metric system to select a controlling node as well as procedure for data transfer. Furthermore we propose a system for faster data delivery based on priority of data and density of nodes from route information while developing a map to show the communication situation of an area. These metrics and algorithms will be simulated in further research using the NS-3 environment to demonstrate the effectiveness
Design and analysis of a beacon-less routing protocol for large volume content dissemination in vehicular ad hoc networks
Largevolumecontentdisseminationispursuedbythegrowingnumberofhighquality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well
Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting
In a multihop wireless network, it is crucial but challenging to schedule
transmissions in an efficient and fair manner. In this paper, a novel
distributed node scheduling algorithm, called Local Voting, is proposed. This
algorithm tries to semi-equalize the load (defined as the ratio of the queue
length over the number of allocated slots) through slot reallocation based on
local information exchange. The algorithm stems from the finding that the
shortest delivery time or delay is obtained when the load is semi-equalized
throughout the network. In addition, we prove that, with Local Voting, the
network system converges asymptotically towards the optimal scheduling.
Moreover, through extensive simulations, the performance of Local Voting is
further investigated in comparison with several representative scheduling
algorithms from the literature. Simulation results show that the proposed
algorithm achieves better performance than the other distributed algorithms in
terms of average delay, maximum delay, and fairness. Despite being distributed,
the performance of Local Voting is also found to be very close to a centralized
algorithm that is deemed to have the optimal performance
Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks Using Rateless Codes
In this paper, we address the problem of distributing a large amount of bulk
data to a sparse vehicular network from roadside infostations, using efficient
vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the
underlying vehicular network topology, we depart from architectures requiring
centralized coordination, reliable MAC scheduling, or global network state
knowledge, and instead adopt a distributed paradigm with simple protocols. In
other words, we investigate the problem of reliable dissemination from multiple
sources when each node in the network shares a limited amount of its resources
for cooperating with others. By using \emph{rateless} coding at the Road Side
Unit (RSU) and using vehicles as data carriers, we describe an efficient way to
achieve reliable dissemination to all nodes (even disconnected clusters in the
network). In the nutshell, we explore vehicles as mobile storage devices. We
then develop a method to keep the density of the rateless codes packets as a
function of distance from the RSU at the desired level set for the target
decoding distance. We investigate various tradeoffs involving buffer size,
maximum capacity, and the mobility parameter of the vehicles
A fast and reliable broadcast service for LTE-advanced exploiting multihop device-to-device transmissions
Several applications, from the Internet of Things for smart cities to those for vehicular networks, need fast and reliable proximity-based broadcast communications, i.e., the ability to reach all peers in a geographical neighborhood around the originator of a message, as well as ubiquitous connectivity. In this paper, we point out the inherent limitations of the LTE (Long-Term Evolution) cellular network, which make it difficult, if possible at all, to engineer such a service using traditional infrastructure-based communications. We argue, instead, that network-controlled device-to-device (D2D) communications, relayed in a multihop fashion, can efficiently support this service. To substantiate the above claim, we design a proximity-based broadcast service which exploits multihop D2D. We discuss the relevant issues both at the UE (User Equipment), which has to run applications, and within the network (i.e., at the eNodeBs), where suitable resource allocation schemes have to be enforced. We evaluate the performance of a multihop D2D broadcasting using system-level simulations, and demonstrate that it is fast, reliable and economical from a resource consumption standpoint
Reliable Delay Constrained Multihop Broadcasting in VANETs
Vehicular communication is regarded as a major innovative feature for in-car technology. While improving road safety is unanimously considered the major driving factor for the deployment of Intelligent Vehicle Safety Systems, the challenges relating to reliable multi-hop broadcasting are exigent in vehicular networking. In fact, safety applications must rely on very accurate and up-to-date information about the surrounding environment, which in turn requires the use of accurate positioning systems and smart communication protocols for exchanging information. Communications protocols for VANETs must guarantee fast and reliable delivery of information to all vehicles in the neighbourhood, where the wireless communication medium is shared and highly unreliable with limited bandwidth. In this paper, we focus on mechanisms that improve the reliability of broadcasting protocols, where the emphasis is on satisfying the delay requirements for safety applications. We present the Pseudoacknowledgments (PACKs) scheme and compare this with existing methods over varying vehicle densities in an urban scenario using the network simulator OPNET
- …