Graph Matching-Based Distributed Clustering and Backbone Formation Algorithms for Sensor Networks
نویسندگان
چکیده
منابع مشابه
Graph Matching-Based Distributed Clustering and Backbone Formation Algorithms for Sensor Networks
Clustering is a widely used technique to manage the essential operations such as routing and data aggregation in wireless sensor networks (WSNs). We propose two new graph-theoretic distributed clustering algorithms for WSNs that use a weighted matching method for selecting strong links. To the best of our knowledge, our algorithms are the first attempts that use graph matching for clustering. T...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملPerformance Analysis of Distributed Clustering Algorithms for Sensor Networks
There has been extensive research on clustering algorithms for sensor applications. Those algorithms allow tradeoffs between energy consumption, convergence time, and adaptability to changing network topologies. However, many of these algorithms may not function well in deployed UGS networks because previous analyses of those algorithms used simplified radio and channel models. For example, the...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملFast Clustering and Minimum Weight Matching Algorithms for Very Large Mobile Backbone Wireless Networks
Mobile Backbone Wireless Networks (MBWN) [10] are wireless networks in which the base stations are mobile. Our strategy is the following: mobile nodes are dynamically grouped into clusters of bounded radius. In the very large wireless networks we deal with we deal with, several hundreds of clusters may be generated. Clustering makes use of a two dimensional Euclidean version of the Antipole Tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2010
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxq004