摘要
提出一种基于几何覆盖理论的Jamming攻击定位(GCL,geometry-covering based localization)算法。GCL算法利用计算几何中的凸壳理论,特别是最小包容圆方法,对Jamming攻击者进行定位。理论证明了该算法的正确性和较低的时间复杂度(O(nlogn));模拟实验表明,该算法在攻击者攻击范围、网络节点密度以及攻击者位置等度量值变化的情况下,比已有算法具有更好的定位准确度。
A geometry-covering based localization（GCL） algorithm was proposed with the purpose of localizing the jamming attacker in wireless sensor networks.The knowledge of the convex hull in computing geometry,especially the smallest circle covering,was utilized in the process of GCL.Simulation results showed that GCL is able to achieve higher accuracy than other comparable localization algorithms in most cases,and that has the time complexity of O（nlogn） which is proper for resource-constrained sensor networks.
出处
《通信学报》
EI
CSCD
北大核心
2010年第11期10-16,共7页
Journal on Communications
基金
国家重点基础研究发展计划("973"计划)基金项目资助(2006CB303000)
国家自然科学基金资助项目(61070203)~~
