Scattered data selection for dense sensor networks

Author

Doherty, Lance ; Pister, Kristofer S J

Author_Institution

Berkeley Sensor & Actuator Center, CA, USA

fYear

2004

fDate

26-27 April 2004

Firstpage

369

Lastpage

378

Abstract

An evaluation methodology is presented for the performance of reporting node self-selection in wireless sensor networks. Five cost metrics are proposed along with several methods for self-selection that involve little or no collaboration with other nodes. These costs are used to evaluate how efficiently the various algorithms allow for node self-selection as simulated on different field complexities. Analysis of different methods over 100 test fields sampled by 2000 nodes indicates that there is no single method that is superior in all respects. Trade-offs in latency and overall energy consumption are revealed to be highly dependent on the selection method and the field complexity.

Keywords

communication complexity; data handling; wireless sensor networks; algorithm efficiency; cost metrics; data recovery; dense sensor network; energy measures; evaluation methodology; field complexity; latency; node collaboration; node self-selection; overall energy consumption; scattered data selection; test field; trade-off; wireless sensor networks; Actuators; Collaboration; Costs; Delay; Image reconstruction; Monitoring; Permission; Scattering; Testing; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Processing in Sensor Networks, 2004. IPSN 2004. Third International Symposium on

Print_ISBN

1-58113-846-6

Type

conf

DOI

10.1109/IPSN.2004.1307358

Filename

1307358