首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于三维体质心的无线传感器网络节点定位算法
引用本文:LAI Xu-zhi,王金鑫,ZENG Gui-xiu,吴敏,SHE Jin-hua,Simon X.Yang.基于三维体质心的无线传感器网络节点定位算法[J].系统仿真学报,2008,20(15).
作者姓名:LAI Xu-zhi  王金鑫  ZENG Gui-xiu  吴敏  SHE Jin-hua  Simon X.Yang
作者单位:1. 中南大学信息科学与工程学院,长沙,410083
2. 圭尔夫大学工程系,圭尔夫,加拿大,N1G 2W1
基金项目:国家自然科学基金,教育部优秀青年教师资助计划
摘    要:针对无线传感器网络中传感器节点初始位置未知的问题,提出一种基于三维体质心的分布式无线传感器网络节点定位算法.算法假设网络中有一定比例的锚节点(位置已知的节点),利用三维辅助坐标系,建立节点间的通信约束关系和空间几何关系,研究三维空间内包含未知节点的三维体构成方法,确定三维体的多个侧面和曲面来构成曲面三维体;为了减小算法计算量和网络能耗,寻找与曲面三维体对应的由多个侧面组成的平面三维体,通过确定平面三维体的质心来获得曲面三维体质心,从而把曲面三维体的质心作为未知节点的估计位置.该算法是一种完全基于网络连通性的分布式算法,算法设计简单,计算量小,节点间通信开销少.仿真结果显示,该算法适合于各种规模的无线传感器网络的节点定位.

关 键 词:无线传感器网络  定位  定位算法  三维体

Distributed Positioning Algorithm Based on Centroid of Three-dimension Graph for Wireless Sensor Networks
LAI Xu-zhi,WANG Jin-xin,ZENG Gui-xiu,WU Min,SHE Jin-hua,Simon X.Yang.Distributed Positioning Algorithm Based on Centroid of Three-dimension Graph for Wireless Sensor Networks[J].Journal of System Simulation,2008,20(15).
Authors:LAI Xu-zhi  WANG Jin-xin  ZENG Gui-xiu  WU Min  SHE Jin-hua  Simon XYang
Abstract:A new distributed positioning algorithm was proposed for unknown nodes in a three-dimensional wireless sensor network.First,assuming that there are some anchor nodes in WSN,the positions of which are already known,geometric relationships and communication constraints among the unknown nodes and the anchor nodes were founded based on the assistant three-dimensional coordinates system.Then the constructing method of a curving three-dimensional graph containing an unknown node was researched based on the geometric relationships and communication constraints.The curving three-dimensional graph was constructed by calculating several profiles and curving planes.It was converted to a plane three-dimensional graph,which is composed of several profiles,to diminish the communication and computational load of WSN.Sequentially,the centroid of the curving three-dimensional graph was obtained by calculation the centroid of plane three-dimensional graph.Finally,the centroid of curving three-dimensional graph was taken to be the estimated position of the unknown node.The algorithm fetches up the blank of algorithms which are used to position the unknown nodes in a three-dimensional WSN.It is range-free,distributed and based exclusively on connectivity.Since the algorithm is very simple and the only communication needed is between the anchor nodes and the unknown node,the communication and computational loads are very small.A theoretical analysis and simulation results show that it suitable for all sizes of low-power wireless sensor networks.
Keywords:positioning  wireless sensor networks  three-dimensional graph  algorithm performance
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号