3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.IT2013★ 1 cited
On Connectivity Thresholds in the Intersection of Random Key Graphs on Random Geometric Graphs
B. Santhana Krishnan, Ayalvadi Ganesh, D. Manjunath
In a random key graph (RKG) of nodes each node is randomly assigned a key ring of cryptographic keys from a pool of keys. Two nodes can communicate directly if they…
cs.IT2012★ 3 cited
On the Separability of Targets Using Binary Proximity Sensors
B. Santhana Krishnan, Animesh Kumar, D. Manjunath +1
We consider the problem where a network of sensors has to detect the presence of targets at any of possible locations in a finite region. All such locations may not be occupied…