English  |  正體中文  |  简体中文  |  Post-Print筆數 : 20 |  Items with full text/Total items : 90029/119959 (75%)
Visitors : 24040458      Online Users : 160
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 學位論文 >  Item 140.119/61495
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/61495

    Title: 校園環境中基於社群資料之耐延遲網路傳輸策略
    Campus Environment Social-based routing in Delay Tolerant Network
    Authors: 林宇軒
    Lin, Yu Hsuan
    Contributors: 蔡子傑
    Tsai, Tzu Chieh
    Lin, Yu Hsuan
    Keywords: 耐延遲網路
    Delay Tolerant Networks
    Campus environment
    personal information
    Date: 2013
    Issue Date: 2013-11-01 11:44:49 (UTC+8)
    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.
    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.
    Description: 碩士
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G1007530381
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File SizeFormat
    038101.pdf1508KbAdobe PDF142View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback