Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering pr...Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.展开更多
针对LEACH算法中簇首的随机选举导致节点能量分布不均衡的问题,本文提出了一种新的簇首自适应让位分簇算法(Cluster Head Adaptive Abdication,CHAA)。该算法在满足节省能量距离门限的前提下,重新定义了LEACH算法中阀值的计算公式,并定...针对LEACH算法中簇首的随机选举导致节点能量分布不均衡的问题,本文提出了一种新的簇首自适应让位分簇算法(Cluster Head Adaptive Abdication,CHAA)。该算法在满足节省能量距离门限的前提下,重新定义了LEACH算法中阀值的计算公式,并定义了一个能量门限来衡量簇首节点的健康度,使那些趋于衰亡的CH找到合适的继任者,并选取距离CH较近的节点担当CN,以保证数据传输的可靠性。仿真结果表明,CHAA算法能够实现能量的均衡,在有效延长网络生存时间的同时,相应的提高了网络数据吞吐量,具有一定的应用价值。展开更多
基金Projects(61173169,61103203)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0798)supported by the Program for New Century Excellent Talents in University of ChinaProject supported by the Post-doctoral Program and the Freedom Explore Program of Central South University,China
文摘Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.
文摘针对LEACH算法中簇首的随机选举导致节点能量分布不均衡的问题,本文提出了一种新的簇首自适应让位分簇算法(Cluster Head Adaptive Abdication,CHAA)。该算法在满足节省能量距离门限的前提下,重新定义了LEACH算法中阀值的计算公式,并定义了一个能量门限来衡量簇首节点的健康度,使那些趋于衰亡的CH找到合适的继任者,并选取距离CH较近的节点担当CN,以保证数据传输的可靠性。仿真结果表明,CHAA算法能够实现能量的均衡,在有效延长网络生存时间的同时,相应的提高了网络数据吞吐量,具有一定的应用价值。
