Dynamic Cooperative Clustering Based Power Assignment: Network Capacity and Lifetime Efficient Topology Control in Cooperative Ad Hoc Networks

Abstract EN

Cooperative communication (CC) is used in topology control as it can reduce the transmission power and expand the transmission range.

However, all previous research on topology control under the CC model focused on maintaining network connectivity and minimizing the total energy consumption, which would lead to low network capacity, transmission interruption, or even network paralysis.

Meanwhile, without considering the balance of energy consumption in the network, it would reduce the network lifetime and greatly affect the network performance.

This paper tries to solve the above problems existing in the research on topology control under the CC model by proposing a power assignment (DCCPA) algorithm based on dynamic cooperative clustering in cooperative ad hoc networks.

The new algorithm clusters the network to maximize network capacity and makes the clusters communicate with each other by CC.

To reduce the number of redundant links between clusters, we design a static clustering method by using Kruskal algorithm.

To maximize the network lifetime, we also propose a cluster head rotating method which can reach a good tradeoff between residual energy and distance for the cluster head reselection.

Experimental results show that DCCPA can improve 80% network capacity with Cooperative Bridges algorithm; meanwhile, it can improve 20% network lifetime.