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

Erratum to: Distributed beamforming designs to improve physical layer security in wireless relay networks

EURASIP Journal on Advances in Signal Processing 2014年第1期2014卷 1-1页

作者： Mujun Qian Chen Liu Youhua Fu The Key Lab of Broadband Wireless Communication and Sensor Network Technology (Ministry of Education) Nanjing University of Posts and Telecommunications Nanjing Jiangsu China National Mobile Communications Research Laboratory Southeast University Nanjing Jiangsu China

来源：评论

学校读者我要写书评

暂无评论

Average Level Crossing Rate and Fading Duration of Multiuser Single Relay Cooperation wireless Uplinks

引用

China communications 2013年第4期10卷 135-143页

作者：贾向东杨龙祥朱洪波 Wireless Communications Key Laboratory of Jiangsu Province Nanjing University of Posts and Telecommunications Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education College of Computer Science and Engineering Northwest Normal University

We investigate the average Level Crossing Rate （LCR） and Average Fading Duration （AFD） of multiuser single relay co- operation wireless uplinks over independent and non-identically distributed （***.d） Ray- leigh fading channels. We first present the statistical analyses of the first-hop equivalent envelope. Then, we investigate the LCR and AFD of an equivalent end-to-end envelope, and present the closed-form solutions to LCR and AFD, which are given with integral forms. Finally, we derive the Laplace approximations of LCR and AFD as well as the upper and lower bounds. The numerical results of LCR show that the upper bound is tight. For multi user systems with different number of mobile users, the analyses indicate that the LCRs are approximately the same at the low level of the envelope. envelope However, there are at the high level of the reasonable differences among the curves of LCRs. Due to that fact that AFD is the inverse function of LCR, the results for AFD are the opposite.

关键词： wireless communications multiuseruplinks level crossing rate average fadingduration

来源：评论

学校读者我要写书评

暂无评论

A robust object tracking algorithm based on SURF

A robust object tracking algorithm based on SURF

引用

International Conference on wireless communications and Signal Processing (WCSP)

作者： Dan Zhou Dong Hu Education Ministry's Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications 210003 China

In this paper, we propose a robust object tracking algorithm based on SURF. First, we adopt a two-stage matching method to improve the accuracy of SURF matching points. Then a template update method is used to deal with the problem of object appearance change. Next we use matching points between new template and candidate region to locate the initial position of object. As template update and object occlusion will cause the accumulation of tracking errors, therefore, at last fixed template is used to correct object's position. For those frames which have little matching points, we use Meanshift instead of SURF to track object. The experiments demonstrate that our work is robust and can track object accurately in complex environments.

关键词： Target tracking Object tracking Video sequences Robustness Mathematical model Vectors

来源：评论

学校读者我要写书评

暂无评论

Server-Aided Verification Proxy Re-signature

Server-Aided Verification Proxy Re-signature

引用

IEEE International Conference on Trust, Security and Privacy in Computing and communications (TrustCom)

作者： Zhiwei Wang Wei Lv Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing Jiangsu Province P.R. China

Proxy re-signature is proposed by Blaze, Blemmer and Strauss (BBS), in which a semi-trusted proxy acts as a translator converts a signature from Alice into a signature from Bob on the same message. Proxy re-signature is a very useful tool for the interoperable DRM architecture and the proof of passed path in cloud computing. However, cloud users usually are mobile devices which are constrained with processing and power limitations. When a mobile user obtain the converted signature from the proxy (cloud server), it still can not verify it due to the heavy computation cost. We propose a new definition of server-aided verification proxy re-signature which consist of a proxy re-signature scheme and a server-aided verification protocol. With the server-aided verification protocol, some computational tasks for a proxy re-signature verification are carried out by the proxy (cloud server), which is generally untrusted, therefore, it is very useful for mobile devices. We present, on the basis of Ateniese and Hohenberger's unidirectional proxy re-signature scheme, two novel existential unforgeability server-aided verification proxy re-signature schemes.

关键词： Servers Protocols Cloud computing Mobile communication Public key

来源：评论

学校读者我要写书评

暂无评论

Improvement on Ahn et al.'s RSA P-homomorphic signature scheme

Improvement on Ahn et al.'s RSA P-homomorphic signature sche...

引用

8th International ICST Conference on Security and Privacy in communication networks, SecureComm 2012

作者： Wang, Zhiwei College of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210003 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100190 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu 210003 China

ISBN: (纸本)9783642368820

P-homomorphic signature is a general framework for computing on authenticated data, which is recently proposed by Ahn et al. With P-homomorphic signature, any third party can derive a signature on the object message m′ from a signature of m, if m′ and m satisfy P(m,m′) = 1 for some predicate P which denotes the authenticatable relationship between m′ and m. Ahn et al. proposed a RSA P-homomorphic signature scheme by using a RSA accumulator, which is very efficient in space. However, the computational cost of verification and derivation is very heavy. We present an improved P-homomorphic signature scheme based on factoring problem. In our construction, the time efficiency of both verification and derivation are much better than Ahn's scheme. © 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Mining Frequent Itemsets in Data Streams Based on Genetic Algorithm

Mining Frequent Itemsets in Data Streams Based on Genetic Al...

引用

2013 15th IEEE International Conference on communication technology

作者： Chong Han Lijuan Sun Jian Guo Xiaodong Chen College of Computer Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education of Jiangsu Province

ISBN: (纸本)9781479900763

