期刊文献+

战场自组织网络中MAC层的注入攻击

Injection Attacks at MAC Layer in Battlefield Self-organizing Networks
下载PDF
导出
摘要 基于对战场自组织网络中IEEE 802.11 MAC协议的安全性分析,提出一种新的注入攻击方法,与传统注入攻击相比不表现出任何自私攻击行为,可以有效地躲避检测。利用NS2仿真平台搭建了具有分簇结构的战场自组织网络场景,在此环境下进行注入攻击仿真;模拟结果表明,新的注入攻击方法可以降低战场自组织网络数据安全传输的可靠性,攻击节点增多将加大攻击效果。 Based on the analysis of I EEE 802.11 MAC protocol security in battlefield self-organizing networks, a novel injection attack was proposed. Compared with the traditional injection attacks methods, it doesn't show any selfish attacking behaviors and can be effectively avoid being detected. Further more, the simulation scenario of cluster-based battlefield self-organizing networks was built by simulation platform NS2, in which injection attacks was simulated. The simulation results show that injection attack could reduce the reliability of data transmission in battlefield self-organizing networks, and the attack effects will be more obvious as the number of attacking nodes is increasing.
出处 《信息安全与技术》 2010年第8期37-40,共4页
基金 国防科技重点实验室基金资助项目[9140C1302010802]
关键词 网络安全 注入攻击 媒体接入控制 分簇结构 network security injection attacks media access control cluster-based
  • 相关文献

参考文献1

二级参考文献10

  • 1Amis A.D.,Prakash R.,Huynh D., Vuong T. Max-min d-cluster formation in wireless ad hoc networks. In: Proceedings of IEEE INFOCOM2000, Tel-Aviv, Israel, 2000, 32~41
  • 2Banerjee S., Khuller S. A clustering scheme for hierarchical control in multi-hop wireless networks. In: Proceedings of the IEEE INFOCOM2001, Anchorage,Alaska, 2001, 2: 1028~1037
  • 3McDonald A.B., Znati T.F. Design and performance of a distributed dynamic clustering algorithm for ad-hoc networks. In: Proceedings of the 34th Annual Simulation Symposium 2001, Seattle, WA, 2001, 27~35
  • 4Jain A., Puri R. Sengupta, Geographical routing using partial information for wireless ad hoc networks. IEEE Personal Communication, 2001, 8(1): 48~57
  • 5Navas J.C., Imelinski T. Geocast-geographic addressing and routing. In: Proceedings of ACM/IEEE MOBICOM' 97, Budapest, Hungary, 1997, 3: 66~76
  • 6Das Bevan, Bharghavan Vaduvur. Routing in ad hoc networks using minimum connected dominating sets. In: Proceedings International Conference on Communications, Montreal, 1997, 376~380
  • 7Wu J., Li H.L. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing, Seattle, Washington, 1999, 7~14
  • 8Garey M.L., Johnson D.S.Computers and Intractability: A Guide to the Theory of Np-Completeness. New York: Freeman W.H., 1979
  • 9Gupta P., Kumar P.R. The capacity of wireless networks. IEEE Transactions on Information Theory, 2000, 46(2): 388~404
  • 10Kleinrock L., Kamoun F. Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks, 1997, 1: 155~174

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部