【文章內(nèi)容簡介】
IDANT ? CONFIDANT[19][20][21]是 EPFL提出的一種入侵檢測協(xié)議。它通過節(jié)點(diǎn)自身觀察和相互通告的手段來檢測幾種已知類型的攻擊,使得網(wǎng)絡(luò)中節(jié)點(diǎn)在進(jìn)行路由時繞過可能的惡意節(jié)點(diǎn),進(jìn)而將惡意節(jié)點(diǎn)孤立。模擬結(jié)果顯示,對于拒絕轉(zhuǎn)發(fā)這類攻擊, CONFIDANT可以有效的對付占節(jié)點(diǎn)總數(shù)一半的惡意節(jié)點(diǎn)的攻擊。 CORE ? 文獻(xiàn) [22]中提出了一種基于游戲理論 [23]的 CORE機(jī)制,它的主要目的是對付 Ad hoc網(wǎng)絡(luò)中的自私節(jié)點(diǎn)。節(jié)點(diǎn)的協(xié)作是通過一種相互配合的監(jiān)督技術(shù)和一套信譽(yù)體系來實(shí)現(xiàn)的。每個節(jié)點(diǎn)的信譽(yù)分為主觀信譽(yù),直接信譽(yù)和功能信譽(yù)。這些信譽(yù)值被加權(quán)平均成一個總的信譽(yù)值,然后用它來決定是配合還是逐步孤立一個節(jié)點(diǎn)。 游戲理論 187。The preference structure 187。The prisoner’ s dilemma 187。The Nash equilibria 性能比較 ? 入侵檢測系統(tǒng)在不同的路由協(xié)議下的性能是不一樣的。實(shí)驗結(jié)果顯示無論節(jié)點(diǎn)是否移動,先應(yīng)式路由協(xié)議的性能要好于反應(yīng)式路由協(xié)議。 ? 給定一個路由協(xié)議和一個具有 N個節(jié)點(diǎn)的系統(tǒng),需要有多少個節(jié)點(diǎn)加入到入侵檢測系統(tǒng)中才能保證監(jiān)測到的攻擊不小于一定的比例。 三、 未來的研究方向 ? Network Performance Centric Security Design ? Game Theory in Security Design Rational exchange VS Fair exchange ? Exploiting the Synergy between PeertoPeer and Mobile Ad Hoc Networks 參考文獻(xiàn) [1] YihChun Hu, Adrian Perrig, and David B. Johnson. Ariadne: A Secure OnDemand Routing Protocol for AdHoc Networks. Technical Report Technical Report TR01383, Department of Computer Science, Rice University, December 2023. [2] . Hu, A. Perrig, and . Johnson, “ Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks,” Proceedings of the TwentySecond Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2023), IEEE, San Francisco, CA, April 2023。 [3] Jiejun Kong, Petros Zerfos, Haiyun Luo, Songwu Lu and Lixia Zhang. Providing Robust and Ubiquitous Security Support for Mobile AdHoc Networks. IEEE 9th International Conference on Network Protocols (ICNP39。01), 2023. [4] Haiyun Luo, Jiejun Kong, Petros Zerfos, Songwu Lu and Lixia Zhang, Selfsecuring Ad Hoc Wireless Networks accepted by the Seventh IEEE Symposium on Computers and Communications (ISCC39。02). [5] A. Shamir, “ How to sh