Fence Monitoring – Experimental Evaluation of a Use Case for Wireless Sensor Networks

Wittenburg, Georg; Terfloth, Kirsten; Villafuerte, Freddy López; Naumowicz, Tomasz; Ritter, Hartmut; Schiller, Jochen

doi:10.1007/978-3-540-69830-2_11

Cited by 41 publications

(36 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Common applications [16][17][18][19][20] operate as monitoring environment to detect and often track events. Typically, their occurrence results in long bursts of packets.…”

Section: Basic Conceptmentioning

confidence: 99%

Exploiting the Burstiness of Intermediate-Quality Wireless Links

Alizai

Wehrle

2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

We address the challenge of link estimation and routing over highly dynamic links, thats is, bursty links that rapidly shift between reliable and unreliable periods of transmissions. Based on significant empirical evidence of over 100,000 transmissions over each link in 802.15.4 and 802.11 testbeds, we propose two metrics, expected future transmissions (EFT) and MAC 3 , for runtime estimation of bursty wireless links. We introduce a bursty link estimator (BLE) that based on these two metrics, accurately estimates bursty links in the network rendering them available for data transmissions. Finally, we present bursty routing extensions (BRE): an adaptive routing strategy that uses BLE for forwarding packets over bursty links if they offer better routing progress than longterm stable links. Our evaluation, comprising experimental data from widely used IEEE 802.15.4-based testbeds, reveals an average of 19% and a maximum of 42% reduction in the number of transmissions when routing over long-range bursty links typically ignored by routing protocols. Additionally, we show that both BLE and BRE are not tied to any specific routing protocol and integrate seamlessly with existing routing protocols and link estimators.

show abstract

“…Common applications [16][17][18][19][20] operate as monitoring environment to detect and often track events. Typically, their occurrence results in long bursts of packets.…”

Section: Basic Conceptmentioning

confidence: 99%

Exploiting the Burstiness of Intermediate-Quality Wireless Links

Alizai

Wehrle

2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Facts are reminiscent of tuples as a way of structuring the application data, while the triggering of rules in response to new facts is similar to the execution of reactions in mobile tuple space middleware. Reactive applications such as fence monitoring [28] are easily implemented using FACTS, thanks to the condition-action rules programmers can specify. Hood.…”

Section: Representative Systemsmentioning

confidence: 99%

Tuple Space Middleware for Wireless Networks

Costa

Mottola

Murphy³

et al. 2009

Middleware for Network Eccentric and Mobile Applications

View full text Add to dashboard Cite

Wireless networks define a very challenging scenario for the application programmer. Indeed, the fluidity inherent in the wireless media cannot be entirely masked at the communication layer: issues such as disconnection and a continuously changing execution context most often must be dealt with according to the application logic. Appropriate abstractions, usually provided as part of a middleware, are therefore required to support and simplify the programming task.Coordination [1] is a programming paradigm whose goal is to separate the definition of the individual behavior of application components from the mechanics of their interaction. This goal is usually achieved by using either message passing or data sharing as a model for interaction. Publish-subscribe, described in Chapter ?? is an example of the former, where coordination occurs only through the exchange of messages (events) among publishers and subscribers. While message passing, in its pure form, is inherently stateless, data sharing enables coordination among components by manipulating the (distributed) state of the system. The tuple space abstraction, the subject of this chapter, is a typical example of a data sharing approach. The two models, publish-subscribe and tuple spaces, have sometimes crossed paths in the scientific literature: their expressive power has been compared on formal grounds in [2]; the limits of an implementation of a stateful tuple space on top of a stateless publish-subscribe layer has been investigated in [3]; some extensions of publish-subscribe with stateful features exist (e.g., the ability to query over past events as in [4]). A thorough discussion of the relationship between the two is outside the scope of this chapter, and hereafter we focus solely on tuple spaces.Linda [5] is generally credited with bringing the tuple space abstraction to the attention of the programming community. In Linda, components communicate through a shared tuple space, a globally accessible, persistent, content-addressable data structure containing elementary data structures called tuples. Each tuple is a sequence of typed fields, as in "foo", 9, 27.5 , containing the information being communicated. A tuple t is inserted in a tuple space through an out(t) oper-1

show abstract

“…We expand upon our previous work, specifically upon the lessons learnt during a proof-of-concept deployment [18] and upon our lab prototype [5]. In [18], we evaluated the general validity of the concept of a WSN-based wireless alarm system.…”

Section: Introductionmentioning

confidence: 99%

A system for distributed event detection in wireless sensor networks

Wittenburg

Dziengel

Wartenburger

et al. 2010

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks

Self Cite

View full text Add to dashboard Cite

Event detection is a major issue for applications of wireless sensor networks. In order to detect an event, a sensor network has to identify which application-specific incident has occurred based on the raw data gathered by individual sensor nodes. In this context, an event may be anything from a malfunction of monitored machinery to an intrusion into a restricted area. The goal is to provide high-accuracy event detection at minimal energy cost in order to maximize network lifetime.In this paper, we present a system for collaborative event detection directly on the sensor nodes. The system does not require a base station for centralized coordination or processing, and is fully trainable to recognize different classes of application-specific events. Communication overhead is reduced to a minimum by processing raw data directly on the sensor nodes and only reporting which events have been detected. The detection accuracy is evaluated using a 100-node sensor network deployed as a wireless alarm system on the fence of a real-world construction site.

show abstract

Fence Monitoring – Experimental Evaluation of a Use Case for Wireless Sensor Networks

Cited by 41 publications

References 6 publications

Exploiting the Burstiness of Intermediate-Quality Wireless Links

Exploiting the Burstiness of Intermediate-Quality Wireless Links

Tuple Space Middleware for Wireless Networks

A system for distributed event detection in wireless sensor networks

Contact Info

Product

Resources

About