• Publications
  • Influence
Energy-efficient target coverage in wireless sensor networks
A critical aspect of applications with wireless sensor networks is network lifetime. Power-constrained wireless sensor networks are usable as long as they can communicate sensed data to a processingExpand
  • 1,043
  • 96
  • Open Access
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of least latencyExpand
  • 209
  • 29
  • Open Access
Distributed Data Aggregation Scheduling in Wireless Sensor Networks
Data aggregation is an essential operation in wireless sensor network applications. This paper focuses on the data aggregation scheduling problem. Based on maximal independent sets, a distributedExpand
  • 269
  • 28
  • Open Access
Sparse target counting and localization in sensor networks based on compressive sensing
In this paper, we propose a novel compressive sensing (CS) based approach for sparse target counting and positioning in wireless sensor networks. While this is not the first work on applying CS toExpand
  • 172
  • 16
  • Open Access
Minimum connected dominating sets and maximal independent sets in unit disk graphs
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set areExpand
  • 219
  • 14
  • Open Access
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone incurs less maintenance overhead. Unfortunately, computing a minimum size CDS isExpand
  • 177
  • 13
  • Open Access
On greedy construction of connected dominating sets in wireless networks
Summary Since no fixed infrastructure and no centralized management present in wireless networks, a connected dominating set (CDS) of the graph representing the network is widely used as a virtualExpand
  • 183
  • 10
  • Open Access
Wireless Sensor Networks and Applications
Contributing Authors Preface SECTION I. Network Design and Network Modelling Chapter 1. A Taxonomy-based Approach to Design Large-scale Sensor Networks (Aravind Iyer, Sunil S. Kulkarni, Vivek MhatreExpand
  • 206
  • 10
Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks
A k-Connected m-Dominating Set (kmCDS) working as a virtual backbone in a wireless sensor network is necessary for fault tolerance and routing flexibility. In order to construct a kmCDS with theExpand
  • 87
  • 7
  • Open Access
An Energy-Efficient Distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks
Data aggregation is an essential yet time-consuming task in wireless sensor networks (WSNs). This paper studies the well-known Minimum-Latency Aggregation Schedule (MLAS) problem and proposes anExpand
  • 74
  • 7
  • Open Access