A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...
—In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based for ...
Time synchronization is a crucial component of a large class of sensor network applications, traditionally implemented as a standalone middleware service that provides a virtual gl...
— We consider a network of spatially distributed sensors deployed to track the intensity of a diffusing source whose location is fixed, but unknown. The sensors make discrete ti...