簡易檢索 / 詳目顯示

研究生: 吳昱仁
Yu-ren Wu
論文名稱: 人群接觸網路上以長時間連線為核心之傳輸策略
Exploiting Long-Duration Contacts for Opportunistic Network Routing
指導教授: 陳秋華
Chyouhwa Chen
鄧惟中
Wei-Chung Teng
口試委員: 李育杰
Yuh-Jye Lee
鮑興國
Hsing-Kuo Pao
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2013
畢業學年度: 101
語文別: 中文
論文頁數: 45
中文關鍵詞: 機會網路社群網路
外文關鍵詞: Delay tolerant networks, social network
相關次數: 點閱:255下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

由於手機,平板電腦等具備網路功能的智慧型可攜式裝置之日益普及,由人類或其他實體裝置共同形成的新型態網路已日漸成為可能。由於此類型網路的連接是間歇性的(intermittent),亦即不穩定的連線,文獻中將此種新型網路稱之為人群接觸網路(human contact network)[21]或延遲容忍網路(delay tolerant network)[22,9,23]或機會性行動網路(opportunistic mobile network)[24]。由於此類的網路連線的不穩定性,使得傳統建立和更新路由表的方法已失去效用。在這樣的網路上,資訊從發送端傳輸到目的地,只能先傳輸到其他中間節點,作為到目的地的中繼站,透過中繼站與下一中繼站或與目的地接觸的機會達到資訊傳輸的目的。因此,建構此類系統的關鍵,是下一個中繼站選擇的策略,以有效地進行資料傳送。
文獻中,針對此類系統的設計,已有非常多的方法被發表,分別提出各種不同的演算法與效能評估。近來,一些根據社會網路分析(social network analysis)的設計,顯示較之前方法更優異的效能。社會網路分析是一種研究社會結構、組織系統、人際關係、團體互動的概念與方法,是在社會計量學基礎上所發展出來的分析方法。由於人們在社會結構中具有特定與功能,並依此地位和與其他人們互動,文獻中針對社會結構在資訊流通與影響力的傳播的分析,也是一個熱門的議題[25]。因此,人群接觸網路的設計,也希望透過捕捉人們的社會特徵,建立社群的資訊,並利用這些社群的資訊設計路由演算法,可據以設計網路傳輸演算法,達到高效率的資料傳輸。


In recent years, it has become prevalent for people to carry a multitude of mobile devices. These devices can be networked to forms a novel, infra-structureless network that is called human contact network, or delay tolerant Networks. For such scenarios, end-to-end delivery through traditional routing algorithms is generally not applicable, because mobility is often unpredictable, and topology structure is highly dynamic.
A number of recent works have proposed to exploit the social behavior inherent with human beings for data dissemination. Two important social metrics, community and centrality, have been extensively studied to characterize human social behavior in social network analysis literature. These metrics have been exploited by the information dissemination systems to select forwarding paths, and have achieved good success. However, there is still much room for improvement for these early social-based approaches. For example, most of the systems operate based on social metrics calculated using a summarization of the contact history. These calculations do not reflect the dynamic and temporal nature of the human contacts.

誌謝 摘要 Abstract 目錄 圖表目錄 1緒論 …………………………………………………………………………1 2基礎的演算法 ………………………………………………………………3 2.1流行病演算法…………………………………………………………3 2.2發散而且等待演算法…………………………………………………5 3相關議題 ……………………………………………………………………7 3.1實驗資料………………………………………………………………8 3.2測量方法與分析………………………………………………………9 4改良演算法 …………………………………………………………………10 4.1長時間性連結的分析…………………………………………………11 4.2陌生人的分析與效用…………………………………………………17 4.3演算法…………………………………………………………………19 5實驗效能……………………………………………………………………25 5.1環境參數 ……………………………………………………………25 5.2實驗效能評估 ………………………………………………………26 6結論 …………………………………………………………………………43 7 未來的研究方向……………………………………………………………43 8 參考文獻 ……………………………………………………………… 44

