NetDiagnoser: Troubleshooting network unreachabilities using end-to-end probes and routing data

A Dhamdhere, R Teixeira, C Dovrolis… - Proceedings of the 2007 …, 2007 - dl.acm.org
The distributed nature of the Internet makes it difficult for a single service provider to
troubleshoot the disruptions experienced by its customers. We propose NetDiagnoser, a …

Graph-constrained group testing

M Cheraghchi, A Karbasi, S Mohajer… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
Nonadaptive group testing involves grouping arbitrary subsets of n items into different pools.
Each pool is then tested and defective items are identified. A fundamental question involves …

Compressive sensing over graphs

W Xu, E Mallada, A Tang - 2011 Proceedings IEEE INFOCOM, 2011 - ieeexplore.ieee.org
In this paper, motivated by network inference and tomography applications, we study the
problem of compressive sensing for sparse signal vectors over graphs. In particular, we are …

Predicting link quality using supervised learning in wireless sensor networks

Y Wang, M Martonosi, LS Peh - ACM SIGMOBILE Mobile Computing …, 2007 - dl.acm.org
Routing protocols in sensor networks maintain information on neighbor states and
potentially many other factors in order to make informed decisions. Challenges arise both in …

A unique “nonnegative” solution to an underdetermined system: From vectors to matrices

M Wang, W Xu, A Tang - IEEE Transactions on Signal …, 2010 - ieeexplore.ieee.org
This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness
of a positive semidefinite matrix solution to underdetermined linear systems. A vector …

Inter-session variability modelling and joint factor analysis for face authentication

R Wallace, M McLaren, C McCool… - 2011 International Joint …, 2011 - ieeexplore.ieee.org
This paper applies inter-session variability modelling and joint factor analysis to face
authentication using Gaussian mixture models. These techniques, originally developed for …

Which distributed averaging algorithm should I choose for my sensor network?

P Denantes, F Bénézit, P Thiran… - IEEE INFOCOM 2008 …, 2008 - ieeexplore.ieee.org
Average consensus and gossip algorithms have recently received significant attention,
mainly because they constitute simple and robust algorithms for distributed information …

How was your journey? Uncovering routing dynamics in deployed sensor networks with multi-hop network tomography

M Keller, J Beutel, L Thiele - Proceedings of the 10th ACM Conference …, 2012 - dl.acm.org
In the context of wireless data collection, a common application class in wireless sensor
networks, this paper presents a novel, non-intrusive algorithm for the precise reconstruction …

A loss inference algorithm for wireless sensor networks to improve data reliability of digital ecosystems

Y Yang, Y Xu, X Li, C Chen - IEEE Transactions on Industrial …, 2011 - ieeexplore.ieee.org
Digital ecosystems (DEs) are based on a large amount of distributed data, and these data
are gathered from physical devices, particularly from wireless sensor networks (WSNs). Due …

Routing topology inference for wireless sensor networks

Y Liang, R Liu - ACM SIGCOMM Computer Communication Review, 2013 - dl.acm.org
We consider an important problem of wireless sensor network (WSN) routing topology
inference/tomography from indirect measurements observed at the data sink. Previous …