Two hop connectivity for uniformed randomly distributed points in the unit square
2006 (English)In: Proceedings of the First International Conference on Communications and Networking in China (CHINACOM 2006). 25-27 October 2006, Beijing, China., 2006Conference paper (Refereed)
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 find the exact analytically solution. For the two-hop connectivity we find the lower and upper bound for connectivity.
Place, publisher, year, edition, pages
IdentifiersURN: urn:nbn:se:umu:diva-38027OAI: oai:DiVA.org:umu-38027DiVA: diva2:371833