期刊名称：International Journal of Wireless & Mobile Networks
印刷版ISSN：0975-4679
电子版ISSN：0975-3834
出版年度：2012
卷号：4
期号：4
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Connectivity in ad-hoc networks is a fundamental, but to a large extend still unsolved problem. In this paper we consider the connectivity problem when a number of nodes are uniformly distributed within a unit square. We limit our problem to the one-hop and two-hop connectivity. For the one-hop connectivity we calculate the exact analytically solution. For the two-hop connectivity we calculate the lower and upper bound for connectivity.
