检索结果-南通市图书馆

A NOVEL INTEREST COVERAGE METHOD BASED ON JENSEN-SHANNON DIVERGENCE IN SENSOR NETWORKS

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Electronics(china) 2007年第4期24卷 484-489页

作者： Wang Yufeng Wang Wendong College of telecommunications and Information Engineering Nanjin9 University of Posts and Telecommunications （ NUPT） Nanjin9 210003 China National laboratory of switching technology ＆ telecommunication Networks Beijing University of Posts and Telecommunications （ B UPT） Beijing 100875 China

In this paper, the idea of interest coverage is provided to form clusters in sensor network, which mean that the distance among data trends gathered by neighbor sensors is so small that, in some period, those sensors can be clustered, and certain sensor can be used to replace the cluster to form the virtual sensor network topology. In detail, the Jensen-Shannon Divergence (JSD) is used to characterize the distance among different distributions which represent the data trend of sensors. Then, based on JSD, a hierarchical clustering algorithm is provided to form the virtual sensor network topology. Simulation shows that the proposed approach gains more than 50% energy saving than Sta- tistical Aggregation Methods (SAM) which transmitted data gathered by sensor only when the differ- ence among data exceed certain threshold.

关键词： Sensor network Interest coverage Jensen-Shannon Divergence (JSD) Hierarchical clustering algorithm

维普期刊数据库

Charge-Based Low Priority Congestion Control

在线全文

学校读者我要写书评

暂无评论

Charge-Based Low Priority Congestion Control

2008 11th IEEE International Conference on Communication technology(ICCT2008)

作者： Chi WAng Hongbo Wang Yu Lin and Shanzhi Chen Chunguang Wu state key laboratory of networking and switching technology beij.ng university of posts and telecommunications beij.ng 100876 china Dalian university of technology Dalian 116024 Liaoning china

With the best-effort TCP transporting foreground traffic,below-best-effort transport protocols are developed to transport background ***,we argue in this paper that:1) two fixed levels of priority are not enough,and 2) the background and foreground transfers are subjective concepts which can only be decided by users but not arbitrarily determined by the network according to the application type of the *** we propose the charge-based low priority congestion control（TCP-CBLP）,an algorithm not only provide multiple flexible priority levels lower than best-effort TCP,but also helps users allocating their available bandwidths effectively to optimize their *** results show that the algorithm is fair,stable,and can optimize users’ utilities.

关键词： congestion control low priority congestion pricing background traffic utility function

在线全文

cnki会议

学校读者我要写书评

暂无评论

IPTV关键技术分析及前景展望

china communications 2009年第2期6卷 47-50,83-87页

作者：王洪波程时端北京邮电大学网络与交换技术国家重点实验室

本文介绍了IPTV的基本概念、特点以及IPTV中的关键技术,基于IMS的IPTV系统架构以及Internet TV。阐述了IPTV中QoS和QoE以及二者的联系与区别,分析了IPTV发展中面临的技术挑战。最后,总结了IPTV在中国的发展现状,并对其发展前景进行了展望。

关键词： IPTV IMS P2P QoSI OoE

维普期刊数据库

在线全文

学校读者我要写书评

暂无评论

随机散列函数安全性与签名者作弊

通信学报 2008年第10期29卷 101-107页

作者：李志敏王励成郑世慧杨义先北京邮电大学网络与交换技术国家重点实验室信息安全中心

现有对抗碰撞散列函数的攻击,严重威胁到先'散列'再'签名'的签名算法的安全性。使用随机散列构造RMX来构造此类签名算法的安全性可以不依赖于底层散列函数的离线碰撞稳固性,但前提必须假设签名者不作弊。通过改变随机数的选取方式以及... 详细信息

现有对抗碰撞散列函数的攻击,严重威胁到先'散列'再'签名'的签名算法的安全性。使用随机散列构造RMX来构造此类签名算法的安全性可以不依赖于底层散列函数的离线碰撞稳固性,但前提必须假设签名者不作弊。通过改变随机数的选取方式以及增加消息提供者的签名验证对使用RMX算法的签名算法进行了改进,改进后的算法不需要再假定签名者是诚实的。此外,对Halevi等人提出的随机函数构造rc(M)=Hc(r|■rc(M))的安全性进行了研究,并给出了关于该构造的一个安全紧规约。

关键词：散列函数先“散列”再“签名”的数字签名算法随机散列法 RMX

AN ADVANCED DYNAMIC FEEDBACK AND RANDOM DISPATCHIng LOAD-BALANCIng ALGORITHM FOR GMLC IN 3G

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronics(china) 2006年第5期23卷 641-644页

