This thesis proposes an alternative cooperating strategy for cooperative communications through the use of parley algorithm in cooperative communications. When employing parley algorithm in cooperative communications, the relay nodes and the destination node need to disseminate and agree on a common decision throughout the cooperation network via a consensus flooding procedure. In this thesis, a heuristic approach for improving the performance of the parley algorithm is proposed. This heuristic approach is to design power allocation method during each iteration of consensus flooding protocol. Specifically, when distributing the power to each node within the cooperative network, this thesis adopts the criterion of maximum capacity of the broadcast channel used for consensus flooding procedures. The simulation result obtained from the investigation of this thesis shows that the proposed power allocation approach can improve the performance in terms of bit error rate as compared with the parley algorithm with uniform power allocation, and, hence, confirms the proposed idea is useful.