Browsing by Author "Zhu, Yanmin"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item type:Item, Mitigate the Obstructing Effect of Vehicles on the Propagation of VANETs Safety-Related Information(2018-07-01) ;Huang, Rui ;Wu, Jing ;Long, Chengnian ;Zhu, YanminLi, BoAs physical obstacles, vehicles have significant impacts on the efficient propagations of safety-related information in vehicular ad hoc networks (VANETs) by frequently obstructing the LOS links between transmitters and receivers. Obstructing effect will diminish the effective coverage of safety-related information and incur severe impact on road safety. However, this impact has not been addressed effectively. In this paper, we first present the definition of broadcast efficiency as the metric for quantizing the obstructing effect. We investigate the optimization issue for mitigating the impact of obstructing effect on the propagation of safety-related information and propose a graph theory based optimization algorithm. For a distributed implementation of this optimization in VANETs, we further propose the maximum broadcast efficiency relaying (MBER) algorithm. MBER maximizes the effective coverage of information, meanwhile, meets delay and reliability constraints by incorporating broadcast efficiency and propagation distance in relay contention. Simulation results demonstrate that MBER promotes the effective coverage of safety-related information in VANETs with varying vehicular distribution.Item type:Item, Mitigate the Obstructing Effect of Vehicles on the Propagation of VANETs Safety-related Information(2017-01-01) ;Huang, Rui ;Wu, Jing ;Long, Chengnian ;Zhu, YanminLin, Yi-BingAs physical obstacles, vehicles have a significant impact on the efficient propagation of safety-related information in vehicular ad hoc networks (VANETs) by frequently obstructing the LOS link between the source and receivers. Obstructing effect of vehicles will diminish the effective coverage of broadcast as part of vehicles can not decode the broadcast successfully and incur severe impact on road safety. However, this impact has not been addressed by existing protocols. In this paper, we first present the definition of broadcast efficiency (BE) as the metric for measuring the obstructing effect and conclude the optimization issue of propagation. We further propose a distributed algorithm for mitigating this impact that can be embedded in VANETs. This algorithm maximizes the effective coverage of the broadcast of safety-related information and meanwhile satisfies the constraints on both link state and delay by selecting relay according to BE and referential propagation distance. Simulation results demonstrate that the proposed algorithm promotes the efficiency of propagation in dynamic multilane VANETs with varying vehicular distribution.Item type:Item, SPRCA: Distributed Multisource Information Propagation in Multichannel VANETs(2017-12-01) ;Huang, Rui ;Wu, Jing ;Long, Chengnian ;Zhu, YanminLi, BoInformation dissemination in VANETs mainly focuses on, e.g., the propagation of cooperative awareness messages and decentralized environmental notification messages on the control channel. As vehicles advance toward higher automation levels, VANETs should support more complex traffic services, which generates the demand for the propagation of Internet Protocol (IP)-based information and service data in multichannel environment as specified by IEEE Standard for Wireless Access in Vehicular Environments (WAVE). Multisource propagation in the multichannel environments will incur multisource relay confliction (MRC) which leads to higher latency and lower information propagation speed (IPS). However, the problem of how to mitigate the impact of MRC and maintain high IPS has not been studied sufficiently. In this paper, we propose success probability based relay contention algorithm (SPRCA) for mitigating the impact of MRC under WAVE channel environments. SPRCA presents a vital metric, success probability, for each vehicle to determine whether to join the relay candidate set of certain source and execute relay contention algorithm. SPRCA explores both real time location information of vehicles and stochastic properties of vehicular distribution. We construct a theoretical model for analyzing the performance of SPRCA with a stochastic geometry-based approach and derive the properties of the performance of SPRCA. We further demonstrate the network performance and the practicality in dynamic VANETs of SPRCA through simulations with realistic traffic flow data.