無線隨意網路(MANET)是一種不需依賴固定基礎建設的自我組織網路。在無線隨意網路中，兩個節點之間通訊傳遞可能經過多個其他節點，且節點的移動速度會造成網路拓樸的快速改變。基於以上原由，設計出適用於無線隨意網路環境下的路由協定是一項值得探討的研究議題。
在惡意網路環境中，無線隨意網路需要藉助匿名通訊機制以保護行動節點的真實身分及實體位置資訊，使個人隱私不致受到惡意攻擊者所侵害。當隱私資訊弱點存在時，攻擊者便可能發起主動或被動式攻擊，例如封包流量分析、欺騙攻擊與路由維護攻擊等。
近年的研究中，數種匿名安全路由協定已陸續被提出發表。現有的方法絕大多數使用非對稱及對稱式金鑰加密隱私資訊，因而導致極高的加解密運算成本。為解決此問題，一個以雜湊函數為基礎且具有低運算成本優點的需求式匿名安全路由協定，稱為HASR，於2010年被提出。我們在QualNet模擬器上模擬實作HASR協定，並在不同的隨意網路情境下進行模擬實驗，評估HASR與其他金鑰加密式路由協定相比較下的運行效能。

A mobile ad hoc network (MANET) is a self-organizing network which does not require the fixed infrastructures. The communication routes between two nodes in MANET may consist of hops through other nodes and the network topology changes frequently due to node mobility. For these reasons, designing a suitable routing protocol for MANET is an important study issue.
In the hostile environments, mobile ad hoc networks require an anonymous communication mechanism in order to protect the identity and physical location information of the mobile nodes not exposed to the malicious attackers. The adversaries can launch the active or passive attacks such as traffic analysis, spoofing attack and route maintenance attack if the vulnerability of privacy information exists.
In recent years, several anonymous secure routing protocols have been proposed. Most of them used asymmetric and symmetric key cryptography to encrypt privacy information so they commonly have a high computation overhead. To address this problem, a hash-based on-demand anonymous secure routing protocol with low cryptographic cost, called HASR, which is proposed in 2010. We simulate and implement HASR using QualNet under certain mobile ad hoc network scenarios to evaluate its feasibility and performance when comparing it with other key-based routing protocols.

[1] 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.
[2] 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.
[3] 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.
[4] 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.
[5] V. D. Park and M. S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” in Proceedings of IEEE INFOCOM ‘97, pp.1405-1355, Kobe, Japan, April, 1997.
[6] Z. J. Haas, “A new routing protocol for the reconfigurable wireless networks,” in Proceedings of the 6th IEEE International Conference on Universal Personal Communications, Vol.2, pp. 562-566, San Diego, California, United States, 1997.
[7] S. Denh, C. Rex and B. Lichun, “ODAR: On-Demand Anonymous Routing in Ad Hoc Networks,” in Proceedings of the 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems, pp. 267-276, Vancouver, British Columbia, Canada, October, 2006.
[8] M. C. Chiang, “Hash-based Anonymous Secure Routing Protocol in Mobile Ad Hoc Networks,” Master thesis, National Taiwan University of Science and Technology, Taipei, Taiwan, June, 2010.
[9] J. Kong and X. Hong, “ANODR: Anonymous On Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks,” in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 291-302, New York, United States, 2003.
[10] B. Zhu, Z. Wan, M. S. Kankanhalli, F. Bao, and R. H. Deng, “Anonymous Secure Routing in Mobile Ad-hoc Networks,” in Proceedings of the 29th IEEE International Conference on Local Computer Networks, pp. 102-108, Tampa, Florida, United States, November, 2004.
[11] R. Song, L. Korba, and G. Yee, “AnonDSR: Efficient Anonymous Dynamic Source Routing for Mobile Ad-Hoc Networks,” in Proceedings of the 2005 ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 33-42, Alexandria, Virginia, United States, November, 2005.
[12] K. El-Khatib, L. Korba, R. Song, and G. Yee, "Secure Dynamic Distributed Routing Algorithm for Ad Hoc Wireless Networks," in Proceedings of the International Conference on Parallel Processing Workshops, pp. 359-366, Kaohsiung, Taiwan, October, 2003.
[13] A. Boukerche, K. El-Khatib, L. Korba, and L. Xu, "SDAR: A Secure Distributed Anonymous Routing Protocol for Ad Hoc Wireless Networks," in Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks, pp. 618-624, Tampa, Florida, United States, November, 2004.
[14] J. Kong, X. Hong, and M. Gerla, "ASR is a variant of ANODR," technical report CSD-TR050014, University of California, Los Angeles, United States, 2005.
[15] “QualNet Developer | network modeling & simulation software | Scalable Network Technologies”, http://www.scalable-networks.com/products/qualnet/, Scalable Networks Technologies, Inc.
[16] “QualNet 5.0 Programmer’s Guide”, http://www.scalable-networks.com, Scalable Network Technologies, Inc.
[17] J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking ‘98, pp. 85-97, New York, United States, 1998.
[18] W. Dai, “Crypto++ 5.6.0 Benchmarks”, http://www.cryptopp.com/benchmarks.html, 2009.