Connectivity of Large Wireless Networks under A Generic Connection Model
Networking and Internet Architecture
2012-10-05 v2 Information Theory
math.IT
Abstract
This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost surely connected. The results established in this paper expand recent results obtained for connectivity of random geometric graphs from the unit disk model and the fewer results from the log-normal model to the more generic and more practical random connection model.
Cite
@article{arxiv.1204.1400,
title = {Connectivity of Large Wireless Networks under A Generic Connection Model},
author = {Guoqiang Mao and Brian Do Anderson},
journal= {arXiv preprint arXiv:1204.1400},
year = {2012}
}
Comments
accepted to appear in IEEE Transactions on Information Theory. arXiv admin note: substantial text overlap with arXiv:1103.1994, arXiv:1012.5693, arXiv:1103.1991, arXiv:1012.5723