By Topic

Sensitivity of critical transmission ranges to node placement distributions

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
$33 $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)
Guang Han ; Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA ; Makowski, A.M.

We consider the geometric random graph where n points are distributed independently on the unit interval [0, 1] according to some probability distribution function F with density f. Two nodes are adjacent (i.e., communicate with each other) if their distance is less than some transmission range. We survey results, some classical and some recently obtained by the authors, concerning the existence of zero-one laws for graph connectivity, the type of zero-one laws under the specific assumptions made, the form of its critical scaling and its dependence on the density f. We also present results and conjectures concerning the width of the corresponding phase transition. Engineering implications are discussed for power allocation.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:27 ,  Issue: 7 )