B
Badri Nath
Researcher at Rutgers University
Publications - 100
Citations - 11885
Badri Nath is an academic researcher from Rutgers University. The author has contributed to research in topics: Wireless sensor network & Wireless network. The author has an hindex of 37, co-authored 100 publications receiving 11612 citations. Previous affiliations of Badri Nath include Alcatel-Lucent.
Papers
More filters
Proceedings ArticleDOI
Ad hoc positioning system (APS) using AOA
Dragos Niculescu,Badri Nath +1 more
TL;DR: This paper proposes a method for all nodes to determine their orientation and position in an ad-hoc network where only a fraction of the nodes have positioning capabilities, under the assumption that each node has the AOA capability.
Proceedings ArticleDOI
Ad hoc positioning system (APS)
Dragos Niculescu,Badri Nath +1 more
TL;DR: This work is proposing APS - a distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate location for all nodes in a network where only a limited fraction of nodes have self location capability.
Journal ArticleDOI
DV Based Positioning in Ad Hoc Networks
Dragos Niculescu,Badri Nath +1 more
TL;DR: This work is proposing APS – a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.
Proceedings ArticleDOI
Robust statistical methods for securing wireless localization in sensor networks
TL;DR: This paper develops robust statistical methods to make localization attack-tolerant, and proposes an adaptive least squares and least median squares position estimator that has the computational advantages of least squares in the absence of attacks and is capable of switching to a robust mode when being attacked.
Proceedings ArticleDOI
ReInForM: reliable information forwarding using multiple paths in sensor networks
TL;DR: This paper describes a protocol called RelnForM to deliver packets at desired reliability at a proportionate communication cost, and shows that for uniform unit disk graphs, the number of edge-disjoint paths between nodes is equal to the average node degree with very high probability.