无线传感器网络定位算法的研究

第1页 / 共63页

第2页 / 共63页

第3页 / 共63页

第4页 / 共63页

第5页 / 共63页

第6页 / 共63页

第7页 / 共63页

第8页 / 共63页
试读已结束,还剩55页,您可下载完整版后进行离线阅读
无线传感器网络定位算法的研究-知知文库网
无线传感器网络定位算法的研究
此内容为付费资源,请付费后查看
10
限时特惠
20
立即购买
您当前未登录!建议登陆后购买,可保存购买订单
付费资源
© 版权声明
THE END
燕山大学工学硕士学位论文AbstractLocation information has played an increasingly important role in many applicationsof wireless sensor networks,such as monitoring activities and so on.The simple,quickand precise way to obtain location information is either to set up manually or to installGPS,which will waste a vast amount of time and human resources.A better way to obtainlocation information is to use the localization algorithm.In this paper,we mainly focuse onthe research of wireless sensor network location algorithm based on multi-dimensionalscaling.Firstly,the research background,significance and status for WSN are summarized inthis paper based on large amount of related literatures.And the framework,characteristicsand typical localization algorithms of wireless sensor networks are introduced.Secondly,in this paper,we give details of classical multidimensional scaling and itsapplication in wireless sensor network location algorithm.Based on the analysis of theclassic MDS-MAP of the location algorithm,this paper presents Hop-Euclidean basedMDS-MAP(D)location algorithm,which uses the clustering method to divide large-scalenetwork into several local networks with cluster head,and in the local positioning,usingthe Hop-Euclidean algorithm in place of the shortest path distance to calculate Euclideandistance between the nodes neighbor.Obviously,this algorithm not only increases thepositioning accuracy,but also is beneficial to the expansion of the network.Thirdly,in this paper,we propose an improved algorithm,which makes up for theshortage of the distributed weighted multi-dimensional scaling localization algorithm thatcan not adapt to the network connectivity change,the irregular network topology and theconvergence speed is slow.We use the weighted mechanism and neighbor choicemechanism that comprehensively considerate the number of one hop neighbors,the nodepositioning precision and the location error.We also introduce the steepest descentmethod to ptimize the goal cost function.Lastly,the two improved algorithms are tested by simulations via Matlab accordingto localization error,network topology and so on.Simulation results show that these-Ⅱ-
喜欢就支持一下吧
点赞14 分享
评论 抢沙发
头像
欢迎您留下宝贵的见解!
提交
头像

昵称

取消
昵称表情代码图片

    暂无评论内容