期刊文献+

连通度要求不同的单层无线传感网络放置问题

Algorithms for Single-tiered Relay Node Placement with Different Connectivity Requirement
下载PDF
导出
摘要 该文讨论含有基站的有位置约束无线传感器网络的放置问题,要求添加最少数目的中继器,使得对某些传感器和基站之间存在至少两条边不相交的路,而另一些传感器和基站之间至少存在一条点不相交的路。该文在传感器连通度要求不同的问题上进行了研究,并且在对中继器位置进行限制之后给出了一个性能比为10的近似算法。 In this paper,we discuss the constrained relay node placement in single-tired wireless sensor networks with basestations.We want to find the minimum relay nodes such that there are at least two edge-disjoint paths between some sensor node and basestations,while there is at least one edge-disjoint path between the other sensor nodes and basestations.We are the first to discuss this problem and give a 10-approximation algorithm.
出处 《杭州电子科技大学学报(自然科学版)》 2011年第2期93-95,共3页 Journal of Hangzhou Dianzi University:Natural Sciences
关键词 位置约束 单层 连通度不同 constrained single-tired different connectivity
  • 相关文献

参考文献5

  • 1Misra S, Hong S, Xue G. Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Sur- vivability Requirements [DB/OL]. http://ieeexplore, ieee. org/xpls/abs_all, jspamumber=4509660, 2010-05 -12.
  • 2Fleischer L. A 2-Approximation for minimum cost {0,1,2} vertex connectivity[ J ]. http ://www. springerlink, com/con- tent/axc2th3t7rnaf, 2009 - 03 - 12.
  • 3Lloyd E , Xue G. Relay node placement in wireless sensor networks[ J]. IEEE Transactions on Computers, 2007, 56 (1) :134 - 138.
  • 4West B . Introduaction to Graph Theory[ M] . American: Prentice Hall , 1996:28 -52.
  • 5Saif Shams M, Aminul Haque Chowdhury D. A fast approximation algorithm for relay node placement in double-tiered wireless sensor network [ C ]. SuWon : Ajou University, Military Communications Conference, 2008 : 1 - 6.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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