Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

On the \theta -Coverage and Connectivity of Large Random Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Wireless planar networks have been used to model wireless networks in a tradition that dates back to 1961 to the work of E. N. Gilbert. Indeed the study of connected components in wireless networks was the motivation for his pioneering work that spawned the modern field of continuum percolation theory. Given that node locations in wireless networks are not known, random planar modeling can be used to provide preliminary assessments of important quantities such as range, number of neighbors, power consumption, and connectivity, and issues such as spatial reuse and capacity. In this paper, the problem of connectivity based on nearest neighbors is addressed. The exact threshold function for \theta -coverage is found for wireless networks modeled as n points uniformly distributed in a unit square, with every node connecting to its \phi _n nearest neighbors. A network is called \theta -covered if every node, except those near the boundary, can find one of its \phi _n nearest neighbors in any sector of angle \theta . For all \theta \in (0, 2 \pi ) , if \phi _n =(1+\delta ) \log _ 2\pi \over 2\pi -\theta n , it is shown that the probability of \theta -coverage goes to one as n goes to infinity, for any \delta \gg 0 ; on the other hand, if \phi _n=(1-\delta ) \log _ 2\pi \over 2\pi -\theta n , the probability of \theta -coverage goes to zero. This sharp characterization of \theta -coverage is used to show, via further geometric arguments, that the network will be connected with probability approaching one if \phi _n=(1+\delta ) \log _2 n . Connections between these results and the performance analysis of wireless networks, especially for routing and topology control algorithms, are discussed. Digital Object Identifier 10.1109/TIT.2006.874384

Published in:

Networking, IEEE/ACM Transactions on  (Volume:14 ,  Issue: 4 )