This section elaborates the cooperation procedure which is actually implemented in real time. It is assumed that each node in the network has a distinct identification number. The steps involved in realizing this cooperation are as follows:
STEP: 1 Neighbour Maintenance Step: Each node(S) in the cluster will broadcast at a regular interval COR(Cooperative Request).This will be broadcasted on a control channel,and will be received by all the neighbouring nodes (NN) which are within the transmitting range. Once COR is transmitted there are two probable conditions. One is that the node which has received COR will cooperate and the other condition is that the node is loaded with traffic and energy constrains also exist, thus this node will not cooperate. If it is ready to cooperate with the requesting node it will send AOC(agree on cooperation),along with it will send its own its own user ID. In this way each requesting nodes will get cooperating nodes. The requesting nodes will store the ID of cooperating nodes, and in this way will maintain neighbour set.
STEP2: Information Exchange Step: When AOC is received by the requesting node, it plans to transmit the information. Now the cooperating node, which is destination may be free or may be heavily occupied with its own assignments. In order to check whether it is ready to receive information the requesting node will send TR (transmission request).If it is ready to receive information it will send necessary information like CSI etc.
STEP 3 :Local Distribution setup: After all these steps node selection and data/power allocation is done with one of the proposed algorithms. Finally data is broadcasted to each of the selected scheduled nodes, and thus cooperation is achieved & established.