1. NCCU Academic Hub
  2. Publications
  3. College of Informatics
  4. Theses
  5. Item

Publications-Theses

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 校園環境中基於社群資料之耐延遲網路傳輸策略
Campus Environment Social-based routing in Delay Tolerant Network
作者 林宇軒
Lin, Yu Hsuan
貢獻者 蔡子傑
Tsai, Tzu Chieh
林宇軒
Lin, Yu Hsuan
關鍵詞 耐延遲網路
校園環境
社群
個人資訊
傳輸
Delay Tolerant Networks
Campus environment
social
personal information
transmission
日期 2013
上傳時間 1-Nov-2013 11:44:49 (UTC+8)
摘要 在耐延遲網路中，沒有網路服務的使用者，可以藉由各節點間的短距離傳送，透過一個間斷性的連結將資料傳送至目的地。因此，在本研究，當使用者在校園環境中，欲將手邊的資料傳送給其他使用者，但無法連結上網際網路時，可以透過與目標節點關聯性較高的節點幫忙以達到傳送資料之目的。
本論文提出一基於個人與社群資訊的資料傳送方法，以個人興趣、個人資訊與朋友關係等三個面向去分析適合用來幫助傳送資料的節點。在每個訊息中，我們加入一級別值，並在相遇到其他節點時做資訊的交換與計算，並利用選擇較高級別值的節點轉送，使資料可以透過較有效率的路線傳送至目的地。最後，我們將本論文方法與其它資料傳送方法比較評估效能，模擬結果顯示我們提出的傳送方法有較優的傳送成功率與較低的資源耗費。
In Delay Tolerant Networks (DTNs), the user without network service can, through short transmission between nodes, use an intermittent route to deliver messages to the destination. In our study, when a user in the campus environment wants to send its data to others but can’t link to Internet in that moment, the user can use the node which has higher relation degree with the destination to help forward the data.

