loading...
Adaptive Beacon Placement
Mesa, AZ April 16-April 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDSC.2001.91897921st IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nirupama Bulusu, University of California at Los Angeles and USC/Information Sciences Institute
Deborah Estrin, University of California at Los Angeles and USC/Information Sciences Institute
John Heidemann, USC/Information Sciences Institute
Abstract: Beacon placement strongly affects the quality of spatial localization, a critical service for context-aware applications in wireless sensor networks; yet this aspect of localization has received little attention. Fixed beacon placement approaches such as uniform and very dense placement are not always viable and will be inadequate in very noisy environments in which sensor networks may be expected to operate (with high terrain and propagation uncertainties). In this paper, we motivate the need for empirically adaptive beacon placement and outline a general approach based on exploration and instrumentation of the terrain conditions by a mobile human or robot agent. We design, evaluate and analyze three novel adaptive beacon placement algorithms using this approach for localization based on RF-proximity. In our evaluation, we find that beacon density rather than noise level has a more significant impact on beacon placement algorithms. Our beacon placement algorithms are applicable to a low (beacon) density regime of operation. Noise makes moderate density regimes more improvable.
Citation:
Nirupama Bulusu, Deborah Estrin, John Heidemann, "Adaptive Beacon Placement," icdcs, pp.0489, 21st IEEE International Conference on Distributed Computing Systems (ICDCS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.