在Ad Hoc Networks的路由安全議題近幾年開始被人提出來研究。在Ad Hoc Network中因為無線環境的特性(例如:傳輸範圍的限制)，使得傳輸的過程中必須藉由其他點的接力，才能使得封包成功地抵達接收端，也因此造成了一些網路安全的問題存在於ad hoc networks。

在論文中，我們提出了一個新的路由安全演算法，稱為雜亂監聽式路由安全演算法。藉由此一演算法，行動主機可以偵測出惡意的攻擊行為，例如，惡意的丟棄資料封包ヽ隨意地修改封包內容。在成功的探測出攻擊的行為後，行動主機可以針對惡意點採取行動去逞罰它。經由我們提出的演算法將可大幅的提升傳送資料的表現。並且使用雜亂監聽式路由安全演算法將不會對網路增加多餘的封包，以保留珍貴的頻寬給資料傳輸。

Routing security in the ad hoc networks has been extensively studied recently. Due to the characteristics of wireless ad hoc networks, e.g., limitation of communication range, data packets have to be relayed by other intermediate nodes to successfully reach the desired destination during the data transmission process. Therefore, network security problems must be solved for the deployment of ad hoc networks.

In this thesis, we propose a novel routing security algorithm, called promiscuous listening routing security algorithm. By using the proposed algorithm, mobile hosts can detect malicious attacks, such as maliciously dropping data packets, arbitrarily modifying the content of data packets. After successfully detecting the malicious behaviors, mobile hosts isolate the malicious nodes. By using our proposed routing security algorithm, the performance of data transmission is significantly improved. In addition, the algorithm does not add any overhead packets to the networks; thus, valuable wireless bandwidth can be preserved for data transmission.

[1] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM: Computer Communications Review, vol.21, no.4, pp.234-244, October 1994.
[2] S. Murthy and J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and Applications Journal, Special Issue on Routing in Mobile Communication Networks, October 1996.
[3] C.E. Perkins and E.M. Royer, “Ad-hoc On-Demand Distance Vector Routing,” Second IEEE Workshop on Mobile Computing Systems and Applications, pp.90-100, February 1999.
[4] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks,” in Mobile Computing, pp.153-181, 1996.
[5] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” IEEE INFOCOM’97, Kobe, Japan, April 1997.
[6] Chai-Keong Toh, “A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing (ABR),” in Proceedings of 15 IEEE Annual International Phenix Conference on Computers and Communications, March 1996.
[7] Vesa Karpijoki, “Security in Ad Hoc Networks,” in Proceedings of the Helsinki University of Technology, Seminars on Network Security, 2000.
http://www.hut.fi/~!vkarpijo/netsec00/netsec00_manet_sec.ps
[8] Janne Lundberg, “Routing Security in Ad Hoc Networks,” in Proceedings of the Helsinki University of Technology, http://citeseer.nj.nec.com/400961.html
[9] P. Papadimitratos and Z.J. Haas, “Secure Routing for Mobile Ad hoc Networks,” SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, January 2002.
[10] J.P. Hubaux, L. Buttyan, and S. Capkun, “The Quest for Security in Mobile Ad Hoc Networks,” ACM Symposium on Mobile Ad Hoc Networking & Computing, CA, October 2001.
[11] M. Zapata and N. Asokan, “Securing Ad hoc Routing Protocols,” ACM MobiCom’02, 2002.
[12] B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures,” SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), 2002.
[13] Y.-C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks,” in Proceedings of the 4th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2002), 2002.
[14] S. Marti, T.J. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” 6 MobiCom, Boston, Massachusetts, August 2000.
[15] http://www.isi.edu/nsnam/ns/
[16] CMU Monarch Group, “CMU Monarch extensions to the NS-2 simulator,” available from http://monarch.cs.cmu.edu/cmu-ns.html, 1998.
[17] J. Broch, D.A. Maltz., D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” in Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking, pp.85-97, October 1998.
[18] H. Deng, W. Li, and D.P. Agrawal, “Routing Security in Wireless Ad Hoc Networks,” IEEE Communications Magazine, October 2002.
[19] Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Wireless Networks 8, pp. 153-167, 2002.
[20] S. Xu and T.N. Saadawi, “Revealing the problems with 802.11 medium access control protocol in multi-hop wireless ad hoc networks,” Computer Networks, 38(4):531-548, March 2002.
[21] J.J. Garcia-Luna-Aceves, “Loop-Free Routing Using Diffusing Computations,” IEEE/ACM Trans. Networking, 1:130—141, February 1993.