Design and Analysis of Cooperative Broadcast Scheme Based on Reliability in Mesh Network

In order to ensure reliable data transmission of sender, the tree-based network is extended to Mesh network by collaborative technology, and the SW-HBH-CARQ broadcast scheme is introduced for the first time. Then, in order to solve the problems of broadcast storm and energy saving, SW-HBH-oiCARQ, SW-HBH-ieCARQ, and SW-HBH-oieCARQ are further proposed. Then, the four broadcasting schemes are analyzed quantitatively, and the performance indicators such as system energy consumption and time delay are obtained. Finally, the relationships between the performance indexes and the parameters are discussed by numerical simulation. At the same time, the effectiveness of the proposed schemes in energy saving is verified by comparing with the corresponding noncollaborative broadcasting scheme. However, the latency of proposes scheme is greater than uncooperative scheme, which is the cost of saving energy and resolving broadcast storms.

Data Dissemination Scheme for VANET using Genetic algorithm and Particle Swarm Optimization

A vehicular ad hoc network (VANET) consist of moving vehicles connected via wireless technology e.g., Wireless Access in Vehicular Environment (WAVE) for the aim of exchanging information. Therefore data dissemination in VANET has become issue of debate for researcher. In VANET broadcasting play an important role. The aim of VANET is to ensure passenger safety through emergency message. With multiple objectives broadcast storm is assumed to be an NP-Hard problem. In this paper we propose DDV algorithm to solve broadcast storm problem. Fitness function has used to optimize the objective of proposed algorithm. The proposed algorithm producing better optimization results. We are considering a highway scenario in city with dynamic rotation, to evaluate the performance of the DDV algorithm we compare the result with Smart flooding techniques, MOGA (Multi Objective Genetic algorithm) [1] and EEADP. Our result show the better performance in terms of reduce the number of retransmission, increase the packet delivery ratio and provide better throughput.

PBeiD Priority-based Information Dissemination Protocol for V2V Communication

In Vehicular Ad-hoc Networks (VANET)s, efficient information dissemination plays a vital role in its successful deployment. Broadcasting has proven as one of the better ways for Information Dissemination over vehicular Networks, and cooperative behaviour among vehicles for information exchange is critical. However, the existing broadcast techniques are still suffering from multiple issues such as Broadcast storm problem, network partition problem, and network contention. Motivated from the aforementioned discussion, in this paper, we propose a Priority-based Efficient Information Dissemination Protocol (PBeiD) to improve the broadcast efficiency in VANETs. PBeiD protocol developed with a blend of probability and density-based information dissemination concepts and implemented in the testbed environment using simulation tools consisting of SUMO, OMNET++, and VEINS. The proposed protocol is compared with benchmark protocols, and the simulation is carried out based on different scenarios from sparse to dense. We found that our protocol is performing well in almost all the cases and to provide proper justification that our results are significant and not by chance, we applied statistical t-test on the results obtained.

Towards Optimal Dissemination of Emergency Messages in Internet of Vehicles: A Dynamic Clustering-Based Approach

In this paper, we target dissemination issues of emergency messages in a highly dynamic Internet of Vehicles (IoV) network. IoV is emerging as a new class of vehicular networks to optimize road safety as well as users’ comfort. In such a context, forwarding emergency messages through vehicle-to-vehicle communications (V2V) plays a vital role in enabling road safety-related applications. For instance, when an accident occurs, forwarding such information in real time will help to avoid other accidents in addition to avoiding congestion of network traffic. Thus, dissemination of emergency information is a major concern. However, on the one hand, vehicle density has increased in the last decade which may lead to several issues including message collisions, broadcast storm, and the problem of hidden nodes. On the other hand, high mobility of vehicles and hence dynamic changes of network topology result in failure of dissemination of emergency packets. To overcome these problems, we propose a new dissemination scheme of emergency packets by vehicles equipped with both DSRC and cellular LTE wireless communication capabilities. Our scheme is based on a dynamic clustering strategy, which includes a new cluster head selection algorithm to deal with the broadcast storm problem. Furthermore, our selection algorithm enables not only the election of the most stable vehicles as cluster heads, and hence their exploitation in forwarding the emergency information, but also the avoidance of packet collisions. We simulated our scheme in an urban environment and compared it with other data dissemination schemes. Obtained results show the efficiency of our scheme in minimizing collision and broadcast storm problems, while improving latency, packet delivery ratio and data throughput, as compared to other schemes.

A Selective reliable communication to reduce broadcasting for cluster based VANET

