無線機會網路下基於時間週期性之訊息傳送機制

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：71

、訪客IP：3.141.25.214

姓名

蕭歆儒(Hsin-Ju Hsiao) 查詢紙本館藏

畢業系所

通訊工程學系

論文名稱

無線機會網路下基於時間週期性之訊息傳送機制
(On Exploiting Temporal Periodicity for Message Delivery in Wireless Opportunistic Networks)

相關論文

★ 非結構同儕網路上以特徵相似度為基準之搜尋方法	★ 以階層式叢集聲譽為基礎之行動同儕網路拓撲架構
★ 線上RSS新聞資料流中主題性事件監測機制之設計與實作	★ 耐延遲網路下具密度感知的路由方法
★ 整合P2P與UPnP內容分享服務之家用多媒體閘道器：設計與實作	★ 家庭網路下簡易無縫式串流影音播放服務之設計與實作
★ 耐延遲網路下訊息傳遞時間分析與高效能路由演算法設計	★ BitTorrent P2P 檔案系統下載端網路資源之可調式配置方法與效能實測
★ 耐延遲網路中利用訊息編碼重組條件之資料傳播機制	★ 耐延遲網路中基於人類移動模式之路由機制
★ 車載網路中以資料匯集技術改善傳輸效能之封包傳送機制	★ 適用於交叉路口環境之車輛叢集方法
★ 車載網路下結合路側單元輔助之訊息廣播機制	★ 耐延遲網路下以靜態中繼節點（暫存盒）最佳化訊息傳遞效能之研究
★ 耐延遲網路下以動態叢集感知建構之訊息傳遞機制	★ 跨裝置影音匯流平台之設計與實作

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

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

摘要(中)

在無線機會網路下，網絡中的節點具有移動性並且透過無線感應來傳輸訊息，因此節點與節點之間並不存在一條始終保持連線的通道，進而形成破碎的網路拓樸。然而在這類的耐延遲網路中已有許多相關研究，其特殊的傳遞訊息方式— store-carry-and-forward，藉由節點機會性的相遇方式來傳遞訊息，因此對傳輸效能有極大的限制與影響。為了改善現有方法的傳輸效能，在這篇論文中，我們提出一個新的路由策略— 基於時間週期性之訊息傳送機制(TPMD)。TPMD 是一個基於週期特性所設計之路由策略，主要著重在節點的移動週期之紀錄、與過去不同的週期定義以及量化週期特性。後續的模擬中證明了TPMD 對於傳送效能有顯著的改善，即使是在條件較差的網路環境：節點的暫存空間小、訊息存活時間長。

摘要(英)

Wireless opportunistic networks represent mobile wireless networks that are generally characterized by broken topology, no end-to-end paths from a source to a destination. Although routing algorithms in this kind of Delay-tolerant networks (DTNs) are being increasingly designed, the network performance associated with store-carryand-forward is still limited because of opportunistic contacts. In this thesis, we propose a routing scheme in DTNs, named Temporal Periodicity for Message Delivery method (TPMD), for achieving greater performance than exist routing protocols. TPMD is a periodic routing, which focus on the characteristic of periodicity about movement, adjustment of common period definition and period quantification procedure, as a result of significance of temporal periodicity in DTNs. Finally, substantial simulations show that the TPMD can effectively improve network performance under a constrained environment with limited buffer size and prolonged TTL of messages in a network.

關鍵字(中)

★ 無線機會網路
★ 週期

關鍵字(英)

論文目次

1 Introduction 1
2 Related Work 3
2.1 Non-history-based Schemes . . . . . . . . . . . . . 3
2.2 History-based Schemes . . . . . . . . . . . . . . . 4
2.3 Period-based Schemes . . . . . . .. . . . . . . . . 6
3 Temporal Periodicity for Message Delivery Method(TPMD)7
3.1 Motivation . . . . . . . . . . . . . . . . . . . . 7
3.2 System Model . . . . . . . . . . . . . . . . . . . 8
3.3 Temporal Periodicity for Message Delivery . . . . . 9
3.3.1 Period Series . . . . . . . . . . . . . . . . . . 9
3.3.2 Similarity of Periodicity . . . . . . . . . . . 10
3.3.3 Message Transmitting Based on Periodicity . . . 11
4 Simulations 15
4.1 Simulator . . . . . . . . . . . . . . . . . . . . 15
4.2 Performance Metrics . . . . . . . . . . . . . . . 15
4.3 Mobility Model . . . . . . . . . . . . . . . . . 16
4.3.1 RandomWay Point . . . . . . . . . . . . . . . . 17
4.3.2 TVCM . . . . . . . . . . . . . . . . . . . . . . 17
4.3.3 Infocom06 . . . . . . . . . . . . . . . . . . . 18
4.3.4 NCU Trace . . . . . . . . . . . . . . . . . . . 18
4.4 Comparison Method . . . . . . . . . . . . . . . . 18
4.5 Environment Setting . . . . . . . . . . . . . . . 19
4.5.1 Parameters used in TPMD . . . . . . . . . . . . 19
4.5.2 Parameters used in Different Mobility Patterns . 21
5 Results and Analysis with Different Factors 22
5.1 Results with Different Values of TTL . . . . . . . 22
5.2 Results with Different Values of Buffer Size . . . 23
5.3 Conclusion of Different Variables in Environment . 23
5.4 Results with Different Message Generation Times . 25
5.5 Results with Different Time Units . . . . . . . . 26
6 Results and Analysis of Periodicity 42
6.1 Prior Periodicity Analysis . . . . . . . . . . . . 42
6.2 Analysis under Different Mobility Periodicity Patterns . . . . . . . . . . 43
6.3 Results with Different Values of . . . . . . . . . 43
7 Conclusions and Future Works 50
Bibliography 51

