论文部分内容阅读
广播是无线传感器网络中一种基本而重要的操作,其能耗大小对整个网络性能有着重要影响.在节点传输半径固定的情况下,考虑到无线通信的多向传输等特性,无线传感器网络广播操作中参与转发的节点数越少,则广播操作总能耗也就越小.如何寻找最少转发节点的广播树问题等同于求解图论中的最小连通支配集问题,这是一个NP难问题.本文提出了一种有效的构造最小连通支配集的启发式算法(EMCDS)来构造广播树,在此基础上提出了一种无线传感器网络中的最小能耗广播算法(MEBA).实验结果表明,EMCDS算法能够找到较小的连通支配集,而MEBA算法可依据节点剩余能量来动态选择转发节点,通过实现节点能量的均衡分布来有效延长网络的生命周期.
Broadcasting is a basic and important operation in wireless sensor network, and its energy consumption size has an important influence on the whole network performance.When the transmission radius of a node is fixed, taking into account the multi-directional transmission of wireless communications and other characteristics, wireless sensor network broadcast The less the total number of nodes involved in forwarding in the operation, the less the total energy consumption of the broadcast operation.How to find the broadcast tree with the fewest forwarding nodes is equivalent to solving the minimal connected dominating set in graph theory, which is an NP-hard problem. In this paper, we propose an efficient heuristic algorithm (EMCDS) to construct a broadcast tree, and propose a minimum energy broadcast algorithm (MEBA) in wireless sensor networks. Experimental results show that, The EMCDS algorithm can find smaller connected dominance sets, and the MEBA algorithm can dynamically select the forwarding nodes according to the remaining energy of the nodes, and effectively prolong the life cycle of the network by realizing a balanced distribution of energy of the nodes.