针对一种新的协作通信方式O-DSTC(Opportunistic Distributed Space-Time Coding)，该文在保证误码率的前提下，基于效益函数和后悔函数，提出了均衡剩余能量的协作节点选择算法。在只能得到信道的统计特性并考虑距离信息的情况下，由于O-DSTC的平均误码率无法计算，所以该文提出并简化了协作中继的平均误码率逼近公式。根据该逼近公式选择满足误码率要求的协作节点集合，集合中的节点通过后悔函数分布式地设置延迟时间，并采用竞争方式成为协作节点。仿真结果验证了该文提出的误码率逼近公式的有效性和可靠性。实验结果也表明，协作节点选择算法可以保证误码率，提高最小剩余能量，同时减少竞争接入时间。
Opportunistic Distributed Space-Time Coding (O-DSTC) is a new type of cooperative communication. In the guarantee of the Symbol Error Rate (SER), the residual energy balanced cooperative partner selection algorithm of O-DSTC is presented based on the benefit function and regret function. When considering distance and only the statistics characteristics of channel information is available, the average SER of O-DSTC can not be computed, therefore the SER approaching formula is presented. The approaching formula selects the appropriate nodes as the cooperative partner candidates, and each candidate node sets the delay time distributedly. Meanwhile, each candidate node contends to become the cooperative partner. Simulation results demonstrate the reliability and effectiveness of the approaching formula. The simulation also shows that the cooperative partner selection algorithm can assure SER, enhance the minimum residual energy and reduce the contention access time.