Performance Characterization of Random Proximity Sensor Networks
Abstract
In this paper, we characterize the localization performance and connectivity of sensors networks consisting of binary proximity sensors using a random sensor management strategy. The sensors are deployed uniformly at random over an area, and to limit the energy dissipation, each sensor node switches between an active and idle state according to random mechanisms regulated by a birth-and-death stochastic process. We first develop an upper bound for the minimum transmitting range which guarantees connectivity of the active nodes in the network with a desired probability. Then, we derive an analytical formula for predicting the mean-squared localization error of the active nodes when assuming a centroid localization scheme. Simulations are used to verify the theoretical claims for various localization schemes that operate only over connected active nodes.
Additional Information
© 2006 IEEE. Issue Date: Oct. 29 2006-Nov. 1 2006. Date of Current Version: 07 May 2007.Attached Files
Published - Capponi2006p91502008_42Nd_Asilomar_Conference_On_Signals_Systems_And_Computers_Vols_1-4.pdf
Files
Name | Size | Download all |
---|---|---|
md5:b4155735202e2ca2d62acfe3435f673b
|
199.6 kB | Preview Download |
Additional details
- Eprint ID
- 22093
- Resolver ID
- CaltechAUTHORS:20110209-110337547
- Created
-
2011-03-10Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Series Name
- Conference Record of the Asilomar Conference on Signals, Systems and Computers
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 10285213