Hierarchical Data Fusion in WSN Based on Mobile Agent

2014 ◽  
Vol 513-517 ◽  
pp. 1154-1159 ◽  
Author(s):  
Sheng Zhang ◽  
Hui Li Yang ◽  
Hou Jin Xiong
Keyword(s):  
Data Integration ◽  
Data Fusion ◽  
Power Consumption ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Cluster Head ◽  
Singular Values ◽  
Hierarchical Data ◽  
Fusion Algorithm ◽  
Simulation Results

We put forward hierarchical data fusion in WSN, in which different fusion algorithm is used in each logic layer. The singular values are kicked out before data fusion with QCP (Quantization coding on precision) method in the cluster, while Difference comparison fusion algorithm are used between cluster head nodes. Mobile agents are used in above two layers. Simulation results demonstrate that the algorithm improves the accuracy of the data integration, lower power consumption and extend the life of the network.

Study on Data Fusion Algorithm of TCAS/ADS-B Integrated Surveillance System Based on the Present Statistical Model

2013 ◽  
Vol 427-429 ◽  
pp. 1311-1314
Author(s):  
Ya Jun Xu
Keyword(s):  
Data Fusion ◽  
Statistical Model ◽  
Collision Avoidance ◽  
Surveillance System ◽  
Position Error ◽  
Integrated System ◽  
Fusion Algorithm ◽  
Simulation Results ◽  
Collision Avoidance System ◽  
The Difference

The difference between Traffic Alert and Collision Avoidance System and Automatic Dependent Surveillance Broadcast surveillance principle was compared. A TCAS/ ADS-B integrated surveillance system based on the present statistical model was built. Using the data fusion algorithm, the optimal local track of TCAS and ADS-B ,as well as the optimal fused track of the integrated system were estimated. The simulation results show that the maximum optimal fused estimated position error is 100m, it is certificated that the integrated system can improve track estimates accuracy, improve the surveillance precision of TCAS.

Data Fusion Algorithm for Asynchronous Radar Networks under Blanket Jamming

2012 ◽  
Vol 157-158 ◽  
pp. 1446-1452 ◽  
Author(s):  
Yan Li Zhao ◽  
Xiao Zun Ma ◽  
Xiang Dong Gao ◽  
Lei Yun ◽  
Shu Qin Fu
Keyword(s):  
Data Fusion ◽  
Target Tracking ◽  
State Vector ◽  
Processing Technique ◽  
High Accuracy ◽  
Observation Data ◽  
Fusion Algorithm ◽  
Batch Mode ◽  
Radar Networks ◽  
Simulation Results

Owing to the incompleteness and asynchronicity of the observation data, it is hard for the asynchronous netted radar to track its target effectively under intense blanket jamming. This paper presents a kind of data fusion algorithm for the asynchronous sensors based on optimal linearization approach, providing a solution to the problem of target tracking of radar networks under blanket jamming. First, the optimal linearization processing technique of the observation equation is derived. Then, based on this, the state vector of the target is initially estimated in batch mode. Finally, the filtering is processed in sequence. The simulation results show that the data fusion algorithm presented in the paper can track the target in high accuracy.

Research on Fusion Tracking Technology in Heterogeneous Multi-Sensor

2014 ◽  
Vol 1056 ◽  
pp. 158-161 ◽  
Author(s):  
Yan Ju Liu ◽  
Chun Xiang Xie ◽  
Jian Hui Song
Keyword(s):  
Data Fusion ◽  
Unscented Kalman Filter ◽  
Infrared Laser ◽  
Infrared Sensor ◽  
Fusion Algorithm ◽  
Laser Sensors ◽  
Weighted Fusion ◽  
Fusion Tracking ◽  
Simulation Results ◽  
Tracking Technology

Heterogeneous multi-sensor’s fusion tracking can detect precise distance and angle to the target. For heterogeneous multi-sensor issues, radar, infrared sensor and laser sensor’s data fusion, and target tracking are studied, weighted fusion algorithm based on Lagrange and unscented kalman filter are adopted, which make date fusion and tracking filtering for target. Simulation results show that the radar / infrared / laser sensors can realize data fusion and tracking to the target, and the accuracy is significantly higher than radar and infrared/laser, and then tracking effect is better.

FUNCTIONAL COORDINATION OF METHODS OF ORGANIZATION OF ADAPTIVE DATA COLLECTION PROCESSES AND METHODS OF SPATIAL SELF-ORGANIZATION OF MOBILE AGENTS

2017 ◽  
Vol 2 (1) ◽  
pp. 27-32
Author(s):  
Botchkaryov. A. ◽  
Keyword(s):  
Data Collection ◽  
Key Words ◽  
Motion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Parallel Execution ◽  
Self Organization ◽  
Data Collection Process ◽  
Speed Up ◽  
Adaptive Data Collection

The way of functional coordination of methods of organization adaptive data collection processes and methods of spatial self-organization of mobile agents by parallel execution of the corresponding data collection processes and the process of motion control of a mobile agent using the proposed protocol of their interaction and the algorithm of parallel execution planning is proposed. The method allows to speed up the calculations in the decision block of the mobile agent by an average of 40.6%. Key words: functional coordination, adaptive data collection process, spatial self-organization, mobile agents

Application of multi-resolution data fusion algorithm

2010 ◽  
Vol 30 (9) ◽  
pp. 2556-2558 ◽  
Author(s):  
Ming-bo SHI ◽  
Ji-hong CHEN ◽  
Zheng-zheng JIANG
Keyword(s):  
Data Fusion ◽  
Fusion Algorithm ◽  
Resolution Data

scholarly journals A Novel Cross-Latch Shift Register Scheme for Low Power Applications

2020 ◽  
Vol 11 (1) ◽  
pp. 129
Author(s):  
Po-Yu Kuo ◽  
Ming-Hwa Sheu ◽  
Chang-Ming Tsai ◽  
Ming-Yan Tsai ◽  
Jin-Fa Lin
Keyword(s):  
Power Consumption ◽  
Supply Voltage ◽  
Electrical Power ◽  
Average Power ◽  
Leakage Power ◽  
Shift Register ◽  
Cmos Process ◽  
Average Power Consumption ◽  
Simulation Results ◽  
Layout Area

The conventional shift register consists of master and slave (MS) latches with each latch receiving the data from the previous stage. Therefore, the same data are stored in two latches separately. It leads to consuming more electrical power and occupying more layout area, which is not satisfactory to most circuit designers. To solve this issue, a novel cross-latch shift register (CLSR) scheme is proposed. It significantly reduced the number of transistors needed for a 256-bit shifter register by 48.33% as compared with the conventional MS latch design. To further verify its functions, this CLSR was implemented by using TSMC 40 nm CMOS process standard technology. The simulation results reveal that the proposed CLSR reduced the average power consumption by 36%, cut the leakage power by 60.53%, and eliminated layout area by 34.76% at a supply voltage of 0.9 V with an operating frequency of 250 MHz, as compared with the MS latch.

Sign in / Sign up

Export Citation Format

Share Document