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


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


    题名: Dynamic Bandwidth Allocation for QoS Routing on TDMA-Based Mobile Ad Hoc Networks
    作者: Shih, Kuei-ping;Chang, Chih-yung;Chen, Yen-da;Chuang, Tsung-han
    贡献者: 淡江大學資訊工程學系
    关键词: Mobile ad hoc networks (MANETs);Routing protocol;Quality of service;QoS;Time division multiple access;TDMA;Wireless networks
    日期: 2006-05
    上传时间: 2011-10-05 22:18:16 (UTC+8)
    出版者: Amsterdam: Elsevier BV
    摘要: The paper proposes several dynamic bandwidth allocation strategies for QoS routing on TDMA-based mobile ad hoc networks. Comprehensively, these strategies are called a distributed slots reservation protocol (DSRP). In DSRP, QoS routing only depends on one-hop neighboring information of each mobile host (MH). In addition, slot inhibited policies (SIPs) and slot decision policies (SDPs) are proposed to determine which slots are valid to use and which slots in the valid slots can be used actually, respectively. In SDPs, three heuristic policies, 3BDP, LCFP, and MRFP, are proposed to increase the success rate of a QoS route and alleviate the slot shortage problems. Moreover, a slot adjustment protocol (SAP) is proposed for a conflicting MH to coordinate the slot usage of its neighbors during the route reservation phase in order to accommodate more routes in the network. The slot adjustment algorithm (SAA) invoked in SAP is a branch-and-bound algorithm, which is an optimum algorithm in terms of the number of slots to be adjusted, on the premise that not to break down any existing route. QoS route maintenance and improvement are also provided. By the simulation results, the proposed protocol cannot only increase the success rate in search of a route with bandwidth requirement guaranteed but also raise the throughput and efficiency of the network.
    關聯: Computer Communications 29(9), pp.1316-1329
    DOI: 10.1016/j.comcom.2005.10.009
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

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

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

    TAIR相关文章

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