In this paper, we present a comprehensive analysis of the performance of a wireless sensor network based target tracking system using the Particle Filter In particular, we evaluate the effect of various network design...
详细信息
ISBN:
(纸本)9781424425747
In this paper, we present a comprehensive analysis of the performance of a wireless sensor network based target tracking system using the Particle Filter In particular, we evaluate the effect of various network design parameters such as the number of nodes, number of generated particles, and sampling interval on the tracking accuracy and computation time of the tracking system. Based on our analysis, we also present recommendations on suitable values for the relevant network design parameters, which provide a reasonable tradeoff between accuracy and computational expense for this problem. In addition, we also analyse the theoretical Cramer-Rao Bound as the benchmark for the best possible tracking performance. We demonstrate that the results from our simulations closely match the theoretical bounds. We also present initial results from experiments comprising of a 25 node wireless sensor network. Initial experimental results are promising and show that the PF based estimation is suitable for detection and tracking using inexpensive wireless sensor network devices.
Interactive wireless sensor networks (IWSNs) manifest diverse application architectures, hardware capabilities, and user interactions that challenge existing centralized [1], or VM-based [2] query system designs. To s...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
Interactive wireless sensor networks (IWSNs) manifest diverse application architectures, hardware capabilities, and user interactions that challenge existing centralized [1], or VM-based [2] query system designs. To support in-network processing of streaming sensor data in such heterogeneous environments, we created SenQ a multi-layer embedded query system. SenQ enables user-driven and peer-to-peer in-network query issue by wearable interfaces and other resource-constrained devices. Complex virtual sensors and user-created streams can be dynamically discovered and shared, and SenQ is extensible to new sensors and processing algorithms. We evaluated SenQ's efficiency and performance in a testbed for assisted-living, and show that on-demand buffering, query caching, efficient restart and other optimizations reduce network overhead and minimize data latency.
In this paper, we address the problem of maximizing sensor networks lifetime under coverage constraint. A distributed Coverage Control Strategy based on Precise Coverage Degree (DSP) is proposed for both homogeneous a...
详细信息
ISBN:
(纸本)9780769533483
In this paper, we address the problem of maximizing sensor networks lifetime under coverage constraint. A distributed Coverage Control Strategy based on Precise Coverage Degree (DSP) is proposed for both homogeneous and heterogeneous sensor networks randomly deployed. We extend the coverage degree concept by defining Pure Coverage and Joint Coverage. DSP adopts the probabilistic sense model, which is a more practical model compared withthe binary sensing model. In DSP, each node calculates the coverage degree locally, so it can provide differentiated service of coverage degree, which can be adjusted dynamically according to the precision requirement by the application. Our protocol takes the complicated boundary effect into account. Experiments results show that with k-coverage guarantee, DSP can reduce the number of the active nodes and prolong the networks lifetime effectively. In addition, DSP can balance the energy consumption, and the protocol needs limited communication.
Time synchronization is a critical component in many wireless sensor network applications. Although several synchronization protocols have recently been developed, they tend to break down when implemented on networks ...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
Time synchronization is a critical component in many wireless sensor network applications. Although several synchronization protocols have recently been developed, they tend to break down when implemented on networks of heterogeneous devices consisting of different hardware components and operating systems, and communicate over different network media. In this paper, we present a methodology for time synchronization in heterogeneous sensor networks (HSNs). this includes synchronization between mote and PC networks, a communication pathway that is often used in sensor networks, but has received little attention with respect to time synchronization. In addition, we evaluate clock skew compensation methods including linear regression, exponential averaging, and phase-locked loops. Our HSN synchronization methodology has been implemented as a network service and tested on an experimental testbed. We show that a 6-hop heterogeneous sensor network can be synchronized with an accuracy on the order of microseconds.
the use of mobile sensors is motivated by the necessity to monitor critical areas where sensor deployment cannot be performed manually. In these working scenarios, sensors must adapt their initial position to reach a ...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
the use of mobile sensors is motivated by the necessity to monitor critical areas where sensor deployment cannot be performed manually. In these working scenarios, sensors must adapt their initial position to reach a final deployment which meets some given performance objectives such as coverage extension and uniformity, total moving distance, number of message exchanges and convergence rate. We propose an original algorithm for autonomous deployment of mobile sensors called SNAP & SPREAD. Decisions regarding the behavior of each sensor are based on locally available information and do not require any prior knowledge of the operating conditions nor any manual tuning of key parameters. We conduct extensive simulations to evaluate the performance of our algorithm. this experimental study shows that, unlike previous solutions, our algorithm reaches a final stable deployment, uniformly covering even irregular target areas. Simulations also give insights on the choice of some algorithm variants that may be used under some different operative settings.
this paper addresses the optimal rate allocation (ORA) problem as follows: given a target bit rate constraint, determine an optimal rate allocation among sensors such that the overall distortion of the reproduction da...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
this paper addresses the optimal rate allocation (ORA) problem as follows: given a target bit rate constraint, determine an optimal rate allocation among sensors such that the overall distortion of the reproduction data is minimized. Optimal rate allocation algorithms are proposed to determine the coding bit rate of each sensor in single hop and multi-hop sensor networks, given a target rate constraint. Extensive simulations are conducted by using temperature readings of the real world dataset. the results show that at low bit rates the optimal rate allocation improves about 2.745 dB on the uniform rate allocation in terms of SNR, and improves nearly 7.602 in terms of MSE. Spatial-temporal range queries are also evaluated to confirm that our approach is often sufficient to provide approximate statistics for range queries.
In this paper, we propose a new control method to cover the "holes" in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are disabled from the collaboration d...
详细信息
Energy efficiency of the MAC protocol is a key design factor for wireless sensor networks (WSNs). Due to the importance of the problem, a number of energy efficient MAC protocols have been developed for WSNs. Preamble...
详细信息
ISBN:
(纸本)9781424425747
Energy efficiency of the MAC protocol is a key design factor for wireless sensor networks (WSNs). Due to the importance of the problem, a number of energy efficient MAC protocols have been developed for WSNs. Preamble-sampling based MAC protocols (e.g., B-MAC and X-MAC) have overheads due to their preambles, and are inefficient at large wakeup intervals. SCP-MAC, a very energy efficient scheduling MAC protocol, minimizes the preamble by combining preamble sampling and scheduling techniques;however, it does not prevent energy loss due to overhearing;in addition, due to its synchronization procedure, it results in increased contention and delay. In this paper, we present an energy efficient MAC protocol for WSNs that avoids overhearing and reduces contention and delay by asynchronously scheduling the wakeup time of neighboring nodes. To validate our design and analysis, we implement the proposed scheme on the MicaZ platform. Experimental results show that AS-MAC considerably reduces energy consumption, packet loss and delay when compared with SCP-MAC.
Congestion in a Wireless sensor Network (WSN) can lead to buffer overflow, resource waste and delay or loss of critical information from the sensors. In this paper, we propose the Priority-based Coverage-aware Congest...
详细信息
In wireless sensor networks, the data aggregation is an essential paradigm for routing, through which the multiple data from different sensors can be aggregated into a single data at intermedial nodes enroute, in orde...
详细信息
ISBN:
(纸本)9780769532875
In wireless sensor networks, the data aggregation is an essential paradigm for routing, through which the multiple data from different sensors can be aggregated into a single data at intermedial nodes enroute, in order to eliminate data redundancy and achieve the goal of saving energy. Some existed medium access protocols and algorithms can effectively prolong the lifetime of the sensor network by determining when each sensor should transmit its data, and when it should sleep. In this paper, we focus on applying multiple spanning trees to organize the data aggregation, which is different from these existed single spanning tree methods. At first, the problem of constructing multiple spanning trees is transformed into a linear programming problem of the data flow network. Based on the solved optimal rate between the two adjacent sensors, the two constructing algorithms of the spanning tree are presented. Experimental results indicate that the method of multiple spanning trees can be of benefit to energy saving for wireless sensor networks, and the corresponding appropriate constructing algorithm can prolong the lifetime of the sensor network.
暂无评论