一種基于鄰居節(jié)點(diǎn)運(yùn)動(dòng)的分布式有向柵欄構(gòu)建算法
發(fā)布時(shí)間:2018-03-19 17:48
本文選題:有向柵欄覆蓋 切入點(diǎn):目標(biāo)位置 出處:《計(jì)算機(jī)研究與發(fā)展》2017年01期 論文類型:期刊論文
【摘要】:K-柵欄覆蓋是有向傳感器網(wǎng)絡(luò)的研究熱點(diǎn)之一.目前為止,很少從移動(dòng)和轉(zhuǎn)動(dòng)能耗相結(jié)合考慮有向柵欄構(gòu)建.提出一種基于鄰居節(jié)點(diǎn)運(yùn)動(dòng)的分布式有向強(qiáng)柵欄構(gòu)建方法(distributed directional strong barrier construction based on neighbor actuation,DBCNA).在形成柵欄的節(jié)點(diǎn)集合中,若在前一個(gè)感知區(qū)域內(nèi)部存在節(jié)點(diǎn),橫坐標(biāo)最大的節(jié)點(diǎn)就是節(jié)點(diǎn)的目標(biāo)位置.如果感知區(qū)域內(nèi)部沒有節(jié)點(diǎn),則令前一個(gè)節(jié)點(diǎn)正右方向一個(gè)半徑距離處作為下一節(jié)點(diǎn)的目標(biāo)位置.有向節(jié)點(diǎn)的目標(biāo)感知方向由移動(dòng)到該位置的移動(dòng)節(jié)點(diǎn)的初始感知方向決定.若初始感知方向0≤β≤α/2或2π-α/2≤β≤2π,目標(biāo)感知方向就是節(jié)點(diǎn)的初始感知方向;若α/2≤β≤π,目標(biāo)感知方向?yàn)棣?α/2;若πβ2π-α/2,目標(biāo)感知方向?yàn)棣?2π-α/2.仿真結(jié)果證明了該柵欄構(gòu)建方法比其他方法節(jié)省40%的節(jié)點(diǎn),平均能耗降低了40%~50%,具有重要的理論與實(shí)際意義.
[Abstract]:K- fence coverage is one of the research hotspots in directed sensor networks. In this paper, a new method of distributed directional strong barrier construction based on neighbor actuation is presented, which is based on neighbor node motion. In the set of nodes that form the fence, a new method is proposed, which is based on the energy consumption of movement and rotation. If there is a node within the previous perceptual region, the node with the largest transverse coordinates is the target location of the node. The target perception direction of the directed node is determined by the initial perceptual direction of the moving node moving to that position. If 0 鈮,
本文編號(hào):1635345
本文鏈接:http://sikaile.net/kejilunwen/zidonghuakongzhilunwen/1635345.html
最近更新
教材專著