信息网络安全
信息網絡安全
신식망락안전
NETINFO SECURITY
2014年
12期
51-55
,共5页
无线传感网络%AOA算法%分簇算法%定位算法
無線傳感網絡%AOA算法%分簇算法%定位算法
무선전감망락%AOA산법%분족산법%정위산법
wireless sensor network%AOA(angle of arrival) algorithm%clustering algorithm%localization algorithm
如今的网络安全主要联系于无线传感网络，定位算法的优劣决定了无线传感网络的能力，也就决定了网络安全的能力。分簇定位算法具有能量效率高、可扩展性好、简单可行的优点，但是分簇算法属于一种模糊定位算法，不具有较高的精度。此外，分簇算法的簇首替换如果在全局范围内进行选择，很容易造成高消耗。AOA(angle of arrival)算法在复杂环境中具有精确的定位能力。文章通过运用AOA测距算法，使分簇算法的每个节点具有自探测能力，通过节点相对夹角，用坐标算法算出相应于簇首的坐标。为了让能量消耗低于普通分簇算法，文章根据完全图中能量有效原理，让分簇只在初始时进行一次，在每个簇内无簇首或能量低时，对簇首进行重选举，再将信息发送给总簇。Matlab仿真实验表明，文章算法实现了range-based的分簇定位算法，且保留了快速部署、能量效率高、高精度的优点。根据实验，文章算法适用于不松散部署的无线传感网络。
如今的網絡安全主要聯繫于無線傳感網絡，定位算法的優劣決定瞭無線傳感網絡的能力，也就決定瞭網絡安全的能力。分簇定位算法具有能量效率高、可擴展性好、簡單可行的優點，但是分簇算法屬于一種模糊定位算法，不具有較高的精度。此外，分簇算法的簇首替換如果在全跼範圍內進行選擇，很容易造成高消耗。AOA(angle of arrival)算法在複雜環境中具有精確的定位能力。文章通過運用AOA測距算法，使分簇算法的每箇節點具有自探測能力，通過節點相對夾角，用坐標算法算齣相應于簇首的坐標。為瞭讓能量消耗低于普通分簇算法，文章根據完全圖中能量有效原理，讓分簇隻在初始時進行一次，在每箇簇內無簇首或能量低時，對簇首進行重選舉，再將信息髮送給總簇。Matlab倣真實驗錶明，文章算法實現瞭range-based的分簇定位算法，且保留瞭快速部署、能量效率高、高精度的優點。根據實驗，文章算法適用于不鬆散部署的無線傳感網絡。
여금적망락안전주요련계우무선전감망락，정위산법적우렬결정료무선전감망락적능력，야취결정료망락안전적능력。분족정위산법구유능량효솔고、가확전성호、간단가행적우점，단시분족산법속우일충모호정위산법，불구유교고적정도。차외，분족산법적족수체환여과재전국범위내진행선택，흔용역조성고소모。AOA(angle of arrival)산법재복잡배경중구유정학적정위능력。문장통과운용AOA측거산법，사분족산법적매개절점구유자탐측능력，통과절점상대협각，용좌표산법산출상응우족수적좌표。위료양능량소모저우보통분족산법，문장근거완전도중능량유효원리，양분족지재초시시진행일차，재매개족내무족수혹능량저시，대족수진행중선거，재장신식발송급총족。Matlab방진실험표명，문장산법실현료range-based적분족정위산법，차보류료쾌속부서、능량효솔고、고정도적우점。근거실험，문장산법괄용우불송산부서적무선전감망락。
Nowadays, network security mostly connects to wireless sensor network (WSN), the ability of WSN rests with the quality of the localization algorithm. Clustering localization algorithm is efifcient, highly scalable, simple and practical algorithm, but it is also a fuzzy match algorithm which does not have high accuracy. If cluster-head switch of clustering algorithm is done within the global nodes, it will cause large amount of energy waste. The AOA algorithm has good localization ability under complex environment. In this paper, by using the AOA algorithm, every node has the ability of self-detection and can calculate the coordinates relative to cluster-head with coordinate algorithm by using node relative-angle. In order to reduce energy waste, this paper designs a algorithm base upon energy-efifcient principle of the complete graph. Separating clusters only runs once in the beginning. A new cluster-head will be elected when there is no cluster-head in a cluster or it is in the situation of low power, and then the information is send to the latest cluster-head. Simulating experiment with Matlab shows that this paper achieves a range-based clustering localization algorithm. The algorithm maintains the advantages of high-speed deploying, high energy-efficient and high accuracy. In addition, the algorithm is adequate to non-loosen wireless sensor network.
