摘要
建立了基于能耗和剩余能量约束的无线传感器网络数据收集模型.提出了一种新的基于目标偏差度函数的启发式算法,该算法根据前次计算的结果和约束要求以及自适应动态调整目标函数加权系数的取值,避免了无效重复计算,使算法始终朝着有效的方向搜索.仿真分析表明本算法在网络存活时间指标上优于最小能耗算法;在算法的时间复杂度和搜索成功率上优于k-Dijkstra算法.
An energy and left-power constrained data gathering model for wireless sensor networks is formulated in this paper. A new heuristic algorithm based on object deviation degree function is proposed. According to the last computing results and constrained demands, the algorithm adaptively adjusts appro- priate weighting coefficients to avoid invalid and reduplicate computation. By this dynamical adjusting, the algorithm can find optimal data gathering route along the correct direction. Finally simulation results con- firm that the algorithm proposed is superior to the minimum total transmission power algorithm on performance of network lifetime. Compared with k-Dijkstra algorithm, this algorithm proposed is better ap- proach on performances of computational complexity and searching success ratio.
出处
《武汉大学学报(理学版)》
CAS
CSCD
北大核心
2008年第3期338-342,共5页
Journal of Wuhan University:Natural Science Edition
基金
国家自然科学基金(60672080)
中国博士后科学基金(20070421009)资助项目
关键词
无线传感器网络
数据收集算法
能量优化
存活时间
wireless sensor networks
data gathering algorithm
energy optimization
lifetime