Delay-Bounded and Energy-Efficient Composite Event Monitoring in Heterogeneous Wireless Sensor Networks

Li, Yingshu; Ai, Chunyu; Vu, Chinh; Pan, Yi; Beyah, Raheem

doi:10.1109/tpds.2009.129

Cited by 33 publications

(15 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As much of the WSN research centers around increasing network lifetime [79], ENERGY* [80] based on ENERGY (Energy Efficient Rate Governed Yardstick) provides an approximate but effective solution to minimize th nsumption in WSNs. Thus, based on the information about the complete network topology and the Euclidean distance as an estimate to the hop count between two nodes, ENERGY* provides the optimal placement of the data transformation function which impacts on the energy consumption on data transmission.…”

Section: Approximation Based Techniquesmentioning

confidence: 99%

Distributed Database Management Techniques for Wireless Sensor Networks

Diallo

Rodrigues

Sène

et al. 2015

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-In sensor networks, the large amount of data nsor reWireless Se composed of a large nu activities are sometimes not negligible in energy consumption generated by sensors greatly influences the lifetime of the network. In order to manage this amount of sensed data in an energy-efficient way, new methods of storage and data query are needed. In this way, the distributed database approach for sensor networks is proved as one of the most energy-efficient data storage and query techniques. This paper surveys the state of the art of the techniques used to manage data and queries in wireless sensor networks based on the distributed paradigm. A classification of these techniques is also proposed. The goal of this work is not only to present how data and query management techniques have advanced nowadays, but also show their benefits and drawbacks, and to identify open issues providing guidelines for further contributions in this type of distributed architectures.

show abstract

Section: Approximation Based Techniquesmentioning

confidence: 99%

Distributed Database Management Techniques for Wireless Sensor Networks

Diallo

Rodrigues

Sène

et al. 2015

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Yang et al proposed a shortest path routing for mobile ad hoc and sensor networks by considering topology dynamics, i.e., the network topology changes due to energy conservation and node mobility (Yang et al, 2010). Li et al proposed a solution to delaybounded and emergency-efficient emergency event monitoring problem by an event detection model and a warning delivery model (Li et al, 2010). Li and Fen proposed a dynamic adaptive cooperative routing for emergency data in wireless sensor networks (Li & Fen, 2009).…”

Section: Related Work On Application-specific Communicationsmentioning

confidence: 99%

Monitoring Technologies in Mission-Critical Environment by Using Wireless Sensor Networks

Zeng¹,

Xiang²,

Li³

2012

Wireless Sensor Networks - Technology and Applications

View full text Add to dashboard Cite

“…While this work gave an indication of suitable neighborhood size from energy efficiency point of view, it did not deal with introducing redundancy to cope up with faults and noise, rendering this work inapplicable in k-coverage context. The idea of k-watched event detection was formalized in [6] from energy efficiency and bounded delay point of view, though binary decision fusion technique similar to [3], [4] is used. They extended the detection scheme for composite event and considered detection delay.…”

Section: Related Workmentioning

confidence: 99%

QoS Support in Event Detection in WSN through Optimal k-Coverage

Alam

Karmakar

Murshed

et al. 2011

Procedia Computer Science

View full text Add to dashboard Cite

Wireless sensor networks promise to guarantee accurate, fault tolerant and timely detection of events in large scale sensor fields. To achieve this the notion of k-coverage is widely employed in WSNs where significant redundancy is introduced in deployment as an event is expected to be sensed by at least k sensors in the neighborhood. As sensor density increases significantly with k, it is imperative to find the optimal k for the underlying event detection system. In this work, we consider the detection probability, fault tolerance and latency as the Quality of Service (QoS) metrics of an event detection system employing k-coverage and present a probabilistic model to guarantee given QoS support with the minimum degree of coverage taking into account the noise related measurement error, communication interference and sensor fault probability. This work eventually resolves the problem of over or under deployment of sensors, increases scalability and provides a well defined mechanism to tune the degree of coverage according to performance needs.

show abstract

Delay-Bounded and Energy-Efficient Composite Event Monitoring in Heterogeneous Wireless Sensor Networks

Cited by 33 publications

References 36 publications

Distributed Database Management Techniques for Wireless Sensor Networks

Distributed Database Management Techniques for Wireless Sensor Networks

Monitoring Technologies in Mission-Critical Environment by Using Wireless Sensor Networks

QoS Support in Event Detection in WSN through Optimal k-Coverage

Contact Info

Product

Resources

About