參考文獻

[1] A. G. and Voyiatzis, “A Survey of Delay- and Disruption-Tolerant Networking Applications,” Internet Engineering, vol. 5, no. 1, June 2012.
[2] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” SIGMOBILE Mob. Comput. Commun. Rev., vol. 7, no. 3, pp.19–20, Jul. 2003.
[3] K. Thilakarathna, A. C. Viana, A. Seneviratne, and H. Petander, “Mobile Social
Networking Through Friend-to- friend Opportunistic Content Dissemination,” in Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking
and Computing, ser. MobiHoc ’13. Bangalore, India: ACM, 2013, pp.263–266.
[4] P. Pholpabu and L.-L. Yang, “A mutual-community-aware routing protocol for mobile social networks,” in Proceeding of IEEE Global Communications Conference, Dec 2014, pp. 2917–2922.
[5] Q. Yuan, I. Cardei, and J. Wu, “Predict and Relay: An Efficient Routing in Disruption-tolerant Networks,” in Proceedings of the Tenth ACM International Symposium
on Mobile Ad Hoc Networking and Computing, ser. MobiHoc ’09. New Orleans, LA, USA: ACM, 2009, pp. 95–104.
[6] C. Liu and J. Wu, “Practical Routing in a Cyclic MobiSpace,” Proceeding of IEEE/ACM Transactions on Networking, vol. 19, no. 2, pp. 369–382, Apr 2011.
[7] E. Bulut and B. K. Szymanski, “Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks,” Proceeding of IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 12, pp. 2254–2265, Dec 2012.
[8] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Tech. Rep., 2000.
[9] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray andWait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,” in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, ser. WDTN ’05. Philadelphia, Pennsylvania, USA: ACM, 2005, pp. 252–259.
[10] G. K. W. Wong and X. Jia, “A novel socially-aware opportunistic routing algorithm in mobile social networks,” in 2013 International Conference on Computing,
Networking and Communications (ICNC), January 2013, pp. 514–518.
[11] J. Leguay, T. Friedman, and V. Conan, “Evaluating Mobility Pattern Space Routing for DTNs,” in Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, April 2006, pp. 1–10.
[12] K. Wei, S. Guo, D. Zeng, K. Xu, and K. Li, “Exploiting Small World Properties for Message Forwarding in Delay Tolerant Networks,” Proceeding of IEEE Transactions on Computers, vol. 64, no. 10, pp. 2809–2818, Oct 2015.
[13] E. Bulut, S. C. Geyik, and B. K. Szymanski, “Efficient routing in delay tolerant networks with correlated node mobility,” in The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010), Nov 2010, pp. 79–88.
[14] Z.Wang, M. A. Nascimento, and M. H. MacGregor, “Towards End-to-end Routing for Periodic Mobile Objects,” in Proceedings of the First ACM International Symposium
on Design and Analysis of Intelligent Vehicular Networks and Applications, ser. DIVANet ’11. Miami, Florida, USA: ACM, 2011, pp. 61–68.

[15] X. Zhang, J. Kurose, B. N. Levine, D. Towsley, and H. Zhang, “Study of a Busbased Disruption-tolerant Network: Mobility Modeling and Impact on Routing,” in Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking, ser. MobiCom ’07. ACM, 2007, pp. 195–206.
[16] Z. Wang, M. A. Nascimento, and M. H. MacGregor, “Discovering periodic patterns of nodal encounters in mobile networks ,” Pervasive and Mobile Computing, vol. 9, no. 6, pp. 892 – 912, 2013.
[17] J. Leguay, T. Friedman, and V. Conan, “DTN Routing in a Mobility Pattern Space,” in Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, ser. WDTN ’05. Philadelphia, Pennsylvania, USA: ACM, 2005, pp. 276–283.
[18] A. Keranen, J. Ott, and T. Karkkainen, “The ONE Simulator for DTN Protocol Evaluation,” in Proceedings of the 2nd International Conference on Simulation Tools and Techniques, ser. Simutools ’09. Rome, Italy: ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2009, pp. 55:1–55:10.
[19] Wei-JenHsu, T. Spyropoulos, K. Psounis, and A. Helmy, “Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks,” IEEE/ACM Transactions on Networking (TON), vol. 17, no. 5, pp. 1564–1577, Oct. 2009.
[20] P. Hui and J. Crowcroft, “How Small Labels Create Big Improvements,” in Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, 2007. PerCom Workshops ’07., March 2007, pp. 65–70.

指導教授

胡誌麟

審核日期

2017-1-19

推文