[1] P. Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein,
“Energy-efficient computing for wildlife tracking: design tradeoffs and
early experiences with zebranet,” in ACM ASPLOS-X, 2002.
[2] P. Basu and T. D. C. Little, “Networked parking spaces: architecture
and applications,” in IEEE VTC, 2002.
[3] A. Vahdat and D. Becker, “Epidemic routing for partially connected
ad hoc networks,” Technical Report CS-200006, Duke University, April 2000.
[4] T. Spyropoulos, K. Psounis and C.S.Raghavendra, Spray and wait: Efficient routing in intermittently connected mobile networks. In Proceedings of ACMSIGCOMM workshop on Delay Tolerant Networking (WDTN), 2005
[5]A. Lindgren, A. Doria, and O. Schel’en, “Probabilistic routing in intermittently
connected networks,” SIGMOBILE Mob. Comput. Commun.
Rev., vol. 7, no. 3, pp. 19–20, July 2003
[6]V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, “Diversity of
forwarding paths in pocket switched networks,” in IMC, 2007.
[7] M. E. J. Newman, “The structure and function of complex networks,”
SIAM Review, vol. 45, pp. 167–256, March 2003.
[8] E. M. Daly and M. Haahr, “Social network analysis for routing in
disconnected delay-tolerant manets,” in ACM MobiHoc, 2007.
[9] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble rap: Social-based forwarding
in delay tolerant networks,” in ACM MobiHoc, 2008.
[10] L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman,
“Search in power-law networks,” Phys. Rev. E, vol. 64, no. 4, Sep 2001.3
[11] N. Eagle and A. Pentland. Reality mining: sensing complex
social systems. Personal and Ubiquitous Computing,V10(4):255–268, May 2006.
[12]A. Chaintreau, P. Hui, et al. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proc.
INFOCOM, April 2006.
[13] P. Hui, A. Chaintreau, et al. Pocket switched networks and human mobility in conference environments. In Proc. WDTN, 2005.
[14] J. Leguay, A. Lindgren, et al. Opportunistic content distribution in an urban setting. In ACM CHANTS, pages 205–212, 2006.
[15]F. Li and J. Wu, LocalCom: a community-based epidemic forwarding
scheme in disruption-tolerant networks, in Proceedings of SECON, p.574-582, June 22-26, 2009.
[16 ]Wei Gao, Guohong Cao,Tom La Porta, and Jiawei Han, "On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks", in IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 1, JANUARY 2013
[17] M. McNett and G. Voelker, “Access and Mobility of Wireless PDA Users,” ACM SIGMOBILE Mobile Computing and Comm. Rev.,vol. 9, no. 2, pp. 40-55, 2005.
[18]Pagani E, Rossi GP (2012) Utility-based Forwarding: a Comparison in different mobility scenarios. In: Third international workshop on mobile opportunistic networks, Zurich, Switzerland, 15–16 March 2012
[19] G. Zyba, G. M. Voelker, S. Ioannidis, and C. Diot. Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd. In IEEE INFOCOMM, 2011.
[20] S. Gaito, E. Pagani, and G. P. Rossi. Strangers help friends to communicate in opportunistic networks. Computer Networks, 55(2):374-385, 2011.
[21]N. Sastry, D. Manjunath, J. Crowcroft and K. Sollins, "Data Delivery Properties of Human Contact Networks", IEEE Transactions on Mobile Computing, vol. 10, no. 6, pp. 868-880, Jun. 2011
[22]Theus Hossmann, Thrasyvoulos Spyropoulos, and Franck Legendre, “Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing,” in Proceedings of IEEE INFOCOM 2010
[23] Ying Zhu, Bin Xu, Xinghua Shi, and Yu Wang, A Survey of Social-based Routing in Delay Tolerant Networks: Positive and Negative Social Effects, IEEE Communications Surveys and Tutorials, 2012
[24]Anna Kaisa Pietilainen, Christophe Diot, Dissemination in Opportunistic Social Networks: The Role of Temporal Communities, ACM MobiHoc 2012
[25]Ian X.Y. Leung, Pan Hui, Pietro Lio' and Jon Crowcroft, Towards Real Time Community Detection in Large Networks, Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), Vol. 79, No. 6. 2009

無法下載圖示 全文公開日期 2018/08/05 (校內網路)
全文公開日期 本全文未授權公開 (校外網路)
全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
QR CODE