scholarly journals Capacity of Vehicular Ad Hoc Networks Based on Multibeam Directional Transmission

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Yuhua Wang ◽  
Laixian Peng ◽  
Renhui Xu

The development of multibeam directional transmission technology used in vehicular ad hoc networks is drawing much more attention in recent years due to its wider coverage ability than omnidirectional transmission. In this paper, we analyse the transport capacity of the vehicular network using different antenna modes in the transmitter and receiver end, respectively. We first construct the cross-layer model comprising the characteristic of the directional antenna model, arbitrary network model, and interference model. Then, based on scaling laws, we calculate the upper and lower bound of the network capacity with and without the directional multibeam transmission technology. In order to reduce the capacity lower bound computation complexity, several topology frameworks are constructed while taking various interferences into account included in the actual project. Finally, we analyse the capacity under changes of different parameters and also evaluate the law of capacity changes to discover how much improvement multibeam transmission technology can bring to the network performance. Analysis shows that compared with DTOR and OTDR mode, DTDR mode can continue to increase network capacity by 2 to 3 times on the basis of the above two modes.

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2764 ◽  
Author(s):  
Huanhuan Yang ◽  
Zongpu Jia ◽  
Guojun Xie

As an auxiliary facility, roadside units (RSUs) can well improve the shortcomings incurred by ad hoc networks and promote network performance in a vehicular ad hoc network (VANET). However, deploying a large number of RSUs will lead to high installation and maintenance costs. Therefore, trying to find the best locations is a key issue when deploying RSUs with the set delay and budget. In this paper, we study the delay-bounded and cost-limited RSU deployment (DBCL) problem in urban VANET. We prove it is non-deterministic polynomial-time hard (NP-hard), and a binary differential evolution scheme is proposed to maximize the number of roads covered by deploying RSUs. Opposite-based learning is introduced to initialize the first generation, and a binary differential mutation operator is designed to obtain binary coding. A random variable is added to the traditional crossover operator to increase population diversity. Also, a greedy-based individual reparation and promotion algorithm is adopted to repair infeasible solutions violating given constraints, and to gain optimal feasible solutions with the compromise of given limits. Moreover, after selection, a solution promotion algorithm is executed to promote the best solution found in generation. Simulation is performed on analog trajectories sets, and results show that our proposed algorithm has a higher road coverage ratio and lower packet loss compared with other schemes.


2013 ◽  
Vol 8 (3) ◽  
pp. 168-176
Author(s):  
Yusuke Sakumoto ◽  
Shinpei Kuribayashi ◽  
Hiroyuki Ohsaki ◽  
Satoshi Hasegawa ◽  
Makoto Imase

2017 ◽  
Vol 97 (3) ◽  
pp. 3331-3353 ◽  
Author(s):  
Gongjun Yan ◽  
Danda B. Rawat ◽  
William Lindsey

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Jezabel Molina-Gil ◽  
Pino Caballero-Gil ◽  
Cándido Caballero-Gil

The secure and efficient exchange of information in vehicular ad hoc networks (VANETs) involves more challenges than in any other type of ad hoc networks. This paper proposes a new vehicular communication system based on mobile phones for fully distributed and decentralized networks. In these networks, communications depend on individual nodes, which could decrease the efficiency and reliability of transmitted information. Besides, the limitation in the resources of mobile devices is an additional obstacle in the forwarding problem, and the content of the information generated by individual nodes must be considered inherently unreliable. In particular, this paper proposes the application of groups as a basis structure for a cooperation mechanism useful in event generation and in packet retransmission. Its aim is to promote the involvement of nodes in network performance. Given that such participation involves consumption of node resources, a group-based structure is here used not only to reduce communication overload but also to prevent sending false information and to encourage nodes in relaying packets. Several simulations of the proposal have been done, and the results have confirmed that this is a promising approach to increase network efficiency and trust in transmitted information, while reducing the number of selfish nodes in VANETs.


Sign in / Sign up

Export Citation Format

Share Document