期刊文献+

无线Mesh网络中的骨干网络部署的优化 被引量:4

Optimization of Wiring Layout in Mesh Network
下载PDF
导出
摘要 在满足用户需求情况下,优化无线Mesh网络中接入点(TAPs)放置以及布线线路以减小布线成本。首先,把该问题中的布线问题模型化为欧氏空间中准组Steiner树问题。解决传统的组Steiner树问题的算法在该问题上并不适用。其次,针对该问题特有的特征给出了一种近似算法。最后,为了达到最小化网络布线的成本的目的,在布线的基础上使用线性规划达到最小化TAPs数目。模拟实验的结果表明,该方法能够显著降低布线成本。优化方法对于无线Mesh网络的骨干网络的部署具有重要指导意义。 This paper optimizes the placement of TAPs in Wireless Mesh network and minimizes the layout cost while meeting user's demand. First, layout problem is modeled as Quasi - Group Steiner Tree Problem. Traditional algorithms, which solve traditional Steiner Tree Problem are not efficient for solving this problem. Secondly, an approximation algorithm based on this problem's specifics is given. Finally, after solving the wiring layout problem, Linear Programming is used to minimize the number of TAPs deployed in network and the cost of wiring layout. Simulations show that this method can minimize the layout cost distinctively. It is of significance for optimizing the wiring layout in Mesh Network.
出处 《计算机仿真》 CSCD 2008年第4期126-129,201,共5页 Computer Simulation
关键词 无线自组网络 布线 组斯坦纳树 无线接入点 Wireless mesh network Wire layout Group Steiner tree TAPs
  • 相关文献

参考文献7

  • 1Lili Qiu, Ranveer Chandra, Kamal Jain, Mohammad Mahdian: Optimizing the placement of integration points in multihop wireless networks[C ]. IEEE International Conference on Network Protocols, 2004. 271 -282.
  • 2J Camp and J Robinson and C Steger and E Knightly. Measurement Driven Deployment of a Two - Tier Urban Mesh Access Network [ C]. ACM International conference on Mobile systems, applications and services, 2006.96 - 109.
  • 3C Douglass Bateman, C S Helvig, Gabriel Robins, Alexander Zelikovsky: Provably Good Routing Tree Construction with Multi - Port Terminals [ C ]. ACM/SIGDA International Symposium on Physical Design, 1997. 96 - 102.
  • 4Edmund Ihler. The Complexity of Approximating the Class Steiner Tree Problem [ M ]. Lecture Notes in Computer Science, 1992, Volume 570 : 85 - 96.
  • 5C H Helvig Gabriel Robins, Alexander Zelikovsky: An improved approximation scheme for the Group Steiner Problem [ J ]. Networks 2001,37 ( 1 ) : 8 - 20.
  • 6R Karrer, A Sabharwal, E Knightly. Enabling Large - scale Wireless Broadband: The Case for TAPs[ C ]. ACM SIGCOMM Computer Communication Review, January 2004, 34( 1 ) : 27 - 32.
  • 7Lusheng Wang, Ding- Zhu Du. Approximations for a Bottleneck Steiner Tree Problem [ J ]. Algorithmica 2002,32 (4) : 554 - 561.

同被引文献18

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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