There has been a lot of work on localization for sensor networks. Most localization schemes assume an already deployed network. Very little research has been done for active senso...
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
Mathieu Couture, Michel Barbeau, Prosenjit Bose, E...
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...