淡江大學機構典藏:Item 987654321/89178
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 57403/90944 (63%)
造访人次 : 13104104      在线人数 : 347
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/89178


    题名: LASER: A load-aware spectral-efficient routing metric for path selection in IEEE 802.16j multi-hop relay networks
    作者: Wang, Sheng-Shih;Lien, Chan-Ying;Liao, Wen-Hwa;Shih, Kuei-Ping
    贡献者: 淡江大學資訊工程學系
    日期: 2012-07
    上传时间: 2013-05-23 09:38:53 (UTC+8)
    出版者: Kidlington: Pergamon
    摘要: For coverage extension and throughput enhancement, the IEEE 802.16j task group has developed a novel multi-hop relay network architecture to enable typical IEEE 802.16 networks to achieve data transmission between base stations and mobile stations via a multi-hop path with relay stations deployment. How to determine an effective path for throughput gain and overhead reduction is emerging and crucial in IEEE 802.16 multi-hop relay networks. This paper introduces a load-aware spectral-efficient routing metric, called LASER, to evaluate paths, and proposes an efficient scheme to determine a proper path. Based on the LASER metric, the proposed path selection scheme formulates the path cost as the summation of cost of each link, and the path with the minimum cost will be selected as the appropriate one. Simulation results show that the proposed LASER-based path selection scheme significantly outperforms existing path selection schemes in network throughput and map overhead.
    關聯: Computers and Electrical Engineering 38(4), pp.953-962
    DOI: 10.1016/j.compeleceng.2012.02.005
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML247检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