基于满Steiner树问题的水下无线传感器网络拓扑愈合算法研究  

Study of topology recovery algorithm based on full Steiner minimum tree problem in underwater wireless sensor networks

作　　者：刘林峰[1] 刘业[2] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003 [2]中国科学技术大学苏州研究院,江苏苏州215123

出　　处：《通信学报》2010年第9期30-37,45,共9页Journal on Communications

基　　金：国家自然科学基金资助项目(60903181;40801149);江苏省自然科学基金资助项目(BK2008451);国家高技术研究发展计划("863"计划)基金资助项目(2009AA701202;2009AA12Z219);江苏省博士后基金资助项目(0801019C);中国博士后科学基金资助项目(20090451240);江苏省高校自然科学研究基金资助项目(09KJB520009);南京邮电大学引进人才科研启动基金资助项目(NY208073)~~

摘　　要：建立了水下无线传感器网络模型,对拓扑愈合问题进行了形式化描述,该问题最终映射到数学上的满Steiner树问题。针对满Steiner树问题设计了一种近似的拓扑愈合算法,通过把自移动节点迁移至合适位置,不仅使拓扑得以愈合,还能够改善时延和能耗指标。仿真实验结果表明,该算法能愈合通信拓扑至较优状态,降低了传输时延和能耗,并能有效地延长水下传感器网络生命期。The UWSN（underwater wireless sensor network） model was constructed,and the topology recovery problem was described formally.The topology recovery problem was mapped into the full Steiner tree problem in mathematics.An approximate topology recovery algorithm was proposed for this problem.The suitable movement of autonomous un-derwater vehicles can not only recover the topology but also improve the targets of delay and energy consumption.The simulation experiments suggest the algorithm proposed can obtain a well-constructed topology,which has lower delay,less energy consumption,and longer UWSN lifetime.

关 键 词：水下无线传感器网络 满Steiner树 拓扑愈合 多目标优化 

分 类 号：TN393[电子电信—物理电子学]