检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河南财经政法大学计算机与信息工程学院,河南郑州450002
出 处:《传感器与微系统》2015年第4期52-55,共4页Transducer and Microsystem Technologies
基 金:国家自然科学基金资助项目(61202285);河南省科技攻关项目(132102210501)
摘 要:无线传感器网络中锚节点分布情况在很大程度上影响未知节点定位的精度,但目前对均匀性的分析相对较少,针对这一问题,对锚节点分布与无线传感器网络定位算法性能之间的关系进行全面分析。首先提出了锚节点均匀分布的相关概念,并设计建立了相应的网络系统模型,然后对质心算法、DV-Hop算法、最小包容圆算法性能与锚节点分布之间的关系进行了仿真实验。结果表明:锚节点的分布情况对所有定位算法均有影响,其中质心算法对锚节点均匀性最敏感,DV-Hop算法次之,最小包容圆算法对锚节点均匀性最不敏感,分析结果对无线传感网络实际应用具有指导意义。Uniformity of anchor nodes distribution has a very important impact on localization precision in wireless sensor networks (WSNs), but related research is limited, in order to solve this problem, relationship between anchor node distribution and localization performance of WSNs is analyzed. Firstly, related concept of anchor nodes uniformly distribution is proposed, and corresponding network system model is designed and set up, then simulation experiments are carried out to test relationship between performance of centroid algorithm, DV-Hop algorithm, smallest enclosing circle algorithm and anchor node distribution. Results show that all localization algorithms are effected by anchor node distribution, centroid algorithm is the most sensitive to uniformity of anchor node, the next is DV-Hop algorithm, smallest enclosing circle algorithm is the most insensitive to uniformity of anchor nodes, the analysis results has guiding significance for applications of WSNs.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30