In this thesis, we proposed a social-based routing approach. It is based on aspects of personal interest, personal information, and social relation to analyze which node is appropriate for data relaying. For each data, a rank value is associated with it. When the node encounters with other nodes, it will exchange and calculate data information to renew the rank value. Based on the rank value, data can be relayed to nodes with higher rank values, and thus to the destination through a more efficient way. Finally, we evaluated our approach, and compared with other routing schemes. The simulation results showed that our proposed approach had better delivery probability and lower resource cost.
參考文獻 [1] N. Eagle and A. Pentland. Reality mining: sensing complex social systems. Personal and Ubiquitous Computing, Vol 10(4):255–268, May 2006.
[2] Zhensheng Zhang. Routing in Intermittently Connected Mobile Ad Hoc Networks and Delay Tolerant Networks: Overview and Challenges. IEEE Communications Surveys & Tutorials, 8(1):24–37, 2006.
[3] Christoph P. Mayer. Hybrid Routing in Delay Tolerant Networks. KIT Scientific Publishing, July 3, 2012.
[4] Bulut. E, Szymanski, B.K., “Friendship Based Routing in Delay Tolerant Mobile Social Networks” in Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE.
[5] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble rap: Social-based forwarding in delay tolerant networks,” in Proc. ACM MobiHoc, 2008, pp. 241–250.
[6] Jiuxin Cao, Liu Yang, Xiao Zheng, Bo Liu, Lei Zhao, Xudong Ni, Fang Dong and Bo Mao, “Social attribute based web service information publication mechanism in Delay Tolerant Network,” in IEEE International Conference on Computational Science and Engineering CSE/I-SPAN
[7] VAHDAT, A., AND BECKER, D. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000).
[8] LINDGREN, A., DORIA, A., AND SCHELÉN, O. Probabilistic routing in intermittently connected networks. Lecture Notes in Computer Science 3126 (2004), 239–254.
[9] SPYROPOULOS, T., PSOUNIS, K., AND RAGHAVENDRA, C. S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In proc. WDTN ’05 (2005), ACM Press, pp. 252–259.
[10] A. Mtibaa, M. May, M. Ammar, and C. Diot. PeopleRank: combining social and contact information for opportunistic forwarding. INFOCOM, 2010.
[11] S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In Seventh International World Wide Web Conference, Brisbane, Australia, 1998.
[12] K. Jahanbakhsh, G.C. Shoja, V. King, Social-greedy: a socially-based greedy routing algorithm for delay tolerant networks, MobiOpp’10: Proceedings of the Second International Workshop on Mobile Opportunistic Networking, ACM, New York, NY, USA (2010), pp. 159–162
[13] Karinthy, Frigyes. Chain-Links. Translated from Hungarian and annotated by Adam Makkai and Enikö Jankó.
[14] Ari Keränen, Jörg Ott, Teemu Kärkkäinen, “The ONE Simulator for DTN Protocol Evaluation”, In Proc. SimuTools, March 2009.
[15] N. Eagle, A. Pentland, and D. Lazer (2009), Inferring Social Network Structure using Mobile Phone Data, Proceedings of the National Academy of Sciences (PNAS),106(36), pp. 15274-15278.
[16] Pan Hui, People are the network: experimental design and evaluation of social-based forwarding algorithms, Computer Laboratory Technical Reports - Cambridge University(2008)
[17] P. Jaccard. ´Etude comparative de la distribution florale dans une portion des alpes et des jura. Bulletin del la Soci´et´e Vaudoise des Sciences Naturelles, 37:547–579, 1901.
[18] J. Kleinberg. The small-world phenomenon: an algorithm perspective. In TOC ’00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 163–170, New York, NY, USA, 2000. ACM.
[19] S. Milgram. The small world problem. Psychology Today, 1:60–67, 1967.
[20] T. Zhou, R. R. Choudhury, K. Chakrabarty, Diverse Routing: Exploiting Social Behavior for Routing in Delay-Tolerant Networks, Pro. Conf. Computational Science and Engineering, Canada, 2009.
描述 碩士
國立政治大學
資訊科學學系
100753038
102
資料來源 http://thesis.lib.nccu.edu.tw/record/#G1007530381
資料類型 thesis
dc.contributor.advisor 蔡子傑zh_TW
dc.contributor.advisor Tsai, Tzu Chiehen_US
dc.contributor.author (Authors) 林宇軒zh_TW
dc.contributor.author (Authors) Lin, Yu Hsuanen_US
dc.creator (作者) 林宇軒zh_TW
dc.creator (作者) Lin, Yu Hsuanen_US
dc.date (日期) 2013en_US
dc.date.accessioned 1-Nov-2013 11:44:49 (UTC+8)-
dc.date.available 1-Nov-2013 11:44:49 (UTC+8)-
dc.date.issued (上傳時間) 1-Nov-2013 11:44:49 (UTC+8)-
dc.identifier (Other Identifiers) G1007530381en_US
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/61495-
dc.description (描述) 碩士zh_TW
dc.description (描述) 國立政治大學zh_TW
dc.description (描述) 資訊科學學系zh_TW
dc.description (描述) 100753038zh_TW
dc.description (描述) 102zh_TW
dc.description.abstract (摘要) 在耐延遲網路中，沒有網路服務的使用者，可以藉由各節點間的短距離傳送，透過一個間斷性的連結將資料傳送至目的地。因此，在本研究，當使用者在校園環境中，欲將手邊的資料傳送給其他使用者，但無法連結上網際網路時，可以透過與目標節點關聯性較高的節點幫忙以達到傳送資料之目的。
本論文提出一基於個人與社群資訊的資料傳送方法，以個人興趣、個人資訊與朋友關係等三個面向去分析適合用來幫助傳送資料的節點。在每個訊息中，我們加入一級別值，並在相遇到其他節點時做資訊的交換與計算，並利用選擇較高級別值的節點轉送，使資料可以透過較有效率的路線傳送至目的地。最後，我們將本論文方法與其它資料傳送方法比較評估效能，模擬結果顯示我們提出的傳送方法有較優的傳送成功率與較低的資源耗費。		zh_TW
dc.description.abstract (摘要) In Delay Tolerant Networks (DTNs), the user without network service can, through short transmission between nodes, use an intermittent route to deliver messages to the destination. In our study, when a user in the campus environment wants to send its data to others but can’t link to Internet in that moment, the user can use the node which has higher relation degree with the destination to help forward the data.

