A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
Duty-cycling in wireless sensor networks (WSNs) has both beneficial effects on network lifetime and negative effects on application performance due to the inability of a sensor to ...
Alessandro Giusti, Amy L. Murphy, Gian Pietro Picc...
— Key management is a major challenge in the design and deployment of secure wireless sensor networks. A common assumption in most distributed key management schemes is that all ...
— Sensor networks with a large amount of sensor nodes usually have high redundancy in sensing coverage. The network lifetime can be further extended by proper scheduling and putt...