期刊文献+

单层网络中继器放置的2-连通问题及算法

Relay Node Placement Approximation Algorithms for 2-connectivity in Single-tiered Networks
下载PDF
导出
摘要 该文主要研究含有基站的单层网络的中继器放置问题。对单层网络2-连通问题,在中继器传输半径与传感器传输半径相同的情形下,设计了性能比为12的近似算法。 This paper discusses relay node placement in single-tiered networks with base stations. For 2-connectivity in single-tiered networks, a 12-approximation algorithm is designed under assuming that relay nodes have the same communication range with sensor nodes.
出处 《杭州电子科技大学学报(自然科学版)》 2013年第2期88-91,共4页 Journal of Hangzhou Dianzi University:Natural Sciences
基金 国家自然科学基金资助项目(11071219)
关键词 中继器放置问题 连通 近似算法 性能比 relay node placement connectivity approximation algorithms performance ratio
  • 相关文献

参考文献6

  • 1Kashyap A, Khuller S, Shayman M. Relay placement for higher order connectivity in wireless sensor networks[C]. Bar- celona: IEEE International Conference on Computer Communications,2006:l -12.
  • 2Zhang W, Xue G, Misra S. Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms [ C]. Anchorage: IEEE International Conference on Computer Communications,2007 : 1 649 - 1 659.
  • 3Lin G, Xue G. Steiner tree problem with minimum number of Steiner point and bounded edge-length [ J ]. Information Pro- cessing Letters, 1999,69 (2) :53 - 57.
  • 4Khuller S, Raghavachari B. Improved approximation algorithms for uniform connectivity problems[ C ] . New York: the twenty-seventh annual ACM symposium on Theory of computing, 1995:214 -235.
  • 5Monma C, Suri S. Transitions in geometric minimum spanning tree [ J ]. Discrete and Computational Geometry, 1992,8 ( 1 ) :265 - 293.
  • 6Chen D, Wang L, Xue G. Approx/madons for steiner trees with minimum number of steiner points[J]. Journal of Global Optimization,2000,18 ( 1 ) : 17 - 33.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部