In the realistic communication environment, due to the noise, packet conflict, signal attenuation and other factors, information exchange is generally unreliable among nodes in the wireless sensor networks. Broadcast is a widely-used operation, and building an energy-efficient broadcast algorithm has important theoretical and application value in improving the performance of wireless sensor networks. This paper studies the minimum energy broadcast problem of wireless sensor networks with the unreliable communications. Firstly, it analyzes the minimum energy consumption of communication model between adjacent nodes and presents the optimal transmission radius that can guarantee the neighbor node to receive packets with probability no less than P*. Then, it discusses the relationship between multi-hop relay strategy and location information of nodes. It finally presents a PSO-based broadcast algorithm with minimum spanning tree, which can guarantee that all nodes in the network will receive packets with probability no less than P* and minimize the total energy consumption. The simulation results show that the presented broadcast algorithm can not only guarantee all nodes to receive packets with probability no less than P*, but also consume less energy and have better performance compared with the improved BIP algorithm.%在实际的通信环境中，由于噪声、报文冲突、信号衰减等因素的影响，无线传感器网络节点间信息交换往往是不可靠的。广播是无线传感器网络中广泛使用的操作，如何在不可靠通信环境下实现能量高效的广播算法，对提高整个无线传感器网络的性能具有重要的理论和应用价值。研究了不可靠通信环境下的无线传感器网络最小能耗广播问题，首先，分析了相邻节点之间最小能耗通信模型，并给出了保证节点接收概率不低于 P*的最优发送半径；然后，讨论了多跳转发策略与节点位置信息之间的关系。在此基础上，提出了一种基于 PSO 的最小生成树广播算法，通过优化各节点的发送半径，在保证所有节点都能以不低于 P*的概率接收到广播数据包的前提下，实现广播操作的总能耗最小。实验结果表明：所提出的广播算法不仅可使每一个节点的接收概率不小于 P*，而且广播总能耗比改进后的BIP算法要小，具有较好的性能。
展开▼
