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

Data Aggregation Scheduling with Guaranteed Lifetime and Efficient Latency in Wireless Sensor networks

China Communications 2012年第9期9卷 11-21页

作者： Chen Zhengyu Yang Geng Chen Lei Xu Jian Wang Haiyong Yang Zhen Key Laboratory of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education Nanjing University of Posts and TelecommunicationsNanjing 210003P.R.China College of Computer Science and Technology Nanjing University of Posts and TelecommunicationsNanjing 210003P.R.China School of Information Technology Jinling Institute of TechnologyNanjing 211169P.R.China

In scenarios of real-time data collection of long-term deployed Wireless Sensor networks （WSNs）, low-latency data collection with long net- work lifetime becomes a key issue. In this paper, we present a data aggregation scheduling with guaran- teed lifetime and efficient latency in WSNs. We first Construct a Guaranteed Lifetime Mininmm Ra- dius Data Aggregation Tree （GLMRDAT） which is conducive to reduce scheduling latency while pro- viding a guaranteed network lifetime, and then de-sign a Greedy Scheduling algorithM （GSM） based on finding the nmzximum independent set in conflict graph to schedule he transmission of nodes in the aggregation tree. Finally, simulations show that our proposed approach not only outperfonm the state-of-the-art solutions in terms of schedule latency, but also provides longer and guaranteed network lifetilre.

关键词： WSNs data aggregation aggregationscheduling network lifetime latency

来源：评论

学校读者我要写书评

暂无评论

Analysis on Token-Controlled Public key Encryption

Analysis on Token-Controlled Public Key Encryption

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Changlu Lin Yong Li Sriramkrishnan Srinivasan Li Lu Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China Key Laboratory of Communication & Information Systems Beijing Municipal Commission of Education Beijing Jiaotong University Beijing China Department of Computing University of Surrey Guildford UK School of Computer Science University of Electronic Science and Technology Chengdu China

ISBN: (纸本)9781467358088

In this paper, we analyze on the use of token-controlled public key encryption (TCE)schemes. We argue that for many of the applications in some possibilities of application in financial or legal scenarios, for example, the millionaire's will problem, the `private-opening' commitment, the scheduled payment problem, and the sealed-bid auctions and electronic lotteries problem, in the literature, the use of token-controlled public key encryption on its own, leads to inadequate solutions. We suggest that when considering applications of TCE, it is advisable to pay close attention to the lack of authentication and incorporate defences against the problems highlighted in this paper.

关键词： Public key encryption Token-controlled public key encryption Authentication Security and privacy Public key encryption Authentication Trichloroethylene

来源：评论

学校读者我要写书评

暂无评论

An evolutionary algorithm for no-wait flowshop problems with flowtime minimization

An evolutionary algorithm for no-wait flowshop problems with...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Zhu, Xia Li, Xiaoping Wang, Qian School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781457703874

In this paper, no-wait flow shop scheduling problem with flowtime minimization is considered. Objective increment properties are analyzed and proved for fundamental operations of heuristics. With these properties, whether a new generated schedule is better or worse than the original one is only evaluated by objective increments, instead of completely calculating objective values as the traditional algorithms do, so that the computational time can be considerably reduced. An evolutionary algorithm (EA) is proposed for the considered problem. The initial population with two members is generated by different heuristics. After crossover, the disturb cycles which consist of a mutation operator and strengthen approaches are conducted to the offspring. EA is compared with the best-so-far algorithms SRTS, PH1p and DPSOvnd on 110 benchmark instances. Experimental results show that EA outperforms the others on effectiveness but is a little worse than DPSOvnd on efficiency. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Chosen Ciphertext Secure Identity-Based Broadcast Encryption in the Standard Model

引用

Journal of Shanghai Jiaotong university(Science) 2011年第6期16卷 672-676页

作者：孙瑾胡予濮张乐友 Key Laboratory of Computer Network and Information Security Xidian University Department of Application Mathematics Xi'an University of Technology

To give concurrent consideration both the efficiency and the security(intensity of intractable problem) in the standard model,a chosen ciphertext secure identity-based broadcast encryption is *** the chosen ciphertext security model,by using identity(ID) sequence and adding additional information in ciphertext,the self-adaptive chosen identity security(the full security) and the chosen ciphertext security are gained *** reduction of scheme's security is the decisional bilinear Diffie-Hellman(BDH) intractable assumption,and the proof of security shows that the proposed scheme is indistinguishable against adaptive chosen ciphertext attacks in the standard model under the decisional BDH intractable *** the security level is improved,and it is suitable for higher security environment.

