国产bbaaaaa片,成年美女黄网站色视频免费,成年黄大片,а天堂中文最新一区二区三区,成人精品视频一区二区三区尤物

首頁> 外文學(xué)位 >Network coding based cooperative Peer-to-Peer repair in wireless networks.
【24h】

Network coding based cooperative Peer-to-Peer repair in wireless networks.

機(jī)譯：無線網(wǎng)絡(luò)中基于網(wǎng)絡(luò)編碼的協(xié)作對等修復(fù)。

獲取原文
獲取原文并翻譯 | 示例
  • 摘要
  • 著錄項(xiàng)
  • 相似文獻(xiàn)
  • 相關(guān)主題

摘要

Multimedia Broadcast/Multicast Service (MBMS) in cellular networks has emerged recently as a promising distribution model to provide rich content distribution where a batch of content is broadcast to a large number of peers simultaneously. However, ensuring efficient error-free message delivery in such a scenario is a challenge, since packet loss is inevitable due to the time-varying nature of wireless transmissions, and the server is probably overwhelmed by floods of individual retransmission requests from peers. Cooperative Peer-to-Peer (P2P) information repair has been proposed to mitigate the packet loss among peers during Base Station (BS) broadcast, by allowing peers to cooperate on information exchange among themselves, rather than asking the BS to rebroadcast the lost packets for the peers. Network Coding, a fairly recent transmission paradigm with the potential network throughput improvement and high reliability advantage, has been widely recognized as a promising information dissemination approach for wireless networks.;In this research, we study the network coding based cooperative P2P information repair in wireless networks. We first propose our initial work - a connected dominating set (CDS) based P2P information repair (PPIR) protocol with network coding which utilize the clustering idea, to minimize the total repair latency as well as alleviate the congestion and burden of BS's downlink channels. Then the decision making problem for P2P repair with densely distributed nodes is studied and two approaches are provided. Later on, the NC based P2P information repair protocol with tunable parameter (NC-PIRTP) which evolved from PPIR protocol is proposed to further reduce transmission collisions and total repair latency. At last, P2P information repair under mobile network environment with pedestrian speed is studied and three efficient protocols are illustrated which are suitable to different specific cases. Extensive simulation results are provided for performance evaluation and comparisons, and to demonstrate the effectiveness and efficiency of our proposed protocols in terms of the total repair latency. Furthermore, an analytical model is developed, based on which theoretical results are derived. These results validate our protocol models and provide useful protocol design guideline for the cooperative P2P information repair problem in wireless networks.
機(jī)譯：蜂窩網(wǎng)絡(luò)中的多媒體廣播/多播服務(wù)（MBMS）最近作為一種有前途的分發(fā)模型而出現(xiàn)，該模型可提供豐富的內(nèi)容分發(fā)，其中一批內(nèi)容同時廣播到大量對等方。但是，在這種情況下確保有效的無錯誤消息傳遞是一項(xiàng)挑戰(zhàn)，因?yàn)闊o線傳輸?shù)臅r變性質(zhì)會不可避免地導(dǎo)致數(shù)據(jù)包丟失，并且服務(wù)器可能會被來自對等端的單個重傳請求所淹沒。已經(jīng)提出了協(xié)作對等（P2P）信息修復(fù)，以通過允許對等方在彼此之間的信息交換上進(jìn)行協(xié)作，而不是要求BS重新廣播丟失的數(shù)據(jù)包來減輕基站（BS）廣播期間對等方之間的數(shù)據(jù)包丟失。對于同行。網(wǎng)絡(luò)編碼是一種較新的傳輸范例，具有潛在的網(wǎng)絡(luò)吞吐量改善和高可靠性優(yōu)勢，已被廣泛認(rèn)為是一種有前途的無線網(wǎng)絡(luò)信息傳播方法。在本研究中，我們研究了基于網(wǎng)絡(luò)編碼的無線協(xié)作式P2P信息修復(fù)。網(wǎng)絡(luò)。我們首先提出我們的初始工作-利用集群思想的基于CDS的基于P2P信息修復(fù)（PPIR）協(xié)議的網(wǎng)絡(luò)編碼，利用群集思想，以最大程度地減少總修復(fù)等待時間并減輕BS下行鏈路信道的擁塞和負(fù)擔(dān)。然后研究了節(jié)點(diǎn)密集分布的P2P修復(fù)決策問題，并提出了兩種方法。隨后，提出了從PPIR協(xié)議演變而來的基于NC的具有可調(diào)參數(shù)的P2P信息修復(fù)協(xié)議（NC-PIRTP），以進(jìn)一步減少傳輸沖突和總修復(fù)等待時間。最后，研究了行人速度在移動網(wǎng)絡(luò)環(huán)境下的P2P信息修復(fù)，并提出了三種適用于不同情況的有效協(xié)議。提供了廣泛的仿真結(jié)果以進(jìn)行性能評估和比較，并以總修復(fù)潛伏期證明了我們提出的協(xié)議的有效性和效率。此外，開發(fā)了一個分析模型，在此模型的基礎(chǔ)上可以得出理論結(jié)果。這些結(jié)果驗(yàn)證了我們的協(xié)議模型，并為無線網(wǎng)絡(luò)中的協(xié)作式P2P信息修復(fù)問題提供了有用的協(xié)議設(shè)計指南。

著錄項(xiàng)

  • 作者

    Liu, Yu.;

  • 作者單位

    Illinois Institute of Technology.;

  • 授予單位 Illinois Institute of Technology.;
  • 學(xué)科 Engineering Electronics and Electrical.
  • 學(xué)位 Ph.D.
  • 年度 2012
  • 頁碼 103 p.
  • 總頁數(shù) 103
  • 原文格式 PDF
  • 正文語種 eng
  • 中圖分類
  • 關(guān)鍵詞

相似文獻(xiàn)

  • 外文文獻(xiàn)
  • 中文文獻(xiàn)
  • 專利
獲取原文

客服郵箱：kefu@zhangqiaokeyan.com

京公網(wǎng)安備：11010802029741號 ICP備案號：京ICP備15016152號-6 六維聯(lián)合信息科技 (北京) 有限公司?版權(quán)所有

  • 客服微信

  • 服務(wù)號