Stream data is a very common data type in big data and in many data streams applications,users tend to pay more attention to the mode information of the data *** mining frequent patterns in data streams is a significative ***,finding frequent itemests in a data set with predefined fixed support threshold could be seen as an optimization *** this paper,the problem of frequent itemsets mining is derived as a non-linear optimization problem,then genetic algorithm is adopted to solve *** the formal and bitmap representation of frequent itemsets,the non-linear optimization problem is transformed to 0-1 programming.A set of experimental results show that unlike typical Apriori algorithm,the complexity of time and memory space grows exponentially as the support decrease,our proposed algorithm has a high time and space efficiency even with a very low support.

关键词： Big data,data streams,genetic algorithm,frequent itemsets

来源：评论

学校读者我要写书评

暂无评论

Virtual network embedding by node-splitting

Virtual network embedding by node-splitting

引用

2013 15th IEEE International Conference on communication technology

作者： Jiandong Huang Qian Wu Yu Liu Bing Wang Wennai Wang Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education College of Telecommunication & Information Engineering Nanjing University of Posts and Telecommunications

network virtualization,as a fundamental technology of Future Internet Architecture,has been used to overcome the ossification of the current *** paper focuses on virtual nodes splitting for aggregating the diverse physical resources in the issue of virtual network embedding(VNE),which is used for the resource allocation in network virtualization.A mixed integer programming(MIP) problem has been proposed by taking both path-splitting and node-splitting into *** feasibility of virtual node splitting is analyzed and a corresponding formal expression is *** VNE performance is evaluated using by a generic MIP solver over a NSFNET *** numerical evaluations in this paper show that,comparing with the approaches for VNE without node-splitting,the proposed algorithm is beneficial to reduce VNE cost,as well as to increase VN acceptance ratio.

关键词： network virtualization Virtual network mapping Node splitting Performance simulation Acceptance ratio

来源：评论

学校读者我要写书评

暂无评论

Research on network malicious code dendritic cell immune algorithm based on fuzzy weighted support vector machine

Research on network malicious code dendritic cell immune alg...

引用

6th China Conference of wireless sensor networks, CWSN 2012

作者： Li, Peng Wang, Ruchuan Zhou, Yanting Dai, Qiuyu College of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210003 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu 210003 China College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210003 China

ISBN: (纸本)9783642362514

According to the significant impact on the accuracy rate of detection of current immune algorithms brought by incorrect classification of signal, it proposes network malicious code dendritic cell immune algorithm based on fuzzy weighted support vector machine. It summarizes and compares the pros and cons of the four methods, which are basic artificial intelligence immune algorithm, detection of unknown viruses based on immunity theory, malicious code immunity based on cryptography and automated intrusion response based on danger theory. It elaborates the process of the algorithm of the proposed immune algorithm, discusses a variety of input and output signals, gives the samples of the actual input signals, applies the coefficient of variation method to determine the values of the weights so as to enhance the discrimination ability of signal processing results, describes the principle and algorithm steps of fuzzy weighted support vector machine clustering method within immune algorithm proposed. By comparing the fuzzy aggregation before and after the immunization program experiments, it draws the conclusion that the proposed immune algorithm can optimize the input signal, fuzzy clustering the signal and the antigen, so as to bring down the number of immunization strategies and reduce the immune response time, as a result it improve the efficiency and performance of the immune system. © 2013 Springer-Verlag.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

A High Performance Frequency Offset Estimation Method for OFDM

A High Performance Frequency Offset Estimation Method for OF...

引用

International Conference on Intelligent System Design and Engineering Application (ISDEA)

作者： Donghua Zhang Lianrui Yu Peng Zhou Qiuyuan Huang Wei Chen Hubei Key Laboratory of Broadband Wireless Communication and Sensor Network School of Information Engineering Wuhan University of Technology Wuhan China

In this paper, we proposed a three-step frequency offset estimation method using a special training frame designed for cable channel in OFDM systems. By making use of the PN-sequence preambles of the training frame, the coarse frequency offset estimation is achieved by the two initial steps. In order to estimate fine frequency offset, we utilize quartic method to eliminate the influence of modulation on the payload data of the training frame. By configuring the three-step estimation neatly, the proposed method makes it possible to realize large span of frequency offset estimation even to half of the system bandwidth, and has high estimation precision. Simulations in AWGN and multipath channels proved the validity of this technique.

关键词： OFDM Estimation Frequency estimation Frequency modulation Training Noise Frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Cooperative Spectrum Sensing with receiver diversity over fading reporting channels

引用

Journal of Information and Computational Science 2013年第9期10卷 2765-2772页

作者： Yue, Wenjing Yang, Zhen Chen, Zhi Wang, Lei Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Nanjing 210003 China National Mobile Communications Research Laboratory Southeast University Nanjing 210003 China

Cooperative Spectrum Sensing (CSS) is well known that, in the fading environment, it can effectively improve the spectrum sensing performance. However, a common problem in CSS requires that the communication links between the sensing users and the data collector must be reliable. In this paper, by taking into account the error introduced by reporting channel (channels between the data collector and the sensing users), We propose a receive diversity based CSS scheme, which improve spectrum sensing accuracy by reducing the probability of error introduced by fading reporting channel. For proposed methods, the relation between detection probability and false alarm probability is studied and the numerical results are given. By considering error probability over fading channel, our analysis and numerical results verify that compared to traditional CSS with OR-rule, the proposed methods can achieve better sensing performance. Copyright © 2013 Binary Information Press.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：