北京邮电大学学报

  • EI核心期刊

北京邮电大学学报

• 论文 • 上一篇    下一篇

传感器网络中的多重贪心路由算法

赵保华,张炜,李婧,屈玉贵,刘桂英   

  1. 中国科学技术大学 计算机科学与技术系,安徽合肥,230027
  • 收稿日期:2005-01-01 修回日期:1900-01-01 出版日期:2006-05-30 发布日期:2006-05-30
  • 通讯作者: 赵保华
  • 基金资助:
     

Multi-greedy Routing Algorithm in Wireless Sensor Networks

Zhao Bao-hua, Zhang Wei, Li Jing, Qu Yu-gui, Liu Gui-ying   

  1. Dept. of Computer Science, University of Science and Technology of China, 230027, China) ZIP, Country
  • Received:2005-01-01 Revised:1900-01-01 Online:2006-05-30 Published:2006-05-30
  • Contact: Zhao Bao-hua
  • Supported by:
     

摘要: 基于二层架构的无线传感器网络,以减少网络功耗为目的,提出了一种新的路由算法--多重贪心算法以获得最优路径。模拟结果证明了此算法复杂度量级远小于穷举法,和贪心算法近似,不过相对于贪心算法大幅度减少了组长传感器的平均功耗,从而提高了网络的生命期。

关键词: 二层架构, 功耗分析, 多重贪心算法, 无线传感器网络

Abstract: On the basis of the twotiered structure wire
less sensor networks (WSN), to slow down the power consumption, a new routing ap
proach is proposed, using the main idea of multiple quoting energygreedy algor
ithms to get the optimal path. As what the simulation performance results demons
trate, the complexity of the new algorithm is much smaller than the infinite enu
meration method and nearly the same as the greedy algorithm; meanwhile, it great
ly reduces the average power consumption of the cluster heads and thus prolongs
the network lifetime efficiently.

Key words: Two-tiered structure, power consumption, multi-greedy algorithm, wireless sensor network

中图分类号: