Contour map matching for event detection in sensor networks

Xue, Wei; Luo, Qiong; Chen, Lei; Liu, Yunhao

doi:10.1145/1142473.1142491

Cited by 177 publications

(131 citation statements)

References 26 publications

(43 reference statements)

Supporting

Mentioning

126

Contrasting

Order By: Relevance

“…The definitions of events in previous literature fall into two categories: thresholdbased [5,4,3] and non-threshold-based [1,6], the methods of which are discussed in the following two paragraphs correspondingly.…”

Section: Related Workmentioning

confidence: 99%

“…One of the most important applications of WSN is the detection of events, most of which in the real-world have the property of gradualness -we call them gradual events, such as fire and gas leakage [1]. The range of a gradual event changes slowly and the effect of a gradual event attenuates gradually as the distance from the event increases.…”

Section: Introductionmentioning

confidence: 99%

“…Contour map matching is recently introduced to detect events with complex tempo-spatial patterns [1], which are quite different from the threshold-based events. However, it involves matching between globally constructed snapshots of a contour map and a user-specified event pattern, and thus consumes much energy.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Reliable and Fast Detection of Gradual Events in Wireless Sensor Networks

Peng

Gao

et al. 2008

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

Abstract. Event detection is among the most important applications of wireless sensor networks. Due to the fact that sensor readings do not always represent the true attribute values, previous literatures suggested threshold-based voting mechanism which involves collecting votes of all neighbors to disambiguate node failures from events, instead of reporting an event directly based on the judgement of single sensor node. Although such mechanism significantly reduces false positives, it inevitably introduces false negatives which lead to a detection delay under the scenario of gradual events. In this paper, we propose a new detection method -the bit-string match voting (BMV), which provides a response time close to that of the direct reporting method and a false positive rate even lower than that of the threshold-based voting method. Furthermore, BMV is able to avoid repeated and redundant reports of the same event, thus prolongs the life of the network. Extensive simulations are given to demonstrate and verify the advantages of BMV.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reliable and Fast Detection of Gradual Events in Wireless Sensor Networks

Peng

Gao

et al. 2008

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

show abstract

“…The recent advances in both the capabilities and miniaturization of wireless sensors have led to applications such as environmental monitoring [12] [13], event detection [15] and security surveillance [11]. These advances herald the development of systems that can gather and harness information in ways previously unexplored.…”

Section: Introductionmentioning

confidence: 99%

DREAM: On the reaction delay in large scale wireless networks with mobile sensors

Tang

Yuan

et al. 2010

2010 IEEE 18th International Workshop on Quality of Service (IWQoS)

View full text Add to dashboard Cite

Abstract-In this work, we present a monitor and rescue system utilizing hybrid networks which is a integration of stationary sensor networks and mobile sensor networks: stationary sensor networks comprised of large numbers of small, simple, and inexpensive wireless sensors, and the mobile sensor network contains a set of mobile sensors (robots). The static sensors in our network have "monitoring" ability, i.e., any activated static sensor can detect the event as long as its sensing range intersects the event region. And the mobile sensors have "moving" and "rescuing" ability, e.g., they can move toward the event region with limited speed and further perform certain rescuing/processing operations on the event. We can consider the event as a hazard, e.g., wild fire, and the mobile sensors as fireman robots. As soon as the fire is detected by the static sensors, the fireman robots are expected to move from its initial location to the hazard region within minimum latency. We define the reaction delay of the system as the delay from the occurrence of event till at least one mobile sensor reaches the event. In order to satisfy certain reaction delay requirement while minimizing the total cost, we propose a number of deployment strategies for the stationary sensor network and mobile sensor network respectively. We further design a random wake-up scheduling for the static sensors for the sake of energy efficiency. Finally, we propose a pure distributed motion strategy for mobile sensors without reliance on localization services such as GPS, focusing on simple algorithms for distributed decision making and information propagation. We demonstrate the efficacy of our system in simulation, providing empirical results.

show abstract

“…Obviously, delivering a huge amount of data back to the sink incurs heavy traffic, which rapidly depletes the energy of sensor nodes. To address this problem, several aggregation based protocols have been proposed [9,16,17]. These protocols aggregate data with similar readings at intermediate nodes, reducing the traffic overhead up to 40% [16].…”

Section: Introductionmentioning

confidence: 99%

Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks

Liu

2007

27th International Conference on Distributed Computing Systems (ICDCS '07)

Self Cite

View full text Add to dashboard Cite

Contour mapping is a crucial part of many wireless sensor network applications. Many efforts have been made to avoid collecting data from all the sensors in the network and producing maps at the sink, which is proven to be inefficient. The existing approaches (often aggregation based), however, suffer from heavy transmission traffic and incur large computational overheads on each sensor node. We propose Iso-Map, an energy-efficient protocol for contour mapping, which builds contour maps based solely on the reports collected from intelligently selected "isoline nodes" in wireless sensor networks. Iso-Map achieves high-quality contour mapping while significantly reducing the generated traffic from O(n) to O( n ), where n is the total number of sensor nodes in the field. The per-node computation overhead is also restrained as a constant. We conduct comprehensive trace-driven simulations to verify this protocol, and demonstrate that Iso-Map outperforms the previous approaches in the sense that it produces contour maps of high fidelity with significantly reduced energy cost.

show abstract

Contour map matching for event detection in sensor networks

Cited by 177 publications

References 26 publications

Reliable and Fast Detection of Gradual Events in Wireless Sensor Networks

Reliable and Fast Detection of Gradual Events in Wireless Sensor Networks

DREAM: On the reaction delay in large scale wireless networks with mobile sensors

Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks

Contact Info

Product

Resources

About