簡易檢索 / 詳目顯示

研究生: 簡貝安
Bei-An Jian
論文名稱: 在一般性行動社交網路中考量短暫社群與社會關係的混合式資料轉送
Hybrid Data Forwarding Considering Transient Community and Social Relationship in Generalized Mobile Social Networks
指導教授: 鄭欣明
Shin-ming Cheng
口試委員: 陳秋華
Chyou-hwa Chen
金台鈴
Tai-lin Chin
邱舉明
Ge-ming Chiu
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2016
畢業學年度: 104
語文別: 英文
論文頁數: 36
中文關鍵詞: 短暫性社群一般性行動社群網路社交關係資料轉發
外文關鍵詞: Transient Community, Generalized Mobile Social Networks, Social Relationship, Data Forwarding
相關次數: 點閱:144下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

隨著社群多媒體以及行動裝置 (智慧型手機、平板) 的迅速發展,一般性行動社群網路 (GMSNs) 已經發展為兩層的社群網路。在短暫性社群網路 (Delay-Tolerant Networks 容遲網路) 中已經有許多有效率的資料轉發方法,但在雙層的GMSNs上只有少數方法。在這篇論文中,我們提出了一個結合短暫性社群(Delay-Tolerant Networks)以及社會關係(Online Social Networks)的資料轉發方式稱作Double Bubble。和其他文獻不同的是,Double Bubble 不僅在雙層之間做資料傳送也在兩層間做資訊交換。在雙層社群網路下的社群資訊交換對於資料轉發造成加乘的效果。除此之外,我們更提出了第二種用來幫助離群者接收到訊息的附加方法。在此,我們利用四個真實世界行走軌跡搭配四種不同的資料轉發方法進行模擬。在一般的資料轉發效能評估外,我們也對資訊量的交換成本做了測量。


By the rapidly increasing of social media and mobile devices (smart phone, tablet), the Generalized Mobile Social Network is extended to two-tier social networks. There are many efficient data forwarding schemes in transient community networks (Delay-Tolerant Networks), but there aren't many data forwarding schemes in two-tier GMSNs. In this paper, we proposed a two-tier GMSNs data forwarding scheme which combined Transient Community (Delay-Tolerant Networks) and Social Relationship (Online Social Networks), called Double Bubble. Different from other literature, Double Bubble does data transmission and information exchange in both two tiers. The two-tier social information exchange makes the synergy effect on data forwarding. Moreover, our second method is affiliated with a new idea which helps lonely people receiving messages.
In this paper, we do the simulation on four real-world traces with four data forwarding strategy, and we also do signal exchange measurement in addition to typical performance metrics in data forwarding.

Chinese Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 List of Illustrations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2 Related Works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.1 One-tier Data Transmission . . . . . . . . . . . . . . . . . . . . . . . 11 2.1.1 No Information . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.1.2 Local Information . . . . . . . . . . . . . . . . . . . . . . . . 12 2.1.3 Global Information . . . . . . . . . . . . . . . . . . . . . . . . 13 2.2 Two-tier Data Transmission . . . . . . . . . . . . . . . . . . . . . . . 13 2.2.1 No Information . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.2.2 Global Information . . . . . . . . . . . . . . . . . . . . . . . . 14 3 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.1 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Performance metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4 Our Proposed . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.1 Double Bubble . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.1.1 Social Community and Centrality . . . . . . . . . . . . . . . . 18 4.1.2 Messages Packet Cost Control . . . . . . . . . . . . . . . . . . 18 4.1.3 Expand to Two-tier . . . . . . . . . . . . . . . . . . . . . . . . 20 4.2 Isolated Node Helper . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 4.2.1 How to choose isolated node . . . . . . . . . . . . . . . . . . . 22 4.2.2 Isolated Node Helper . . . . . . . . . . . . . . . . . . . . . . . 23 5 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 5.1 Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 5.2 Simulation Setup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 5.3 Experiment Results and Analysis . . . . . . . . . . . . . . . . . . . . 27 6 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34

