节点文献

传感器网络配置算法的研究

【作者】 伍一

【导师】 李建中;

【作者基本信息】 黑龙江大学 , 计算机应用技术, 2005, 硕士

【摘要】 传感器网络配置可以有效布置传感器网络节点,合理覆盖感知数据区域,延长感知区域传感器网络的运行周期,即能够准确地采集感知区域的数据信息,又能够充分管理传感器网络资源,具有十分广阔的应用前景。 目前学术界研究传感器配置的算法采用自配置方式和固定配置方式。固定配置方式不需要了解感知区域传感器节点的分布情况,直接根据感知区域地貌状况一次完成传感器节点的配置。国内没有发现相关的研究成果,国外近年开展这方面的研究,提出一些算法,具有代表性的是MAX_AVG_COV算法,采用贪心策略配置传感器网络,效果好于随机配置算法(RANDOM)。文献[4]对MAx AvG_COV算法加以改进,提出MAX_MrN_COV算法取得了明显的配置效果。但是这些配置算法都是由目标区域的感知需求寻优感知目标的绝对检测程度,并没有根据感知目标的要求以及当前被感知程度寻优感知目标的相对检测程度,也没有对配置算法的理论体系做较为完善的探讨。即使文献[2]提出不确定配置算法(NDSP算法),也是寻优感知目标的绝对检测程度。因此本文针对固定方式配置算法的理论体系做较为完善的探讨,对感知区域的个性化需求提出解决方案。 本文在网格描述的感知区域基础上建立传感器网络检测模型,采用不精确性概率检测方法采集感知区域目标数据。探讨信息感知的覆盖分布规律,给出感知区域的度量空间和目标函数以及配置算法具备最优解的上界条件。提出基于传感器网络全局感知区域和局部感知区域的多个配置算法,寻求在全局感知区域中用较少的传感器数量获得较佳的信息

【Abstract】 The deployment for sensor networks can place effectively nodes of sensor networks and cover reasonably the field for sensing data.It can also prolong running lifetime for sensor networks. It can not only collect accurately data information for sensing field,but also manage adequately the resource for sensor networks.It has a wild application future.This paper introduce characteristics about deployment for sensor networks and present issues about deployment and relative algorithm for sensor networks.It expatiate on development process up to now and development tendency for the future about sensor networks.The academe research the deployment algorithm for sensor network by autonomous deployment mode and immovable deployment mode at present.The immovable deployment mode complete once the deployment of sensor node base on the state about sensor fields,without knowing the distributing for sensor node.There are not relative study fruit inland. There are some study fruit overseas[1][2][3][4]. Some relative algorithms are presented.The representative algorithm is MAX_AVG_COV[1].It deploy sensor networks with greedy strategy.It’s deployable effect is better than RANDOM algorithm. Literature[4] improve on MAXAVGCOV algorithm and present MAXMINCOV algorithm and obtain obvious deployable effect. The algorithms optimize absolute sense degree by sense requirement about object field.The algorithms don’t optimize opposite sense degree about sense requirement and current sense degree.The system info for deployment algorithms have not been discussed perfectly. Even though Literature[2] present uncertainty-aware sensor deployment algorithms (NDSP algorithms),it optimize absolute sense degree too. Therefore,this paper discuss the system info for immovable deployment mode algorithmsperfectly and present resolvent scheme about individuation requirement for sense field.This paper set up the detection model of sensor networks under grid showing sense field.It collects target data of sense field using imprecise probability detection method. It is researched for the coverage distribution rule of information sensing.lt is given for measurement space and target function and deployment optimization algorithm’s upper condition about sensing area.A series of deployment algorithm about whole sense field and local sense field are presented.lt is explored to get the better effect about information collect using less sensor numbers in the whole sensing field.The algorithms are analyzed and proved.The effect about deployment algorithms to place sensor is discussed with obstacle and non-obstacle and analyzed theoretically.The experimental results for deployment algorithm are given in many case.The experimental results prove further the correctness for deployment algorithm about theoretic analysis.The redundancy deployment strategy is given base on sensor deployment algorithms that had been presented.There are K node redundancy numbers for every target detect point.The redundancy deployment algorithms are K independency .The algorithms have validity and don’t influence coverage effectivity.Thus it can improve reliability for sensor networks and ensure sufficient lifetime for sensor networks.

  • 【网络出版投稿人】 黑龙江大学
  • 【网络出版年期】2005年 08期
  • 【分类号】TN929.5;TP212.9
  • 【被引频次】1
  • 【下载频次】674
节点文献中: