Traditional sensing models assume one or a few powerful sensors and centralized computation. Today, technological trends enable the creation of inexpensive, small, intelligent devices for sensing and actuation. If many small sensors can work together as a sensor network, they provide several advantages over traditional centralized sensing. By placing the sensor close to the object being sensed,...

Aufgrund technologischer Fortschritte in der Prozessortechnik, Speichertechnologie, sowie Funkund Energietechnik ist es möglich geworden Netze aus kleinen und günstigen Sensorknoten herzustellen, welche dann zur verteilten Aufnahme von Phänomenen eingesetzt werden können. In dieser Seminararbeit wird das Kommunikationsparadigma „Directed Diffusion“ vorgestellt. Dazu wird zunächst ein Überblick ...

In this paper, we present a mechanism for securing group communications in Wireless Sensor Networks (WSN). First, we derive an extension of Logical Key Hierarchy (LKH). Then we merge the extension with directed diffusion. The resulting protocol, LKHW, combines the advantages of both LKH and directed diffusion: robustness in routing, and security from the tried and tested concepts of secure mult...

This paper presents a novel model of interaction patterns between individual agents in dynamic social networks. A simulation was developed implementing the directed diffusion protocol to propagate beliefs through a social network. Belief propagation through a social network is modeled as packet propagation through a wireless sensor network using the directed diffusion protocol. This data propag...

ss as: M atics J (2 Abstract This paper proposes an implementation for the directed diffusion paradigm aids in studying this paradigm’s operations and evaluates its behavior according to this implementation. The directed diffusion is evaluated with respect to the loss percentage, lifetime, end-to-end delay, and throughput. From these evaluations some suggestions and modifications are proposed t...

In spectral graph theory, the Cheeger’s inequality gives upper and lower bounds of edge expansion in normal graphs in terms of the second eigenvalue of the graph’s Laplacian operator. Recently this inequality has been extended to undirected hypergraphs and directed normal graphs via a non-linear operator associated with a diffusion process in the underlying graph. In this work, we develop a uni...