VANETs Multipath Video Data Streaming Considering Road Features

Multipath video streaming in Vehicular Ad-hoc Networks (VANETs) is an evolving research topic. The adoption of video transmission in VANETs communication has become essential due to the comprehensiveness and applicability of video data for on-road advertisement and infotainment. Meanwhile, several research studies have considered how to apply and improve the transmission of the video quality. Due to this, the concurrent multipath transmission has been employed in order to achieve load balancing and path diversity, because of the high data rate of the video data.  However, the main nature of the road, which is the pathway for VANET nodes has not been considered explicitly. In this paper, the road features are considered for VANETs multipath video streaming based on the greedy geographical routing protocol. Thus, VANETs Multipath Video Streaming based on Road Features (VMVS-RF) protocol has been proposed. The protocol was compared with an ordinary Multipath Video Streaming (MVS). The result demonstrates that the proposed VMVS-RF protocol outperforms the MVS in terms of Data Receiving Rate (DRR), Structural Similarity (SSIM) index and Packet Loss Ratio (PLR)

An Efficient Multi path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment

Wireless mobile ad-hoc networks are classified as ad-hoc networks with logical connections. These types of networks do not have fixed topology (or physical connections) due to the mobility property of nodes, interference, propagation and loss of path. Because of all these problems the path established between sources to destination is not reliable and efficient path. Hence a dynamic source routing protocol is required for these networks to working properly. Data transfer using this protocol based on shorted path, all packets need to be transferred using same path. The researcher on MANET proposed many Routing algorithms to this task. The main idea of this paper is to study, understand, and analyze the problems with existing routing methods. In the proposed multi path dynamic routing, first identify multi paths exist between source to destination and select best shortest path and then data is segmented into packets, each packet is transferred to receiver using selected best shortest path. At receiver end received data need to be rearranged. Finally the performance proposed system is compared with existing methods and proposed method shows better performance when compared with existing methods

Dynamic Time-Stable Geocast Routing in Vehicular Ad Hoc Networks

Vehicular ad hoc networks (VANETs) have emerged as an area of interest for both industry and research scholars because they have become an essential part of intelligent transportation systems (ITSs). Many applications in VANET require sending a message to certain or all vehicles within a region, called geocast. Sometimes geocast requires that the message be kept alive within the region for a period of time. This time-stable geocast has a vital role in some ITS applications, particularly commercial applications. This study presents a novel time-stable geocast protocol that works well even in too sparse networks. Moreover, since commercial applications sometimes make it necessary to change the duration of the stable message within the region, the dynamic nature of a geocast protocol should allow this time to be extended, reduced, or canceled without any additional cost. Therefore, we call it a dynamic time-stable geocast, DTSG, protocol. It works in two phases (the pre-stable period and the stable period), and the simulation results show that it works well in its performance metrics (delivery ratio and network cost). In addition, these results validate the protocol prediction of its performance metrics. Moreover, with the informed time of zero, all the intended vehicles will be informed as soon as they enter the region. The fact that the protocol is independent of the networks’ density, the vehicles’ speed, and the vehicles’ broadcasting range, makes it more robust than others that fail in sparse networks or in high-speed nodes

An Efficient Bypassing Void Routing Algorithm for Wireless Sensor Network

Since the sensor node’s distribution in a wireless sensor network (WSN) is irregular, geographic routing protocols using the greedy algorithm can cause local minima problem. This problem may fail due to routing voids and lead to failure of data transmission. Based on the virtual coordinate mapping, this paper proposes an efficient bypassing void routing protocol to solve the control packet overhead and transmission delay in routing void of WSN, which is called EBVRPVCM. The basic idea is to transfer the random structure of void edge to a regular one through mapping the coordinates on a virtual circle. In EBVRPVCM, some strategies, executed in different regions, are selected through virtual coordinates to bypass routing void efficiently. The regular edge is established by coordinate mapping that can shorten the average routing path length and decrease the transmission delay. The virtual coordinate mapping is not affected by the real geographic node position, and the control packet overhead can be reduced accordingly. Compared with RGP and GPSR, simulation results demonstrate that EBVRPVCM can successfully find the shortest routing path with higher delivery ratio and less control packet overhead and energy consumption