TY - JOUR
T1 - Meeting connectivity requirements in a wireless multihop network
AU - Li, Ji
AU - Andrew, Lachlan L.H.
AU - Foh, Chuan Heng
AU - Zukerman, Moshe
AU - Neuts, Marcel F.
PY - 2006/1
Y1 - 2006/1
N2 - This paper investigates the connectivity probability of 1-dimensional ad hoc networks in which nodes have random, non-identically distributed locations, this leads to optimization of the number of nodes required. An empirical approach is used. We fit a parametric distribution to the CDF of the maximum distance between adjacent nodes. Special and extreme cases which are not covered by the empirical approach are treated separately. © 2006 IEEE.
AB - This paper investigates the connectivity probability of 1-dimensional ad hoc networks in which nodes have random, non-identically distributed locations, this leads to optimization of the number of nodes required. An empirical approach is used. We fit a parametric distribution to the CDF of the maximum distance between adjacent nodes. Special and extreme cases which are not covered by the empirical approach are treated separately. © 2006 IEEE.
KW - Ad hoc network
KW - Connectivity probability
KW - Empirical analysis
KW - Log-logistic distribution
KW - Sensor network
UR - http://www.scopus.com/inward/record.url?scp=32444435972&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-32444435972&origin=recordpage
U2 - 10.1109/LCOMM.2006.1576556
DO - 10.1109/LCOMM.2006.1576556
M3 - RGC 21 - Publication in refereed journal
SN - 1089-7798
VL - 10
SP - 19
EP - 21
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 1
ER -