作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2013, Vol. 39 ›› Issue (7): 110-114. doi: 10.3969/j.issn.1000-3428.2013.07.025

• 移动互联与通信技术 • 上一篇    下一篇

WSN最短链路调度问题的常数近似算法

吕玉华,禹继国,王晨曦   

  1. (曲阜师范大学计算机科学学院,山东 日照 276826)
  • 收稿日期:2012-07-10 出版日期:2013-07-15 发布日期:2013-07-12
  • 作者简介:吕玉华(1985-),男,硕士研究生,主研方向:无线网络;禹继国,教授、博士;王晨曦,硕士研究生
  • 基金资助:
    国家自然科学基金资助项目(11101243, 60373012);山东省自然科学基金资助项目(ZR2012FM023, ZR2009GM009, ZR2009 AM013);山东省高校科技计划基金资助项目(J10LG09)

Constant Approximation Algorithm for Shortest Link Scheduling Problem in Wireless Sensor Network

LV Yu-hua, YU Ji-guo, WANG Chen-xi   

  1. (School of Computer Science, Qufu Normal University, Rizhao 276826, China)
  • Received:2012-07-10 Online:2013-07-15 Published:2013-07-12

摘要: 针对无线传感器网络中的最短链路调度问题,在有界线性功率分配方式下,提出一种基于物理干扰模型的常数近似算法。采用网格划分方法,使每个时间段所对应链路集合中的链路都满足SINR阈值约束,并对算法的有效性和近似比进行理论论证。仿真结果表明,与TONOYAN算法相比,在多数情况下该算法具有更小的时间延迟。

关键词: 无线传感器网络, 链路调度, 最大独立集, 物理干扰模型, 线性功率分配, NP完全

Abstract: Link scheduling is an important issue in Wireless Sensor Network(WSN). For the problem of Shortest Link Scheduling(SLS), this paper gives a constant approximation algorithm with linear power assignment under the physical interference model. All links of each link set in corresponding time slot meet the SINR threshold constraint with grid partition. The effectiveness of the algorithm and the approximate ratio are discussed through theoretical analysis. Simulation experimental results show that the algorithm has less time delay than TONOYAN algorithm.

Key words: Wireless Sensor Network(WSN), link scheduling, maximum independent set, physical interference model, linear power assignment, NP-complete problem

中图分类号: