Connectivity of Large Wireless Networks Under A General Connection Model

DOI10.1109/TIT.2012.2228894zbMATH Open1364.94048arXiv1204.1400OpenAlexW2084983846WikidataQ61311464 ScholiaQ61311464MaRDI QIDQ2989378FDOQ2989378

Authors: Guoqiang Mao, Brian D. O. Anderson 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1204.1400

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication theory (94A05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (4)

• The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
• Random geometric graph: some recent developments and perspectives
• Title not available (Why is that?)
• Distributed connectivity of wireless networks

This page was built for publication: Connectivity of Large Wireless Networks Under A General Connection Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989378)