N
Nabhendra Bisnik
Researcher at Rensselaer Polytechnic Institute
Publications - 19
Citations - 939
Nabhendra Bisnik is an academic researcher from Rensselaer Polytechnic Institute. The author has contributed to research in topics: Wireless ad hoc network & Random access. The author has an hindex of 15, co-authored 19 publications receiving 911 citations. Previous affiliations of Nabhendra Bisnik include Intel.
Papers
More filters
Proceedings ArticleDOI
Queuing network models for delay analysis of multihop wireless ad hoc networks
TL;DR: An analytical model takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC to characterize the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes.
Proceedings ArticleDOI
Stochastic event capture using mobile sensors subject to a quality metric
TL;DR: This paper considers the following event capture problem: the events of interest arrive at certain points in the sensor field and disappear according to known arrival and departure time distributions, and presents heuristic algorithms for the aforementioned motion planning problems and bound their performance with respect to the optimal.
Journal ArticleDOI
Queuing network models for delay analysis of multihop wireless ad hoc networks
TL;DR: An analytical model takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC to derive the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes.
Journal ArticleDOI
A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience
TL;DR: The problem of designing motion strategies for a team of mobile agents, required to fulfill request for on-site service in a given planar region, is studied as the stochastic and dynamic version of the well-known vehicle routing problem with time windows.
Proceedings ArticleDOI
Modeling and analysis of random walk search algorithms in P2P networks
TL;DR: This paper proposes an equation based adaptive search mechanism that uses estimate of popularity of a resource in order to choose the parameters of random walk such that a targeted performance level is achieved by the search.