首页 > 最新文献

Journal of China Universities of Posts and Telecommunications最新文献

英文 中文
Ant colony optimization based load balancing routing and wavelength assignment for optical satellite networks 基于蚁群优化的光卫星网络负载均衡路由和波长分配
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60236-X
Wen Guoli , Zhang Qi , Wang Houtian , Tian Qinghua , Zhang Wei , Xin Xiangjun

An ant colony optimization (ACO) based load balancing routing and wavelength assignment (RWA) algorithm (ALRWA) was put forward for the sake of achieving a fairy load balancing over the entire optical satellite networks. A multi-objective optimization model is established considering the characteristic of global traffic distribution. This not only employs the traffic intensity to modify the light path cost, but also monitors the wavelength utilization of optical inter-satellite links (ISLs). Then an ACO algorithm is utilized to solve this model, leading to finding an optimal light path for every connection request. The optimal light path has the minimum light path cost under satisfying the constraints of wavelength utilization, transmission delay and wavelength-continuity. Simulation results show that ALRWA performs well in blocking probability and realizes efficient load balancing. Meanwhile, the average transmission delay can meet the basic requirement of real-time business transmission.

为了实现整个光卫星网络的童话负载均衡,提出了一种基于蚁群优化的负载均衡路由和波长分配算法。考虑全球交通分布的特点,建立了一个多目标优化模型。这不仅利用业务强度来修改光路成本,而且还监测卫星间光链路(ISL)的波长利用率。然后利用ACO算法来求解该模型,从而为每个连接请求找到最佳光路。在满足波长利用率、传输延迟和波长连续性的约束下,最优光路具有最小的光路成本。仿真结果表明,ALRWA在阻塞概率方面表现良好,实现了高效的负载均衡。同时,平均传输时延可以满足实时业务传输的基本要求。
{"title":"Ant colony optimization based load balancing routing and wavelength assignment for optical satellite networks","authors":"Wen Guoli ,&nbsp;Zhang Qi ,&nbsp;Wang Houtian ,&nbsp;Tian Qinghua ,&nbsp;Zhang Wei ,&nbsp;Xin Xiangjun","doi":"10.1016/S1005-8885(17)60236-X","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60236-X","url":null,"abstract":"<div><p>An ant colony optimization (ACO) based load balancing routing and wavelength assignment (RWA) algorithm (ALRWA) was put forward for the sake of achieving a fairy load balancing over the entire optical satellite networks. A multi-objective optimization model is established considering the characteristic of global traffic distribution. This not only employs the traffic intensity to modify the light path cost, but also monitors the wavelength utilization of optical inter-satellite links (ISLs). Then an ACO algorithm is utilized to solve this model, leading to finding an optimal light path for every connection request. The optimal light path has the minimum light path cost under satisfying the constraints of wavelength utilization, transmission delay and wavelength-continuity. Simulation results show that ALRWA performs well in blocking probability and realizes efficient load balancing. Meanwhile, the average transmission delay can meet the basic requirement of real-time business transmission.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 77-86"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60236-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72265835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Stateless overlay multicast with in-packet bloom filters 具有数据包内布隆过滤器的无状态覆盖多播
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60232-2
Tian Shengwen , Wang Jingyu , Yang Hongyong , Cui Guanghai

Due to the difficulty of deploying Internet protocol (IP) multicast on the Internet on a large scale, overlay multicast has been considered as a promising alternative to develop the multicast communication in recent years. However, the existing overlay multicast solutions suffer from high costs to maintain the state information of nodes in the multicast forwarding tree. A stateless overlay multicast scheme is proposed, in which the multicast routing information is encoded by a bloom filter (BF) and encapsulated into the packet header without any need for maintaining the multicast forwarding tree. Our scheme leverages the node heterogeneity and proximity information in the physical topology and hierarchically constructs the transit-stub overlay topology by assigning geometric coordinates to all overlay nodes. More importantly, the scheme uses BF technology to identify the nodes and links of the multicast forwarding tree, which improves the forwarding efficiency and decreases the false-positive forwarding loop. The analytical and simulation results show that the proposal can achieve high forwarding efficiency and good scalability.

由于在互联网上大规模部署互联网协议(IP)多播的困难,近年来,覆盖多播被认为是发展多播通信的一种很有前途的替代方案。然而,现有的覆盖多播解决方案在维护多播转发树中节点的状态信息方面存在高昂的成本。提出了一种无状态覆盖多播方案,其中多播路由信息由布隆过滤器(BF)编码并封装到分组报头中,而不需要维护多播转发树。我们的方案利用了物理拓扑中的节点异构性和邻近性信息,并通过为所有覆盖节点分配几何坐标来分层构建传输存根覆盖拓扑。更重要的是,该方案使用BF技术来识别多播转发树的节点和链路,提高了转发效率,减少了误报转发循环。分析和仿真结果表明,该方案具有较高的转发效率和良好的可扩展性。
{"title":"Stateless overlay multicast with in-packet bloom filters","authors":"Tian Shengwen ,&nbsp;Wang Jingyu ,&nbsp;Yang Hongyong ,&nbsp;Cui Guanghai","doi":"10.1016/S1005-8885(17)60232-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60232-2","url":null,"abstract":"<div><p>Due to the difficulty of deploying Internet protocol (IP) multicast on the Internet on a large scale, overlay multicast has been considered as a promising alternative to develop the multicast communication in recent years. However, the existing overlay multicast solutions suffer from high costs to maintain the state information of nodes in the multicast forwarding tree. A stateless overlay multicast scheme is proposed, in which the multicast routing information is encoded by a bloom filter (BF) and encapsulated into the packet header without any need for maintaining the multicast forwarding tree. Our scheme leverages the node heterogeneity and proximity information in the physical topology and hierarchically constructs the transit-stub overlay topology by assigning geometric coordinates to all overlay nodes. More importantly, the scheme uses BF technology to identify the nodes and links of the multicast forwarding tree, which improves the forwarding efficiency and decreases the false-positive forwarding loop. The analytical and simulation results show that the proposal can achieve high forwarding efficiency and good scalability.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 44-52"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60232-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72265834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Speaker conversion using kernel non-negative matrix factorization 基于核非负矩阵因子分解的说话人转换
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60234-6
Xu Qinyu , Lu Guanming , Yan Jingjie , Li Haibo , Cheng Xiao

Voice conversion (VC) based on Gaussian mixture model (GMM) is the most classic and common method which converts the source spectrum to target spectrum. However this method is prone to over-fitting because of its frame-by-frame conversion. The VC with non-negative matrix factorization (NMF) is presented in this paper, which can keep spectrum from over-fitting by adjusting the size of basis vector (dictionary). In order to realize the non-linear mapping better, kernel NMF (KNMF) is adopted to achieve spectrum mapping. In addition, to increase the accuracy of conversion, KNMF combined with GMM (GKNMF) is also introduced into VC. In the end, KNMF, GKNMF, GMM, principal component regression (PCR), PCR combined with GMM (GPCR), partial least square regression (PLSR), NMF correlation-based frequency warping (NMF-CFW) and deep neural network (DNN) methods are compared with each other. The proposed GKNMF gets better performance in both objective evaluation and subjective evaluation.

基于高斯混合模型(GMM)的语音转换(VC)是将源频谱转换为目标频谱的最经典、最常用的方法。然而,这种方法由于其逐帧转换而易于过度拟合。本文提出了一种具有非负矩阵分解(NMF)的VC,它可以通过调整基向量(字典)的大小来防止频谱过拟合。为了更好地实现非线性映射,采用核NMF(KNMF)来实现频谱映射。此外,为了提高转换的准确性,还将KNMF与GMM(GKNMF)相结合的方法引入VC中。最后,将KNMF、GKNMF、GMM、主成分回归(PCR)、PCR与GMM相结合(GPCR)、偏最小二乘回归(PLSR)、基于NMF相关的频率扭曲(NMF-CFW)和深度神经网络(DNN)方法进行了比较。所提出的GKNMF在客观评价和主观评价中都取得了较好的性能。
{"title":"Speaker conversion using kernel non-negative matrix factorization","authors":"Xu Qinyu ,&nbsp;Lu Guanming ,&nbsp;Yan Jingjie ,&nbsp;Li Haibo ,&nbsp;Cheng Xiao","doi":"10.1016/S1005-8885(17)60234-6","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60234-6","url":null,"abstract":"<div><p>Voice conversion (VC) based on Gaussian mixture model (GMM) is the most classic and common method which converts the source spectrum to target spectrum. However this method is prone to over-fitting because of its frame-by-frame conversion. The VC with non-negative matrix factorization (NMF) is presented in this paper, which can keep spectrum from over-fitting by adjusting the size of basis vector (dictionary). In order to realize the non-linear mapping better, kernel NMF (KNMF) is adopted to achieve spectrum mapping. In addition, to increase the accuracy of conversion, KNMF combined with GMM (GKNMF) is also introduced into VC. In the end, KNMF, GKNMF, GMM, principal component regression (PCR), PCR combined with GMM (GPCR), partial least square regression (PLSR), NMF correlation-based frequency warping (NMF-CFW) and deep neural network (DNN) methods are compared with each other. The proposed GKNMF gets better performance in both objective evaluation and subjective evaluation.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 60-67"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60234-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72251597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extraction technique of region of interest from stereoscopic video 立体视频中感兴趣区域的提取技术
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60235-8
Lü Chaohui, Pan Jiaying

A feature fusion approach is presented to extract the region of interest (ROI) from the stereoscopic video. [0]Based on human vision system (HVS), the depth feature, the color feature and the motion feature are chosen as vision features. [0]The algorithm is shown as follows. Firstly, color saliency is calculated on superpixel scale. Color space distribution of the superpixel and the color difference between the superpixel and background pixel are used to describe color saliency and color salient region is detected. Then, the classic visual background extractor (Vibe) algorithm is improved from the update interval and update region of background model. The update interval is adjusted according to the image content. The update region is determined through non-obvious movement region and background point detection. So the motion region of stereoscopic video is extracted using improved Vibe algorithm. The depth salient region is detected by selecting the region with the highest gray value. Finally, three regions are fused into final ROI. Experiment results show that the proposed method can extract ROI from stereoscopic video effectively. In order to further verify the proposed method, stereoscopic video coding application is also carried out on the joint model (JM) encoder with different bit allocation in ROI and the background region.

提出了一种从立体视频中提取感兴趣区域的特征融合方法。[0]基于人类视觉系统(HVS),选择深度特征、颜色特征和运动特征作为视觉特征。[0]算法如下所示。首先,在超像素尺度上计算颜色显著性。利用超像素的颜色空间分布和超像素与背景像素之间的色差来描述颜色显著性,并检测颜色显著区域。然后,从背景模型的更新间隔和更新区域两个方面对经典的视觉背景提取器(Vibe)算法进行了改进。根据图像内容来调整更新间隔。通过非明显运动区域和背景点检测来确定更新区域。因此,采用改进的Vibe算法提取立体视频的运动区域。通过选择具有最高灰度值的区域来检测深度显著区域。最后,将三个区域融合到最终ROI中。实验结果表明,该方法能够有效地从立体视频中提取ROI。为了进一步验证所提出的方法,还对ROI和背景区域中具有不同比特分配的联合模型(JM)编码器进行了立体视频编码应用。
{"title":"Extraction technique of region of interest from stereoscopic video","authors":"Lü Chaohui,&nbsp;Pan Jiaying","doi":"10.1016/S1005-8885(17)60235-8","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60235-8","url":null,"abstract":"<div><p>A feature fusion approach is presented to extract the region of interest (ROI) from the stereoscopic video. [0]Based on human vision system (HVS), the depth feature, the color feature and the motion feature are chosen as vision features. [0]The algorithm is shown as follows. Firstly, color saliency is calculated on superpixel scale. Color space distribution of the superpixel and the color difference between the superpixel and background pixel are used to describe color saliency and color salient region is detected. Then, the classic visual background extractor (Vibe) algorithm is improved from the update interval and update region of background model. The update interval is adjusted according to the image content. The update region is determined through non-obvious movement region and background point detection. So the motion region of stereoscopic video is extracted using improved Vibe algorithm. The depth salient region is detected by selecting the region with the highest gray value. Finally, three regions are fused into final ROI. Experiment results show that the proposed method can extract ROI from stereoscopic video effectively. In order to further verify the proposed method, stereoscopic video coding application is also carried out on the joint model (JM) encoder with different bit allocation in ROI and the background region.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 68-76"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60235-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72251619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Centralized congestion control routing protocol based on multi-metrics for low power and lossy networks 基于多指标的低功耗有损网络集中式拥塞控制路由协议
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60231-0
Yao Yukun, Liu Jiangbing, Xu Dongliang, Ren Zhi, Hu Qing

Owing to the unreliability of wireless link and the resource constraints of embedded devices in terms of energy, processing power, and memory size in low power and lossy networks (LLNs), network congestion may occur in an emergency and lead to significant packet loss and end-to-end delay. To mitigate the effect of network congestion, this paper proposes a centralized congestion control routing protocol based on multi-metrics (CCRPM). It combines the residual energy of a node, buffer occupancy rate, wireless link quality, and the current number of sub-nodes for the candidate parent to reduce the probability of network congestion in the process of network construction. In addition, it adopts a centralized way to determine whether the sub-nodes of the congested node need to be switched based on the traffic analysis when network congestion occurs. Theoretical analysis and extensive simulation results show that compared with the existing routing protocol, the performance of CCRPM is improved significantly in reducing the probability of network congestion, prolonging average network lifetime, increasing network throughput, and decreasing end-to-end delay.

在低功耗和有损网络(LLN)中,由于无线链路的不可靠性以及嵌入式设备在能量、处理能力和内存大小方面的资源限制,网络拥塞可能在紧急情况下发生,并导致显著的数据包丢失和端到端延迟。为了减轻网络拥塞的影响,本文提出了一种基于多度量的集中式拥塞控制路由协议。它结合了节点的剩余能量、缓冲区占用率、无线链路质量以及候选父节点的当前子节点数量,以降低网络建设过程中出现网络拥塞的概率。此外,当网络拥塞发生时,它采用集中的方式,根据流量分析来确定拥塞节点的子节点是否需要切换。理论分析和大量仿真结果表明,与现有的路由协议相比,CCRPM的性能在降低网络拥塞概率、延长平均网络寿命、提高网络吞吐量和降低端到端延迟方面有了显著提高。
{"title":"Centralized congestion control routing protocol based on multi-metrics for low power and lossy networks","authors":"Yao Yukun,&nbsp;Liu Jiangbing,&nbsp;Xu Dongliang,&nbsp;Ren Zhi,&nbsp;Hu Qing","doi":"10.1016/S1005-8885(17)60231-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60231-0","url":null,"abstract":"<div><p>Owing to the unreliability of wireless link and the resource constraints of embedded devices in terms of energy, processing power, and memory size in low power and lossy networks (LLNs), network congestion may occur in an emergency and lead to significant packet loss and end-to-end delay. To mitigate the effect of network congestion, this paper proposes a centralized congestion control routing protocol based on multi-metrics (CCRPM). It combines the residual energy of a node, buffer occupancy rate, wireless link quality, and the current number of sub-nodes for the candidate parent to reduce the probability of network congestion in the process of network construction. In addition, it adopts a centralized way to determine whether the sub-nodes of the congested node need to be switched based on the traffic analysis when network congestion occurs. Theoretical analysis and extensive simulation results show that compared with the existing routing protocol, the performance of CCRPM is improved significantly in reducing the probability of network congestion, prolonging average network lifetime, increasing network throughput, and decreasing end-to-end delay.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 35-43"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60231-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72265832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
SFD-AGC algorithm with ADC digitalizing bit fully utilized and stable PAR 充分利用ADC数字化位的SFD-AGC算法,标准杆数稳定
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60228-0
Wang Jie , Hu Xiaoguang , Guan Enyi , Ding Zhushun , Yao Yidong , Li Wen

Aiming at making full use of analog to digital converter (ADC) digitalizing bit without oversaturation while keeping peak to average ratio (PAR) stable, this paper puts forward a new segmented full-digital (SFD)-automatic gain control (AGC) algorithm for a new long term evolution (LTE) communication system. Segmented digital gain control strategy is adopted to adjust the gain by only one step based on detected power status. Whether the gain needs to be adjusted is determined by current signal state derived from the change ranges of adjacent root mean square (RMS) of input signal, but not the difference between the power level of current signal and target signal. Software simulation and hardware implementing had been conducted with LTE frequency division dual (FDD) uplink signal and the results indicated that the proposed AGC algorithm can judge power status accurately and hence adjust the gain precisely in one step with a short delay, further, it can make full use of ADC digitalizing bit without oversaturation as well as keeping stable PAR. In addition, the mean error vector magnitude (EVM) was confined less than 1.6% to meet the 3rd generation partnership project (3GPP) standard well.

针对一种新的长期演进(LTE)通信系统,提出了一种分段全数字(SFD)-自动增益控制(AGC)算法,该算法在保证标准杆数稳定的前提下,充分利用模数转换器(ADC)数字化比特不过饱和。采用分段数字增益控制策略,根据检测到的功率状态只调整一步增益。增益是否需要调整取决于从输入信号的相邻均方根(RMS)的变化范围导出的当前信号状态,而不是当前信号和目标信号的功率电平之间的差。对LTE频分双(FDD)上行信号进行了软件仿真和硬件实现,结果表明,所提出的AGC算法可以准确判断功率状态,从而在短延迟的情况下一步精确调整增益,并且可以充分利用ADC数字化比特而不过饱和,保持标准杆数稳定,平均误差矢量幅度(EVM)被限制在1.6%以下,以很好地满足第三代合作伙伴计划(3GPP)标准。
{"title":"SFD-AGC algorithm with ADC digitalizing bit fully utilized and stable PAR","authors":"Wang Jie ,&nbsp;Hu Xiaoguang ,&nbsp;Guan Enyi ,&nbsp;Ding Zhushun ,&nbsp;Yao Yidong ,&nbsp;Li Wen","doi":"10.1016/S1005-8885(17)60228-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60228-0","url":null,"abstract":"<div><p>Aiming at making full use of analog to digital converter (ADC) digitalizing bit without oversaturation while keeping peak to average ratio (PAR) stable, this paper puts forward a new segmented full-digital (SFD)-automatic gain control (AGC) algorithm for a new long term evolution (LTE) communication system. Segmented digital gain control strategy is adopted to adjust the gain by only one step based on detected power status. Whether the gain needs to be adjusted is determined by current signal state derived from the change ranges of adjacent root mean square (RMS) of input signal, but not the difference between the power level of current signal and target signal. Software simulation and hardware implementing had been conducted with LTE frequency division dual (FDD) uplink signal and the results indicated that the proposed AGC algorithm can judge power status accurately and hence adjust the gain precisely in one step with a short delay, further, it can make full use of ADC digitalizing bit without oversaturation as well as keeping stable PAR. In addition, the mean error vector magnitude (EVM) was confined less than 1.6% to meet the 3rd generation partnership project (3GPP) standard well.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 8-15"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60228-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72251616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks 无线传感器网络有限域上辛几何密钥预分配新方案
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60229-2
Chen Shangdi , Wen Jiejing

To achieve secure communication in wireless sensor networks (WSNs), where sensor nodes with limited computation capability are randomly scattered over a hostile territory, various key pre-distribution schemes (KPSs) have been proposed. In this paper, a new KPS is proposed based on symplectic geometry over finite fields. A fixed dimensional subspace in a symplectic space represents a node, all 1-dimensional subspaces represent keys and every pair of nodes has shared keys. But this naive mapping does not guarantee a good network resiliency. Therefore, it is proposed an enhanced KPS where two nodes have to compute a pairwise key, only if they share at least q common keys. This approach enhances the resilience against nodes capture attacks. Compared with the existence of solution, the results show that new approach enhances the network scalability considerably, and achieves good connectivity and good overall performance.

为了在无线传感器网络(WSN)中实现安全通信,已经提出了各种密钥预分发方案(KPS),其中具有有限计算能力的传感器节点随机分散在敌对区域上。本文基于有限域上的辛几何,提出了一种新的KPS。辛空间中的固定维子空间表示一个节点,所有一维子空间表示密钥,并且每对节点都有共享密钥。但这种天真的映射并不能保证良好的网络弹性。因此,提出了一种增强的KPS,其中两个节点必须计算成对密钥,前提是它们共享至少q个公共密钥。这种方法增强了抵御节点捕获攻击的弹性。与现有的解决方案相比,结果表明,新方法大大提高了网络的可扩展性,实现了良好的连通性和整体性能。
{"title":"New key pre-distribution scheme using symplectic geometry over finite fields for wireless sensor networks","authors":"Chen Shangdi ,&nbsp;Wen Jiejing","doi":"10.1016/S1005-8885(17)60229-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60229-2","url":null,"abstract":"<div><p>To achieve secure communication in wireless sensor networks (WSNs), where sensor nodes with limited computation capability are randomly scattered over a hostile territory, various key pre-distribution schemes (KPSs) have been proposed. In this paper, a new KPS is proposed based on symplectic geometry over finite fields. A fixed dimensional subspace in a symplectic space represents a node, all 1-dimensional subspaces represent keys and every pair of nodes has shared keys. But this naive mapping does not guarantee a good network resiliency. Therefore, it is proposed an enhanced KPS where two nodes have to compute a pairwise key, only if they share at least <em>q</em> common keys. This approach enhances the resilience against nodes capture attacks. Compared with the existence of solution, the results show that new approach enhances the network scalability considerably, and achieves good connectivity and good overall performance.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 16-22, 76"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60229-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72251617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Dynamic resource allocation in cloud download service 云下载服务中的动态资源分配
Q4 Computer Science Pub Date : 2017-10-01 DOI: 10.1016/S1005-8885(17)60233-4
Tan Xiaoying , Huang Dan , Guo Yuchun , Chen Changjia

Cloud download service, as a new application which downloads the requested content offline and reserves it in cloud storage until users retrieve it, has recently become a trend attracting millions of users in China. In the face of the dilemma between the growth of download requests and the limitation of storage resource, the cloud servers have to design an efficient resource allocation scheme to enhance the utilization of storage as well as to satisfy users' needs like a short download time. When a user's churn behavior is considered as a Markov chain process, it is found that a proper allocation of download speed can optimize the storage resource utilization. Accordingly, two dynamic resource allocation schemes including a speed switching (SS) scheme and a speed increasing (SI) scheme are proposed. Both theoretical analysis and simulation results prove that our schemes can effectively reduce the consumption of storage resource and keep the download time short enough for a good user experience.

云下载服务作为一种新的应用程序,可以离线下载请求的内容,并将其保留在云存储中,直到用户检索到为止,最近已成为吸引中国数百万用户的趋势。面对下载请求的增长和存储资源的限制之间的困境,云服务器必须设计一种高效的资源分配方案,以提高存储的利用率,并在短的下载时间内满足用户的需求。当用户的流失行为被视为一个马尔可夫链过程时,发现适当的下载速度分配可以优化存储资源的利用率。因此,提出了两种动态资源分配方案,包括速度切换(SS)方案和速度增加(SI)方案。理论分析和仿真结果都证明,我们的方案可以有效地降低存储资源的消耗,并使下载时间足够短,从而获得良好的用户体验。
{"title":"Dynamic resource allocation in cloud download service","authors":"Tan Xiaoying ,&nbsp;Huang Dan ,&nbsp;Guo Yuchun ,&nbsp;Chen Changjia","doi":"10.1016/S1005-8885(17)60233-4","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60233-4","url":null,"abstract":"<div><p>Cloud download service, as a new application which downloads the requested content offline and reserves it in cloud storage until users retrieve it, has recently become a trend attracting millions of users in China. In the face of the dilemma between the growth of download requests and the limitation of storage resource, the cloud servers have to design an efficient resource allocation scheme to enhance the utilization of storage as well as to satisfy users' needs like a short download time. When a user's churn behavior is considered as a Markov chain process, it is found that a proper allocation of download speed can optimize the storage resource utilization. Accordingly, two dynamic resource allocation schemes including a speed switching (SS) scheme and a speed increasing (SI) scheme are proposed. Both theoretical analysis and simulation results prove that our schemes can effectively reduce the consumption of storage resource and keep the download time short enough for a good user experience.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 5","pages":"Pages 53-59"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60233-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72265833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Efficient closed-form solution for target localization using TDOA measurements in the presence of sensor position errors 在存在传感器位置误差的情况下,使用时差测量进行目标定位的有效闭合形式解决方案
Q4 Computer Science Pub Date : 2017-08-01 DOI: 10.1016/S1005-8885(17)60217-6
Yan Leibing , Zhang Yerong , Lu Yin

Abstract

An efficient solution for locating a target was proposed, which by using time difference of arrival (TDOA) measurements in the presence of random sensor position errors to increase the accuracy of estimation. The cause of position estimation errors in two-stage weighted least squares (TSWLS) method is analyzed to develop a simple and effective method for improving the localization performance. Specifically, the reference sensor is selected again and the coordinate system is rotated according to preliminary estimated target position by using TSWLS method, and the final position estimation of the target is obtained by using weighted least squares (WLS). The proposed approach exhibits a closed-form and is as efficient as TSWLS method. Simulation results show that the proposed approach yields low estimation bias and improved robustness with increasing sensor position errors and thus can easily achieve the Cramer-Rao lower bound (CRLB) easily and effectively improve the localization accuracy.

摘要提出了一种有效的目标定位解决方案,该方案通过在存在随机传感器位置误差的情况下使用到达时间差(TDOA)测量来提高估计精度。分析了两阶段加权最小二乘(TSWLS)方法中位置估计误差的原因,提出了一种简单有效的方法来提高定位性能。具体地,通过使用TSWLS方法根据初步估计的目标位置再次选择参考传感器并旋转坐标系,并且通过使用加权最小二乘法(WLS)获得目标的最终位置估计。所提出的方法表现出封闭的形式,并且与TSWLS方法一样有效。仿真结果表明,随着传感器位置误差的增加,该方法具有较低的估计偏差和较高的鲁棒性,可以很容易地实现Cramer-Rao下界,有效地提高定位精度。
{"title":"Efficient closed-form solution for target localization using TDOA measurements in the presence of sensor position errors","authors":"Yan Leibing ,&nbsp;Zhang Yerong ,&nbsp;Lu Yin","doi":"10.1016/S1005-8885(17)60217-6","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60217-6","url":null,"abstract":"<div><h3>Abstract</h3><p>An efficient solution for locating a target was proposed, which by using time difference of arrival (TDOA) measurements in the presence of random sensor position errors to increase the accuracy of estimation. The cause of position estimation errors in two-stage weighted least squares (TSWLS) method is analyzed to develop a simple and effective method for improving the localization performance. Specifically, the reference sensor is selected again and the coordinate system is rotated according to preliminary estimated target position by using TSWLS method, and the final position estimation of the target is obtained by using weighted least squares (WLS). The proposed approach exhibits a closed-form and is as efficient as TSWLS method. Simulation results show that the proposed approach yields low estimation bias and improved robustness with increasing sensor position errors and thus can easily achieve the Cramer-Rao lower bound (CRLB) easily and effectively improve the localization accuracy.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 4","pages":"Pages 1-9, 15"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60217-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72263780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Low-profile microwave lens antenna based on isotropic Huygens' metasurfaces 基于各向同性惠更斯超表面的低剖面微波透镜天线
Q4 Computer Science Pub Date : 2017-08-01 DOI: 10.1016/S1005-8885(17)60218-8
Wang Zhengbin , Wang Haofang , Dong Zhuangli , Wu Zhihang , Zhang Yerong , Zhou Zhipeng

Abstract

An isotropic electromagnetic (EM) lens based on Huygens' metasurface is proposed for 28.0 GHz lens antenna design. The lens consists of a series of non-resonant and subwavelength metallic patterns etched on both sides of an ultrathin dielectric substrate. Both electric and magnetic responses are introduced to realize desired abrupt phase change and high-efficiency transmission for the secondary wavelets in the incident wavefront. Then, a substrate-integrated waveguide (SIW) fed patch antenna is combined with the lens as the primary feed to form a low-profile lens antenna system. The simulated and measured results coincide with each other, and demonstrate that the prototype realizes 8.8 dB∼12.6 dB gain increment and low side-lobe levels over the bandwidth of 26.7 GHz∼30.0 GHz. The novel design leads to a low-profile, light weight, and low-cost antenna solution in a wireless communication system.

摘要提出了一种基于惠更斯超表面的各向同性电磁透镜,用于28.0 GHz透镜天线的设计。该透镜由一系列非谐振和亚波长的金属图案组成,这些图案蚀刻在超薄电介质衬底的两侧。引入了电响应和磁响应,以实现入射波前中二次小波的期望突变相位和高效传输。然后,将衬底集成波导(SIW)馈电的贴片天线与透镜组合作为主馈电,以形成低轮廓透镜天线系统。模拟和测量结果相互一致,并证明原型在26.7 GHz~30.0 GHz的带宽上实现了8.8 dB~12.6 dB的增益增量和低旁瓣电平。这种新颖的设计在无线通信系统中提供了一种低轮廓、轻重量和低成本的天线解决方案。
{"title":"Low-profile microwave lens antenna based on isotropic Huygens' metasurfaces","authors":"Wang Zhengbin ,&nbsp;Wang Haofang ,&nbsp;Dong Zhuangli ,&nbsp;Wu Zhihang ,&nbsp;Zhang Yerong ,&nbsp;Zhou Zhipeng","doi":"10.1016/S1005-8885(17)60218-8","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60218-8","url":null,"abstract":"<div><h3>Abstract</h3><p>An isotropic electromagnetic (EM) lens based on Huygens' metasurface is proposed for 28.0 GHz lens antenna design. The lens consists of a series of non-resonant and subwavelength metallic patterns etched on both sides of an ultrathin dielectric substrate. Both electric and magnetic responses are introduced to realize desired abrupt phase change and high-efficiency transmission for the secondary wavelets in the incident wavefront. Then, a substrate-integrated waveguide (SIW) fed patch antenna is combined with the lens as the primary feed to form a low-profile lens antenna system. The simulated and measured results coincide with each other, and demonstrate that the prototype realizes 8.8 dB∼12.6 dB gain increment and low side-lobe levels over the bandwidth of 26.7 GHz∼30.0 GHz. The novel design leads to a low-profile, light weight, and low-cost antenna solution in a wireless communication system.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 4","pages":"Pages 10-15"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60218-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72233478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
期刊
Journal of China Universities of Posts and Telecommunications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1