Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(10)
Ad Hoc Network
Analytical Method
Geometric Random Graphs
Mobile Ad Hoc Network
Sensor Network
Spatial Distribution
Uniform Distribution
wireless multihop network
wireless multihop network
Wireless Sensor Network
Related Publications
(48)
Some peculiar boundary phenomena for extremes of rth nearest neighbor links
The Number of Neighbors Needed for Connectivity of Wireless Networks
Critical Power for Asymptotic Connectivity in Wireless Networks
Connectivity in adhoc and hybrid networks
Connectivity properties of a packet radio network model
Subscribe
Academic
Publications
On the minimum node degree and connectivity of a wireless multihop network
On the minimum node degree and connectivity of a wireless multihop network,10.1145/513800.513811,Christian Bettstetter
Edit
On the minimum node degree and connectivity of a wireless multihop network
(
Citations: 350
)
BibTex

RIS

RefWorks
Download
Christian Bettstetter
This paper investigates two fundamental characteristics of a wireless multi hop network: its minimum node degree and its kconnectivity. Both topology attributes depend on the
spatial distribution
of the nodes and their transmission range. Using typical modeling assumptions : :a random
uniform distribution
of the nodes and a simple link model : :we derive an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely kconnected network. Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes are needed to cover a certain area with a kconnected network. We also investigate these questions by various simulations and thereby verify our analytical expressions. Finally, the impact of mobility is discussed.The results of this paper are of practical value for researchers in this area, e.g., if they set the parameters in a networklevel simulation of a
mobile ad hoc network
or if they design a
wireless sensor
network.
Conference:
Mobile Ad Hoc Networking and Computing  MobiHoc
, pp. 8091, 2002
DOI:
10.1145/513800.513811
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
portal.acm.org
)
(
www.informatik.unitrier.de
)
(
camars.kaist.ac.kr
)
(
doi.acm.org
)
(
cst.mi.fuberlin.de
)
(
portal.acm.org
)
More »
Citation Context
(261)
...In terms of communication networks, the probability that no node is isolated in the multihop UVC network depends on the node density, ‰, as well as the transmission range, r0, of every UVC node and is given by [
17
]...
...UVC network has a minimum node degree dmin ‚ k is given by [
17
]...
Alexander Vavoulas
,
et al.
Connectivity Issues for Ultraviolet UVC Networks
...In the following simulations, we consider a unit square deployment area [
4
], [5], [26]...
Mauro Conti
,
et al.
Distributed Detection of Clone Attacks in Wireless Sensor Networks
...For example, it has been shown that to ensure either 1connectivity (there exists a path between any pair of nodes) [3], [4] or connectivity (there exist at least nodedisjoint paths between any pair of nodes) [
5
], the average number of neighbors of each node must increase with the network size...
Wei Ren
,
et al.
Connectivity of Heterogeneous Wireless Networks
...[
4
] and [5] study the relation between the minimum node degree and connectivity in a random graph and explore the minimum radio transmission range for achieving a fully connected ad hoc network for a given node density...
...Let us label the vertices in the onedimensional geometric graph from left to right as nodes 1, 2, 3, and so on. If there is an edge (communication link) between vertices (nodes) and , where , it directly implies there are edges between vertex and vertices located in between nodes and since those node pairs haveshorter Euclideandistances than that between nodes and . With reference to [
4
], a graph is said to be connected if for each node ...
Ivan WangHei Ho
,
et al.
Stochastic model and connectivity dynamics for VANETs in signalized ro...
...1) Simulation Setup: We assume the spectrum auction hosted by the auctioneer is deployed in a 1*1 square area, where nodes are uniformly distributed and connected [
37
], [38]...
Miao Pan
,
et al.
Purging the BackRoom Dealing: Secure Spectrum Auction Leveraging Paill...
References
(37)
On kconnectivity for a geometric random graph
(
Citations: 230
)
Mathew D. Penrose
Journal:
Random Structures and Algorithms  RSA
, vol. 15, no. 2, pp. 145164, 1999
On the evolution of random graphs
(
Citations: 1302
)
P. Erdos
,
A. R'enyi
Published in 1961.
Critical Power for Asymptotic Connectivity in Wireless Networks
(
Citations: 694
)
Piyush Gupta
,
P. R. Kumar
Published in 1998.
Performance Comparison of Two Ondemand Routing Protocols for Ad Hoc Networks
(
Citations: 746
)
Samir Ranjan Das
,
Charles E. Perkins
,
Elizabeth M. Beldingroyer
Conference:
IEEE INFOCOM  INFOCOM
, vol. 1, pp. 312, 2000
OnDemand Multi Path Distance Vector Routing in Ad Hoc Networks
(
Citations: 481
)
Mahesh K. Marina
,
Mahesh K. Das
Conference:
International Conference on Network Protocols  ICNP
, pp. 1423, 2001
Sort by:
Citations
(350)
Connectivity Issues for Ultraviolet UVC Networks
(
Citations: 1
)
Alexander Vavoulas
,
Harilaos G. Sandalidis
,
Dimitris Varoutas
Journal:
Journal of Optical Communications and Networking  J OPT COMMUN NETW
, vol. 3, no. 3, pp. 199205, 2011
Distributed Detection of Clone Attacks in Wireless Sensor Networks
(
Citations: 1
)
Mauro Conti
,
Roberto Di Pietro
,
Luigi Mancini
,
Alessandro Mei
Journal:
IEEE Transactions on Dependable and Secure Computing  TDSC
, vol. 8, no. 5, pp. 685698, 2011
Connectivity of Heterogeneous Wireless Networks
Wei Ren
,
Qing Zhao
,
Ananthram Swami
Journal:
IEEE Transactions on Information Theory  TIT
, vol. 57, no. 7, pp. 43154332, 2011
Stochastic model and connectivity dynamics for VANETs in signalized road systems
Ivan WangHei Ho
,
Kin K. Leung
,
John W. Polak
Journal:
IEEE/ACM Transactions on Networking  TON
, vol. 19, no. 1, pp. 195208, 2011
Purging the BackRoom Dealing: Secure Spectrum Auction Leveraging Paillier Cryptosystem
Miao Pan
,
Jinyuan Sun
,
Yuguang Fang
Journal:
IEEE Journal on Selected Areas in Communications  JSAC
, vol. 29, no. 4, pp. 866876, 2011