摘要
将基站位置选择及节能路由优化联合考虑,定义了最短路径树剖分,分析了二维空间中剖分单元的结构与相邻剖分单元搜索算法,并设计了3种启发式算法。通过仿真实验对算法性能进行了分析与对比,结果表明所提出的启发式算法的性能有效地接近或者收敛于全局最优解。
The selection of sink position and the routing optimization for energy efficiency were combined,and the shortest path tree（SPT） tessellation was defined.The structure of the SPT tessellation cells in 2-dimension space was analyzed,and a method to search neighboring cells was presented.Three heuristic algorithms were also designed.Simu-lation experiments are conducted to analyze and compare the performance of the proposed algorithms,and the results show that the performance of the algorithms is close to or able to converge to the global optimality.
出处
《通信学报》
EI
CSCD
北大核心
2010年第9期1-7,共7页
Journal on Communications
基金
国家重点基础研究发展计划("973"计划)基金资助项目(2009CB320405)
国家科技重大专项课题基金资助项目(2010ZX03005-002
2010ZX03006-002-02)~~
关键词
无线传感器网络
网络总能耗
基站位置
非线性规划
凸分析
最短路径树剖分
wireless sensor networks
overall network energy consumption
sink position
nonlinear programming
con-vex analysis
shortest path tree tessellation
