—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
—The overlay-based network architecture has been recognized as an effective way to deal with the funneling effect in sensor networks, where sensors closer to the sink are usually...
—Wireless sensor networks consist of sensor nodes with limited computational and communication capabilities. In this paper, the whole network of sensor nodes is divided into clus...
The detection and isolation of compromised nodes in wireless sensor networks is a difficult task. However, failure to identify and isolate compromised nodes results in significan...