检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:何永强[1,2] 张旭阳 HE Yongqiang;ZHANG Xuyang(College of Computer,Henan University of Engineering,Zhengzhou 451191,China;Henan IoT Engineering Research Center of Smart Building,Zhengzhou 450007,China)
机构地区:[1]河南工程学院计算机学院,河南郑州451191 [2]河南省智慧建筑物联网工程研究中心,河南郑州450007
出 处:《河南工程学院学报(自然科学版)》2018年第3期59-63,共5页Journal of Henan University of Engineering:Natural Science Edition
基 金:河南省高等学校重点科研项目(15A520054)
摘 要:为了减少智能社区传感网数据传输造成的能耗不均匀并延长网络寿命,提出了簇头选举优化的传感网路由自适应优化算法.在该算法中,首先提出了一种适应用于智能社区传感网结构的三维分簇方法,该三维分簇方法采用基于最小化总传输损耗的簇头选举机制来优化传感网的能量.其次,针对分簇之后的簇间数据传播问题,提出了一种自适应蚁群传播方法,借助蚁群算法的最优寻路思想,寻找能量损耗和误包率更低的能量均衡路由.最后,仿真结果表明该算法在减少能量消耗和延迟、提高传输效率及节点存活时间方面均具有较好的性能.To reduce the uneven energy consumption for the data transmission and extend network life of intelligent community sensot network, an adaptive routing optimized algorithm for intelligent community sensor networks with cluster head election is proposed. In this zlgoithm, a three-dimensional clustering method adapted to the structure of intelligent community sensor network is proposed. The three-dimensional clustering method uses the cluster head election mechanism based on minimizing the total transmission loss to optimize the energy of the intelligent community sensor network. Secondly, a adaptive ant colony propagation method is proposed to solve the problem of inter-cluster data propagation after clustering. With the best path finding algorithm of ant colony algorithm, energy balance routing with lower energy loss and lower packet error rate is proposed. Finally, the simulation resuhs show that the algorithm has better performance in reducing energy consumption and delay, improving transmission efficiency and node survival time.
关 键 词:智能社区 传感网 三维分簇路由 自适应蚁群 网络寿命
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30