Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios
Article
Article Title | Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios |
---|---|
ERA Journal ID | 4554 |
Article Category | Article |
Authors | Xiong, Wei (Author), Jingjing, Xu (Author), Li, Yan (Author), Wan, Xiangkui (Author) and Jin, Liang (Author) |
Journal Title | Eurasip Journal on Wireless Communications and Networking |
Journal Citation | 32, pp. 1-10 |
Number of Pages | 10 |
Year | 28 Jan 2016 |
Place of Publication | Germany |
ISSN | 1687-1472 |
1687-1499 | |
Digital Object Identifier (DOI) | https://doi.org/10.1186/s13638-016-0529-0 |
Web Address (URL) | https://jwcn-eurasipjournals.springeropen.com/articles/10.1186/s13638-016-0529-0 |
Abstract | A vehicular ad hoc network (VANET) is a specific type of mobile ad hoc networks (MANETs); it can provide direct or multi-hop vehicle-to-vehicle (V2V), vehicle-to-roadside (V2R), vehicle-to-pedestrian (V2P), and vehicle-to-internet (V2I) communications based on the pre-existing road layouts. The emerging and promising VANET technologies have drawn tremendous attention from the government, academics, and industry over the past few years and have been increasingly available for a large number of cutting edge applications that can be classified into road safety, traffic efficiency, and infotainment categories. Due to the unique characteristics of VANETs, such as high mobility with an organized but constrained pattern, and diverse radio propagation conditions, the conventional researches dedicated for general MANETs cannot be directly applied to VANETs. This paper presents an analytical framework to investigate the minimum node degree of k-connected VANETs, with a homogeneous range assignment in highway scenarios. We simulate the mobility patterns with realistic vehicular traces, model the network topology as a two-path fading geometric random graph, and conduct extensive experiments on the derived analytical results. Through a combination of mathematical modeling and simulations, we derive a probabilistic bound for the minimum node degree of a homogeneous vehicular ad hoc network in highway scenarios. The analytical framework is useful in the study of connectivity and estimation of performance in one-dimensional vehicular ad hoc networks. |
Keywords | Vehicular ad hoc networks (VANETs); Minimum node degree; Network connectivity |
Contains Sensitive Content | Does not contain sensitive content |
ANZSRC Field of Research 2020 | 460609. Networking and communications |
Byline Affiliations | Hubei University of Technology, China |
School of Agricultural, Computational and Environmental Sciences | |
Guangdong Biolight Meditech Company, China | |
Institution of Origin | University of Southern Queensland |
https://research.usq.edu.au/item/q3x09/minimum-node-degree-of-k-connected-vehicular-ad-hoc-networks-in-highway-scenarios
Download files
1516
total views109
total downloads0
views this month0
downloads this month