成功大學博碩士論文系統

簡易檢索 / 詳目顯示

回結果列表

研究生：	任上鳴 Jen, Shang-Ming
論文名稱：	以有效率的路由節點數分析抵禦無線隨意網路之蟲洞攻擊 Defending Wormhole Attacks in Wireless Ad Hoc Networks: An Efficient Routing Mechanism with Hop Count Analysis
指導教授：	賴溪松 Laih, Chi-Sung
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 電腦與通信工程研究所 Institute of Computer & Communication Engineering
論文出版年：	2007
畢業學年度：	95
語文別：	英文
論文頁數：	103
中文關鍵詞：	無線隨意網路、蟲洞攻擊
外文關鍵詞：	ad-hoc network, wormhole attack
相關次數：	點閱：116 下載：2
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

無線隨意網路是一種新興的網路系統，藉由自我組織的能力，在沒有基礎設施的環境當中，快速而有效率地形成一個通訊網路。然而，在這種型態的網路中，因為通訊完全依靠無線傳輸，故容易存在許多安全性的問題。包含了竊聽、竄改資料、阻斷服務攻擊…等。攻擊者往往必須先利用一些手段取得路由的權利，方能進行後續攻擊行為。其中，蟲洞攻擊是一種藉由快速的傳輸方式，取得相較於正常路由更好的傳輸參數，進而掌控路由權利的方法，近年來有諸多文獻對此攻擊手法提出解決方案，如： Wang等人提出的視覺化方法、Hu等人提出的封包控制方法以及Lazos等人提出了圖論方法…等，來偵測蟲洞的存在並避免之。在這些著作裡，偵測蟲洞的觀點皆由管理者的角度下手，仰賴一些特殊硬體或大量運算，並著重於尋找蟲洞的所在位置。此外，這些方法大多必須依靠一些不易達成的假設才能有所發揮。本論文提出一個有效率的機制，由使用者的角度來避免明顯可能存在危害的路由，我們利用路由數的分析，不須大費周章地偵測蟲洞是否存在，即可判斷可能有危害的路由，進而避開之。經實驗證明，我們可以達到較上述機制更為良好的安全效果，且不需任何特殊的硬體或網路環境，即可直接應用在現有的無線隨意網路。

The wireless ad-hoc network is a kind of newly risen network system. With the ability of self-organization, nodes in the network can automatically form a communication system without infrastructure. However, there are serious security issues in this kind of network due to its wireless transmissions. For example, eavesdrop, modification and Denial of Service (DoS), and so on, are some common attacks. The attackers usually have to use some angles to take the right of routing in order to launch these attacks. The wormhole attack is an effective angle. The routes which go through a wormhole tunnel formed by attackers may have better transmission parameters than normal ones, so that malicious nodes can easily have the right of routing. Until now, many researches against this problem have been proposed. For examples, Wang et al. constructed a visualization system; Hu et al. presented a method of packet leashes; and Lazos et al. gave a graph theory approach, etc. Most of these works detect wormhole from the viewpoint of administrators. Some special hardware or enormous computations are needed for finding the wormhole in most of these methods. Besides, they usually depend on some impractical assumptions of network environment. In this paper, we propose an efficient mechanism, the HCA routing protocol, from users’ viewpoint to avoid some routes which are obviously unsafe. We analyze the hop count values in the route reply (RREP) packets and do not have to confirm the existence of the wormhole. We verify the performance through three experiments and conclude that we can successfully avoid most of the wormhole without any hardware supported. In addition, our HCA protocol does not need any environment assumptions and can be directly adapted in the mobile ad-hoc networks.

Contents.....................................................................................................vii
List of Tables................................................................................................xi
List of Figures..............................................................................................xii

Chapter 1	  An Introduction to Mobile Ad-hoc Networks....................................................1
1  The History of Mobile Ad-hoc Networks.....................................................................1
2  The Features and Applications of Mobile Ad-hoc Networks...................................................3
3  Comparison of Wireless Ad-hoc Networks and Other Similar Mobile Communication Systems.....................6
3.1  Wireless Sensor Networks........................................................................7
3.2  Wireless Local Area Network (WLAN) .............................................................9
3.3  Honeycomb (Cellular) Systems....................................................................9
3.4  Satellite Communication Systems................................................................11
3.5  Comparison of Similar Systems..................................................................12
4  Routing Security in Wireless Ad-hoc Networks and Motivations.............................................14
5  Contributions............................................................................................14

