Search

Results: 7
A Distributed Algorithmic Framework for Coverage Problems in Wireless Sensor Networks
One of the key challenges in Wireless Sensor Networks (WSNs) is that of extending the lifetime of the network while meeting some coverage requirements. In this paper, we present a distributed algorithmic framework to enable...
Published by: Ursinus College
A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks
A Connected Dominating Set (CDS) of the graph representing a Wireless Sensor Network can be used as a virtual backbone for routing in the network. Since sensor nodes are constrained by limited on-board batteries, it is desirable...
Published by: Ursinus College
Randomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks
A Connected Dominating Set (CDS) of a graph representing a Wireless Sensor Network can be used as a virtual backbone for routing through the network. Since the sensors in the network are constrained by limited battery life, we...
Published by: Ursinus College
Fault-tolerant Coverage in Dense Wireless Sensor Networks
In this paper, we present methods to detect and recover from sensor failure in dense wireless sensor networks. In order to extend the lifetime of a sensor network while maintaining coverage, a minimal subset of the deployed...
Published by: Ursinus College