In this thesis, we proposed a social-based routing approach. It is based on aspects of personal interest, personal information, and social relation to analyze which node is appropriate for data relaying. For each data, a rank value is associated with it. When the node encounters with other nodes, it will exchange and calculate data information to renew the rank value. Based on the rank value, data can be relayed to nodes with higher rank values, and thus to the destination through a more efficient way. Finally, we evaluated our approach, and compared with other routing schemes. The simulation results showed that our proposed approach had better delivery probability and lower resource cost.		en_US
dc.description.tableofcontents CHAPTER 1 Introduction 2
1.1 Background & Motivation 2
1.2 Objective 4
CHAPTER 2 Related Work 5
2.1 Social Trace Data 5
2.1.1. MIT reality 5
2.1.2. Cambridge 5
2.1.3. Infocom05、06 5
2.2 Social based in Delay-Tolerant Networks 6
2.2.1 The anatomy of a large-scale hypertextual Web search engine 6
2.2.2 PeopleRank: Social Opportunistic Forwarding 6
2.2.3 Social-Greedy: A Socially-Based Greedy Routing Algorithm for Delay Tolerant Networks 7
CHAPTER 3 Social-based Routing Approach 8
3.1 Environment define 8
3.2 Data replicate and receive strategy 10
3.3 Rank calculate in social-based routing: 13
CHAPTER 4 Simulation Results 17
4.1 Simulation Environment 17
4.2 Simulation Setting 17
4.3 Simulation Result 19
4.3.1. Performance of different routing method in our environment 19
4.3.2. Performance of different buffer size in our environment 22
4.3.3. Performance of different personal data weight distribute in our environment 24
CHAPTER 5 Conclusions and Future Work 26
REFERENCE 26		zh_TW
dc.format.extent 1545116 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.source.uri (資料來源) http://thesis.lib.nccu.edu.tw/record/#G1007530381en_US
dc.subject (關鍵詞) 耐延遲網路zh_TW
dc.subject (關鍵詞) 校園環境zh_TW
dc.subject (關鍵詞) 社群zh_TW
dc.subject (關鍵詞) 個人資訊zh_TW
dc.subject (關鍵詞) 傳輸zh_TW
dc.subject (關鍵詞) Delay Tolerant Networksen_US
dc.subject (關鍵詞) Campus environmenten_US
dc.subject (關鍵詞) socialen_US
dc.subject (關鍵詞) personal informationen_US
dc.subject (關鍵詞) transmissionen_US
dc.title (題名) 校園環境中基於社群資料之耐延遲網路傳輸策略zh_TW
dc.title (題名) Campus Environment Social-based routing in Delay Tolerant Networken_US
dc.type (資料類型) thesisen
dc.relation.reference (參考文獻) [1] N. Eagle and A. Pentland. Reality mining: sensing complex social systems. Personal and Ubiquitous Computing, Vol 10(4):255–268, May 2006.
[2] Zhensheng Zhang. Routing in Intermittently Connected Mobile Ad Hoc Networks and Delay Tolerant Networks: Overview and Challenges. IEEE Communications Surveys & Tutorials, 8(1):24–37, 2006.
[3] Christoph P. Mayer. Hybrid Routing in Delay Tolerant Networks. KIT Scientific Publishing, July 3, 2012.
[4] Bulut. E, Szymanski, B.K., “Friendship Based Routing in Delay Tolerant Mobile Social Networks” in Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE.
[5] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble rap: Social-based forwarding in delay tolerant networks,” in Proc. ACM MobiHoc, 2008, pp. 241–250.
[6] Jiuxin Cao, Liu Yang, Xiao Zheng, Bo Liu, Lei Zhao, Xudong Ni, Fang Dong and Bo Mao, “Social attribute based web service information publication mechanism in Delay Tolerant Network,” in IEEE International Conference on Computational Science and Engineering CSE/I-SPAN
[7] VAHDAT, A., AND BECKER, D. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000).
[8] LINDGREN, A., DORIA, A., AND SCHELÉN, O. Probabilistic routing in intermittently connected networks. Lecture Notes in Computer Science 3126 (2004), 239–254.
[9] SPYROPOULOS, T., PSOUNIS, K., AND RAGHAVENDRA, C. S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In proc. WDTN ’05 (2005), ACM Press, pp. 252–259.
[10] A. Mtibaa, M. May, M. Ammar, and C. Diot. PeopleRank: combining social and contact information for opportunistic forwarding. INFOCOM, 2010.
[11] S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In Seventh International World Wide Web Conference, Brisbane, Australia, 1998.
[12] K. Jahanbakhsh, G.C. Shoja, V. King, Social-greedy: a socially-based greedy routing algorithm for delay tolerant networks, MobiOpp’10: Proceedings of the Second International Workshop on Mobile Opportunistic Networking, ACM, New York, NY, USA (2010), pp. 159–162
[13] Karinthy, Frigyes. Chain-Links. Translated from Hungarian and annotated by Adam Makkai and Enikö Jankó.
[14] Ari Keränen, Jörg Ott, Teemu Kärkkäinen, “The ONE Simulator for DTN Protocol Evaluation”, In Proc. SimuTools, March 2009.
[15] N. Eagle, A. Pentland, and D. Lazer (2009), Inferring Social Network Structure using Mobile Phone Data, Proceedings of the National Academy of Sciences (PNAS),106(36), pp. 15274-15278.
[16] Pan Hui, People are the network: experimental design and evaluation of social-based forwarding algorithms, Computer Laboratory Technical Reports - Cambridge University(2008)
[17] P. Jaccard. ´Etude comparative de la distribution florale dans une portion des alpes et des jura. Bulletin del la Soci´et´e Vaudoise des Sciences Naturelles, 37:547–579, 1901.
[18] J. Kleinberg. The small-world phenomenon: an algorithm perspective. In TOC ’00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 163–170, New York, NY, USA, 2000. ACM.
[19] S. Milgram. The small world problem. Psychology Today, 1:60–67, 1967.
[20] T. Zhou, R. R. Choudhury, K. Chakrabarty, Diverse Routing: Exploiting Social Behavior for Routing in Delay-Tolerant Networks, Pro. Conf. Computational Science and Engineering, Canada, 2009.		zh_TW