Chapter 2	  Overview of Current Routing Protocols in Wireless Ad-hoc Networks...........................15
1  Classification of Routing Methods in Wireless Ad-hoc Networks............................................16
1.1  Proactive (Table-driven) Routing Protocols and Examples................................................16
1.2  Reactive Routing Protocols and Examples................................................................19
1.3  Hybrid Routing Protocols and Examples..................................................................25
2  Classification of Our Routing Protocol...........................................................27

Chapter 3	  Security Issues in Wireless Ad-hoc Networks.................................................29
1  Category of Attacks in Wireless Ad-hoc Networks..........................................................29
1.1  Modification and Eavesdrop Attack..............................................................30
1.2  Denial of Service (DoS) Attack.................................................................31
2  Wormhole Attacks in Wireless Ad-hoc Networks and its Influences..........................................33
2.1  Overview of Wormhole Attacks...................................................................33
2.2  The Influences of Wormhole Attacks.............................................................35

Chapter 4	  Related Works on Wormhole Attacks Prevention................................................37
1  Visualization of Wormholes...............................................................................37
2  Packet Leashes...........................................................................................39
3  Statistical Analysis of Routes...........................................................................42
3.1  A Graph Theoretic Approach.....................................................................43
3.2  A Statistical Analysis of Multi-path...........................................................47
4  Other Mechanisms and Protocols...........................................................................50
5  Comparison of the Main Mechanisms........................................................................51

Chapter 5	  Our HCA Routing Protocol....................................................................53
1   Overview................................................................................................53
2   Route Establishment in HCA Routing Protocol.............................................................55
2.1  Generate and Broadcast RREQ Packets............................................................55
2.2  Generate and Reply RREP Packets................................................................58
2.3  RREP Count Limit and Gray List.................................................................60
2.4  Hop Count Analysis and Route Path Selection Mechanism..................................................65
3   Route Maintenance in HCA Routing Protocol...............................................................66
3.1  Dealing with the Broken Route and RERR Packet..................................................66
3.2  Cross-check the Route Paths....................................................................67
4  Comparisons of HCA Routing Protocol and Other Mechanisms.................................................68

Chapter 6	  Simulations.................................................................................69
1  Overview.................................................................................................69
2  Simulation Scenarios.....................................................................................70
2.1  Experiment 1...................................................................................71
2.2  Experiment 2...................................................................................73
2.3  Experiment 3...................................................................................74
3  Results..................................................................................................75
3.1  Results of Experiment 1........................................................................75
3.2  Results of Experiment 2........................................................................78
3.3  Results of Experiment 3........................................................................80

Chapter 7	  Conclusions and Future Works................................................................83
1  Conclusions..............................................................................................83
2  Future Works.............................................................................................84

Reference.....................................................................................................85

Appendix......................................................................................................91
A.	Experiment 1-A........................................................................................91
B.	Experiment 1-B........................................................................................93
C.	Experiment 1-C........................................................................................95
D.	Experiment 2-A........................................................................................97
E.	Experiment 2-B........................................................................................99
F.	Experiment 2-C.......................................................................................101

Vita.....................................................................................................................................103
                                    

References

