An Energy-efficient Clustering Algorithm for Wireless Ad Hoc Networks
Tung-Tsun Lee · 2002
In this paper, we try to cluster nodes in ad hoc networks considering of energy consumption, load -balanced and well-backboned factors. The energy spent in communication between clusterhead and its members are considered to be the major factor in c1usterhead election. The member of a clusterhead has to report its position with respect to its c1usterhead in a timely fashion , such that the clusterhead can get the fresh information. And, the routing and message delivering can be done within cluster effectively. Furthermore, the load -balanced factor is considered in clustering process. A mobile node is equipped with limited power in general; therefore, it is desirable if most of nodes have the chance to be clusterhead, and most of clusters contain average number of members. Moreover, the well-backboned architecture formed by cluster is beneficial if clusterheads are within the inner of the graph derived from nodes and edges between communicable nodes. The reason is that routing process is achieved by the cooperation of c1usterheads and gateway nodes; the routing activity is less effective if cluster is consisted of a single nod e located at boundary of graph. A simple algorithm considered upon these factors is proposed. The objectives can be achieved from the observation of simulations.