K
Krishnendu Chakrabarty
Researcher at Duke University
Publications - 1056
Citations - 29699
Krishnendu Chakrabarty is an academic researcher from Duke University. The author has contributed to research in topics: Biochip & Automatic test pattern generation. The author has an hindex of 79, co-authored 996 publications receiving 27583 citations. Previous affiliations of Krishnendu Chakrabarty include Huawei & Wake Forest University.
Papers
More filters
Proceedings ArticleDOI
Sensor deployment and target localization based on virtual forces
Yi Zou,Krishnendu Chakrabarty +1 more
TL;DR: A virtual force algorithm (VFA) is proposed as a sensor deployment strategy to enhance the coverage after an initial random placement of sensors to improve the coverage of cluster-based distributed sensor networks.
Journal ArticleDOI
Grid coverage for surveillance and target location in distributed sensor networks
TL;DR: It is shown that grid-based sensor placement for single targets provides asymptotically complete location of multiple targets in the grid, and coding-theoretic bounds on the number of sensors are provided and methods for determining their placement in the sensor field are presented.
Proceedings ArticleDOI
Sensor placement for effective coverage and surveillance in distributed sensor networks
TL;DR: Two algorithms are presented that address coverage optimization under the constraints of imprecise detections and terrain properties and are targeted at average coverage as well as at maximizing the coverage of the most vulnerable grid points.
Journal ArticleDOI
Sensor deployment and target localization in distributed sensor networks
Yi Zou,Krishnendu Chakrabarty +1 more
TL;DR: A virtual force algorithm (VFA) is proposed as a sensor deployment strategy to enhance the coverage after an initial random placement of sensors to improve the coverage of cluster-based distributed sensor networks.
Journal ArticleDOI
On a new class of codes for identifying vertices in graphs
TL;DR: A new class of codes for the optimal covering of vertices in an undirected graph G such that any vertex in G can be uniquely identified by examining the vertices that cover it is investigated.