In wireless sensor networks, the traditional intrusion detection can not detect the compromised nodes immediately. In this paper, we propose a secure routing protocol (Secure Relay Grid Routing Protocol) based on prob...
详细信息
In wireless sensor networks, the traditional intrusion detection can not detect the compromised nodes immediately. In this paper, we propose a secure routing protocol (Secure Relay Grid Routing Protocol) based on probability prediction to solve this problem. In the protocol, the network is divided into different small grids. Utilizing the geographic information and intrusion detection information, the proposed protocol is designed with a routing metric which is based on a mathematical prediction model. The routing metric could guarantee that the message detours those compromised grids that have not been detected by the intrusion detection. Theoretical analysis and OPNET simulation results show that the proposed protocol can provide a high delivery ratio and decrease the number of the compromised packets.
Sparsity adaptive matching pursuit algorithm(SAMP) is a compressed sensing signal reconstruction algorithm with good performance. However, as the support set expands one time, the backward pursuit should be processed ...
详细信息
Sparsity adaptive matching pursuit algorithm(SAMP) is a compressed sensing signal reconstruction algorithm with good performance. However, as the support set expands one time, the backward pursuit should be processed for many times, in which redundant update calculations are included. To solve the problem, this paper presents a fast sparsity adaptive matching pursuit algorithm(FSAMP). During the operation of the FSAMP, the backward pursuit is performed only once when the support set expands. After the support set is fixed, the backward pursuit shall be executed for multi times to guarantee the reconstruction precision. Simulation results for signal reconstruction show that the FSAMP has the slight higher reconstruction precision and the much faster reconstruction speed compared with the SAMP.
The static nonlinear feature of narrow band Radio Frequency Power Amplifier (RF PA) is made as the fingerprint of wireless communication emitter. RF PA with unknown input can be looked as a static nonlinear Hammerstei...
详细信息
The static nonlinear feature of narrow band Radio Frequency Power Amplifier (RF PA) is made as the fingerprint of wireless communication emitter. RF PA with unknown input can be looked as a static nonlinear Hammerstein model. The process of feature extraction from this model is split into two steps. The first step is signal samples whitening and the second is the estimation of Taylor series' coefficients. The order statistics of the whitening signal samples is monotone. Then the features are estimated through linear regression using least square method. Comparing feature vectors of 4 RF power amplifiers results in that the proposed algorithm is effectively to identification different type of RF power amplifiers.
When the input signals are strongly correlated, the adaptive algorithm performance of Volterra filter deteriorates. Meanwhile, the correlativity of linear input signals of Volterra filter is different from that of non...
详细信息
When the input signals are strongly correlated, the adaptive algorithm performance of Volterra filter deteriorates. Meanwhile, the correlativity of linear input signals of Volterra filter is different from that of nonlinear input signals of Volterra filter. So, a new variable step size NLMS algorithm based on decorrelation for second-order Volterra filter is proposed. In the new algorithm, the decorrelation is used in linear and nonlinear input signals of Volterra filter, respectively, and the different variable step factors are adopted. Simulation results of noise cancellation show that the correlativity of input noises has no fundamental impact on the proposed algorithm, whether it is strong or weak. And when the input noises are strongly correlated, the new algorithm still has a better noise cancellation performance.
The concept of Peer-to-Peer (P2P) has been in-troduced into mobile networks, which has led to the emer-gence of mobile P2P networks, and originated potential ap-plications in many fields. However, mobile P2P networks ...
详细信息
The concept of Peer-to-Peer (P2P) has been in-troduced into mobile networks, which has led to the emer-gence of mobile P2P networks, and originated potential ap-plications in many fields. However, mobile P2P networks are subject to the limitations of transmission range, and highly dynamic and unpredictable network topology, giving rise to many new challenges for efficient information retrieval. In this paper, we propose an automatic and economical hybrid information retrieval approach based on cooperative cache. In this method, the region covered by a mobile P2P network is partitioned into subregions, each of which is identified by a unique ID and known to all peers. All the subregions then constitute a mobile Kademlia (MKad) network. The pro-posed hybrid retrieval approach aims to utilize the flooding-based and Distributed Hash Table (DHT)-based schemes in MKad for indexing and searching according to the designed utility functions. To further facilitate information retrieval, we present an effective cache update method by considering all relevant factors. At the same time, the combination of two different methods for cache update is also introduced. One of them is pull based on time stamp including two different pulls: an on-demand pull and a periodical pull, and the other is a push strategy using update records. Furthermore, we provide detailed mathematical analysis on the cache hit ratio of our approach. Simulation experiments in NS-2 showed that the proposed approach is more accurate and efficient than the existing methods.
Minimum changes bandwidth allocation (MCBA) is an optimal video transmission scheme resulting in the minimum number of rate changes with the minimum peak rate, which can reduce renegotiation frequency in statistical m...
详细信息
ISBN:
(纸本)9781424445530
Minimum changes bandwidth allocation (MCBA) is an optimal video transmission scheme resulting in the minimum number of rate changes with the minimum peak rate, which can reduce renegotiation frequency in statistical multiplexing service. The existing MCBA algorithm with searching frontiers, however, has a high computational complexity, which depressed the applicability of MCBA. In this paper, we design a fast algorithm of MCBA that examines for the bounded point based on the convex envelopes of the overflow and underflow curve. As a result, our algorithm can work out an MCBA scheme in a shorter time because we can find the bounded point with a linear complexity, and calculate each transmission rate within several iterations. The simulation using real video traces confirmed the philosophy and efficiency of our algorithm.
This paper discusses system models of three types of signal in wireless communication, i.e. single user single antenna signal, virtual MIMO signal and single user MIMO signal. Based on the model, proposes a method for...
详细信息
In this paper, we construct signal modelings of four types of signals in wireless communication, i.e. single user single antenna signal, virtual MIMO signal, multibeam smart antenna signal and single user MIMO signal ...
详细信息
This paper constructed signal models of four types of signal in wireless communication, i.e. single user MIMO signal, single user single antenna signal, virtual MIMO signal and multibeam smart antenna signal first, an...
详细信息
NC-OFDM is OFDM-based spectrum pooling technique and also a transmission mode of cognitive radio. The paper models and analyzes NC-OFDM stochastic process, then designs stochastic comb-pilot pattern and analyzes its c...
详细信息
暂无评论