Biometric Information Acquisition System Using VMD in Wi-Fi Channel Status Information

Author(s):  
Kazuya Tsubota ◽  
Yuki Nagatsu ◽  
Hideki Hashimoto
2013 ◽  
Vol 303-306 ◽  
pp. 578-581
Author(s):  
Kai Tuo Du ◽  
Zhen Ya Zhang ◽  
Hong Mei Cheng ◽  
Qian Sheng Fang

The process of building environmental information perception can be constructed with wireless sensor network (WSN) expediently. A WSN based information acquisition system for building running environment is described in this paper. The CPU of host computer in the system is Loongson2F and wireless nodes in the system are implemented as Telsob nodes. Because the price of wireless node is low, the hardware cost of the desired system is decreased evidently and the security of the desired system is enhanced because the CPU of the host is native. With those features, the application scenario of the desired system is extended widely. To verify the suitability of the using of Collection Tree Protocol (CTP) in construction of the WSN in the desired information acquisition system, the performance of the CTP based WSN deployed in public building space for environment information acquiring are tested and solutions for some key problems in the construction and the maintenance of the CTP based WSN are given in this paper too.


2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Ye Fang Bin

Due to the large and frequent static data interaction between the Electric Information Acquisition System and the external business systems, researching on using limited server sources to do an efficient task scheduling is becoming one of the key technologies of the unified interface platform. The information interaction structure of the unified interface platform is introduced. Task scheduling has been decomposed into two stages, task decomposition and task combination, based on the features (various types and dispersed) of large static data. The principle of the minimum variance of the subtasks data quantity is used to do the target task resolving in the decomposition stage. The thought of the Greedy Algorithm is used in the taskcombination. Breaking the target task with large static data into serval composed tasks with roughly same data quantity is effectively realized. Meanwhile, to avoid the situation of the GA falling into the local optimal solution, an improved combination method has been put forward. Moreover, the new method creates more average composed tasks and making the task scheduling more effective. Ultimately, the effectiveness of the proposed method is verified by the experimental data.


Sign in / Sign up

Export Citation Format

Share Document