Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Efficient tracing of failed nodes in sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Distributed deviation detection in sensor networks
ACM SIGMOD Record
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Hi-index | 0.00 |
This paper targets the detection of the reach of events in sensor networks with faulty sensors. Typical applications include the detection of the transportation front line of a contamination and estimation of the region in forest fire. We propose an algorithm for detection the boundary of such events. Our algorithm is purely localized and thus is suitable for large scale of sensor networks. The computational overhead is low since the detection algorithm is based on a simple clustering technique which only simple numerical operations are involved. Simulation results show that our algorithm can clearly detect the event boundary when as many as 20% sensors become faulty. Therefore, our algorithm achieves a great improvement over the previous algorithms. In addition, our proposed detection algorithm can accept any kind of scalar values as inputs. It can be applied as long as the "events" can be modeled by numerical numbers.