检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:范斌[1,2] 李金宝[1,2] 郭龙江[1,2] 柳絮[1,2]
机构地区:[1]黑龙江大学计算机科学技术学院,哈尔滨150080 [2]黑龙江省数据库与并行计算重点实验室,哈尔滨150080
出 处:《电信科学》2012年第2期36-45,共10页Telecommunications Science
基 金:国家自然科学基金资助项目(No.61070193);国家自然科学基金青年科学基金资助项目(No.60803015);黑龙江省科技攻关资助项目(No.GC09A109);中国博士后基金资助项目(No.20080430902);黑龙江省教育厅重点资助项目(No.1154Z1001);黑龙江省博士后基金资助项目(No.LRB08-021);哈尔滨市青年科技创新人才研究专项基金资助项目(No.2009RFQXG080)
摘 要:MMDC首先为每个节点构造数据收集的能量消耗最优路径;然后考虑网内通信冲突、数据收集时延等因素,构建MPST,使数据收集能耗小、冲突少、时延低;最后在MPST的基础上运用CALS完成数据收集,CALS借助较少的Radio和信道,消除链路间的通信冲突与干扰,实现多条链路无冲突并行收发数据,从而优化数据收集效率。实验结果表明,MMDC可有效降低数据转发时延,缩短数据收集时间,减少网络能量消耗,提高网络吞吐量。Aiming at the data collection problem in dual-radio sensor networks,a multi-power multi-channel data collection scheduling algorithm named MMDC is proposed.MMDC first constructs the optimal path for data collection with each node's energy consumption,then considers the conflict within the network communications,data collection delays and other factors,to construct a multi-level power spanning tree called MPST,to reduce energy consumption,conflict,and delay of data collection.Finally,based on MPST,we use joint channel allocation and link scheduling algorithm for data collection,called CALS.CALS employs fewer radios and channels to eliminate the conflict and interference between the communication links,to achieve conflict-free parallel sending and receiving data in multiple links,and to optimize data collection efficiency.The results show that MMDC can effectively reduce the data forwarding delay,the data collection time and the network energy consumption,as well as increase the network throughput.
分 类 号:TP274.2[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.82