中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/8550
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 72271/72271 (100%)
造访人次 : 23036522      在线人数 : 691
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/8550


    题名: 無線行動隨建即連網路上之廣播排程協定;Broadcast Scheduling Protocols in Mobile Ad Hoc Networks
    作者: 洪培凱;Pei-Kai Hung
    贡献者: 資訊工程研究所
    关键词: 無線行動隨建即連網路;分散式演算法;廣播協定;distributed algorithms;Broadcasting protocols
    日期: 2001-07-25
    上传时间: 2009-09-22 11:30:03 (UTC+8)
    出版者: 國立中央大學圖書館
    摘要: 在一個無線行動隨建即連網路上,對網路上的各個點廣播訊息是經常發生的。一個有效的廣播通訊協定要能幫助訊息快速及可靠的散播而且要能降低多餘的再廣播。 在這篇論文當中,我們提出了三個廣播排程協定,一個是中央集中排程的協定,它需要知道整個網路各點的拓撲。其它二個是分散式的排程,他們只需要知道附近鄰居的資訊。其中一個是適用於比較靜態的網路,另一個可用於動態的網路。我們所提出的三個廣播排程協定都可以降低再廣播的比例而且能快速地完成廣播的動作。前二個協定能達到百分之百的收到率,第三個協定也有良好的收到率。在我們的論文中,我們將所提出的廣播排程協定與其它的協定就再廣播的比例、收到率及平均完成廣播的時間作詳細的比較、分析及討論。 In this thesis, we consider the issue of broadcasting protocols in a mobile ad hoc network (MANET). The objective of a broadcasting protocol is to deliver the broadcasted message to all network nodes. Flooding in MANET has poor performance because it leads to se-rious packets collision, contention, and redundancy, which results in the waste of limited network bandwidth. Our goal is to design broadcasting protocols to improve the broadcast performance. In this thesis, we propose three broadcasting protocols, one is centralized protocol and two are distributed ones. In the three protocols, we use two basic schemes, the ”set-covering” scheme and ”independent-transmission-set” scheme, to choose the relay nodes and arrange a proper transmission sequence for each node. In the centralized proto-col, we assume the topology of the network is known in advance. The centralized protocol runs at source node and has a collision-free broadcast schedule. In the two distributed pro-tocols, one is used for low mobility and the other one is used for topology changing rapidly. We assume each node having the knowledge of its two-hop neighbors in both distributed protocols. Simulation results show that the proposed broadcasting protocols can decrease a great deal of redundant forwarding packets to save the limited network bandwidth
    显示于类别:[資訊工程研究所] 博碩士論文

    文件中的档案:

    档案 大小格式浏览次数


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈  - 隱私權政策聲明