Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sameer Sundresh

dblp:86/6042 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 75% Physical-layer communications · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal detection › hypothesis testing
binary detection
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Internet of things and sensor networks › wireless sensor network › target tracking
cooperative tracking
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Internet of things and sensor networks › wireless sensor network › target tracking
sensor network tracking
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Internet of things and sensor networks › wireless sensor network
target tracking
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003
Performance modeling and evaluation
simulation
0.012003
Cooperative tracking with binary-detection sensor networks · SenSys 2003

Methods — techniques the papers use, named apart from their topics

statistical estimation · 0.1approximation techniques · 0.1
YearPublicationVenuePosition
2010 Resilient localization for sensor networks in outdoor environments
abstract
The process of determining the physical locations of nodes in a wireless sensor network is known as localization . Self-localization is critical for large-scale sensor networks, because manual or assisted localization is often impractical due to time requirements, economic constraints, or inherent limitations of the deployment scenarios. We propose scalable solutions for reliably localizing wireless sensor networks in environments conducive to several types of ranging errors. We follow a hybrid hardware-software approach for acoustic ranging or radio interferometry to acquire internode distance measurements, and a resilient self-localization algorithm to compute the node location estimates. The acoustic ranging method improves on previous work, extending the practical measurement range up to 35 m in grassy outdoor environments, achieving a distance-invariant median measurement error of about 1% (33 cm). The localization algorithm is based on least-squares scaling with soft constraints. Empirical evaluation using ranging results obtained from sensor network field experiments and simulations confirms that our approach is more resilient than multidimensional scaling (MDS) algorithms against large-magnitude ranging errors and sparse range measurements: conditions that are common in large-scale outdoor sensor network deployments.
YoungMin Kwon, Kirill Mechitov, Sameer Sundresh, WooYoung Kim, Gul A. Agha
ACM Trans. Sens. Networks3
2005 Resilient Localization for Sensor Networks in Outdoor Environments
abstract
The process of computing the physical locations of nodes in a wireless sensor network is known as localization. Self-localization is critical for large-scale sensor networks because manual or assisted localization is often impractical due to time requirements, economic constraints or inherent limitations of deployment scenarios. We have developed a service for reliably localizing wireless sensor networks in environments conducive to ranging errors by using a custom hardware-software solution for acoustic ranging and a family of self-localization algorithms. The ranging solution improves on previous work, extending the practical measurement range threefold (20-30m) while maintaining a distance-invariant median measurement error of about 1% of maximum range (33cm). The localization scheme is based on least squares scaling with soft constraints. Evaluation using ranging results obtained from sensor network field experiments shows that the localization scheme is resilient against large-magnitude ranging errors and sparse range measurements, both of which are common in large-scale outdoor sensor network deployments.
YoungMin Kwon, Kirill Mechitov, Sameer Sundresh, WooYoung Kim, Gul A. Agha
ICDCS3
2003 Cooperative tracking with binary-detection sensor networks
abstract
We present a novel method for tracking the movement of people or vehicles in open outdoor environments using sensor networks. Unlike other sensor network-based methods, which depend on determining distance to the target or the angle of arrival of the signal, our cooperative tracking approach requires only that a sensor be able to determine if an object is somewhere within the maximum detection range of the sensor. We propose cooperative tracking as a method for tracking moving objects and extrapolating their paths in the short term. By combining data from neighboring sensors, this approach enables tracking with a resolution higher than that of the individual sensors being used. We employ statistical estimation and approximation techniques to further increase the tracking precision, and to enable the system to exploit the tradeoff between accuracy and timeliness of the results. We analyze the behavior of the cooperative tracking algorithm through simulation, focusing on the effects of approximation techniques on the quality of estimates achieved. This work focuses on acoustic tracking, however the presented methodology is applicable to any sensing modality where the sensing range is relatively uniform.
Kirill Mechitov, Sameer Sundresh, YoungMin Kwon, Gul A. Agha
SenSys2