作者： Liao Jianxin Zhang Hao Zhu Xiaomin state key laboratory of networking and switching technology Beijing University of Posts and Telecommunications Beijing 100876 China

Based on the system architecture and software structure of GMLC (Gateway Mobile Location Center) in 3G (third generation), a new dynamic load-balancing algorithm is proposed. It bases on dynamic feedback and imports the increment for admitting new request into the load forecast. It dynamically adjusts the dispatching probability according to the remainder process capability of each node. Experiments on the per- formance of algorithm have been carried out in GMLC and the algorithm is compared with Pick-KX algorithm and DFB (Dynamic FeedBack) algorithm in average throughput and average response time. Experiments re- sults show that the average throughput of the proposed algorithm is about five percents higher than that of the other two algorithms and the average response time is four percents higher under high system loading condi- tion.

关键词： GMLC (Gateway Mobile Location Center) Load-balancing algorithm Heterogeneous cluster

维普期刊数据库

Group key Management Using key Graphs in ID-Based Cryptosystem

在线全文

学校读者我要写书评

暂无评论

Group Key Management Using Key Graphs in ID-Based Cryptosyst...

中国电子学会第十五届信息论学术年会暨第一届全国网络编码学术年会

作者： Zhao Ziming Li Hui Yang Yixian Niu Xinxin Information Security Center,state key laboratory of networking and switching technology beij.ng university of posts and telecommunications beij.ng,P.R.china,100876

Many newly emerging applications in ID-based cryptosystem are based on group communication *** this paper, we present a hierarchical group key management scheme in an ID-Based cryptosystem *** the proposed scheme,we construct a provable secure group key distribution protocol using bilinear *** security of the proposed scheme is based on the assumption of the bilinear Diffie-Hellman *** the paper presents,our scheme is also scalable and efficient.

关键词： Identity-based cryptosystem Group communication Bilinear pairing Bilinear Diffie-Hellman problem

DRDoS Threat Analysis Based on Magnification Factor and Diffusion Factor

在线全文

cnki会议

学校读者我要写书评

暂无评论

DRDoS Threat Analysis Based on Magnification Factor and Diff...

第一届中国高校通信类院系学术研讨会

作者： Li Ji Hu Ying Zheng Kangfeng Xiu Xinxin Yang Yixian Information security center,state key laboratory of networking and switching technology,beij.ng university of posts and telecommunications,beij.ng 100876

＜正＞As a new kind of DDoS attack method,DRDoS （Distributed Reflect Denial of Service）is easy to launch, but difficult to trace back and *** this paper,the identical properties and possible scenes of DRDoS are discussed,and a novel DRDoS attack model based on magnification factor and diffusion factor is *** the same time,a traffic equation based on the magnification factor and diffusion factor is presented,and the influence of magnification effect and diffusion effect to defend methods are analyzed.

关键词： Network Security Ddos Attack Reflect Attack

在线全文

cnki会议

学校读者我要写书评

暂无评论

密码学原语中信任传递语义研究

通信学报 2008年第12期29卷 60-65页

作者：王励成潘耘谷利泽杨义先北京邮电大学网络与交换技术国家重点实验室信息安全中心中国传媒大学计算机学院

以可信计算和信任管理为背景,考察密码学原语中所包含的信任传递语义,进而借助于目前较为成熟的密码学理论为信任传递机理进行建模,提出了信任传递语义模型的雏形,分析了多种典型数字签名原语中的信任传递语义。分析结果表明所提模型具... 详细信息

以可信计算和信任管理为背景,考察密码学原语中所包含的信任传递语义,进而借助于目前较为成熟的密码学理论为信任传递机理进行建模,提出了信任传递语义模型的雏形,分析了多种典型数字签名原语中的信任传递语义。分析结果表明所提模型具有很强的概括能力。最后,展望了该模型在IP网络信任管理系统设计及分析中的潜在应用。

关键词：密码学原语信任传递语义

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

关于Negabent函数的若干结论

通信学报 2011年第8期32卷 179-182页

作者：任传伦刘凤梅李忠献钮心忻杨义先北京邮电大学网络与交换技术国家重点实验室信息安全中心北京邮电大学网络与信息攻防技术教育部重点实验室华北计算技术研究所信息保障技术重点实验室天津市国瑞数码安全系统有限公司

利用二次不定方程的求解,研究了Negabent函数的判别和构造问题,给出了Negabent函数的一个直观判别条件和一种间接构造法,同时,证明了一类Maiorana-McFarland bent函数不是Negabent函数。

关键词：布尔函数 Nega-Hadamard变换 Negabent函数 bent函数