Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks

In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations. Thus, selecting a subset of nodes to perform measurements whose results will closely mirror the results of having all the nodes perform measurements is an important problem. This node selection problem, depending on the character of the function that integrates measurements and the type of measurements, can be mapped into a more general problem called the k-median problem. In the k-median problem we select a centroid set - a subset of nodes - that minimizes the function, that is the sum of the minimal costs between each node and a node in the centroid set. The set of selected nodes is called “centroids” or “leader nodes”, where the cluster of a leader node is defined by the set of nodes closest to the leader node. We develop an approximate kmedian distributed algorithm called Cluster-Swap, which doe...

• Type: Conference
• Year: 2009
• Where: IAT
• Authors: Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ramesh K. Sitaraman
• Keywords: IAT 2009, Intelligent Agent, Leader Node, Node, Nodes Perform Measurements