Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Computer Science and Information Engineering / 資訊工程學系
  4. Efficient resource allocation for IEEE 802.15.3(a) ad hoc networks
 
  • Details

Efficient resource allocation for IEEE 802.15.3(a) ad hoc networks

Resource
Lecture Notes in Computer Science 3283: Intelligence in Communication Systems, edited by F. A. Aagesen, C. Anutariya and V. Wuwongse, Springer-Verlag, pp. 128-142
Journal
Lecture Notes in Computer Science 3283: Intelligence in Communication Systems, edited by F. A. Aagesen, C. Anutariya and V. Wuwongse, Springer-Verlag
Pages
128-142
Date Issued
2004
Date
2004
Author(s)
Tseng Y. H.
Wu E. H. K.
Shieh K. L.
GEN-HUEY CHEN  
DOI
10.1007/978-3-540-30179-0_12
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-34547465563&doi=10.1007%2f978-3-540-30179-0_12&partnerID=40&md5=a0fbec5cee8264bdc0434aed17bfe51e
Abstract
IEEE 802.15.3(a) is working to design a higher speed PHY enhancement amendment to 802.15.3 such as ultra-wideband which can provide precise timing and location information. This paper proposes an effective resource allocation mechanism which can guarantee the QoS properties of multimedia traffics and provide higher channel utilization by the aid of location information. The proposed mechanism, which is executed by the piconet coordinator, consists of three components: grouping, call admission control, and best effort traffic maximization. The grouping component groups non-interfering traffics together so that they are allowed to be transmitted simultaneously. The problem of grouping is shown equivalent to the graph coloring problem for which a lot of algorithms are available. The CAC component is responsible for QoS guarantee. The best effort traffic maximization component attempts to maximize the total throughput of best effort traffics. The maximization problem is formulated as a linear programming. Finally, simulation results verify the ability of QoS guarantee and higher channel utilization. © IFIP International Federation for Information Processing 2004.
Other Subjects
Ad hoc networks; Channel capacity; Graph algorithms; Linear programming; Multimedia systems; Resource allocation; Ultra-wideband (UWB); Allocation mechanism; Best-Effort Traffic; Channel utilization; Efficient resource allocation; Graph coloring problem; Location information; Maximization problem; Piconet coordinators; IEEE Standards
Type
journal article

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science