We address the problem of discovering frequent items in unstructured P2P networks which is relevant for several distributed services such as cache management, data replication, query refinement, topol...
Traditional data aggregation methods use data originating from all sensor nodes of the wireless sensor network (WSN). Unfortunately, the use of all available sensors is not a resource efficient approa...
To date, a large collection of distributed algorithms for convex multi-agent optimization have been reported, yet only few of them converge to an optimal solution at guaranteed rates when the topologi...
This work introduces FAIR, a novel framework for <u>F</u>uzzy-based Aggregation providing In-network Resilience for Wireless Sensor Networks (WSN). FAIR addresses the possibility of malicious aggregat...
This paper presents a new cluster-based power preservation scheme. Our clustering strategy for power saving is defined based on the “similarity of data” coming out from the sensors. The proposed clust...
This paper develops Subset Equalizing (SE), a distributed algorithm for solving a symmetric positive definite system of linear equations over a network of agents with arbitrary asynchronous interactio...
This paper considers the problem of solving a symmetric positive definite system of linear equations over a network of agents with arbitrary asynchronous interactions and membership dynamics. The latt...
This paper addresses the problem of averaging numbers across a wireless network from an important, but largely neglected, viewpoint: bandwidth/energy efficiency. We show that existing distributed aver...
This dissertation is devoted to the development of efficient, robust, and scalable distributed algorithms, which enable agents in a large-scale, multi-hop network to cooperatively compute a global qua...
The wireless sensor network is a resource-constrained self-organizing system that consists of a large number of tiny sensor nodes. Due to the low-cost and low-power nature of sensor nodes, sensor node...
The significant advances of hardware manufacturing technology and the development of efficient software algorithms make technically and economically feasible a network composed of numerous, small, low...
The scenario of distributed data aggregation in wireless sensor networks is considered, where sensors can obtain and estimate the information of the whole sensing field through local data exchange and...
The research reported in this paper addresses the problem of energy conservation in wireless sensor networks (WSNs). It proposes concepts and techniques to extract environmental information that are u...
The problem of distributed Kalman filtering (DKF) for sensor networks is one of the most fundamental distributed estimation problems for scalable sensor fusion. This paper addresses the DKF problem by...
Sensor nodes are often used to collect data from locations inaccessible or hazardous for humans. As they are not under normal supervision, these nodes are particularly susceptible to physical damage o...
Sensor nodes are often deployed in large numbers to monitor extended sensor fields. In such scenarios data aggregation plays a crucial role on summarizing data forwarded to base stations in sensor net...
Sensor networks have received considerable attention in recent years, and are often employed in the applications where data are difficult or expensive to collect. In these applications, in addition to...
Sensor networks have received considerable attention in recent years, and are often employed in the applications where data are difficult or expensive to collect. In these applications, in addition to...
Sensor networks have received considerable attention in recent years, and are employed in many applications. In these applications, statistical aggregates such as Sum over the readings of a group of s...
Sensor networks have proven to be useful in many application domains. Having the sensor nodes aggregate their results inside the network before sending the results to a base station has been shown to ...