检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王开通[1] 熊庆宇[1] 王小刚[1] 齐洋洋[1] 于海存[1]
出 处:《计算机工程与应用》2015年第10期103-107,共5页Computer Engineering and Applications
基 金:国家工信部2011年物联网发展专项资金;国家科技支撑计划项目(No.2011BAJ03B13);重庆市科技计划攻关项目(No.CSTC2012GG-YYJS40008)
摘 要:针对LEACH算法随机选取簇头,未考虑节点剩余能量及单跳与sink节点通信造成能量损耗过快的问题。引入以剩余能量及邻居节点数作为权重因子的时间等候簇头竞争模式选取簇头,并提出LEACH与蚁群算法相结合建立簇间路由机制,采用局部信息素更新,综合簇头节点的剩余能量及节点距离,为簇首与sink节点通信建立多跳路由,达到降低簇头节点能耗过快的目的。仿真实验结果表明,改进算法在降低能耗、延长网络生命周期等方面较LEACH算法有较大提高。In view of the LEACH algorithm randomly selects a cluster head, without considering the residual energy of the nodes and single hop communication with sink nodes bring about the problem of excessive energy loss. A waiting time for cluster head competition mode, introduced the residual energy and the number of neighbor nodes asweighting factors to selecting cluster head is proposed. And it proposes to combine the LEACH and ant colony algorithm to establish the inter-cluster routing mechanism, updating the local pheromone and synthesizing the residual energy, distance nodes of cluster head and cluster head node for communication with sink based multi-hop routing, to reach the purpose of reducing the cluster head node energy consumption too fast. The simulation experimental results show that the improved algorithm in reducing energy consumption and prolonging the network life cycle has a great improvement compared with LEACH algorithm.
关 键 词:低功耗自适应集簇分层型协议(LEACH) 剩余能量 蚁群算法 簇间路由
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222