首页 | 本学科首页   官方微博 | 高级检索  
     

基于动态联盟和蚁群算法的任务协同框架
引用本文:张荣雨,李士宁,李志刚,杨丽平.基于动态联盟和蚁群算法的任务协同框架[J].计算机工程,2010,36(14):105-107.
作者姓名:张荣雨  李士宁  李志刚  杨丽平
作者单位:西北工业大学计算机学院,西安,710129
基金项目:国家科技支撑计划基金,陕西省自然科学基金,陕西省科技攻关计划基金 
摘    要:单个节点能力受限,无线传感器节点需要协同完成任务。针对该问题,将协同任务分为感知子任务和计算子任务,提出基于动态联盟和蚁群算法的任务协同框架。根据应用需求选择感知节点形成初始联盟分配感知任务,当感知节点与节点总数的比值小于32%时,网络监测性能最优,引入自适应蚁群算法构建数据汇集路由树,利用同一任务数据的强相关性优化数据传输路径,从而降低通信能耗。

关 键 词:无线传感器网络  任务协同  动态联盟  蚁群算法

Task Collaboration Framework Based on Dynamic Coalition and Ant Colony Algorithm
ZHANG Rong-yu,LI Shi-ning,LI Zhi-gang,YANG Li-ping.Task Collaboration Framework Based on Dynamic Coalition and Ant Colony Algorithm[J].Computer Engineering,2010,36(14):105-107.
Authors:ZHANG Rong-yu  LI Shi-ning  LI Zhi-gang  YANG Li-ping
Affiliation:(College of Computer Science, Northwestern Polytechnical University, Xi’an 710129)
Abstract:Single node capability is limited, node in Wireless Sensor Network(WSN) need collaborate with neighbors to complete a task. Aiming at this problem, this paper divides the collaborate task into sensor subtask and computing subtask, and proposes a task collaboration framework based on dynamic coalition and Ant Colony Algorithm(ACO). It chooses the perception node according to the application need, those nodes form an initial dynamic coalition, and assign perception task on the coalition member. When the ratio of perception nodes to the whole nodes is below 32%, the network monitoring performance is best. It adopts self-adaptive ACO to construct data aggregation routing tree, optimizes data transfer path based on strong data relation of a same task, and reduces communication energy consumption.
Keywords:Wireless Sensor Network(WSN)  task collaboration  dynamic coalition  Ant Colony Algorithm(ACO)
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号