On efficient neighbor sensing in vehicular networks
Computer Communications
| Hi-index | 0.00 |
In this paper, we propose a tree-based adaptive broadcasting (TAB) algorithm for data dissemination to improve data access efficiency in vehicle communications. The proposed TAB algorithm first constructs a broadcast tree to determine the broadcast frequency of each data, and splits the broadcast tree into some broadcast wood to generate the broadcast program. In addition, this paper develops an analytical model to derive the mean access latency of the generated broadcast program. In light of the derived result, the bandwidth for both index channel and data channel can be optimally allocated to maximize bandwidth utilization. Furthermore, to evaluate the effectiveness of the proposed strategy, experiments are demonstrated as well. This study argues for the use of an interest profile (ontology) of drivers and information about vehicles to form a group of interest for Vehicle ad hoc Networks (VANETs). The performance of the approach is evaluated by performing computer simulations. From the experimental results, it can be seen that the proposed mechanism is feasible in practice.