检索结果-南通市图书馆

An Improved Node localization algorithm for Wireless Sensor

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Improved Node Localization Algorithm for Wireless Sensor

2012年计算机应用与系统建模国际会议

作者： Yujun Liu Jing Jin Qinghai Wang Na Na Guangjian Chang Academy of Armored Forces Engineering

This paper introduces an improved localization algorithm that bases on distance and local coordinate system which is built up by beacon nodes. This algorithm evaluates the differences of several independent localization information to determine whether upgrade this node as beacon nodes according to the size of the difference whether beyond the prescribed or not. It can effectively prevent and reduce the accumulated and spread error in localization process by the audit of beacon nodes, and improve the positioning accuracy of nodes in the network.

关键词： wireless sensor networks node localization localization algorithm

A Self-localization algorithm for Wireless Sensor Networks

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Self-localization Algorithm for Wireless Sensor Networks

第24届中国控制与决策会议

作者： Juelong Li 1,2 , Xiaofei Du 1 , Jianchun Xing 1 , Qiliang Yang 1 1. PLA University of Science and Technology Nanjing 210007, China 2. Research Center of Coastal Defence Engineering Beijing 100841, China

Considering the deficiencies and limitations of Multidimensional Scaling -based （MDS-MAP） localization algorithm, a new MDS-mass spring-based （MDS-MS） localization algorithm was proposed by analyzing the MDS-MAP algorithm and Mass Spring Optimization-based （MSO） positioning algorithm. Moreover, for different ranging error, network connectivity and anchor node density, MDS-MAP, MSO, MDS-MAP（P） and MDS-MS four localization algorithms were simulated and compared. The simulation results show that MDS-MS-based algorithm possesses strong robustness and high positioning precision, and is fit for localization in sparse network topology and irregular network topology.

关键词： wireless sensor networks MDS MSO localization algorithm MDS-MS

localization algorithm of Wireless Sensor Network Based on Concentric Circle Distance Calculation

在线全文

cnki会议

学校读者我要写书评

暂无评论

国际计算机前沿大会会议论文集 2020年第1期 405-415页

作者： KaiGuo Qian Chunfen Pu Yujian Wang ShaoJun Yu Shikai Shen School of Information Engineering Kunming UniversityKunmingChina School of Teacher Education Kunming UniversityKunmingChina

Node localization is one of the key technology in the field of wireless sensor network(WSN)that has become a challenging research topic under the lack of distance *** order to solve this problem,a localization algorithm based on concentric circle distance calculation(LACCDC)is *** LA-CCDC takes the beacon as the center of the concentric circle,then divides the task area into concentric circles with the k communication radius of sensor,which forms concentric *** node located in the k hops ring intersects the concentric circle with(k−1)r radius that forms an intersection *** area is used to calculate the distance from the beacon to the unknown node,hyperbola is then adopted to locate the unknown *** the application scenario with node random distribution,the simulation results show that the LA-CCDC algorithm gets the node location with low error under different node number,different beacons and different communication radius of sensor.

关键词： Wireless sensor network(WSN) localization algorithm Concentric circles Average relative positioning error(ARPE)

A localization algorithm in Wireless Sensor Network Based on Positioning Group Quality

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

国际计算机前沿大会会议论文集 2021年第1期 125-139页

作者： Kaiguo Qian Chunfen Pu Yujian Wang Shaojun Yu Shikai Shen School of Information Engineering Kunming UniversityKunmingChina

localization is fundamental component for many critical applicationsin wireless sensor networks (WSNs). However, DV-Hop localization algorithmand its improved ones cannot meet the requirement of positioning accuracy fortheir high localization errors. This paper proposes a localization algorithm basedon positioning group quality (LA-PGQ). The average estimate hop size was firstcorrected by link singularity and difference between the estimation hop lengthand true hop length among beacons, the best positioning group was constitutedfor unknown node by using node trust function and positioning group qualityevaluation function to choose three beacons with best topological ***, LA-PGQ algorithm uses two-dimensional hyperbolic algorithm instead ofthe classical three-side method/least square method to determine the coordinates ofnodes, which are more accurate. Simulation results show the positioning accuracyof LA-PGQ algorithm is obviously improved in WSNs, and the average localizationerror of LA-PGQ algorithm is remarkable lower than those of the DV-Hopalgorithm and its improved algorithm and Amorphous, under both the isotropyand anisotropy distributions.

关键词： Wireless sensor networks localization algorithm Positioning group quality Positioning accuracy

Mobile Robot localization and Navigation System Based on Monocular Vision

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Transactions of Tianjin University 2012年第5期18卷 335-342页

作者：贾云伟刘铁根高丽兰王聃 School of Precision Instrument and Opto-Electronics Engineering Tianjin University School of Mechanical Engineering Tianjin University of Technology School of Computer and Communication Engineering Tianjin University of Technology

