Dynamic Content Adjustment In Mobile Ad Hoc Networks

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：7

、訪客IP：3.139.78.149

姓名

楊士嶸(Shih-Rong Yang) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

(Dynamic Content Adjustment In Mobile Ad Hoc Networks)

相關論文

★ Dynamic Overlay Construction for Mobile Target Detection in Wireless Sensor Networks	★ 車輛導航的簡易繞路策略
★ 使用傳送端電壓改善定位	★ 利用車輛分類建構車載網路上的虛擬骨幹
★ Why Topology-based Broadcast Algorithms Do Not Work Well in Heterogeneous Wireless Networks?	★ 針對移動性目標物的有效率無線感測網路
★ 適用於無線隨意網路中以關節點為基礎的分散式拓樸控制方法	★ A Review of Existing Web Frameworks
★ 將感測網路切割成貪婪區塊的分散式演算法	★ 無線網路上Range-free的距離測量
★ Inferring Floor Plan from Trajectories	★ An Indoor Collaborative Pedestrian Dead Reckoning System
★ 以影像為基礎的定位系統	★ 大範圍無線感測網路下分散式資料壓縮收集演算法
★ 車用WiFi網路中的碰撞分析	★ Exploring Spatial-Temporal Cloaking Against Correlation Attacks for Location-based Services

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

現今當移動式隨意網路越來越廣泛使用於網路資源存取或是資源共享時，短時間內大量的資源需求往往容易造成網路的負載過高。因此，如何在滿足大量的資源需求下並且能夠降低所帶來的高網路負載一直是個重要的議題。在過去的研究中，大部分的作法都是專注於在某個固定的資源需求量下所設計的極佳化資源放置策略，但是卻忽略了資源的需求量其實是隨時在改變的。在本篇論文中，我們提出了一個動態資源網格調整策略(DCGAS)來平衡網路流量的負載。DCGAS的主要特色是當某個資源在網路中的需求量超過或是低於我們定義該資源的門檻時，我們就會動態地增加或是減少該資源在網路中的數量並藉此因應不同的資源需求量。從實驗結果來看，我們提出的策略優於最近相關提出的方法。

摘要(英)

As mobile ad hoc networks are generally applied for the resource access and sharing, enormous amount of resource query may occur in a short period of time, which will easily lead to heavy traffic load in the network. Therefore, the traffic reduction for queries is an important issue. Most of the researches in this area focus on the optimal resources placement strategy under static query traffic and overlook the dynamic nature of the traffic. In this paper, we propose the Dynamic Content Grid Adjustment Strategy (DCGAS) to balance the dynamic traffic load in a network. The main feature behind DCGAS is to adjust the number of resources in a network when the query traffic exceeds or falls behind some critical thresholds. The simulation results demonstrate that our strategy outperforms the state-of-the-art data replication schemes.

關鍵字(中)

★ 物件複製
★ 網格網路
★ 移動隨意式網路

關鍵字(英)

★ Content replication
★ Grid networks
★ MANETs

論文目次

1 Introduction 1
2 Literature Review 3
3 DCGAS Overview 5
4 Dynamic Content Grid Adjustment Strategy 8
4.1 Query packets calculation 9
4.2 Dividing a grid 11
4.3 Merging neighboring grids 11
5 DCGAS Throughput Analysis 14
6 Performance Evaluations 16
6.1 Simulation setting and performance metrics 16
6.2 Effect of the average number of hops to a content 17
6.3 Effect of the average number of query forwarding 20
6.4 Effect of the query delay 22
7 Conclusion 24
8 Reference 25

參考文獻

[1] A. Carzaniga and A. L. Wolf, “Forwarding in a content-based network,” in ACM SIGCOMM, 2003, pp. 163–174.
[2] V. Jacobson and D. K. S. et al, “Networking named content,” in ACM CoNEXT, 2009, pp. 1–12.
[3] ——, “A data-oriented (and beyond) network architecture,” in ACM SIGCOMM, 2007, pp. 181–192.
[4] Y. Ko and N. H. Vaidya, “Location-aided routing (lar) mobile ad hoc networks,” ACM MOBICOM, vol. 6, pp. 307–321, Jul. 1998.
[5] ——, “Geotora: a protocol for geocasting in mobile ad hoc networks.” in IEEE ICNP, 2000, pp. 240–250.
[6] ——, “A two-tier data dissemination model for largescale wireless sensor networks,” in ACM MOBICOM, 2002, pp. 148–159.
[7] I. Baev and R. Rajaraman, “Approximation algorithms for data placement in arbitrary networks,” in SODA, 2001, pp. 661–670.
[8] E. Cohen and S. Shenker, “Replication strategies in unstructured peer-topeer networks,” in ACM SIGCOMM, 2002, pp. 177–190.
[9] B. J. Ko and D. Rubenstein, “Distributed, self-stablizing placement of replicated resources in emerging networks,” IEEE ICNP, vol. 13, pp. 476–487, Jun. 2005.
[10] B. Li, M. J. Golin, G. F. Ialiano, and X. Deng, “On the optimal placement of web proxies in the internet,” in IEEE INFOCOM, 1999, pp. 1282 – 1290 vol.3.
[11] L. Qiu, V. N. Padmanabhan, and G. M. Voelker, “On the placement of web server replicas,” in IEEE INFOCOM, 2001, pp. 1587 – 1596 vol.3.
[12] G. Cao, L. Yin, and C. R. Das, “Cooperative cache-based data access in ad hoc networks,” IEEE Computer, vol. 37, no. 2, pp. 32–39, Feb. 2004.
[13] S.-B. Lee, H. Y. S. Wong, K.-W. Lee, and S. Lu, “Content management in a mobile ad hoc network: beyond opportunistic strategy,” IJCNDS, vol. 10, no. 2, pp. 123–145, Feb. 2013.
[14] T. Hara, “Replica allocation methods in ad hoc networks with data update,” Mobile Networks and Applications, vol. 8, no. 4, pp. 343–354, Aug. 2003.
[15] ——, “Replica allocation in ad hoc networks with periodic data update,” in Proceed-ings of International Conference on Mobile Data Management, 2002, pp. 79–86.
[16] M. Fiore, F. Mininni, C. Casetti, and C. F. Chiasserini, “To cache or not to cache?” in IEEE INFOCOM, 2009, pp. 235 – 243.
[17] S. De, “On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks,” IEEE Communications Letters, vol. 9, no. 11, pp. 1000–1002, Nov. 2005.
[18] “The Network Simulator NS-2,” http://www.isi.edu/nsnam/ns/.
[19] “IEEE 802.11,” http://standards.ieee.org/about/get/802/802.11.html.
[20] “Random waypoint model,” http://www.netlab.tkk.fi/ esa/java/rwp/rwpmodel.html.

指導教授

孫敏德

審核日期

2013-7-30

推文