The increased complexity of today's distributed, composite, Web-based systems presents difficult and unique systems management problems. The way these systems interact, and the fact that they often span organizati...
详细信息
ISBN:
(纸本)9781424436842
The increased complexity of today's distributed, composite, Web-based systems presents difficult and unique systems management problems. The way these systems interact, and the fact that they often span organizational boundaries, render them difficult to monitor and manage. Autonomic computing has emerged as a promising approach to the management of complex systems. A key to realizing fully autonomic systems is the development of monitoring tools that provide the controllers with adequate and meaningful performance information, especially the identification of symptoms that indicate potential underlying problems. We present an event- driven sensor approach to a monitoring system whereby a hierarchy of dedicated, simple sensors monitors and correlates low level events into a meaningful representation of the system performance that can be used for problem determination. Our approach utilizes the OASIS Web Services distributed Management (WSDM) standards.
In data-centric wireless sensor networks, the malicious nodes may selectively drop some crucial data packets, which seriously destroy the network's data collection and decrease the availability of sensor services....
详细信息
Wireless sensor networks promise an unprecedented opportunity to monitor physical environments via inexpensive wireless embedded devices. Given the sheer amount of sensed data, efficient classification of them becomes...
详细信息
Many applications of wireless sensor network are applied in three dimensional environments. The primary problem to be solved in these applications is three dimensional nodes positioning. In this paper, a new range-fre...
详细信息
The most obvious benefit from networked sensors in distributed control system is the reduction of cables, which means savings in cost and easiness in deployment and maintenance. Some current available sensor standards...
详细信息
ISBN:
(纸本)9781424436927
The most obvious benefit from networked sensors in distributed control system is the reduction of cables, which means savings in cost and easiness in deployment and maintenance. Some current available sensor standards and protocols are complicate and cost for most industrial applications and low performance for real-time control systems. In this paper we propose a light-weight CAN-like sensor network protocol for real-time distributed control system with some unique features. Based on a novel event/action model, the protocol provides a resilient and scalable application layer that is independent with sensor developers and sensor users. The data link layer supports both event and master/slave communication mode, which greatly improves the real-time performance. An FPGA-based reference implementation of protocol stack is also validated on a Cyclone II development boards.
Bulk transport underlies data exfiltration and code update facilities in WSNs, but existing approaches are not designed for highly lossy and variable-quality links. We observe that Mayinounkov's rateless online co...
详细信息
ISBN:
(纸本)9783642020841
Bulk transport underlies data exfiltration and code update facilities in WSNs, but existing approaches are not designed for highly lossy and variable-quality links. We observe that Mayinounkov's rateless online codes are asymptotically more efficient, but can perform poorly in the WSN operating region. We analyze and optimize coding parameters and present the design and evaluation of RTOC a protocol for bulk trausport that recovered over 95% of application data despite up to 84% packet loss in a MicaZ network.
Middleware for wireless sensor network (WSN) has been proposed as an effective solution to ease the application development by providing high-level abstractions. One of the important tasks of middleware in WSN is to s...
详细信息
ISBN:
(纸本)9781424433032
Middleware for wireless sensor network (WSN) has been proposed as an effective solution to ease the application development by providing high-level abstractions. One of the important tasks of middleware in WSN is to support event service. As an important paradigm for event service, publish / subscribe (pub/sub) can support the asynchronous data exchange for applications and has received a lot of attention in traditional distributedsystems. In WSNs, however, the design of pub/sub, especially on composite events, has not been adequately addressed. In this paper, we present the design and implementation of PSWare, a pub / sub middleware for WSN which can support both primitive and composite events. Our contribution mainly includes three parts. First, we propose an event definition language (EDL), which is specifically tailored to WSNs and can achieve high expressiveness and availability in the definition of primitive and composite events. The application programmers of PSWare can use the proposed EDL to define events in a simple manner. We implemented a compiler to compile the program written in EDL into byte codes. Second, we develop a runtime environment on sensor nodes, which provide a platform to run the compiled byte codes. Finally, we propose a composite event detection protocol to detect the events in an energy-efficient fashion.
For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a novel scheme of dynamic clustering routing algorithm (DCRA) based on support degree is proposed The new approach lets sensors decide...
详细信息
ISBN:
(纸本)9781424447541
For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a novel scheme of dynamic clustering routing algorithm (DCRA) based on support degree is proposed The new approach lets sensors decide whether-become a clusterhead (CH) according to the support degree coming from neighbors Unlike traditional distributed clustering algorithms, DCRA, combines,,energy, load balancing and topology information together by defining an objective function based on support degree Furthermore, the clusterhead aggregates data and transmits the result to base station (sink node) along multiple paths The now algorithm is completely distributed and location-unaware Simulation results show that DCRA has great potential in efficiently distributing energy consumption and extending the network lifetime
Radio Frequency (RF) tomography refers to the process of inferring information about an environment by capturing and analyzing RF signals transmitted between nodes in a wireless sensor network. In the case where few a...
详细信息
ISBN:
(纸本)9783642020841
Radio Frequency (RF) tomography refers to the process of inferring information about an environment by capturing and analyzing RF signals transmitted between nodes in a wireless sensor network. In the case where few available measurements are available, the inference techniques applied in previous work may not be feasible. Under certain assumptions, compressed sensing techniques can accurately infer environment characteristics even from a small set of measurements. This paper introduces Compressed RF Tomography, an approach that combines RF tomography and compressed sensing for monitoring in a wireless sensor network. We also present decentralized techniques which allow monitoring and data analysis to be performed cooperatively by the nodes. The simplicity of our approach makes it attractive for sensor networks. Experiments with simulated and real data demonstrate the capabilities of the approach in both centralized and decentralized scenarios.
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E) where V and E denote the sensors dep...
详细信息
ISBN:
(纸本)9783642020841
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E) where V and E denote the sensors deployed in the plane and the links among them, respectively. A link between two sensors exists if their Euclidean distance is at most 1. We present a distributed algorithm that computes a family S of S-1, S-2, ..., S-m non-trivial connected dominating sets (CDS) with the goal to maximize alpha = m/k where k=max(u is an element of V)vertical bar{i : u is an element of S-i}vertical bar. In other words, we wish to find as many CDSs as possible while minimizing the number of frequencies of each node in these sets. Since CDSs play all important role for maximizing network lifetime when they are used as backbones for broadcasting messages, maximizing a reduces the possibility of repeatedly using the same subset of nodes as backbones. We provide an upper bound on the value of a, via a nice relationship between all minimum vertex-cuts and CDSs in G and present a distributed (localized) algorithm for the a maximization problem. For a subclass of unit disk graphs, we show that our algorithm achieves a constant approxmation factor of the optimal solution.
暂无评论