Basic Search / Detailed Display

Back to Search Result
Author: 蘇威豪
Wei-hao Su
Thesis Title: 以社交關係為基礎的隨意網路之效能研究
A Network Performance Study for Social Relationship-oriented MANET
Advisor: 羅乃維
Nai-wei Lo
Committee: 左瑞麟
Ray-lin Tso
呂永和
Yung-ho Leu
Degree: 碩士
Master
Department: 管理學院 - 資訊管理系
Department of Information Management
Thesis Publication Year: 2012
Graduation Academic Year: 100
Language: 英文
Pages: 28
Keywords (in Chinese): 友誼機制 、隨意網路 、社交關係 、自私節點 、社交關係導向之分級機制 、封包傳遞率
Keywords (in other languages): Social relationship-oriented grading mechanism
Reference times: Clicks: 546  Downloads: 2 
Share:
School Collection Retrieve National Library Collection Retrieve Error Report

    • 在隨意網路中，節點間交換訊息通常是透過路由協定如AODV、DSR來為節點建立連線，以往路由協定大多是假設節點間訊息的交換是沒有自私行為的。在真實的社會網路中，節點在安全性、電源與網路頻寬等限制下，使得節點必然會有自私行為。
    本研究提出利用社交關係為基礎，依據節點間是否成功傳遞封包，來為節點進行評分，並依此評分為節點分級，作為建立朋友清單的資訊。並透過路由找尋時，增加一個友誼標籤來交朋友，並將朋友清單資訊分享給其它節點，使得節點可以利用朋友清單的資訊，以提升網路封包的成功傳遞量。

    In a mobile ad hoc network, nodes establish routing paths and usually exchange messages with each other through routing protocols, such as AODV and DSR.
    Most MANET routing protocols assume that every node is unselfish. In the real world, people exists selfish behavior because of limited network bandwidth and because battery energy is constrained. This study proposes a social relationship-oriented grading mechanism to grade points of nodes according to previous node behavior in MANET. The mechanism also classifies node levels and shares friend-lists for other neighboring nodes.
    This study simulates network performances, such as network throughput, end-to-end delay, and average delivery ratio, to display the effects of friendship on a selfish MANET.

    中文摘要 i Abstract ii 誌謝 iii Contents iv List of Figures vi List of Tables vii Chapter 1 Introduction 1 Chapter 2 Related Work 2 2.1 Selfish Behavior 2 2.1.1 Not relaying RREQ messages 2 2.1.2 Not sending Hello messages 2 2.1.3 Intentionally delaying the relay of RREQ messages 2 2.1.4 Relays routing messages but not data messages 3 2.2 MANET Routing Protocols 4 2.2.1 Proactive routing or table-driven routing 4 2.2.2 Reactive routing or on-demand routing 4 2.3 DSR Protocol 5 2.3.1 Route Discovery 5 2.3.2 Route Maintenance 6 2.4 Trust Evaluation 7 Chapter 3 The Friendship Strategy 8 3.1 New Friendships 8 3.2 Friend-list Update 9 3.2.1 Static friend relationship 9 3.2.2 Dynamic friendships 10 Chapter 4 Simulation Analysis 12 Simulation 1: The DSRGF protocol affects network throughput for different friend delivery rates 14 Simulation 2: Comparing network throughput for DSRGF stranger delivery rates of 0% 17 Simulation 3: Comparing network throughput for stranger delivery rates of 50% and 0% when the DSRGF friend delivery rate is 95% 20 Simulation 4: DSRGF protocol, when used with different friend/stranger delivery rates, affects end-to-end delay 22 Simulation 5: DSRGF protocol, when used with different friend/stranger delivery rates, affects the packet delivery ratio 24 Simulation 6: The relative packet delivery ratio among various selfish environments and an ideal (unselfish) environment when using a DSR protocol 25 Chapter 5 Conclusion 26 References 27

    [1] H. Liu, J. Delgado-Frias, S. Medidi, "Using A Cache Scheme to Detect Selfish Nodes in Mobile Ad Hoc Network," in Proceedings of the Sixth IASTED International Conference Communications, Internet, and Information Technology, July 2-4, 2007.
    [2] T. Fahad, R. J. Askwith, "A Node Misbehaviour Detection Mechanism for Mobile Ad-Hoc Networks," The 7th Annual PostGraduate Symposium on The Convergence of Telecommunications, Networking and Broadcasting, 2006.
    [3] S. Marti, T. J. Giuli, K. Lai, and M. Baker,"Mitigating Routing Misbehavior in Mobile Ad Hoc Networks," in Proceedings of the 6th annual international Conference on Mobile Computing and Networking, 2000, pp. 255-265.
    [4] Joseph P. Macker , M. Scott Corson, "Mobile ad hoc networking and the IETF," ACM SIGMOBILE Mobile Computing and Communications Review, v.2 n.4, October 1998
    [5] T. Liu and K. Liu, "Improvements on DSDV in Mobile Ad Hoc Networks," Wireless Communications, Networking and Mobile Computing, pp. 1637-1640, Shanghai, China, 2007.
    [6] P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum and L. Viennot," Optimized link state routing protocol for ad hoc networks," in Proceedings of 5th IEEE Multi Topic Conference, pp. 62-68, New York, United States, 2001.
    [7] C. E. Perkins, E. M. Belding-Royer and S. R. Das, "Ad hoc On-Demand Distance Vector Routing," in Proceedings of the Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, New Orleans, Los Angles, 1999.
    [8] D. B. Johnson and D. A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," In Mobile Computing, edited by Tomasz Imielinski and Hank Korth, Chapter 5, Kluwer Academic Publishers, pp. 153-181, 1996. 
    [9] S. Yokoyama, Y. Nakane, O. Takahashi, and E. Miyamoto, "Evaluation of the Impact of Selfish Nodes in Ad Hoc Networks and Detection and Countermeasure Methods," Proceedings of the 7th International Conference on Mobile Data Management (MDM 2006).
    [10] Frank Kargl, Andreas Klenk, Stefan Schlott, Michael Weber, "Advanced Detection of Selfish or malicious Nodes in Ad hoc Networks," University of UIm, Dep. Of Multimedia Computing, UIm, Germany.
    [11] "QualNet Developer | network modeling & simulation software | Scalable Network Technologies", http://www.scalable-networks.com/products/qualnet/, Scalable Networks Technologies, Inc.
    [12] "QualNet 5.0 Programmer’s Guide", http://www.scalable-networks.com, Scalable Network Technologies, Inc.

    QR CODE