Please wait a minute...

Current Issue

    25 April 2016, Volume 37 Issue 4
    academic paper
    Privacy computing:concept, connotation and its research trend
    Feng-hua LI,Hui LI,Yan JIA,Neng-hai YU,Jian WENG
    2016, 37(4):  1-11.  doi:10.11959/j.issn.1000-436x.2016078
    Asbtract ( 2596 )   HTML ( 228)   PDF (130KB) ( 5781 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    s: With the widespread application of mobile Internet, cloud computing and big data technologies, people enjoy the convenience of electronic business, information retrieval, social network and other services, whereas the threats of privacy leaks are ever growing due to the use of big data analytics. The differences of privacy protection strategy and ability in different systems bring more difficulties in privacy extended management. In addition, the requirements of pro-tecting the same information at different time need the combination of various privacy protection schemes. However, nearly all the current privacy protection schemes are ing at a single case, which lacks systematic and quantized pri-vacy characterization. Furthermore, there is no systematic computing model describing the relationship between the pro-tection level, profit and loss of privacy leaks and the complexity of integrated privacy protection methods. Based on the analysis on the research status of privacy protection, the concept and connotation of privacy computing is proposed and defined. Then the privacy computing research category will be discussed from the whole life cycle of information privacy protection. Finally, some research directions of privacy computing are given, including privacy computing model, context adaptive cryptology for privacy protection, big data a lytics resisted privacy control and protection, privacy protection based on information hiding and system architecture for high concurrent privacy preserving services.

    Pricing strategy for video migration based on truthful auction mechanism
    ONGXin C,ILing-ling Z,UNJin-guang S
    2016, 37(4):  1-65.  doi:10.11959/j.issn.1000-436x.2016072
    Asbtract ( 303 )   HTML ( 2)   PDF (300KB) ( 857 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to decrease the unit costs of video service, pricing strategy LBAS for video migration based on truthful auction mechanism was proposed. Firstly, according to the principles of market economy prices, service prices using the future video demand as independent variable were laid down by the VoD provider, so as to decrease the costs of the VoD provider. Secondly, a distance function was designed to measure the unit costs of video service. The proposed function computes the distance between the costs providing by cloud providers and expected prices offering by the VoD provider, and the obtained distance was used to determine who can win the auction. Thirdly, replaceable video alloca-tion algorithm based on the benefits of cloud providers was presented. The proposed algorithm increases the satisfaction of cloud providers and decreases the costs of the VoD provider. Finally, the AEM algorithm was improved through estab-lishing the detection mechanism of video number, so as to adapt to the low-bid auction. The improved algorithm avoids the collusion among bidders and assurances the benefits of the VoD provider. The experiment results demonstrate that LBAS can decrease 10% of the costs compared to the VMC strategy.

    Compression strategies selection method based on classification of HBase data
    Hai-yan WANG,Cai-hang FU
    2016, 37(4):  12-22.  doi:10.11959/j.issn.1000-436x.2016068
    Asbtract ( 555 )   HTML ( 15)   PDF (213KB) ( 1378 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most of the current compression strategies selection methods for HBase data did not consider whether the data was cold or hot. Besides, problem of incompleteness and unreliability existed during selection process. To address the problems above, a compression strategies selection method based on classification of HBase data was put forward. HBase data was classified into cold and hot data according to the access frequency of each data file and an access level would be designated to each file. On this base, an evaluation layer was added and a compression strategies selection method based on access level with integration of neighbor sector and statistic column based selection methods. Simulation experiments and results demonstrate that the proposed compression strategies selection method based on classification of HBase data can not only save storage space but also greatly improve the query performance of HBase data.

    Energy-consumption-balanced efficient source-location privacy preserving protocol in WSN
    Xiao-guang NIU,Chuan-bo WEI,Ya-lan YAO
    2016, 37(4):  23-33.  doi:10.11959/j.issn.1000-436x.2016069
    Asbtract ( 366 )   HTML ( 4)   PDF (275KB) ( 715 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering the conflicts among anonymity, network load and transmission latency for most of the existing event source-location privacy (SLP) in wireless sensor network (WSN).Firstly,the effect of the data mixing and fake packet injec-tion on the privacy and network performance was analyzed. Then, the anonymity-quantified dynamic mix-ring-based source-location anonymity protocol(ADRing)was proposed, ADRing which was designed to achieve source anonymity and balance between network traffic and real event report latency through the dynamic mix-ring based packet confusion and the corresponding sector-based anonymity assess and the radius of non-uniform clusters. The simulation results demonstrate that ADRing is very efficient in balancing energy consumption and transmission latency, and can significantly prolong survival period of the network and ensure security as well as latency to satisfy the packets' requirements.

    Exploiting interests and behavior prediction for dynamic resource discovery in mobile social networking
    Zhi-yuan LI,Ru-long CHEN,Ru-chuan WANG
    2016, 37(4):  34-43.  doi:10.11959/j.issn.1000-436x.2016070
    Asbtract ( 484 )   HTML ( 4)   PDF (223KB) ( 764 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Resource discovery in delay-tolerant mobile social networks (MSN) continues to be challenging issue. An interests and behavior prediction-based dynamic resource discovery mechanism (IBRD) in 3-dimensional cartesian coor-dinate system was proposed. Firstly, IBRD extracted the interest vectors from the user's file resources and the profile table, and then the initial virtual interest communities through the cosine similarity computation between the nodes were con-structed. After mobile social networking data was anal the semi-Markov chain model was used to predict the beha-vior and movement trajectory of users. According to the prediction results of the Markov model, the dynamic ma en-ances of the virtual interest communities were realized. Next, an efficient resource discovery strategy based on the dynamic virtual interest communities was designed. Finally, proposed method was simulated on the platform of the opportunistic network environment simulator. Simulations results show that the proposed scheme consistently outperforms the state-of-the-art resource discovery schemes in terms of the searching efficiency the average delay and the communication cost.

    Software defined data center network with hybrid routing
    Yue-ping CAI,Chang-ping WANG
    2016, 37(4):  44-52.  doi:10.11959/j.issn.1000-436x.2016071
    Asbtract ( 618 )   HTML ( 11)   PDF (159KB) ( 944 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the current data center networks, the flow size distribution is not uniform and the transmission performance requirements of elephant flows and mice flows are different. To address this issue, a software-defined hybrid routing (SHR) scheme was proposed. SHR differentiate data flows by statistical calculat nt flows utilize the adap-tive routing algorithm while the mice flows use the oblivious routing algorithm. SHR extends the OpenFlow scheme by offloading some basic functions such as flow statistical detection and mice flow forwarding to switches to reduce the switch-controller interaction overhead. Performance evaluations of SHR were carried out using the fat-tree network to-pology. Results show that SHR can effectively increase network throughput and reduce the flow dropping rate as well as packet delay compared with the traditional ECMP algorithm.

    Spatio-temporal correlation based fast inter mode decision for HEVC
    Wei ZHU,Xun-hua ZHANG,Cai-sheng WANG,Hua2 ZHANG
    2016, 37(4):  64-73.  doi:10.11959/j.issn.1000-436x.2016073
    Asbtract ( 442 )   HTML ( 11)   PDF (174KB) ( 1133 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The new generation high efficiency video coding (HEVC) standard adopts coding tree unit (CTU) quadtree partition technology and ten inter prediction unit (PU) modes to improve compression efficiency significantly, but it brings in an enormous encoding computational complexit . A spatio-temporal correlation based fast inter mode decision algorithm for HEVC was proposed to reduce partition times of coding unit (CU) and inter PU mode candidates. First, the spatio-temporal correlation of depth information among the current CTU, the same located CTU in the reference frame and the spatial neighbor CTU in the current frame are utilized to predict depth range of the current CTU. Then, the spatial correlation of optimal PU modes between the current CU and its parent-CU was analyzed. And the rate-distortion (RD) costs of the estimated PU modes of the current CU were also used. Based on these, the redundant inter PU modes of current CU are skipped. The experiment results demonstrate that as compared to the HEVC test model (HM), the proposed algorithm saves about 52% encoding time under different encoding configurations, and it maintains a good RD performance. When compared to HM with fast mode decision algorithms enabled, the proposed algorithm further saves about 30% encoding time.

    Channel access mechanism based on equally allocation of protocol sequence for VANET
    Zhe-xin XU,Ling-ling CAI,Xiao LIN,Yi WU
    2016, 37(4):  74-86.  doi:10.11959/j.issn.1000-436x.2016074
    Asbtract ( 409 )   HTML ( 2)   PDF (287KB) ( 737 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the throughput performance in VANET, a channel access mechanism based on equally al-location (EA) of protocol sequence was proposed. For highway scenery, the proposed mechanism re-planed the mapping of traffic channel allocation of IEEE 802.11p to competition zone. In addition, the frame structure was also redesigned according to the characteristic of user irrepressible protocol sequence. A few bits of data were used to find out the number of nodes in the competition zone. Cyclic polling allocation was proposed to allocate the protocol sequences under average meaning. The theoretical throughput expression is derived and proved to be correct by simulation. It is also verified that the throughput of EA is more superior to classical met in a sparser distributed network or a higher PHY data rate. Equally importantly, EA can also keep relative low net overhead and available fairness about channel access of the nodes.

    Research on the privacy-preserving point-in-polygon protocol
    Jing ZHANG,Shou-shan LUO,Yi-xian YANG,Yang XIN
    2016, 37(4):  87-95.  doi:10.11959/j.issn.1000-436x.2016075
    Asbtract ( 324 )   HTML ( 2)   PDF (122KB) ( 794 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A privacy-preserving point-in-polygon protocol was proposed under semi-honest model, to deal with the prob-lem of high complexity and limitation of the existing protocols. First, an blivious point-line protocol was designed by extending the traditional point-line protocol, making the use of 1-out-n oblivious transfer and the geometric properties of the vector. Then, based on this protocol and combined with the secure binary search protocol, the final solution was put forward. The security of the protocol was proved with ich method. Meanwihle, the validity and the complexity of the protocol were also be analyzed. It is shown that this new protocol gets the advantage over the existing one in terms of efficiency and enjoys excellent expandability.

    Research on data integration privacy preservation mechanism for DaaS
    Zhi-gang ZHOU,Hong-li ZHANG,Xiang-zhan YU,Pan-pan LI
    2016, 37(4):  96-106.  doi:10.11959/j.issn.1000-436x.2016076
    Asbtract ( 399 )   HTML ( 8)   PDF (242KB) ( 727 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The emergence of cloud computing provides a broader platform for multiple data owners to make integrated data publishing and collaborative data mining. In data-as-a-service (DaaS) model, integrated data was deployed in a cer-tain cloud platform with an untrusted service provider ta privacy leakage has become the challenge hindering applica-tion and popularization of DaaS model. For protecting privacy in the data integration stage, a two-layer privacy pro-tection mechanism for DaaS-oriented application was given, which was independent ith the specific applications, parti-tioning data attributes into different parts. In addition, the corres ding fake data set was used to assure the balanced distribution of data in each part, which realized privacy protection of data integration. The experimental results indicate that the proposed strategy is feasible, simultaneously has the low computing overhead.

    Parameters estimation of LFM signal based on Gaussian-weighted fractional Fourier transform
    Peng WANG,Tian-shuang QIU,Jing-chun LI,Hai-feng TAN
    2016, 37(4):  107-115.  doi:10.11959/j.issn.1000-436x.2016077
    Asbtract ( 491 )   HTML ( 8)   PDF (369KB) ( 745 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To overcome the performance degradation of conventiona methods in low duty ratio condition, a novel me-thod of parameters estimation for LFM signal based on the Gaussian-weighted fractional Fourier transform (GFRFT) was proposed. Firstly, the GFRFT definition was given and the LFM signal GFRFT with finite duration was derived. Secondly, the statistical characteristics of the GFRFT for the LFM signal under the Gaussian white noise were studied, and a closed mathematical expression of output signal-to-noise ratio was derived. Finally, simulation experiments are conducted, and the applicable condition of the GFRFT is also discussed, which demonstrates that the proposed method can effectively improve parameters estimation performance, especially in the low duty ratio condition.

    Energy efficiency-based downlink resource allocation in cognitive small cell networks
    Ya-nan JIA,Dian-wu YUE
    2016, 37(4):  116-127.  doi:10.11959/j.issn.1000-436x.2016079
    Asbtract ( 421 )   HTML ( 5)   PDF (378KB) ( 1068 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Joint downlink spectrum resource block(SRB) and power allocation was studied based on OFDMA n cog-nitive small cell networks.In a distributed framework, small cell base stations (SCBS) could share free spectrum re-sources with open access to maximize their energy efficiency (EE) respectively. The competition among SCBS made the dynamic resources allocation problem be modeled as a non-cooperative game. It was non-convex optimal to op-timize the EE in a fractional form under multiple interference constraints. The maximization problem was transmitted into an equivalent problem in subtractive form which could be solved from the sequential and parallel iteration points of view. After obtaining the SRB allocation strategies, the master game could be re-modeled as equivalent sub-games for solving the transmission power more easily. Simulation results show the proposed algorithm can converge to a Nash equilibrium and effectively improve system resources utilization and EE in interference-limited communication environments.

    Traffic matrix-based load balancing routing in flow-based smart identifier network
    ARu JI,Shuai GAO,Hong-bin LUO,Hong-ke ZHANG,Ming WAN
    2016, 37(4):  128-138.  doi:10.11959/j.issn.1000-436x.2016080
    Asbtract ( 476 )   HTML ( 8)   PDF (219KB) ( 965 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Smart identifier network (SINET)has an advantage of being aware of the accurate traffic matrix. Traffic ma-trix was use as the constraint, model on load balancing routing problem, and transform the primal problem into dual problem by using Lagrange function. Therefore,the optimization goal of the dual problem can be easily achieved. In or-der to achieve the dual problem optimization goal,a traffic matrix based load balancing routing algorithm (TM-LB)was proposed. By performing the TM-LB,the control plane can plan paths for subsequent traffic according to network fluctu-ation. OMNET++ was used to run the experiment simulation based on NSFnet topology. The results show that TM-LB can better reduce congestion and realize load balancing, compared with traditional routing mechanism. Finally, a proof-of-concept was built implementation and carry out experiments for testing the overhead of TM-LB algorithm.

    Minimum number oriented relay node deployment algorithm in two-tiered WSN
    Chun-yu MIAO,Li-na CHEN,Guo-yong DAI,Fan YANG,Qing-zhang CHEN
    2016, 37(4):  139-148.  doi:10.11959/j.issn.1000-436x.2016081
    Asbtract ( 368 )   HTML ( 7)   PDF (280KB) ( 592 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at minimizing the number of relay nodes distributed in the sensing area while keeping the feasible communication with at least one relay node for every sensor node, two algorithms (i.e. the integral linear programming optimal algorithm and the heuristic algorithm) were proposed. First, the integral linear programming optimal algorithm was designed to find the best region of deploying rela nodes within candidate regions through integer linear program-ming. In the large-scale wireless sensor network, the heuristic algorithm was proposed that found the best deployment re-gion through iteratively updating the deployment area luding the most relay nodes. Finally, simulation results show that the two proposed algorithms can minimize the number of relay nodes needed with the guarantee of serving all sensor nodes.

    Cooperative game based bandwidth allocation mechanism live migration of multiple virtual machines
    Yong CUI,Yu-song LIN,Run-zhi LI,Zong-min WANG
    2016, 37(4):  149-158.  doi:10.11959/j.issn.1000-436x.2016082
    Asbtract ( 350 )   HTML ( 5)   PDF (166KB) ( 671 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In IaaS cloud computing platform, live migration of virtual machines plays a significant role in resource dy-namic dispatching and management. Under many scenarios, multiple virtual machines in the same server need to be moved online concurrently.Since live migration algorithm utilizes bandwidth as more as possible to send data, there is a bandwidth competition among the concurrent migration processes, which cannot guarantee the optimal allocation for the bandwidth and finally degrades the overall performance of the parallel live migration. A cooperative game based band-width allocation mechanism in live migration of multip virtual machines was proposed, which models the bandwidth allocation problem as a Nash bargaining game and attains a desirable bandwidth sharing scheme that guarantees Pareto optimality. Experiment results show that the proposed method can assign the bandwidth fairly and efficiently and im-prove the performance of the parallel live migration.

    Overview
    Research on network virtualization slicing mechanism in SDN-based testbeds
    Jiang LIU,Tao HUANG,Chen ZHANG,Ge ZHANG
    2016, 37(4):  159-171.  doi:10.11959/j.issn.1000-436x.2016083
    Asbtract ( 654 )   HTML ( 11)   PDF (223KB) ( 1727 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The researches on future network architecture and key logies need test environment both open and flex-ible. Traditional distribute architecture was short on effective control and new protocol deployment. The emerging of the software defined networking (SDN) technology provides a promising way to s this problem and become a major re-search direction in recent years. In the SDN based network testbed, the virtual network slicing technology was a key issue since it could separate physical resource and provided individual virtual network environment. Therefore, the slicing me-thods of some typical network virtualization platforms with the perspective of “slice identifier”, “virtual nodes ab-straction”and “virtual links abstraction”were introduced , and the future research directions were concluded in this field.

    Academic communication
    Noncoherent multiple symbol detection of CPFSK based on decision-feedback
    Qiang CHEN,Guo-sheng RUI,Wen-jun SUN,Wen-biao TIAN,Yang ZHANG
    2016, 37(4):  172-181.  doi:10.11959/j.issn.1000-436x.2016084
    Asbtract ( 455 )   HTML ( 7)   PDF (308KB) ( 890 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    There is a great deal of issues in the traditional symbol detection algorithm such as high computational com-plexity and large engineering implementation difficulty. Considering these problems, an improved algorithm based on decision feedback was proposed. To reduce complexity, the approach in which ruling element information was employed to filter waveforms during length of observing bits. Besides, the theoretical performance was approved by a composition of upper bound and lower bound. Specifically, the form is a union bound which consists of being tight at high SNR and being tight at low SNR, the latter can be obtained by grid minimum Euclidean distance. Theoretical analysis and si-mulation results show that compared with the traditional algorithm, the improved algorithm could keep no loss of detec-tion performance, but the complexity is reduced at negative exponent power way with the increase of number of feedback element.

    Coupling image denoising model based on total variation
    Mei-ling WANG,Xian-chun ZHOU,Lin-feng ZHOU,Lan-fang SHI
    2016, 37(4):  182-191.  doi:10.11959/j.issn.1000-436x.2016085
    Asbtract ( 473 )   HTML ( 15)   PDF (372KB) ( 502 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The total variation (TV) model used in image denoising may produce “staircase effect”. A coupling image de-noising model based on total variation was proposed. First, a trend fidelity term based on the change tendency of image gradient was established. The fidelity term could not only remove image noise, but also restrain “staircase effect”. Then, wavelet was used to decompose coefficient in frequency domain, control based on the edge detection ability of Canny algorithm were designed. The control functions control energy spread direction, the advantages of TV model and trend fidelity term are maintained, edge and texture details were protected, and “staircase effect'' was also suppressed. Experiment results show that peak signal to noise ratio (PSNR), structure similarity (SSIM) and visual effects of the nov-el model are much better. Moreover, the running time of the novel model is shorter.

    Space alternating generalized maximum-likelihood based low-complexity list detection algorithm
    Chang-le JING,Xin WANG,Ji-bo WEI,Bin CHEN,Shi-qi WU
    2016, 37(4):  192-198.  doi:10.11959/j.issn.1000-436x.2016086
    Asbtract ( 364 )   HTML ( 2)   PDF (177KB) ( 717 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A space-alternating generalized maximum-likelihood (SAGL) list detection algorithm with lower-complexity for V-BLAST systems was proposed. The sub-detector involved in the proposed list detection algor hm consisted of sim-plified maximum-likelihood (SML) detectors and successive interference cancel ation (SIC) detectors. The proposed al-gorithm could utilize adjacent symbols to realize joint-sliding detection to achieve higher diversity gain, wh le the tradi-tional SIC algorithm was only able to detect a single symbol each time. Moreover, the proposed SAGL algorithm could further iteratively improve the detection results. Ana is and simulation results present the corresponding enhanced per-formance at the cost of slightly increased complexity, compared with the traditional list detection algorithm.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: