Papers
Topics
Authors
Recent
Search
2000 character limit reached

Connectivity of Large Wireless Networks under A Generic Connection Model

Published 6 Apr 2012 in cs.NI, cs.IT, and math.IT | (1204.1400v2)

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.

Citations (31)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.