期刊文献+

基于ILP和概率贪婪调度的无线网络容量提高

Wireless network capacity improvement based on ILP and probabilistic greedy scheduling
下载PDF
导出
摘要 为提高无线Mesh网(WMNs)的容量,提出一种将自由空间光(FSO)技术集成到现有基于RF的WMNs中的解决方案。首先,基于每个节点预期的长期上行和下行流量需求,构建一个整数线性规划(ILP),用于FSO收发器和RF链路调度的联合分配,以找到关键位置节点,对这样的节点升级后,能够最大限度地提高整个网络的容量;其次,为了避免原始ILP的复杂性,提出一种概率贪婪调度算法,以非常低的计算成本计算出一个可行解,作为比较基准,还提出了一种模拟退火算法。仿真实验结果表明,采用对若干关键位置的节点进行升级,可以提高网络容量。 A new solution is proposed to integrate Free-Space Optics(FSO)technology into the existing RF-based Wireless Mesh Networks(WMNs)in order to improve the capacity of wireless mesh networks.Firstly,based on the expected long-term uplink and downlink traffic demands at each node,an Integer Linear Program(ILP)is constructed for the joint assignment of FSO transceiver and RF link scheduling to find the key location nodes which increase the overall network capacity to the greatest extent if they get upgraded.Secondly,in order to avoid the complexity of the original ILP,a Probabilistic Greedy Scheduling(PGS)algorithm is proposed,which can calculate a feasible solution at a very low computational cost.As a comparative benchmark,a Simulated Annealing(SA)algorithm is also proposed.The simulation results show that the network capacity can be improved by upgrading some key location nodes.
作者 历光平 王耀彬 LI Guangping;WANG Yaobin(Department of Humanities and Social Sciences,Sichuan Vocational College of Health and Rehabilitation,Zigong Sichuan 643000,China;School of Computer Science and Technology,Southwest University of Science and Technology,Mianyang Sichuan 621010,China)
出处 《太赫兹科学与电子信息学报》 2021年第1期60-66,共7页 Journal of Terahertz Science and Electronic Information Technology
基金 自贡市科技局科技计划(2018GYCX33)。
关键词 无线MESH网 有向图 FSO技术 整数线性规划 链路调度 容量提高 Wireless Mesh Networks directed graph FSO technology Integer Linear Program link scheduling capacity improvement
  • 相关文献

参考文献8

二级参考文献47

  • 1WANG L, WU K, HAMDI M, et al. Attachment-learn- ing for multi-channel allocation in distributed OFDMA- based networks [ J ]. IEEE Transactions on Wireless Communications, 2013, 12(4): 1712-1721.
  • 2DRAVES R, PADHYE J, ZILL B. Routing in multi-ra- dio multi-hop wireless mesh networks [ C ]. Proceedings of the 10th annual international conference on Mobile computing and networking, Philadelphia, Pennsylvania, USA, 2004 : 114-128.
  • 3RANIWALA A, GOPALAN K, CHIUEH T. Central- ized channel assignment and routing algorithms for multi-channel wireless mesh networks [ J ]. ACM SIG- MOBILE Mobile Computing and Communications Re- view, 2004, 8(2):50-65.
  • 4SO J, VAIDYA N H. Multi-channel mac for ad hoc net- works: handling multi-channel hidden terminals using a single transceiver[ C ]. Proceedings of the 5th ACM in- ternational symposium on Mobile ad hoc networking and computing, Roppongi, Japan, 2004: 222-233.
  • 5BAHL P, CHANDRA R, DUNAGAN J. SSCH: slot- ted seeded channel hopping for capacity improvement in IEEE 802. 11 ad-hoc wireless networks [ C ]. Pro- ceedings of the 10th Annual International Conference on Mobile Computing and Networking, Philadelphia, Pennsylvania, USA, 2004:216-230.
  • 6WU S L, LIN C Y, TSENG Y C, et al. A new multi- channel MAC protocol with on-demand channel assign- ment for multi-hop mobile ad hoc networks [ C ]. Paral- lel Architectures, Algorithms and Networks, Interna- tional Symposium on I-SPAN 2000 Proceedings, IEEE, 2000:232-237.
  • 7BENVENISTE M. The CCC mesh MAC protocol [ J]. IEEE, 802 : 802.11-05.
  • 8KYASANUR P, VAIDYA N H. Routing and link-layer protocols for multi-channel multi-interface ad hoc wire- less networks [ J ]. ACM SIGMOBILE Mobile Compu- ting and Communications Review, 2006, 10 ( 1 ) : 31-43.
  • 9GAO L, WANG X. A game approach for muhi-ehan- nel allocation in multi-hop wireless networks [ C ]. Pro- ceedings of the 9th ACM International Symposium on Mobile ad Hoc Networking and Computing, Hong Kong SAR, China, 2008: 303-312.
  • 10MAHONEN P, PETROVA M. Minority game for cog- nitive radios: cooperating without cooperation [ J ]. Physical Communication, 2008, 1 (2) : 94-102.

共引文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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