政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/110148
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 113318/144297 (79%)
造访人次 : 50955243      在线人数 : 954
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/110148


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/110148


    题名: 基於社群聯盟並有地理輔助之耐延遲網路的路由協定
    A novel DTN routing by social ally with geographic enhancement
    作者: 羅文卿
    贡献者: 蔡子傑
    羅文卿
    关键词: 耐延遲網路
    社交模式
    地理資訊
    路由協定
    Delay Tolerant Network
    Social-based
    Social ally
    Routing
    Geographic
    日期: 2014
    上传时间: 2017-06-01 09:53:15 (UTC+8)
    摘要: 在DTN(Delay Tolerant Networks)這類的網路架構下，無線節點之
    間的通訊連線是採非連續性建立的。DTN 路由協定中, 決定中繼節點
    方式大致可以分成兩類:依地理位置考量的路由協定（Geographic Routing Protocal）和依社交模式考量的路由協定（Social-based Routing Portocal）。
    由於人與人間的互動是透過社交關係, 但是真實的資訊傳遞又須 仰賴當時的地理位置。因此我們提出的演算法將網路拓墣分成社交層與地理層, 在社交層中利用Social Ally Selection Algorithm 挑選出合適的社交盟友(Social Ally)。在地理層中利用Geographic Messenger Forwarding Algorithm 挑選合適的節點將訊息傳送給朝向目的地或是社交中繼站的節點。根據實驗模擬結果, 我們的路由協定能有較佳的傳遞成功率, 並降低了延遲時間。
    Delay Tolerant networks (DTN) may lack continuous network connectivity. Most of these DTN routing protocol, which attempt to make better routing decision, could be divided in two categories: Geographic routing protocols and Social-based routing protocols.
    Due to the interaction between people through social behaviors and message transmissions rely on geographic position information, we proposed a routing protocol which network topology is divided into two sub layers: social layer and geographic layer. In social layer, we propose a Social Ally Selection Algorithm to decide social allies that are controlled to improve delivery performance. In geographic layer, we propose a Geographic Messenger Forwarding Algorithm to transmit message to the nodes moving toward to social ally or destination. According to the simulation results, we could show that our routing protocol have higher delivery ratio and lower delay latency compare to other protocols.
    參考文獻: [1] Jian Shen, Sangman Moh, Ilyong Chung, “Routing Protocols in Delay Tolerant Networks: A Comparative Survey”, The 23rd International Technical Conference on Circuits/Systems,Computers and Communications, pp. 1577 - 1580, 8 July, 2008
    [2] E.P.C. Jones and P.A.S ward, “Routing Strategies for Delay-Tolerant Networks”, Submitted to Computer Communacation Review,2008
    [3] A. Vahdat and D. Becker, “Epidemic routing for partially connected ad hoc networks,” Duke University Technical Report CS-200006, April 2000.

    [4] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” in WDTN ’05: Proc. 2005 ACM SIGCOMM workshop on Delay-tolerant networking, 2005, pp. 252–259.

    [5] J. Lebrun, C.-N. Chuah, D. Ghosal, and M. Zhang, “Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks”, in Proceedings of IEEE Vehicular Technology Conference (VTC), vol. 4, pp. 2289–2293, May 2005.
    [6] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic routing in intermittently connected networks”, in Proc. First International Workshop on Service Assurance with Partial and Intermittent Resources, pp. 239––254,2004.
    [7] H. Dang and H. Wu, “Clustering and Cluster-Based Routing Protocol for Delay-Tolerant Mobile Networks”, IEEE Transactions on Wireless Communications, Vol. 9, No.6, pp.1874–1881, June 2010.
    [8] P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, “Pocket switched networks and human mobility in conference environments”, in Proc. ACM SIGCOMM Workshop on DTN and Related Topics, pp. 244––251, 2005.
    [9] C. Liu and J. Wu, “Scalable routing in delay tolerant networks”, in Proc.ACM MobiHoc, 2007.
    [10] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of human mobility on the design of opportunistic forwarding algorithms”, in Proc. IEEE INFOCOM, pp. 1––13, 2006.
    [11] M. Kim, D. Kotz, and S. Kim, “Extracting a mobility model from real user traces”, in Proc. IEEE INFOCOM, pp. 1––13, 2006.
    [12] T. Spyropoulos, K. Psounis, and C. Raghavendra, “Performance analysis of mobility-assisted routing”, in Proc. MobiHoc’06: 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing,pp. 49––60, 2006.
    [13] J. Leguay, T. Friedman, and V. Conan, “DTN routing in a mobility pattern space”, in Proc. WDTN‘05: 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, pp. 276––283, 2005.
    [14] Ari Keränen, Jörg Ott, Teemu Kärkkäinen, “The ONE Simulator for DTN Protocol Evaluation”, in SIMUTools’09: 2nd International Conference on Simulation Tools ans Techniques, Rome, March 2-6,2009
    [15] H. Zhu, X. Lin, R. Lu, and X. Shen, “A secure incentive scheme for delay tolerant networks,” in Proc. 3rd International Conference on Communications and Networking in China (ChinaCom), Aug. 2008.
    [16] H. Zhu, X. Lin, R. Lu, Y. Fan, and X. Shen, “Smart: A secure multilayer credit-based incentive scheme for delay-tolerant networks,” IEEE Trans. Veh. Technol., vol. 58, no. 8, pp. 4628–4639, Oct. 2009.
    [17] P. Hui and J. Crowcroft, “How small labels create big improvements,” in International Workshop on Intermittently Connected Mobile Ad hoc Networks in conjunction with IEEE PerCom 2007, March 19-23, 2007.
    [18] E. M. Daly and M. Haahr, “Social network analysis for routing in disconnected delay-tolerant manets,” in MobiHoc ’07 Proc. 8th ACM international symposium on Mobile ad hoc networking and computing, 2007.
    [19] P. Hui, J. Crowcroft, and E. Yonek, “Bubble rap: Social-based for- warding in delay tolerant networks,” in Proc. 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), May, 2008.
    [20] W. Zhao, M. Ammar, and E. Zegura, “A message ferrying approach for data delivery in sparse mobile ad hoc networks,” in MobiHoc ’04: Proc. 5th ACM international symposium on Mobile ad hoc networking and computing, pp. 187–198, 2004.

    [21] W. Zhao, M. Ammar, and E. Zegura, “Controlling the mobility of multiple data transport ferries in a delay-tolerant network,” in Proc. 24th IEEE International Conference on Computer Communications (INFOCOM), 2005.

    [22] 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,” SIGOPS Oper. Syst. Rev., vol. 36, no. 5, pp. 96–107, 2002.

    [23] T. Hossmann, F. Legendre, and T. Spyropoulos, “From contacts to graphs: pitfalls in using complex network analysis for DTN routing,” in INFOCOM’09: Proc. 28th IEEE International conference on Computer Communications Workshops, pp. 260–265, 2009.

    [24] T. Hossmann, T. Spyropoulos, and F. Legendre, “Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing,” in INFOCOM’10: Proc. 29th IEEE International conference on Computer Communications, 2010.
    [25] P. Hui, E. Yoneki, S.Y. Chan, and J. Crowcroft, “Distributed community detection in delay tolerant networks,” in Proc. ACM SIGCOMM Workshop, MobiArch’07, 2007.
    [26] E. Yoneki, P. Hui, and J. Crowcroft, “Visualizing community detection in opportunistic networks,” in Proc. ACM MobiCom Workshop on Challenged Networks (CHANTS), September, 2007.
    [27] P. Hui, E. Yoneki, and J. Crowcroft, “Identifying social communities in complex communications for network efficiency,” in Proc. 1st In- ternational Conference on Complex Sciences: Theory and Applications (Complex 2009), February, 2009.
    [28] S. Y. Chan, P. Hui, and K. Xu, “Community detection of time-varying mobile social networks,” in Proc. 1st International Conference on Complex Sciences: Theory and Applications (Complex 2009), February, 2009.
    [29] W. Wang, S. Eidenbenz, Y. Wang, and X.-Y. Li, “OURS: Optimal unicast routing system in non-cooperative wireless networks,” in Proc. 12th ACM Annual International Conference on Mobile Computing and Networking (MobiCom 2006), 2006.
    描述: 碩士
    國立政治大學
    資訊科學學系
    96753017
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0096753017
    数据类型: thesis
    显示于类别:[資訊科學系] 學位論文

    文件中的档案:

    档案 大小格式浏览次数
    301701.pdf3494KbAdobe PDF266检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