12 citations · 12 across the 2 of their papers we have counts for
Showing cs.NIShow all
2 papers · 1 filter
cs.NI2026
Computing All-Pairs Shortest Communication Time Paths for Periodically Varying Satellite Networks
Koushik Sinha, Dibakar Saha, Sai Puppala +1
We address the problem of designing an efficient algorithm for computing the all-pairs shortest-time paths in time-varying networks, specifically targeting the dynamic topological…
cs.NI2014★ 12 cited
Distributed Area Coverage by Connected Set Cover Partitioning in Wireless Sensor Networks
Dibakar Saha, Nabanita Das
Assuming a random uniform distribution of n sensor nodes over a virtual grid, this paper addresses the problem of finding the maximum number of connected set covers each ensuring 1…