关键词： the standard model provably secure broadcast encryption the chosen ciphertext security the self-adaptive chosen identity security

来源：评论

学校读者我要写书评

暂无评论

Cooperative Agent-based QoS Framework for heterogeneous networks

Cooperative Agent-based QoS Framework for heterogeneous netw...

引用

2011 International Conference on information Technology, computer Engineering and Management Sciences, ICM 2011

作者： Ding, Feng Zhang, Shuai Wang, Heng Huang, Songhua Tao, Jun Key Laboratory of Science and Technology on Information Systems Engineering Nanjing Research Institute of Electronics Engineering Nanjing China Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9780769545226

With the fast development of network technology and expansion of the network scale, the heterogeneity of Internet makes the Quality of Service (QoS) guarantee techniques even more challenging. In this paper the state-of-the-art of QoS guarantee techniques is first reviewed, and a new Cooperative Agent-based QoS Framework (CAQF) for heterogeneous networks is proposed, which integrates the technologies of QoS-adaptive cooperation, situation awareness, admission control, routing, packet scheduling and resource management. It can be used for intra-domain, inter-domain's QoS guarantee in the heterogeneous networks. Procedure simulation results show that CAQF can achieve expected functionality, while demonstrating the feasibility and universality of the framework for distributed end-to-end QoS cooperation. © 2011 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of synchronization buffering mechanism in peer-to-peer live streaming systems

引用

ICIC Express Letters, Part B: Applications 2012年第6期3卷 1665-1672页

作者： Jin, Shunfu Liu, Na Ma, Zhanyou College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China College of Science Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China

In the peer-to-peer (P2P) live streaming systems, a single stream is decomposed into multiple sub-streams. For the participating nodes, data blocks of different sub-streams are stored in different sub-buffers for synchronization, then forwarded and assembled to the original video stream in chronological order. In this paper, regarding the sub-buffers as multiple queues with homogeneous Poisson arrival processes, the data block forwarding procedure as a polling service, the forwarding suspension in an empty sub-buffer as a service delay state, a symmetric polling model is constructed. By using the method of embedded Markov chain, the mean queueing length and the probability for one queue to be empty when it is visited are derived in steady-state. Moreover, the performance measures in terms of average synchronization buffering length and video continuity level are obtained accordingly. Finally, numerical results are given to demonstrate that an appropriate number of sub-streams and a reasonable time limit for forwarding suspension can enhance the system performance.© 2012 ISSN 2185-2766.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Graph-based single-copy routing in delay tolerant networks

引用

High Technology Letters 2011年第1期17卷 52-56页

作者：于海征 Ma Jianfeng Key Laboratory of Computer Network and Information Security Xidian University Xi＇ an 710071 P. R. China

This paper presents a new graph-based single-copy routmg method m delay tolerant networks （DTN）. With time goes on in the networks, a DTN connectivity graph is constituted with mobility of nodes and communication, and a corresponding greedy tree is obtained using a greedy algorithm in DTN connectivity graph. While there are some bad nodes such as disabled nodes or selfish nodes in delay tolerant networks, the nodes can choose the next p^oper intermediate node to transmit the mes- sage by comparing the location of neighboring nodes in the greedy tree. The single-copy routing method is very appropriate for energy-constrained, storage-constrained and bandwidth-constrained applications such as mobile wireless DTN networks. We show that delivery ratio is increased significantly by using the graph-based single-copy routing when bad nodes exist.

关键词： delay tolerant network （ DTN） message single-copy routing graph

来源：评论

学校读者我要写书评

暂无评论

Deterministic Pilot Design for MIMO OFDM System Based on Compressed Sensing

Deterministic Pilot Design for MIMO OFDM System Based on Com...

引用

2012 IEEE 14th International Conference on Communication Technology

作者： Nan Jing Weihong Bi Lin Wang School of Information Science and Engineering Yanshan University The Key Laboratory for Special Fiber and Fiber Sensor of Hebei Province School of Information Science and Engineering Yanshan University The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province

ISBN: (纸本)9781467321006

We consider the problem of pilot design for sparse multipath channel estimation in multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system in this *** order to reconstruct MIMO sparse channel,the prevalent compressed sensing (CS) theory is *** to random pilot construction,a deterministic pilot de- sign method is exploited to form the measurement matrix by deterministically extracting some rows of Fourier matrix that satisfies Restricted Isometry Property (RIP).Two families of continuous functions,namely f1 -SL0 and f 2-SL0,are investi- gated in this paper to approximate A 0norm for MIMO sparse channel *** results suggest that the de- terministic pilot design scheme performs as well as the random one at both low and high signal noise ratio (SNR).Moreover,f1 - SL0 and f 2-SL0 outperform A 1-dantzig algorithm with faster running time and better anti-noisy performance.

关键词： sparse channel estimation,deterministic pilot design,compressed sensing,MIMO OFDM

来源：评论

学校读者我要写书评

暂无评论

miRDeathDB:a database bridging microRNAs and the programmed cell death

miRDeathDB:a database bridging microRNAs and the programmed ...

引用

第五届全国生物信息学与系统生物学学术大会暨国际生物信息学前沿研讨会高通量时代的生物信息学与系统生物学

作者： Jianzhen Xu Yan-Hui Li College of Bioengineering Henan University of TechnologyZhengzhouChina 450001 Institute of Cardiovascular Sciences and Key Laboratory of Molecular Cardiovascular Sciences Ministry of EducationPeking University Health Science Center Scientific Data Center Computer Network Information CenterChinese Academy of Sciences

Background:MicroRNAs(miRNAs) are a class of small non-coding RNAs,which negatively regulate protein coding genes at the posttranscriptional *** tiny regulators have been associated to almost all known physiological and pathological *** defects in miRNAs have been implicated in the etiology of many forms of human diseases. Apoptosis,autophagy and programmed necrosis are three distinct yet intimately connected functional modules of programmed cell death(PCD).In the past few years,increasing evidences suggested that aberrant expression of miRNAs regulate different subroutines of *** the roles of miRNAs in PCD network has attracted interests of researchers from a wide range of ***,a knowledge depository,which integrates information for both miRNAs and their targets in PCD network,will be of great help. Methods:Based on PubMed search,we firstly collected literatures which reported the roles of miRNAs in PCD before April ***,these literatures were inspected manually and the miRNAs and their targets genes were *** criterion for selecting PCD associated miRNAs in miRDeathDB is *** morphological or biochemical data should be provided when the miRNAs(or their targets) are manipulated in cell death *** miRDeathDB(http://***/mirdeathdb/) was developed,which allows users to browse,search and analyze the PCD associated miRNAs. Results:In total,210 records covering 86 miRNAs and 95 protein coding genes were collected in five model species:humans(Homo sapiens),mice(Mus musculus),fruit flies (Drosophila melanogaster),rat(Rattus norvegicus) and African frog(Xenopus tropicalis). Users can search the database for both miRNAs and protein coding entries based on principal *** addition,users can browse and obtain full lists of miRNAs involved in PCD for any given *** data can be freely downloaded or accessed via our website for academic uses. Conclusions:miRDeathDB provides a valuab

关键词： microRNAs apoptosis autophagy necrosis

来源：评论

学校读者我要写书评

暂无评论

Web service selection with quantitative and qualitative user preferences

Web service selection with quantitative and qualitative user...

引用

2011 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2011

作者： Wang, Hongbing Liu, Weihong Key Lab of Computer Network and Information Integration School of Computer Science and Engineering Southeast University 211189 China School of Computer Science Anhui Unversity of Technology 243002 China

ISBN: (纸本)9780769545134

Most existing approaches of Web service selection with user preferences are either quantitative or qualitative. However, using a qualitative or quantitative approach alone cannot handle all the non-functional properties(NFPs). To solve this problem, we present an approach of service selection with quantitative and qualitative user preferences, where qualitative preferences are modeled as a TCP-net and quantitative preferences are specified by using arbitrary positive numbers. Our approach consists of two steps, that is, qualitative selection based on qualitative preferences and quantitative selection based on quantitative preferences. We prove its effectiveness and verify its efficiency through extensive experiments. © 2011 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：