W-PAC: an efficient weighted partitioning around cluster head mechanism for ad hoc network
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
| Hi-index | 0.00 |
Cooperative communications is widely used to share the resources of different nodes, and achieve spatial diversity gain in multi-user network. The node which is chosen as cooperative node (cluster-head), consumes more transmit power for other nodes than itself. Because of this, traditional algorithm results in uneven power distribution. In this paper, we propose a new algorithm called weighted clustering algorithm based on power distribution (PDWCA) to solve the problem. Compared with traditional weighted clustering algorithm (WCA), the proposed algorithm adds a new weight factor decided by the power reward, which evaluates the power contributed to or service by others so as to guarantee uniform power distribution. In this paper, we also give a new definition of the measure of mobility which is more clear than the traditional one. Simulations results show that the performances are similar to WCA in terms of cluster-head number and load balancing factor (LBF); meanwhile, it can reach much better improvement on average transmit power.