检索结果-内蒙古大学图书馆

The wireless sensor network localization algorithm based on improved pattern genetic algorithm

Journal of Computational Information Systems 2011年第9期7卷 3031-3038页

作者： Huang, Haiping Cai, Qiwang Wang, Ruchuan She, Baoyang Ma, Yujing College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing 210003 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China

Localization is one of the important technical issues of wireless sensor networks. Based on the traditional genetic algorithm applied in node localization, this paper introduces pattern search algorithm for the selection of population, meanwhile, genetic operators are designed. The theoretical analysis and simulation results show that, even though the proportion of anchor nodes and network connectivity is poor, and distance measurements are corrupted by Gaussian noise, the improved algorithm achieves high accuracy. Thus, it can be applied to most large-scale wireless sensor networks for node localization. © 2005 by Binary Information Press.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A quantum search based signal detection for MIMO-OFDM systems

A quantum search based signal detection for MIMO-OFDM system...

引用

International Conference on Telecommunications (ICT)

作者： Fei Li Lizhi Zhou Li Liu Haibo Li Department of Applied Physics and Electronics Umeå University Umea Sweden Institute of Signal Processing and Transmission Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China

Multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) is considered as candidates for future broadband wireless services. In this paper a novel signal detection scheme based on Grover's quantum search algorithm is proposed for MIMO-OFDM systems. Grover's quantum search algorithm is based on the concept and principles of quantum computing, such as quantum bit, quantum register and quantum parallelism. An analysis is given to the theoretical basis of Grover's algorithm and the performance of Grover's algorithm is evaluated. A novel signal detector based on Grover's algorithm (GD) for MIMO-OFDM system is proposed. The simulation results show that the proposed detector has more powerful properties in bit error rate than MMSE detector and VBLAST-MMSE detector. The performance of the proposed GD detector is close to optimal when the failure probability is 0.001. When the failure probability is 0.00001, the performance of GD detector declines. In this case, our proposed improved Grover's algorithm based detector is still close to the optimal ML detector. The complexity of GD and IGD is O(√N). It's much better than classical ML detector which complexity is O(N).

关键词： Detectors Quantum computing Algorithm design and analysis Databases Signal detection Complexity theory OFDM

来源：评论

学校读者我要写书评

暂无评论

A novel neural network optimized by Quantum Genetic Algorithm for signal detection in MIMO-OFDM systems

A novel neural network optimized by Quantum Genetic Algorith...

引用

IEEE Symposium on Computational Intelligence in Control and Automation, CICA

作者： Fei Li Min Zhou Haibo Li Department of Applied Physics and Electronics Umeå University Umea Sweden Institute of Signal Processing and Transmission Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China

Neural networks can easily fall into a local extremum and have slow convergence rate. Quantum Genetic Algorithm (QGA) has features of small population size and fast convergence. Based on the investigation of QGA, we propose a novel neural network model, Radial Basis Function (RBF) networks optimized by Quantum Genetic Algorithm (QGA-RBF model). Then we investigate the performance of the proposed QGA-RBF on solving MIMO-OFDM signal detection problem. A novel signal detector based on QGA-RBF for MIMO-OFDM system is also proposed. The simulation results show that the proposed detector has more powerful properties in bit error rate than QGA based detector, RBF based detector and MMSE algorithm based detector, namely a 4-6 dB gain in performance can be achieved. The performance of the proposed detector is closer to optimal, compared with the other detectors.

关键词： Radial basis function networks Genetic algorithms Detectors Convergence Artificial neural networks Logic gates OFDM

来源：评论

学校读者我要写书评

暂无评论

Research on two-dimensional feature fusion algorithm of multi-sensors in wireless sensor networks

引用

Journal of Information and Computational Science 2011年第15期8卷 3647-3657页

作者： Bao, Bisai Wu, Jianrong Lou, Xiaojun Liu, Haitao Key Lab. of Wireless Sensor Network and Communication Shanghai Institute of Micro-System and Information Technology Chinese Academy of Science Shanghai 200050 China Wuxi SensingNet Industrialization Research Institute Wuxi 214135 China

