首页    期刊浏览 2024年11月27日 星期三
登录注册

文章基本信息

  • 标题:Modified Greedy Physical Link Scheduling Algorithm for Improving Wireless Mesh Network Performance
  • 本地全文:下载
  • 作者:Nachwan Mufti Adriansyah ; Muhamad Asvial ; Bagio Budiardjo
  • 期刊名称:TELKOMNIKA (Telecommunication Computing Electronics and Control)
  • 印刷版ISSN:2302-9293
  • 出版年度:2015
  • 卷号:13
  • 期号:1
  • 页码:202-210
  • DOI:10.12928/telkomnika.v13i1.790
  • 语种:English
  • 出版社:Universitas Ahmad Dahlan
  • 摘要:The algorithm to allocate mesh active link to radio resource timeslot in wireless mesh network (WMN) is investigated. This paper proposes the novel method to allocate multiple links in one timeslot for improving the wireless mesh network throughput via spatial time division multiple access (STDMA) protocol. The throughput improvement is obtained by modifying greedy based algorithm that is widely known as a low complexity algorithm. We propose and investigate new parameters in the greedy based algorithm that can be used as scheduling control parameters, i.e. interference weight, scheduling weight, and the sum of link’s degree. Simulation results indicate that this approximation increases network performance in throughput and length of scheduling performance closed to the upper bound performance that is achieved by the algorithm that uses the physical interference model.
  • 其他摘要:The algorithm to allocate mesh active link to radio resource timeslot in wireless mesh network (WMN) is investigated. This paper proposes the novel method to allocate multiple links in one timeslot for improving the wireless mesh network throughput via spatial time division multiple access (STDMA) protocol. The throughput improvement is obtained by modifying greedy based algorithm that is widely known as a low complexity algorithm. We propose and investigate new parameters in the greedy based algorithm that can be used as scheduling control parameters, i.e. interference weight, scheduling weight, and the sum of link’s degree. Simulation results indicate that this approximation increases network performance in throughput and length of scheduling performance closed to the upper bound performance that is achieved by the algorithm that uses the physical interference model.
国家哲学社会科学文献中心版权所有