Figure - available from: Wireless Communications and Mobile Computing
This content is subject to copyright. Terms and conditions apply.
Source publication
Safety services of Vehicular Ad Hoc Network (VANET) require reliable broadcasts. We propose a reliable broadcast mechanism for urban roads called VANET Broadcasting for Urban areas based on Road Layout (VBURL), which tries to minimize the dependency on information that may become inaccurate to maximize the efficiency of broadcast. Specifically, the...
Citations
... Distance and location based methods [34][35][36][37] determine a rebroadcast according to estimates of the distance between the transmitter and the receiver. Nodes closer to the boundary of the transmitter range are chosen for retransmission, since this would lead to a larger coverage area. ...
Information hovering is an information dissemination concept over a mobile set of peers which has not been investigated to the extent that other information dissemination paradigms have. It naturally appears in many vehicular network applications where information must be made available to vehicles within a confined geographical area for during some time period. One elementary strategy is to flood the area with data. Even in this case, some vehicles may never receive the content due to potential partitions created by low traffic density. In order to address this issue, in this work we propose a strategy based on epidemic routing in the hovering area, and probabilistic flooding outside it. Vehicles outside the hovering area serve as bridges towards partitions, leading to high reachability. We highlight the adaptive feature of the protocol, where the rebroadcast probability in partitions is adaptively regulated based on estimates of the density of vehicles in the hovering area. The performance of the proposed scheme is evaluated in VISSIM, using as the reference model in all simulation experiments a section of the road network in cities of Washington. The proposed protocol is shown to achieve the set design goals.
... Depending on whether the forwarding decision is made by the receiver or sender, the protocols can be classified as receiver-oriented and sender-oriented schemes. In receiver-oriented schemes, when candidate forwarders receive messages from the current forwarder, they will contend to forward the message in a distributed manner, choose a random number from contention window [3] or calculate waiting time based on various factors [4]. However, most of them depends on the fixed distance. ...
... Recently, some broadcast mechanisms are proposed specifically for urban VANETs because of the complex road topology and communication environment. A road layout based broadcast mechanism for urban VANETs (VBURL) [4] is completely distributed without infrastructure support, it can address the disconnected network based on two waiting timers and neighbour table, which has considered the impact of obstacle around the intersection, but the distance between sender and candidate forwarder was the only factor in calculation of waiting time, which may cause a broadcast storm. Under different traffic density in urban road, Akabane et al. [16] proposed two forwarding mechanism: (1) store-carry-forward mechanism is adapted to improve coverage of message transmission in the sparse scenario; ...
... When the vehicle receives the previous message, if the Waiting Timer is running, the Timer keeps running only when the message is from non-IA and the vehicle at IA has not received implicit ACK from all directions where neighbours exist, otherwise, the vehicle cancels the Timer and discards the duplicate message. Especially, when the vehicle is IPV and receives the Year Relay selection Scenario AddP [2] 2017 density and distance based highway and urban SEAD [10] 2016 density based highway NDD [11] 2015 distance and message size based highway BDSC [12] 2016 link qualities for single-hop neighbour based highway DDP4V [13] 2018 partition and distance based highway and urban JFRN [14] 2015 fuzzy logic based highway and urban BSM [15] 2015 time and frequency based highway TB [18] 2019 super-node based urban LER-GR [6] 2017 the least error in location based urban VBURL [4] 2018 distance based urban TURBO [16] 2015 one-hop neighbour based urban UMBP [17] 2016 iterative partition, mini-slot, and black-burst based urban CTB [19] 2018 concurrent transmission based urban RFNSM [20] 2018 fuzzy logic based urban message from the intersection, the 'flag' filed of the message in its schedule table change to be zero. If the Rebroadcast Waiting Timer is running, which means the vehicle has forwarded the message and is waiting for implicit ACK, the Timer keeps running only when the vehicle at IA has not received implicit ACK from all directions where neighbours exist, otherwise, the vehicle cancels the Timer and discards the duplicate message. ...
In urban roads, the safety service of vehicular ad hoc networks is particularly important because of the frequent traffic accidents. In order to minimise redundancy and delay of network and ensure the high reception rate of vehicles in the target area when spreading the emergency message. In this study, the authors propose a reliable broadcast mechanism based on the layout information of the road. Different from existing mechanisms, in the straight, the proposed mechanism regards effective communication distance based on prediction rather than fix distance as one of the parameters of waiting time calculation. Considering the obstacles such as buildings around the intersection in the actual urban scenario, the vehicle in the intersection area (IA) of the target area will have an additional broadcast, if there are no vehicles in the IA, the vehicle in the pre-selected area for intersections (IPA) has chance to broadcast when it enters IA, which avoids the failure of emergency message transmission in some direction because of the obstacles around the intersection and ensures the coverage and reliability of emergency message. The simulation results verify that the novel scheme has better performance than the compared schemes in terms of reliability and delay.
... Therefore, it is not possible to compare and established efficiency of the proposed methodology. In [21], an urban broadcast mechanism in VANET environment is proposed based on road layout. It is assumed that road layout information is already available to all the vehicles in the network. ...
... In the first experiment, we explore the number of retransmissions exhibited by the optimized solutions produced from the proposed MOGA and compare it with SF, AVED, AddP and [21]. The experiments of MOGA for each vehicle density are repeated at least ten times. ...
... The optimized solutions of the proposed MOGA in the urban scenarios are compared with SF, AddP and [21]. In case of the SF, 134 vehicles are used with an intervehicle distance of 100m in an urban scenario with 15 generations to produce the resultant retransmissions [7], [8]. ...
This paper addresses the broadcasting storm problem by proposing an optimized relay vehicle selection methodology in the Vehicular Ad-hoc Networks (VANETs). A crucial effect observed in the broadcasting storm is the network congestion that is caused by multiple retransmissions generated by the relay vehicles to achieve the desired network coverage. In order to address this problem, we propose an optimized relay selection methodology based on Multi-Objective Genetic Algorithm (MOGA) consisting of a novel analytical fitness function. In this paper, we present a detailed study of previous research work and identify the gaps to achieve the optimum performance in terms of network coverage time.We introduce a component-based analytical model containing the proposed MOGA to reduce these performance gaps. A dedicated solver was designed using Python to implement the proposed model in both urban and highway environments. The numerical results obtained by the proposed MOGA are compared with the existing techniques. It is shown that the proposed method performs better in terms of number of retransmissions and network coverage time.