Vehicular Ad hoc Network (VANET) is one of the subset of Mobile Ad hoc Network (MANET) and it is a self-organised system with a group of vehicles, which are capable of short-range communication using On Board Unit (OBU). This unit is comprised with the vehicles that are possible to communicate with the nearby vehicles. VANETs rely on heavy broadcast transmission due to sharing data (messages) between the nearby vehicles about the traffic, collision and so on. This redundant information spoils the nature of VANET that affects the inter-vehicular communication, rebroadcasting and information on collision. This message transmission increases largely as the number of vehicles increases. This problem is typically named as broadcast storm and it is relatively reduced through the proposed Selective Reliable Communication (SRC) Protocol. Through a reliable communication, packets are retransmitted to reduce a number of transmission in the network within the acceptable level of QoS. The proposed SRC protocol automatically detect the vehicle clusters as “Zone of Interest”. Generally, the proposed protocol forwards the packets to the cluster-heads and the cluster-head forwards the packets to the cluster-members. The proposed protocol outperforms than the existing protocols in terms of Throughput, Packet Delivery Ratio (PDR) and Average delay.

Distributed Urban Platooning towards High Flexibility, Adaptability, and Stability

Vehicle platooning reduces the safety distance between vehicles and the travel time of vehicles so that it leads to an increase in road capacity and to saving fuel consumption. In Europe, many projects for vehicle platooning are being actively developed, but mostly focus on truck platooning on the highway with a simpler topology than that of the urban road. When an existing vehicle platoon is applied to urban roads, many challenges are more complicated to address than highways. They include complex topology, various routes, traffic signals, intersections, frequent lane change, and communication interference depending on a higher vehicle density. To address these challenges, we propose a distributed urban platooning protocol (DUPP) that enables high mobility and maximizes flexibility for driving vehicles to conduct urban platooning in a decentralized manner. DUPP has simple procedures to perform platooning maneuvers and does not require explicit conforming for the completion of platooning maneuvers. Since DUPP mainly operates on a service channel, it does not cause negative side effects on the exchange of basic safety messages on a control channel. Moreover, DUPP does not generate any data propagation delay due to contention-based channel access since it guarantees sequential data transmission opportunities for urban platooning vehicles. Finally, to address a problem of the broadcast storm while vehicles notify detected road events, DUPP performs forwarder selection using an analytic hierarchy process. The performance of the proposed DUPP is compared with that of ENSEMBLE which is the latest European platooning project in terms of the travel time of vehicles, the lifetime of an urban platoon, the success ratio of a designed maneuver, the external cost and the periodicity of the urban platooning-related transmissions, the adaptability of an urban platoon, and the forwarder selection ratio for each vehicle. The results of the performance evaluation demonstrate that the proposed DUPP is well suited to dynamic urban environments by maintaining a vehicle platoon as stable as possible after DUPP flexibly and quickly forms a vehicle platoon without the support of a centralized node.

Black Widow Optimization Algorithm and Similarity Index Based Adaptive Scheduled Partitioning Technique for Reliable Emergency Message Broadcasting in VANET

The vehicular ad hoc network (VANET) topology will change the mobility of the nodes and the data delivery will be efficient in the vehicle environment. This technique uses the density, mobility, dissemination in the requirements of emergency message broadcasting. The emergency message is broadcast on the road causes many issues like reliability, latency and scalability. Beacons are used in the VANET to broadcast messages and get the information from neighbours. When more vehicles transmit the messages in equal time lead a frequent broadcast storm the vehicles are faced the message delivery failure. Adaptive Scheduled Partitioning and Broadcasting technique (ASPBT) is used in our paper for message reliability, and the transmission efficiency will adjust the partitions and beacon automatically for reducing retransmissions. The partition size is determined using the density of network transmission of each partition schedule is estimated using the Black Widow Optimization (BWOA). The emergency message gets low delay and redundancy of the message is reducing, ASPBT include the forwarding of novel with the selection of optimal partition. The performance analysis is done with the existing methods for the determination of efficiency, redundancy, collision, and delay. The efficiency of proposed technique as 98% comparing with existing broadcast schemes of VANET.

Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for Performance Improvement in MANET

The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.

EEMDS: An Effective Emergency Message Dissemination Scheme for Urban VANETs

In Vehicular Adhoc Networks (VANETs), disseminating Emergency Messages (EMs) to a maximum number of vehicles with low latency and low packet loss is critical for road safety. However, avoiding the broadcast storm and dealing with large-scale dissemination of EMs in urban VANETs, particularly at intersections, are the challenging tasks. The problems become even more challenging in a dense network. We propose an Effective Emergency Message Dissemination Scheme (EEMDS) for urban VANETs. The scheme is based on our mobility metrics to avoid communication overhead and to maintain a stable cluster structure. Every vehicle takes into account its direction angle and path loss factor for selecting a suitable cluster head. Moreover, we introduce estimated link stability to choose a suitable relay vehicle that reduces the number of rebroadcasts and communication congestion in the network. Simulation results show that EEMDS provides an acceptable end-to-end delay, information coverage, and packet delivery ratio compared to the eminent EM dissemination schemes.