407 research outputs found
Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications
We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches
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
RESP: Relay suitability-based routing protocol for video streaming in vehicular Ad Hoc Networks
Video streaming in Vehicular Ad Hoc Networks (VANETs) is a fundamental requirement for a roadside emergency and smart video surveillance services. However, vehicles moving at a high speed usually create unstable wireless links that drop video frames qualities. In a high-density network, network collision between vehicles is another obstacle in improving the scalability of unicast routing protocols. In this paper, the RElay Suitability-based Routing Protocol (RESP) which makes a routing decision based on the link stability measurement was proposed for an uninterrupted video streaming. The RESP estimates the geographic advancement and link stability of a vehicle towards its destination only in the small region. To ensure the reliability while extending the scalability of routing, the relay suitability metric integrates the packet delay, collision dropping, link stability, and the Expected Transmission Count (ETX) in the weighted division algorithm, and selects a high-quality forwarding node for video streaming. The experimental results demonstrated
the proposed RESP outperformed the link Lifetime-aware Beacon-less Routing Protocol (LBRP) and other traditional geographical streaming protocols in providing a high packet delivery ratio and packet delay with various network densities,
and proved the scalability support of RESP for video streaming
Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks
For improving the efficiency and the reliability of the opportunistic routing
algorithm, in this paper, we propose the cross-layer and reliable opportunistic
routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the
improved efficiency fuzzy logic and humoral regulation inspired topology
control into the opportunistic routing algorithm. In CBRT, the inputs of the
fuzzy logic system are the relative variance (rv) of the metrics rather than
the values of the metrics, which reduces the number of fuzzy rules
dramatically. Moreover, the number of fuzzy rules does not increase when the
number of inputs increases. For reducing the control cost, in CBRT, the node
degree in the candidate relays set is a range rather than a constant number.
The nodes are divided into different categories based on their node degree in
the candidate relays set. The nodes adjust their transmission range based on
which categories that they belong to. Additionally, for investigating the
effection of the node mobility on routing performance, we propose a link
lifetime prediction algorithm which takes both the moving speed and moving
direction into account. In CBRT, the source node determines the relaying
priorities of the relaying nodes based on their utilities. The relaying node
which the utility is large will have high priority to relay the data packet. By
these innovations, the network performance in CBRT is much better than that in
ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201
Reliable and efficient data dissemination schemein VANET: a review
Vehicular ad-hoc network (VANET), identified as a mobile ad hoc network MANETs with several added constraints. Basically, in VANETs, the network is established on the fly based on the availability of vehicles on roads and supporting infrastructures along the roads, such as base stations. Vehicles and road-side infrastructures are required to provide communication facilities, particularly when enough vehicles are not available on the roads for effective communication. VANETs are crucial for providing a wide range of safety and non-safety applications to road users. However, the specific fundamental problem in VANET is the challenge of creating effective communication between two fast-moving vehicles. Therefore, message routing is an issue for many safety and non-safety of VANETs applications. The challenge in designing a robust but reliable message dissemination technique is primarily due to the stringent QoS requirements of the VANETs safety applications. This paper investigated various methods and conducted literature on an idea to develop a model for efficient and reliable message dissemination routing techniques in VANET
A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks
This article addresses Delay/Disruption Tolerant Networking (DTN) routing under a highly dynamic scenario, envisioned for communication in Vehicular Sensor Networks (VSNs) suffering from intermittent connection. Here, we focus on the design of a high level routing framework, rather than the dedicated encounter prediction. Based on an analyzed utility metric to predict nodal encounter, our proposed routing framework considers the following three cases:
1) Messages are efficiently replicated to a better qualified candidate node, based on the analysed utility metric related to destination.
2) Messages are conditionally replicated if the node with a better utility metric has not been met.
3) Messages are probabilistically replicated if the information in relation to destination is unavailable in the worst case.
With this framework in mind, we propose two routing schemes covering two major technique branches in literature, namely Encounter-Based Replication Routing (EBRR) and Encounter-Based Spraying Routing (EBSR). Results under the scenario applicable to VSNs show that, in addition to achieving high delivery ratio for reliability, our schemes are more efficient in terms of a lower overhead ratio. Our core investigation indicates that apart from what information to use for encounter prediction, how to deliver messages based on the given utility metric is also important
- …