[1] N. Kayastha, D. Niyato, P. Wang, and E. Hossain, “Applications, architectures,
and protocol design issues for mobile social networks: A survey,” Proceedings
of the IEEE, vol. 99, no. 12, pp. 2130–2158, Dec. 2011.
[2] E. Daly and M. Haahr, “Social network analysis for routing in disconnected
delay-tolerant MANETs,” in Proc. ACM MobiHoc, Sept. 2007, pp. 32–40.
[3] P. Hui, J. Crowcroft, and E. Yoneki, “BUBBLE Rap: Social-based forwarding
in delay-tolerant networks,” IEEE Trans. Mobile Comput., vol. 10, no. 11, pp.
1576–1589, Nov. 2011.
[4] E. Bulut and B. K. Szymanski, “Exploiting friendship relations for efficient
routing in mobile social networks,” IEEE Trans. Parallel Distrib. Syst., vol. 23,
no. 12, pp. 2254–2265, Dec. 2012.
[5] Z. Li, C. Wang, S. Yang, C. Jiang, and X. Li, “LASS: Local-activity and socialsimilarity
based data forwarding in mobile social networks,” IEEE Trans. Parallel
Distrib. Syst., vol. 26, no. 11, pp. 174–184, Jan. 2015.
[6] A. Vahdat and D. Becker, “Epidemic routing for partially-connected ad hoc
networks,” Duke University, Tech. Rep. CS-200006, Apr. 2000.
[7] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and Wait: An
efficient routing scheme for intermittently connected mobile networks,” in Proc.
ACM SIGCOMM WDTN, Aug. 2005, pp. 252–259.
[8] A. Lindgren, A. Doria, and O. Schelén, “Probabilistic routing in intermittently
connected networks,” ACM SIGMOBILE MC2R, vol. 7, no. 3, pp. 19–20, July
2003.
[9] S.-M. Cheng, W. C. Ao, P.-Y. Chen, and K.-C. Chen, “On modeling malware
propagation in generalized social networks,” IEEE Commun. Lett., vol. 15,
no. 1, pp. 25–27, Jan. 2011.
34
[10] Y. E. Sagduyu and Y. Shi, “Navigating a mobile social network,” IEEE Commun.
Mag., vol. 22, no. 5, pp. 122–128, Oct. 2015.
[11] Z. Li, C. Wang, S. Yang, C. Jiang, and I. Stojmenovic, “Space-Crossing:
Community-based data forwarding in mobile social networks under the hybrid
communication architecture,” IEEE Trans. Wireless Commun., vol. 14, no. 9,
pp. 4720–4727, Sept. 2015.
[12] S. CC, V. Raychoudhury, G. Marfia, and A. Singla, “A survey of routing and
data dissemination in delay tolerant networks,” Journal of Network and Computer
Applications, vol. 67, pp. 128–146, May 2016.
[13] G. Palla, I. Derényi, I. Farkas, and T. Vicsek, “Uncovering the overlapping
community structure of complex networks in nature and society,” Nature, vol.
435, no. 7043, pp. 814–818, Jan. 2005.
[14] M. E. J. Newman, “Analysis of weighted networks,” Phys. Rev. E, vol. 70, no. 5,
p. 056131, Nov. 2004.
[15] A.-K. Pietilänen and C. Diot, “CRAWDAD dataset thlab/ sigcomm2009
(v. 2012-07-15),” Downloaded from http:// crawdad.org/ thlab/ sigcomm2009/
20120715, July 2012.
[16] G. Bigwood, T. Henderson, D. Rehunathan, M. Bateman, and S. Bhatti,
“CRAWDAD dataset st_andrews/sassy (v. 2011-06-03),” Downloaded from
http://crawdad.org/st_andrews/sassy/20110603, June 2011.
[17] R. I. Ciobanu and C. Dobre, “CRAWDAD dataset upb/mobility2011 (v. 2012-
06-18),” Downloaded from http://crawdad.org/upb/mobility2011/20120618,
June 2012.
[18] A. Caputo, A. Socievole, and F. D. Rango, “CRAWDAD dataset unical/socialblueconn
(v. 2015-02-08),” Downloaded from http://crawdad.org/unical/
socialblueconn/20150208, Feb. 2015.
[19] A. Keränen, J. Ott, and T. Kärkkäinen, “The ONE simulator for DTN protocol
evaluation,” in Proc. Simutools ’09, no. 55, 2009, pp. 1–10.

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