Distributed optimization in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Resilient aggregation in sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Diversify sensor nodes to improve resilience against node compromise
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
Power scheduling for wireless sensor and actuator networks
Proceedings of the 6th international conference on Information processing in sensor networks
Information fusion for wireless sensor networks: Methods, models, and classifications
ACM Computing Surveys (CSUR)
Fully distributed EM for very large datasets
Proceedings of the 25th international conference on Machine learning
Collaborative clustering with the use of Fuzzy C-Means and its quantification
Fuzzy Sets and Systems
Estimation of the Hyperexponential Density with Applications in Sensor Networks
International Journal of Distributed Sensor Networks
Data fusion and topology control in wireless sensor networks
WSEAS Transactions on Signal Processing
Agentification of Markov model-based segmentation: Application to magnetic resonance brain scans
Artificial Intelligence in Medicine
Weakly connected dominating set-based secure clustering and operation in distributed sensor networks
International Journal of Communication Networks and Distributed Systems
Incremental distributed identification of Markov random field models in wireless sensor networks
IEEE Transactions on Signal Processing
A collaborative training algorithm for distributed learning
IEEE Transactions on Information Theory
Collaborative architectures of fuzzy modeling
WCCI'08 Proceedings of the 2008 IEEE world conference on Computational intelligence: research frontiers
Secure clustering in DSN with key pre-distribution and WCDS
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
A key-predistribution-based weakly connected dominating set for secure clustering in DSN
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Gossip-Based greedy gaussian mixture learning
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Evaluating local contributions to global performance in wireless sensor and actuator networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Journal of Network and Computer Applications
Decentralized estimation over noisy channels in cluster-based wireless sensor networks
International Journal of Communication Systems
Massively parallel expectation maximization using graphics processing units
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed anomaly detection for industrial wireless sensor networks based on fuzzy data modelling
Journal of Parallel and Distributed Computing
Efficient algorithm for serial data fusion in wireless sensor networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Distributed data association in smart camera networks using belief propagation
ACM Transactions on Sensor Networks (TOSN)
Location Feature Integration for Clustering-Based Speech Separation in Distributed Microphone Arrays
IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP)
Hi-index | 35.75 |
The paper considers the problem of density estimation and clustering in distributed sensor networks. It is assumed that each node in the network senses an environment that can be described as a mixture of some elementary conditions. The measurements are thus statistically modeled with a mixture of Gaussians, where each Gaussian component corresponds to one of the elementary conditions. The paper presents a distributed expectation-maximization (EM) algorithm for estimating the Gaussian components, which are common to the environment and sensor network as a whole, as well as the mixing probabilities that may vary from node to node. The algorithm produces an estimate (in terms of a Gaussian mixture approximation) of the density of the sensor data without requiring the data to be transmitted to and processed at a central location. Alternatively, the algorithm can be viewed as a distributed processing strategy for clustering the sensor data into components corresponding to predominant environmental features sensed by the network. The convergence of the distributed EM algorithm is investigated, and simulations demonstrate the potential of this approach to sensor network data analysis.