Information fusion is an effective way to solve the problem of the limited of energy and bandwidth for wireless sensor networks, a novel strategy of two-dimensional feature fusion is proposed in this paper. The feature vectors of multi-sensors are first combined into a two-dimensional feature vector matrix. Then Two-Dimensional Principal Component Analysis is generalized for feature extraction from two-dimensional feature vector matrix to achieve multi-sensors feature fusion. The experimental results on the real signals of ground targets indicate that the dimension of fusion features is effectively reduced and the classification accuracy is increased significantly under two-dimensional feature fusion. They also demonstrate that two-dimensional feature fusion is more effective than the traditional feature fusion. © 2009 by Binary Information Press.

关键词： wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A distributed compressed sensing approach for speech signal denoising

引用

Journal of Electronics 2011年第4期28卷 509-517页

作者： Ji, Yunyun Yang, Zhen College of Communication and Information Engineering Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing 210003 China Nanjing University of Posts and Telecommunications Nanjing 210006 No. 66 Xinmofan Road P. O. Box 214 China

Compressed sensing, a new area of signal processing rising in recent years, seeks to minimize the number of samples that is necessary to be taken from a signal for precise reconstruction. The precondition of compressed sensing theory is the sparsity of signals. In this paper, two methods to estimate the sparsity level of the signal are formulated. And then an approach to estimate the sparsity level directly from the noisy signal is presented. Moreover, a scheme based on distributed compressed sensing for speech signal denoising is described in this work which exploits multiple measurements of the noisy speech signal to construct the block-sparse data and then reconstruct the original speech signal using block-sparse model-based Compressive Sampling Matching Pursuit (CoSaMP) algorithm. Several simulation results demonstrate the accuracy of the estimated sparsity level and that this denoising system for noisy speech signals can achieve favorable performance especially when speech signals suffer severe noise. © 2011 Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg.

关键词： Denoising Distributed compressed sensing Sparsity estimation Speech signal

来源：评论

学校读者我要写书评

暂无评论

Two-way denoise-and-forward network coding opportunistic relaying aiming at minimizing euclidean distance in multi-access phase

引用

Journal of Electronics 2011年第4期28卷 433-443页

作者： Jia, Xiangdong Yang, Longxiang Shao, Shixiang Wireless Communications Key Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing 210003 China College of Mathematics and Information Science Northwest Normal University Lanzhou 730070 China Nanjing University of Posts and Telecommunications Nanjing 210003 Box 188 No. 66 Xinmofan Road China

To exploit the effect of modulation schemes on the best relay selection, a novel Jointing Modulation schemes max-min criterion (JM-max-min) is proposed firstly for Two-Way De-Noise-and-Forward (DNF) Opportunistic Relaying systems (TW-DNF-OR) by aiming at minimizing the Pairwise Error Probability (PEP) of Multi-Access (MA) phase which dominates the error performance of TW-DNF-OR due to the presence of MA interference. The proposed JM-max-min criterion integrates perfectly the minimum distances of constellations and the relay links gains. Then, with the proposed JM-max-min criterion, we analyze the Symbol Error Probabilities (SEPs) of MA phase and BroadCast (BC) phase by using the approximated mathematics analysis, and present the corresponding closed-form expressions to SEPs. The numerical analysis shows, for a given modulations combination at both sources, the TW-DNF-OR systems with the proposed JM-max-min criterion outperform the one with the conventional max-min criterion. © 2011 Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg.

关键词： Cooperative communications Max-min criterion network coding Opportunistic relaying

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of data aggregation algorithms in wireless sensor networks

Performance analysis of data aggregation algorithms in wirel...

引用

International Conference on Electrical and Control Engineering (ICECE)

作者： Jian Xu Geng Yang Zheng-yu Chen Lei Chen Zhen Yang Key Laboratory of Broadband Wireless Communication & Sensor Network Technology of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Nanjing University of Posts and Telecommunications Nanjing CN College of Computer Science & Technology Nanjing University of Posts and Telecommunications Nanjing Jiangsu China

Resource-constrained is a critical issue in wireless sensor networks (WSN) applications. Data aggregation (or data fusion) is one of the key techniques to solve the problem. Data aggregation can effectively reduce the data traffic, thereby reduce energy consumption, and extend the network's survival time. The research of data aggregation relates to many aspects of technology, so that the design of efficient data aggregation algorithm is a challenging task. In this paper, we investigate the effect of essential operations, scheduling algorithm and aggregation tree construction, has on data aggregation performance. The main performance such as end-to-end delay and energy-consumption of different aggregation schemes has been studied and measured by simulation experiment.

