Connectivity in finite ad-hoc networks

Wang, Hanxing; Lu, Guilin; Jia, Weijia; Zhao, Wei

doi:10.1007/s11432-008-0011-7

Cited by 9 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Desai and Manjunath [41] first analyzed the connectivity in a finite ad hoc network with nodes uniformly distributed in one-dimension and derived a closed-form equation to compute the network connectivity probability. Wang et al [42] also derived a generic formula for the probability that a one-dimensional MANET is connected. They investigated some topological characteristics of connected ad hoc networks, especially the derivations of necessary condition for network connectivity in oneand two-dimensions.…”

Section: Related Workmentioning

confidence: 99%

Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios

Xiong

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios

Xiong

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The exact probability of connectivity of G(n, z, r) is derived in [6] (email: shylmath@hotmail.com) Figure 1 One-dimensional ad hoc network model. through the Laplacian transform and several different ways leading to it are provided in [7,8]. Ref.…”

Section: Definitionmentioning

confidence: 99%

A note on the 2-connectivity in one-dimensional ad hoc networks

Shang

2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

2-connectivity is the basic graph theoretical metric for fault tolerance to node failures, and it is an extremely desirable property in network design. For a one-dimensional finite ad hoc network formed by n nodes uniformly and independently distributed in a closed interval [0, z] (z ∈ R + ), we give a closed form expression for the probability that a connected one-dimensional finite ad hoc network becomes disconnected after removing a node. We also sketch a procedure of finding the exact formula for 2-connectivity in a one-dimensional ad hoc network.

show abstract

“…Then, the minimum node density for a certain probability of network connectivity was deduced. Connectivity of AANETs 2 and MANETs 3,4 was also studied and some important conclusions were obtained. In VANETs, the impact of multi-cooperation…”

Section: Introductionmentioning

confidence: 99%

Hop count limitation analysis in wireless multi-hop networks

Wenxing

Muqing

Zhao

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Recent studies about wireless multi-hop networks mainly focus on two aspects, network performance and network strategy. A mass of models and algorithms about network connectivity, path reliability, and node mobility have been proposed to improve network performance. However, hop count, an important factor of wireless multi-hop networks, is rarely researched. In this article, we propose some feasible research methods to figure out the connections between hop count and network connectivity, and path reliability and node mobility, respectively. By modeling the network connectivity, path reliability, and node mobility, we get the maximum hop count of arbitrary wireless multi-hop network. This study shows that the hop count limitation has great effect on network stability. With an increase in hop count, the network stability gets worse. Thinking about this situation, we propose some feasible advices to avoid the hop count limitation problem, which may provide some useful theoretical foundation for further study on wireless multi-hop networks.

show abstract

Connectivity in finite ad-hoc networks

Cited by 9 publications

References 11 publications

Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios

Minimum node degree of k-connected vehicular ad hoc networks in highway scenarios

A note on the 2-connectivity in one-dimensional ad hoc networks

Hop count limitation analysis in wireless multi-hop networks

Contact Info

Product

Resources

About