检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国海洋大学信息科学与工程学院,青岛266100
出 处:《东南大学学报(自然科学版)》2012年第A02期238-244,共7页Journal of Southeast University:Natural Science Edition
基 金:国家自然科学基金资助项目(61170258;61103196;61003238;60933011)
摘 要:为了解决现有的数据采集算法在高速采集的情况下存在占用CPU资源过多的问题,在对传统采集方式的优缺点进行比较的基础上,通过模拟数据采集实验获得大量的关于数据采集通信延迟时间的数据,对这些数据进行可视化分析,求解其最大值、最小值、平均值和方差,得到通信时间概率密度,并给出了数据采集的动态延迟特性.在此基础上,提出了更加稳定高效的数据采集算法.从理论分析和试验验证2方面对算法的性能进行分析比较,结果表明:该算法在保证采集效率的同时,大幅度降低了CPU的使用率,有效地减少了能量的消耗,大幅度提升传感器网络的生存周期.In order to solve the problem that the current acquisition algorithm occupies more central processing unit (CPU) resources under the circumstance of high-speed acquisition, on the basis of comparing the advantages and disadvantages of traditional acquisition methods, a great deal of data about the communication delay in data collection are obtained by means of the experiments in simula- ting data acquisition. By analyzing the visualization data and solving the variance and the maximum, minimum, and average values of the data, the probability density of the communicating time is ob- tained and the dynamic delay characteristics of data collection are given. And on this basis, a data collection algorithm is proposed, which is more stable and more efficient. The algorithm perform- ance in terms of theoretical analysis and experimental verification are compared and analyzed. The results show that the proposed algorithm can greatly reduce the usage of the CPU and the energy con- sumption, and, meanwhile, assure collection efficiency, thus greatly improving the life cycle of sen- sor networks.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30