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.
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...
详细信息
We describe LiveNet, a set of tools and analysis methods for reconstructing the complex behavior of a deployed sensor network. LiveNet is based on the use of multiple passive packet sniffers co-located with the networ...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
We describe LiveNet, a set of tools and analysis methods for reconstructing the complex behavior of a deployed sensor network. LiveNet is based on the use of multiple passive packet sniffers co-located with the network, which collect packet traces that are merged to form a global picture of the network's operation. The merged trace can be used to reconstruct critical aspects of the network's operation that cannot be observed from a single vantage point or with simple application-level instrumentation. We address several challenges: merging multiple sniffer traces, determining sniffer coverage, and inference of missing information for routing path reconstruction. We perform a detailed validation of LiveNet's accuracy and coverage using a 184-node sensor network testbed, and present results from a real-world deployment involving physiological monitoring of patients during a disaster drill. Our results show that LiveNet is able to accurately reconstruct network topology, determine bandwidth usage and routing paths, identify hot-spot nodes, and disambiguate sources of packet loss observed at the application level.
We propose CaliBree, a self-calibration system for mobile wireless sensor networks. sensors calibration is a fundamental problem in a sensor network. If sensor devices are not properly calibrated, their sensor reading...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
We propose CaliBree, a self-calibration system for mobile wireless sensor networks. sensors calibration is a fundamental problem in a sensor network. If sensor devices are not properly calibrated, their sensor readings are likely of little use to the application. distributed calibration is challenging in a mobile sensor network, where sensor devices are carried by people or vehicles, mainly for three reasons: i) the sensing contact time, i.e., the amount of time nodes are within the sensing range of each other, can be very limited, requiring a quick and efficient calibration technique;ii) for scalability and ease of use, the calibration algorithm should not require manual intervention;iii) the computational burden must be low since some sensor platforms have limited capabilities. In this paper we propose CaliBree, a distributed, scalable, and lightweight calibration protocol that applies a discrete average consensus algorithm technique to calibrate sensor nodes. CaliBree is shown to be effective through experimental evaluation using embedded wireless sensor devices, achieving high calibration accuracy.
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.
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 (WSNs), sensors gather information about the physical world and base station makes appropriate decision upon the environment. This technology enables users to effectively sense and monitor ...
详细信息
As wide applications of wireless sensor networks, privacy concerns have emerged as the main obstacle to success. When wireless sensor networks are used to monitor sensitive objects, the privacy about monitored object&...
详细信息
This paper presents a protocol called SAKE (Software Attestation for Key Establishment), for establishing a shared key between any two neighboring nodes of a sensor network. SAKE guarantees the secrecy and authenticit...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
This paper presents a protocol called SAKE (Software Attestation for Key Establishment), for establishing a shared key between any two neighboring nodes of a sensor network. SAKE guarantees the secrecy and authenticity of the key that is established, without requiring any prior authentic or secret information in either node. In other words, the attacker can read and modify the entire memory contents of both nodes before SAKE executes. Further, to the best of our knowledge, SAKE is the only protocol that can perform key re-establishment after sensor nodes are compromised, because the presence of the attacker's code in the memory of either protocol participant does not compromise the security of SAKE. Also, the attacker can perform any active or passive attack using an arbitrary number of malicious, colluding nodes. SAKE does not require any hardware modification to the sensor nodes, human mediation, or secure side channels. However, we do assume the setting of a computationally-limited attacker that does not introduce its own computationally powerful nodes into the sensor network. SAKE is based on ICE (Indisputable Code Execution), a primitive we introduce in previous work to dynamically establish a trusted execution environment on a remote, untrusted sensor node.
Unlike traditional multihopforwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more attention. It is known that the use o...
详细信息
ISBN:
(数字)9783540691709
ISBN:
(纸本)9783540691693
Unlike traditional multihopforwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more attention. It is known that the use of mobility significantly reduces the energy consumption at each sensor, elongating the functional lifetime of the network, in exchange for increased data delivery latency. However, in previous work, mobility and communication capabilities are often underutilized, resulting in suboptimal solutions incurring unnecessarily large latency. In this paper, we focus on the problem of finding an optimal path of a mobile device, which we call "data mule," to achieve the smallest data delivery latency in the case of minimum energy consumption at each sensor, i.e., each sensor only sends its data directly to the data mule. We formally define the path selection problem and show the problem is NP-hard. Then we present an approximation algorithm and analyze its approximation factor. Numerical experiments demonstrate that our approximation algorithm successfully finds the paths that result in 10%-50% shorter latency compared to previously proposed methods, suggesting that controlled mobility can be exploited much more effectively.
暂无评论