Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (13): 95-97.

• 网络、通信、安全 • Previous Articles     Next Articles

Approximation algorithm for 3-connectivity in wireless sensor networks

CHEN Guangting,LI Ruxue,DING Wei   

  1. Institute of Operations Research and Control Sciences,Hangzhou Dianzi University,Hangzhou 310018,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-05-01 Published:2011-05-01

双层无线传感网络的3连通近似算法

陈光亭,李茹雪,丁 蔚   

  1. 杭州电子科技大学 运筹与控制研究所,杭州 310018

Abstract: The two-tiered wireless sensor network is a network that data can only be transmitted between relay nodes or sensor nodes and relay nodes,and there is no data stream between sensor nodes.An approximation algorithm is proposed based on two foundational works:The k-disk cover problem and the single-tiered 3-connectivity relay node placement problem,with a special structure,called “hexagon”,to keep 3-connectivity for the network.The performance ratio is 8α+β,where α is the performance ratio of approximation algorithm for the k-disk cover problem,and β is the performance ratio of approximation algorithm for the single-tiered 3-connectivity relay node placement problem.

Key words: 3-connectivity, disk-cover, two-tier Wireless Sensor Network(WSN), relay node, sensor node

摘要: 主要研究双层无线传感网络模型,即数据信息流只能在传感器和中继器或中继器和中继器之间传输,而不能在传感器之间传输。近似算法基于两个子问题:k圆盘覆盖问题和单层传感网络的k连通问题,而后在部分中继器周围设置“等六边形”结构的中继器点,最终达到整个网络的3-连通水平。该算法的最终性能比为8α+β,其中α为k圆盘覆盖近似算法的性能比,β为单层传感网络的k连通近似算法的性能比。

关键词: 3连通, 圆盘覆盖, 双层无线传感网络, 中继器, 传感器