Connectivity in finite ad-hoc networks
Research on ad-hoc network connectivity has mainly focused on asymptotic results in the
number of nodes in the network. For a one-dimensional ad-hoc network G 1, assuming all …
number of nodes in the network. For a one-dimensional ad-hoc network G 1, assuming all …
Comments on" On the connectivity in finite ad hoc networks"
AD Gore - IEEE Communications Letters, 2006 - ieeexplore.ieee.org
Comments on "On the connectivity in finite ad hoc networks" Page 1 88 IEEE
COMMUNICATIONS LETTERS, VOL. 10, NO. 2, FEBRUARY 2006 Comments on “On the …
COMMUNICATIONS LETTERS, VOL. 10, NO. 2, FEBRUARY 2006 Comments on “On the …
On the throughput of ad-hoc networks using connectivity graphs
C Fragouli, T Tabet, C Derdiyok - 42nd Annual Allerton …, 2004 - infoscience.epfl.ch
In this paper we propose a set of necessary and sufficient conditions under which the
throughput in an ad-hoc network can remain constant as the number of nodes n increases …
throughput in an ad-hoc network can remain constant as the number of nodes n increases …
On the connectivity in finite ad hoc networks
M Desai, D Manjunath - IEEE Communications letters, 2002 - ieeexplore.ieee.org
Connectivity and capacity analysis of ad hoc networks has usually focused on asymptotic
results in the number of nodes in the network. In this letter we analyze finite ad hoc networks …
results in the number of nodes in the network. In this letter we analyze finite ad hoc networks …
A note on the 2-connectivity in one-dimensional ad hoc networks
YL Shang - Science China Information Sciences, 2011 - Springer
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 …
an extremely desirable property in network design. For a one-dimensional finite ad hoc …
Correction to" Comments on'On the connectivity in finite ad hoc networks'"
AD Gore - IEEE Communications Letters, 2006 - ieeexplore.ieee.org
The probability of connectivity of a one-dimensional finite ad hoc network was derived by
Desai and Manjunath, and further analyzed by Gore. In this letter, we point out a …
Desai and Manjunath, and further analyzed by Gore. In this letter, we point out a …
Low degree connectivity in ad-hoc networks
L Kučera - Algorithms–ESA 2005: 13th Annual European …, 2005 - Springer
The aim of the paper is to investigate the average case behavior of certain algorithms that
are designed for connecting mobile agents in the two-or three-dimensional space. The …
are designed for connecting mobile agents in the two-or three-dimensional space. The …
On the k-connectivity of ad-hoc wireless networks
B Gupta, A Gupta - 2013 IEEE Seventh International …, 2013 - ieeexplore.ieee.org
In this paper, we consider k-connectivity problem which is one of the fundamental problems
in the ad-hoc wireless network. Here we assume that the nodes are uniformly distributed on …
in the ad-hoc wireless network. Here we assume that the nodes are uniformly distributed on …
An improved lower bound to the number of neighbors required for the asymptotic connectivity of ad hoc networks
Xue and Kumar have established that the number of neighbors required for connectivity of
wireless networks with N uniformly distributed nodes must grow as log (N), and they also …
wireless networks with N uniformly distributed nodes must grow as log (N), and they also …
Exact probability of connectivity one-dimensional ad hoc wireless networks
A Ghasemi, S Nader-Esfahani - IEEE Communications Letters, 2006 - ieeexplore.ieee.org
The probability that a one-dimensional stationary ad hoc wireless network is composed of at
most C clusters is presented. The probability of network connectivity, ie the case of C= 1, can …
most C clusters is presented. The probability of network connectivity, ie the case of C= 1, can …