Wireless integrated network sensors
Communications of the ACM
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data
IEEE Transactions on Visualization and Computer Graphics
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
IEEE/ACM Transactions on Networking (TON)
Beyond average: toward sophisticated sensing with queries
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Contour maps: monitoring and diagnosis in sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling spatially correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
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.