Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. Capacity of Opportunistic Routing and Routing Mechanism of Correlated Source Over a Network
 
  • Details

Capacity of Opportunistic Routing and Routing Mechanism of Correlated Source Over a Network

Date Issued
2011
Date
2011
Author(s)
Tseng, Fan-Min
URI
http://ntur.lib.ntu.edu.tw//handle/246246/253945
Abstract
In wireless network, the broadcast feature makes the transmission link unreliable in certain network, like cognitive radio network or wireless mesh network. The opportunistic routing is therefore been proposed to solve the problem. In opportunistic routing, the end-to-end transmission path is not pre-determined. Every node would be potential forwarder. In this routing mechanism, we conclude that the capacity is bound in the situation that whether the forwarders to destination have received an un-transmitted packet so that it can transmit to destination. To solve this problem we use the concept of network coding that we find the min-cut of network from source to those forwarders. Our analytical result shows that the capacity is related to the total transmission links within T time slots, and the capacity will also increase with the number of transmission paths. The second part of our work does the multi-sources, single destination network while the sources are correlated, which is most likely the wireless sensor network. We use the overhearing information to improve traffic efficiency, i.e., every node can do data compression by the transmitting information message that it overhears from its neighboring nodes. We let each sensor choose its forwarder, and also do efficient transmission by the overhearing message of its possible forwarders. Our goal is to minimize the total transmitting information message from every source nodes and relay nodes. To obtain a distributed routing algorithm, we use the Gibbs sampler which theoretically can approach to global optimal by local information. We compare our algorithm with greedy approach, and the simulation result shows that our algorithm improves the total transmitting information message significantly. We also find that the improvement is related to how correlated of sources.
Subjects
opportunistic routing
network coding
correlated source
Gibbs sampler
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-100-R98942042-1.pdf

Size

23.32 KB

Format

Adobe PDF

Checksum

(MD5):9d365a3915f742da02a6cc937e3b1838

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(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