A system for mobile robot localization and navigation was *** the proposed system,the robot can be located and navigated by a single landmark in a single *** the navigation mode may be following-track,teaching and playback,or *** basic idea is that the system computes the differences between the expected and the recognized position at each time and then controls the robot in a direction to reduce those *** minimize the robot sensor equipment,only one omnidirectional camera was *** in disturbing environments show that the presented algorithm is robust and easy to implement,without camera *** rootmean-square error(RMSE) of localization is 1.4,cm,and the navigation error in teaching and playback is within 10,cm.

关键词： localization algorithm navigation omni-vision monocular vision

Real-time localization estimator of mobile node in wireless sensor networks based on extended Kalman filter

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai University(English Edition) 2011年第2期15卷 128-131页

作者：田金鹏郑国莘 Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information Engineering Shanghai University

localization of the sensor nodes is a key supporting technology in wireless sensor networks （WSNs）. In this paper, a real-time localization estimator of mobile node in WSNs based on extended Kalman filter （KF） is proposed. Mobile node movement model is analyzed and online sequential iterative method is used to compute location result. The detailed steps of mobile sensor node self-localization adopting extended Kalman filter （EKF） is designed. The simulation results show that the accuracy of the localization estimator scheme designed is better than those of maximum likelihood estimation （MLE） and traditional KF algorithm.

关键词： wireless sensor networks (WSNs) node location localization algorithm Kalman filter (KF)

Detection of Link Fault Using Risk Modelling and Improving QOS Parameters in IP/WDM Networks

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Circuits and Systems 2016年第9期7卷 2217-2233页

作者： K. Sashi Rekha M. Sumathi Department of Information Technology R. M. K. Engineering College Thiruvallur India Department of Electronics and Communication Engineering Dhirajlal Gandhi College of Technology Salem India

An operational backbone network is connected with many routers and other devices. Identifying faults in the network is very difficult, so a fault localization mechanism is necessary to identify fault and alleviate it and correct the faults in order to reduce the network performance degradation. A risk model needs to be devised based on the dynamic database by creating alternate path and the network is reconfigured by identifying dynamic paths. In this paper, an on-demand link state routing approach is used for handling failures in IP backbone networks and a localization algorithm is used to improve QOS parameters based on threshold value of gateway. It is proved that on-demand link state routing guarantees loop-free forwarding to reachable destinations regardless of the number of failures in the network, and in case of localization algorithm using modification process packet loss is avoided based on threshold value of gateway. Heuristic algorithm is also used for reconfiguration of dynamic path for effective fault localization. In this paper, in order to change the traffic condition, reconfiguration strategic is dynamically used. Dijikstra’s shortest path algorithm has been used to determine the shortest path between node pairs. Using risk modeling mechanism, a small set of candidate faults is identified. The concept of Fault localization is used to minimize the fault occurring in the node and sends original path to node pairs. The localization algorithm based on MODIFICATION PROCESS, packet loss is avoided in the network by checking threshold value of gateway. If the threshold value is maximum, router directly forwards the packet to destination through gateway and if the threshold value is minimum, router compresses the packet and forwards the packet to destination with notification via gateway.

关键词： Virtual Topology Reconfiguration Load Balancing localization algorithm On-Demand Link State Routing localization algorithm Based Modification

Simulation Research of UWB location algorithm

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Simulation Research of UWB location algorithm

第30届中国控制与决策会议

作者： Jihong Liu He Jing Yanxia Xiang Zhiyu Guan College of Information Science and Engineering Northeastern University College of Computer Science and Engineering Northeastern University

Ultra Wideband solves the major problems of traditional wireless technology in *** this paper,a UWB positioning model based on the mixed algorithm of TOA（time of arrival）,RSSI（Received Signal Strength Indication）and TDOA（Time Difference of Arrival） is proposed,and the computer simulation is carried *** initial value which is closer to the real value is obtained by the TOA mixed RSSI *** the initial value is brought into the Taylor algorithm of TDOA,which solves the problem that the Taylor algorithm is not *** the simulation results show that the hybrid algorithm is more accurate when the SNR is high and the number of nodes is high.

关键词： UWB localization algorithm TDOA RSSI TOA

On Computation of Distributed Supervisory Controllers in Discrete-Event Systems

在线全文

cnki会议

学校读者我要写书评

暂无评论

On Computation of Distributed Supervisory Controllers in Dis...

第24届中国控制与决策会议

作者： Zhang Renyuan, Gan Yongmei, Wang Zhaoan the School of Electrical Engineering, Xi''an Jiaotong University W. M. Wonham the Department of Electrical and Computer Engineering, University of Toronto

This paper refines an earlier localization procedure used to design optimal nonblocking distributed supervisory controllers in discrete-event systems （DES）. The earlier algorithm needed a control consistency relation involving two conditions, and introduced superfluous selfloops. We propose a refined procedure, including a newly defined weak control consistency relation, and a cleanup algorithm, which results in simpler and cleaner controllers. It is proved to be correct, and illustrated by a Transfer Line plant.

关键词： Distributed supervisory controller localization algorithm discrete-event system