[1] S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”, in IETF RFC 2501, Jan 1999
[2] D. A. Bayer, “Accomplishments of the DARPA Survivable Adaptive Networks SURAN Program”, in Proceedings of IEEE MILCOM '90, Monterey, CA, pp. 855-862, Oct. 1990
[3] S. Basagni, I. Chlamtac, V. R. Syrotiuk and B. A. Woodward, “A distance routing effect algorithm for mobility (DREAM)”, 4th ACM/IEEE International Conference on Mobile Computing and Networking, pp. 76--84, October 25--30, 1998
[4] D. Bertsekas and R. Gallager, “Data Networks”, Prentice-Hall, Inc., pp. 297–333, 1987.
[5] T. Clausen, C. Dearlove and P. Jacquet, “The Optimized Link State Routing Protocol version 2”, in Mobile Ad hoc Networking Internet-Draft draft-ietf-manet-olsrv2-03.txt, February 2007
[6] M. S. Corson and A. Ephremides, “A distributed routing algorithm for mobile wireless networks”, in ACM-Baltzer J. Wireless Networks, vol. 1,pp. 61–81, Jan. 1995
[7] T.-W. Chen and M. Gerla, “Global State Routing：A New Routing Scheme for Ad hoc Wireless Networks”, in Proceedings of the IEEE International Conference on Communications(ICC), Atlanta, GA, pp.171-175, June 1998
[8] T. Clausen and P. Jacquet, “The Optimized Link State Routing Protocol”, RFC 3626, October 2003
[9] J.-H. Chen, “A study of Securing Ad Hoc Network: Routing Static Information Protection”, Cryptology and Network Security Lab., NCKU, Thesis for Master of Science, June 2005
[10] H. S. Chiu and K. S. Lui, “DelPHI: Wormhole Detection Mechanism for Ad Hoc Wireless Networks”, in IEEE ISWPC 2006, pp. 1-6, Jan. 2006
[11] S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations” in IETF RFC 2501, Jan 1999
[12] C.-C. Chiang, H-K Wu, W. Liu and M. Gerla, “Routing in Clustered Multihop, Mobile Wireless Networks”, in The IEEE Singapore International Conference on Networks, SICON'97, pp.197-211, 16-17 April 1997
[13] R. Dube, C. D. Rais, K.-Y. Wang and S. K. Tripathi, “Signal Stability-Based Adaptive Routing (SSA)”, in IEEE Personal Communications, pp. 36-45, February 1997
[14] M. Gunes, M. Kahmer and I. Bouazizi, “Ant-routing-algorithm (ARA) for mobile multi-hop ad-hoc networks - new features and results”, in Proceedings of the 2nd Mediterranean Workshop on Ad-Hoc Networks (Med-Hoc-Net'03). Mahdia, Tunisia, 2003
[15] J. J. Garcia-Luna-Aceves and M. Spohn, “Source-Tree Routing in Wireless Networks”, in Proceedings of 7th International Conference on Network Protocols, 1999.
[16] C. Hedrick, “Routing Information Protocol”, IETF Network Working Group, RFC 1058, June 1988
[17] Y.-C. Hu, D. Johnson and A. Perrig, “Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols”, in Proceedings of the ACM Workshop on Wireless Security, WiSe 2003, Sep. 2003
[18] J. M. Hou, “A study of Securing Ad Hoc Network: Dynamic Routing Information Protection”, Cryptology and Network Security Lab., NCKU, Thesis for Master of Science, June 2005
[19] Y.-C. Hu , A. Perrig and D. B. Johnson, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks”, in Proceedings of the 4th IEEE Workshop on Mobile Computing Systems & Applications (WMCSA 2002), IEEE, Calicoon, NY, June 2002
[20] Y.-C. Hu, A. Perrig and D. B. Johnson, “Packet Leashes: A Defense against Wormhole Attacks in Wireless Network”, in IEEE INFOCOM 2003, pp. 1976-1986, 30 March-3 April 2003
[21] Y.-C. Hu, A. Perrig and D. B. Johnson, “Wormhole Attacks in Wireless Networks” ,in IEEE Journal on Selected Areas in Communications, Vol. 24, No. 2, pp.370-380, February 2006
[22] Z. J. Haas, M. R. Pearlman and P. Samar, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks”, in IETF INTERNET-DRAFT, draft-ietf-manet-zone-zrp-04.txt, July 2002
[23] M. Jiang, J. Li and Y. C. Tay, “Cluster Based Routing Protocol(CBRP)”, in IETF Internet-Draft draft-ietf-manet-cbrp-spec-00.txt, Augest 1998
[24] D. B. Johnson, D. A. Maltz and Y.-C. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)”, in IETF MANET Working Group INTERNET-DRAFT, 15 April 2003
[25] J. Jubin and J. D. Tornow, “The DARPA packet radio network protocols”, in Proceedings of the IEEE, 75(1), pp.21-32, Jan. 1987
[26] I. Khalil, S. Bagchi and N. B. Shroff, “LITEWORP: a lightweight countermeasure for the wormhole attack in multihop wireless networks”, in IEEE DSN’05, pages 1-10, June 28 – July 1, 2005
[27] Y.-B. Ko and N. H. Vaidya, “Location-Aided Routing(LAR) in Mobile Ad hoc Networks”, in ACM/Baltzer Wireless Networks (WINET) journal, Vol.6-4, pp. 307-321, 2000
[28] S.-J. Lee and M. Gerla, “Split multipath routing with maximally disjoint paths in ad hoc networks”, in Proceedings of IEEE ICC 2001, pp. 3201-3205, 11-14 June 2001
[29] Z. Li and Y.-K. Kwok, “A New Multipath Routing Approach to Enhancing TCP Security in Ad Hoc Wireless Networks”, in IEEE ICPPW’05, 14-17 June 2005
[30] L. Lazos and R. Poovendran, “SeRLoc: Secure Range-Independent Localization for Wireless Sensor Networks”, in ACM WiSE’04, October 2004
[31] L. Lazos and R. Poovendran, “SeRLoc: SeRLoc: Robust Localization for Wireless Sensor Networks”, in ACM Transactions on Sensor Networks, Vol. 1, No. 1, pp. 73–100, August 2005.
[32] L. Lazos, R. Poovendran, C. Meadows and P. Syverson, L. W. Chang, “Preventing Wormhole Attacks on Wireless Ad Hoc Networks: A Graph Theoretic Approach”, in IEEE WCNC 2005, pp. 1193-1199, 13-17 March 2005
[33] B. M. Leiner, R. Ruth and A. R. Sastry, “Goals and Challenges of the DARPA GloMo Programs”, in IEEE Personal Cpmmunications, Vol.3, No.6, pp34-43, DEC. 1996
[34] S. Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks”, in ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, pp. 183–97, Oct. 1996
[35] N. Nikaein, H. Labiod and C. Bonnet, “DDR-Distributed Dynamic Routing Algorithm for Mobile Ad hoc Networks”, in MOBHOC.2000, pp. 19-27, 11 Aug. 2000
[36] R. Ogier, F. Templin and M. Lewis, “Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)”, IETF RFC 3684. http://www.ietf.org/rfc/rfc3684.txt, February 2004
[37] C. Perkins and E. Belding-Royer, “Ad hoc On-Demand Distance Vector (AODV) Routing”, in IETF RFC 3561, July 2003
[38] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers” in Proc. of the ACM SIGCOMM’94, vol. 24, no. 4, pp.234-244, Oct. 1994
[39] V. Park and S. Corson, “Temporally-Ordered Routing Algorithm (TORA)” ,in IETF MANET Working Group Internet-Draft, draft-ietf-manet-tora-spec-04.txt, July 2001
[40] A. Perrig, R. Canetti, D. Tygar and D. Song, “Efficient authentication and signature of multicast streams over lossy channels” ,in Proc. IEEE Symp. Res. Security and Privacy, pp. 56–73, May 2000.
[41] G. Pei, M. Gerla and T.-W. Chen, “Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks”, in Proceedings of ICC 2000, New Orleans, LA, Jun. 2000
[42] G. Pei, M. Gerla, X. Hong and C.-C. Chiang, “A Wireless Hierarchical Routing Protocol with Group Mobility”,in IEEE WCNC’99,New Orleans, LA, pp. 1536-1540, Sep. 1999
[43] L. Qian, N. Song and X. Li, “Detecting and Locating Wormhole Attacks in Wireless Ad Hoc Networks through Statistical Analysis of Multi-path” ,in IEEE WCNC 2005, pp. 2106-2111, 13-17 March 2005
[44] E. M. Royer and C. E. Perkins, “Multicast operation of the ad-hoc on-demand distance vector routing protocol”, in Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 207–218, Aug. 1999
[45] D. Ratner, P. Reiher and G. Popek, “Roam: A Scalable Replication System for Mobile Computing”, in Workshop on Mobile Databases andDistrib utedSystems (MDDS), September 1999
[46] S. Radhakrishnan, G. Racherla, C. N. Sekharan, N. S.V. Rao and S. G. Batsell, “DST - A Routing Protocol for Ad Hoc Networks Using Distributed Spanning Trees”, in WCNC 1999, vol 3, pp. 1543-1547, 21-24 Sept. 1999
[47] W. Su and M. Gerla, “IPv6 Flow Handoff in Ad-Hoc Wireless Networks Using Mobility Prediction”, in Proceedings of IEEE GLOBECOM'99, Rio de Janeiro, Brazil, Dec. 1999
[48] N. Song, L. Qian and X. Li, “Wormhole Attacks Detection in Wireless Ad Hoc Networks: A Statistical Analysis Approach”, in IEEE IPDPS’05, 4-8 April 2005
[49] C.-K. Toh, “Associativity-Based Routing for Ad-Hoc Mobile Networks”, in Wireless Personal Communications 4, pp.103–139, March 1997
[50] W. Wang and B. Bhargava, “Visualization of Wormholes in Sensor Networks”, in ACM WiSE’04, October 2004
[51] S.-C. M. Woo and S. Singh, “Scalable routing protocol for ad hoc networks”, in ACM/Kluwer Wireless Networks (WINET) Journal, 2001
[52] M.G. Zapata, “Secure Ad hoc On-Demand Distance Vector (SAODV) Routing”, in IETF Internet Draft, draft-guerrero-manet-saodv-06.txt, 5 September 2006

校內：2008-07-17公開
校外：2008-07-17公開

簡易檢索 / 詳目顯示

相關論文