| 摘要 |
<p>The application relates to an algorithm that organizes access points of a wireless communication network into groups or clusters, whereby a cluster comprises a set of wireless nodes including at least one cluster head and at least one cluster member. Known algorithms rely on knowledge of network nodes and conditions over multiple clusters at a single control point. Because heterogeneous networks are unplanned, such knowledge may not be readily available. There is therefore a need to enable distributed clustering of wireless nodes without any need to centralize data collection over multiple clusters. This problem is solved in the present application as follows: Initial cluster heads CHs are determined. Through neighbor discovery, every node joins a cluster, thereby becoming a cluster member. Each member requests its CH to compute its own marginal cost which is a value of a cost function for the cluster including the requesting member minus the value of the cost function for the cluster omitting the requesting member. Once knowing its own marginal cost, the member contacts any available neighbor cluster and requests computation of the marginal cost in case it would join this cluster. This marginal cost, also referred to as neighbor marginal cost is compared to the own marginal cost and if it is lower, the member quits its current cluster and joins the neighbor cluster. These steps are performed by any member and as long as the arrangement converges to a stable solution.</p> |