关键词： wireless sensor networks Delay Energy consumption Scheduling algorithm Algorithm design and analysis Approximation algorithms Distributed databases

来源：评论

学校读者我要写书评

暂无评论

An Expanding Ring Prediction and Location Aided AODV Routing Algorithm

An Expanding Ring Prediction and Location Aided AODV Routing...

引用

International Conference on Information technology, Computer Engineering and Management Sciences (ICM)

作者： Chunling Cheng Jingbo Hao Dengyin Zhang College of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Nanjing University of Posts and Telecommunications Nanjing CN

On the battlefield, the cooperative fighting and communication among combat vehicles require higher service level of real-time transmission. Combat vehicles, fast moving and the links, frequent disruption lead to the increase of packet loss rate, packet delay and routing control overhead ratio. This paper proposes an expanding ring prediction and location aided AODV routing algorithm. It improves AODV routing protocol from both routing discovery and maintenance phases. In the routing discovery phase, the algorithm limits the scope of sending RREQ through predicting the topology ring, and during the route maintenance phase, it predicts the motion range of destination node with the information provided by GPS to avoid blindness routing. The simulation results show that the proposed routing algorithm can greatly cut down the overload of combat vehicular network, improve the routing delay and reduce packet loss rate. It can meet the real-time requirements of the service transmission among combat vehicles and also improve the performance of the combat vehicular network.

关键词： Routing Vehicles Delay Prediction algorithms Routing protocols Maintenance engineering Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED HYBRID SEMANTIC MATCHING ALGORITHM WITH LEXICAL SIMILARITY

引用

Journal of Electronics(China) 2010年第6期27卷 838-847页

作者： Peng Rongqun Mi Zhengkun Wang Lingjiao Broadband Wireless Communication and Sensor Network Technology Key Lab of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing 210003 China

In this paper, we proposed an improved hybrid semantic matching algorithm combining Input/Output (I/O) semantic matching with text lexical similarity to overcome the disadvantage that the existing semantic matching algorithms were unable to distinguish those services with the same I/O by only performing I/O based service signature matching in semantic web service discovery techniques. The improved algorithm consists of two steps, the first is logic based I/O concept ontology matching, through which the candidate service set is obtained and the second is the service name matching with lexical similarity against the candidate service set, through which the final precise matching result is concluded. Using Ontology Web Language for Services (OWL-S) test collection, we tested our hybrid algorithm and compared it with OWL-S Matchmaker-X (OWLS-MX), the experimental results have shown that the proposed algorithm could pick out the most suitable advertised service corresponding to user's request from very similar ones and provide better matching precision and efficiency than OWLS-MX.

关键词： Hybrid matching algorithm Semantic matching Lexical similarity WordNet Ontology Web Language for Services (OWL-S)

来源：评论

学校读者我要写书评

暂无评论

Target moving path algorithm in wireless sensor networks

引用

Ruan Jian Xue Bao/Journal of Software 2011年第SUPPL. 1期22卷 32-39页

作者： Ma, Yin Wang, Ru-Chuan Sun, Li-Juan Huang, Hai-Ping College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Nanjing 210003 China

wireless sensor networks are widely used to monitor various kinds of events that happened in the sensing area. On the contrary, in order to avoid being detected, intelligent mobile targets are exerting themselves to seek paths with the least exposure passing the sensing area. Looking at the issue of intelligent moving targets seeking the appropriate moving path, the study analyzed the defects of existing moving path algorithms and proposed the AFMP (Angle First Moving Path) algorithm that generates a moving path via choosing the appropriate direction. Theoretical analysis and simulation results illustrate that the AFMP algorithm does not require global node information and isomorphic sensing radius of nodes. Also, it has a lower sensitivity when compared to the node deployment density and distribution. Therefore, the algorithm is especially suitable for the case when only local node information is known. Moreover, the complexity of the algorithm is lower than that of the Voronoi algorithm and the ideal grid algorithm. © Copyright 2011, Editorial Department of Journal of Software. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：