Issue Downloads
Optimizing physical-layer parameters for wireless sensor networks
As wireless sensor networks utilize battery-operated nodes, energy efficiency is of paramount importance at all levels of system design. In order to save energy in the transfer of data from the sensor nodes to one or more sinks, the data may be routed ...
A security framework for privacy-preserving data aggregation in wireless sensor networks
A formal treatment to the security of Concealed Data Aggregation (CDA) and the more general Private Data Aggregation (PDA) is given. While there exist a handful of constructions, rigorous security models and analyses for CDA or PDA are still lacking. ...
Efficient incremental code update for sensor networks
Wireless reprogramming of sensor nodes is an essential requirement for long-lived networks since software functionality needs to be changed over time. During reprogramming, the number of radio transmissions should be minimized, since reprogramming time ...
Robust sensor placements at informative and communication-efficient locations
When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this article, we present ...
Energy-efficient congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on ...
Optimizing sensor movement planning for energy efficiency
Conserving the energy for motion is an important yet not-well-addressed problem in mobile sensor networks. In this article, we study the problem of optimizing sensor movement for energy efficiency. We adopt a complete energy model to characterize the ...
A model framework for greedy routing in a sensor network with a stochastic power scheme
A stochastic model is formulated and analyzed to study the advancements of messages under greedy routing in a sensor network with a power-saving scheme. The aim of this model is give a better understanding of stochastic dependencies arising in the ...
Critical sensor density for partial connectivity in large area wireless sensor networks
In this article, we study the critical sensor density for partial connectivity of a large area sensor network. We assume that sensor deployment follows the Poisson distribution. For a given partial connectivity requirement ρ, 0.5 < ρ < 1, we prove that ...
Sensor network localization using sensor perturbation
Sensor network localization is an instance of the NP-Hard graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if it is uniquely determined by the input distances.
In this article, we show ...