A heterogeneity based clustering heuristic for mobile ad hoc networks

An ad hoc network is an autonomous system of heterogeneous, mobile nodes that communicate with each other over wireless links. Routing protocols for these networks are inherently based on broadcasting control information and are therefore very bandwidth consuming. In order to limit the amount of routing information that has to be stored and maintained by the individual nodes, the technique of clustering is used. The network is partitioned into non-overlapping sub networks, referred to as clusters, and one cluster node, the clusterhead, will take a leading role in the dissemination of control information. In this paper we approach the problem of finding an optimal partition that explicitly takes into account the heterogeneity of the network, as an integer linear programming (ILP) problem. In a second phase we have developed a new heuristic that approximates our ILP solution that is used in our clustering algorithm. It is shown that this heuristic tends to be more stable than existing clustering techniques that are solely based on ID number and/or connectivity and that do not take into account the heterogeneity of the network.