Cart (Loading....) | Create Account
Close category search window
 

Problem of localisation in networks of randomly deployed nodes: asymptotic and finite analysis, and thresholds

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 $31
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

3 Author(s)
Daneshgaran, F. ; ECE Dept., California State Univ. LA, Los Angeles, CA, USA ; Laddomada, M. ; Mondin, M.

Consider a two-dimensional domain S ? R2 containing two sets of nodes from two statistically independent uniform Poisson point processes with constant densities ?L and ?NL. The first point process identifies the distribution of a set of nodes having information about their positions, hereafter denoted as L-nodes (localised-nodes), whereas the other is used to model the spatial distribution of nodes that need to localise themselves, hereafter denoted as NL-nodes (not localised-nodes). For simplicity, both kinds of nodes are equipped with the same kind of transceiver, and communicate over a channel affected by shadow fading. As a first goal, the authors derive the probability that a randomly chosen NL-node over S gets localised as a function of a variety of parameters. Then, the authors derive the probability that the whole network of NL-nodes over S gets localised. As with many other random graph properties, the localisation probability is a monotone graph property showing thresholds. In this work, the authors derive both finite (when the number of nodes in the bounded domain is finite and does not grow) and asymptotic thresholds for the localisation probability. In connection with the asymptotic thresholds, the authors show the presence of asymptotic thresholds on the network localisation probability in two different scenarios. The first refers to dense networks, which arise when the domain S is bounded and the densities of the two kinds of nodes tend to grow unboundedly. The second kind of thresholds manifest themselves when the considered domain increases but the number of nodes grow in such a way that the L-node density remains constant throughout the investigated domain. In this scenario, what matters is the minimum value of the maximum transmission range averaged over the fading process, denoted as dmax, above which the network of NL-nodes almost surely gets asymptotically localised.

Published in:

Communications, IET  (Volume:4 ,  Issue: 8 )

Date of Publication:

May 21 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.