Please wait a minute...

Current Issue

    25 February 2012, Volume 33 Issue 2
    academic paper
    Dynamic spectrum allocation based on one-band multi-winner auction
    Wen-zhu ZHANG,Ling-yun WANG
    2012, 33(2):  1-6.  doi:1000-436X(2012)02-0001-06
    Asbtract ( 0 )   HTML ( 1)   PDF (603KB) ( 7 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the effectiveness of traditional auction in DSA (dynamic spectrum allocation) issue in cognitive radio networks,a new dynamic spectrum allocation algorithm based on one-band multi-winner auction was proposed.Compared with the original greedy algorithm,the new algorithm can achieve better spectrum allocation solutions with lower computational complexity by introducing the multiple greedy strategy.It increases the seller's revenue by improving the VCG (vickery-clarke-groves) mechanism,while retaining the dominant strategy incentive compatible property.In addition,it suppresses the occurrence of collusion effectively.Simulation results show that the algorithm proposed can get spectrum allocation efficiency close to the optimal solution and increase the auction revenue significantly.

    Duplicate elimination algorithm for data streams with SKIP Bloom filter
    Hai-na TANG,Xiao-la LIN,Chun-jing HAN
    2012, 33(2):  7-14.  doi:1000-436X(2012)02-0007-08
    Asbtract ( 0 )   HTML ( 0)   PDF (713KB) ( 10 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the dynamic characteristics of data streams,a duplicate elimination algorithm was proposed with low time complexity and high accuracy based on SKIP Bloom filter.A moving cursor and double Bloom filter were used to differentiate history data and current data mapping.Theoretically,it proves that the algorithm has the time complexity of O(n) and the false positive rate of O(1﹣(1﹣1/(2m))<sup>w·k</sup>)<sup>k</sup>.The experiment shows that the new SKIP Bloom filter improves the accuracy of 2~12 times in real networks compared with other existing algorithm.

    Dynamic filtered keystream generator DF-FCSR-8
    Zhen PAN,Xiao-hu TANG
    2012, 33(2):  15-22.  doi:1000-436X(2012)02-0015-08
    Asbtract ( 0 )   HTML ( 0)   PDF (616KB) ( 16 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the investigation of the filtered key stream generator family F-FCSR using feedback with carry shift register(FCSR)as components,especially the reason what makes F-FCSR-Hv2 key stream generator failed,a dynamic filtered generator named DF-FCSR-8 was presented.This generator avoids Hell-Johansson attack and its key stream sequences can pass the test of NIST's suit STS.Finally,it can also resist many other attacks.

    Resource reservation based on relaxed policy for grid workflow
    Peng XIAO,Zhi-gang HU,Chao-kun YAN,Xi-long QU
    2012, 33(2):  23-29.  doi:1000-436X(2012)02-0023-07
    Asbtract ( 0 )   HTML ( 0)   PDF (807KB) ( 5 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the problem that applications tend to overestimate reservation duration,a novel reservation technique based on overlapping relaxing policy was proposed,so as to mitigate the negative effects of stringent reservation mechanisms on system performance.The analysis of the relaxed policy was represented theoretically and a relaxed admission algorithm was designed for large-scale grid workflows.Experimental results show that relaxed policy can significantly mitigate the negative effects of classical policies when system is in presence of heavy workload.Experimental results based on a real workflow indicate that the relaxed policy is able to decreasing the efficiency loss due to the overestimation of reservation durations.

    Lightweight security architecture design for wireless sensor network
    Chao WANG,Guang-yue HU,Huan-guo ZHANG
    2012, 33(2):  30-35.  doi:1000-436X(2012)02-0030-06
    Asbtract ( 125 )   HTML ( 2)   PDF (495KB) ( 439 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most previous security proposal did not consider key management or their authentication efficiency was very low.Lightweight security architecture and lightweight security algorithm were proposed for wireless sensor network,The problem of network encounters malicious nodes maybe occur in the procedure of backbone networks networking could be solved by threshold secret sharing mechanism.The lightweight ECC was proposed to optimize the CPK architecture based on normal ECC,authentication was efficient without the third-party CA,and could reduce the computational complexity,the key management could meet the resource limit in wireless sensor network,and the key security depended on the exponential computation complexity of the elliptic discrete logarithm decomposition.The scheme used the improved two-way authentication to ensure the communication security between common node and sink node,which could prevent man-in-the-middle attack.

    Increasing capacity for wireless communication systems based on signal waveform collaboration
    Jun SHI,Xue-jun SHA,Qin-yu ZHANG,Xiao-cheng SONG,Nai-tong ZHANG
    2012, 33(2):  36-44.  doi:1000-436X(2012)02-0036-09
    Asbtract ( 77 )   HTML ( 0)   PDF (898KB) ( 64 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A wireless communication technology based on signal waveform collaboration was proposed for resolving the conflict between limited spectrum resources and the rapidly growing service needs.The proposed technology employs linear frequency modulation (LFM) signals to transmit different users' information by utilizing the dual relationship between the energy concentration property of sinusoidal signals and that of LFM signals in the frequency and fractional domains,and the transmitted signals are superimposed on communication waveforms of the traditional sinusoidal carrier communication system on the same frequency band.At the receiver,frequency-and fractional-domain filters are applied to separate two kinds of users' signals.Moreover,the system model of the proposed technology is constructed,and theoretical analysis is also derived.The validity of the theoretical derivations is demonstrated via simulations.It has been shown that spectral efficiency can be effectively improved using signal waveform collaboration and transform-domain filtering.Theoretically,the proposed technology can achieve twice system capacity as large as that of the traditional sinusoidal carrier communication system.

    Research on the multiuser MIMO linear cooperative spectrum sensing in cognitive radio networks
    Yong-qiang HEI,Xiao-hui LI,Wen-tao LI
    2012, 33(2):  45-52.  doi:1000-436X(2012)02-0045-08
    Asbtract ( 52 )   HTML ( 0)   PDF (778KB) ( 67 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The multiuser MIMO based linear cooperative spectrum sensing problem was investigated in cognitive radio system to improve the reliability of spectrum sensing.Both the local spectrum detecting strategy and global spectrum detecting strategy for multiuser MIMO based linear cooperative spectrum sensing system were derived.Then the optimization model that the different weights assigned on the receive signals of each user at the fusion center for global decision were optimized to maximize the detection probability given a targeted probability of false alarm is established.Furthermore,genetic algorithm (GA) was introduced to find the optimal weight vector of the above-mentioned cooperative spectrum sensing problem,with the purpose of reducing the sensing time in the spectrum sensing process.The simulation results show that,the reliability of spectrum sensing in cooperative spectrum sensing system can be efficiently enhanced with multiple antennas.Besides,the proposed GA method is efficient and stable,and achieves better detection performance when compared with the existing methods.

    Routing lookup algorithm based on parallel BP neural network
    Xiao-bo XU,Kang-feng ZHENG,Dan LI,Yi-xian YANG,IUXin-xin N
    2012, 33(2):  61-68.  doi:1000-436X(2012)02-0061-08
    Asbtract ( 88 )   HTML ( 0)   PDF (642KB) ( 812 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new routing lookup algorithm based on Bloom-filter algorithm and parallel back-propagation neural networks (BFBP) was proposed.The algorithm could meet the challenges of routing lookup and just had to learn the network ID moreover,it was equally attractive for IPv6.The results show that compared to other routing lookup methods based on neural network,BFBP algorithm reduces the average number of items which neural network has to learn by 520 times,improves learning efficiency of neural networks,and creates favorable conditions for the application of neural network in the area of routing lookup.

    Novel algorithm for dynamic bandwidth scheduling in WDM EPON
    Xue-shun WANG,Shao-hua YU,Jin-you DAI
    2012, 33(2):  69-75.  doi:1000-436X(2012)02-0069-07
    Asbtract ( 63 )   HTML ( 2)   PDF (623KB) ( 139 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Optical network unit(ONU)grant scheduling techniques for wavelength division multiplexed Ethernet passive optical networks (WDM EPON) was investigated and the grant scheduling problem based on scheduling theory was solved the question was formulated into a rectangle packing problem and a high performance ONU grant scheduling policy based on Euclidian distance was proposed by taking quasi-human strategy.An effective heuristic algorithm was provided to quickly solve ONU grant scheduling problem in WDM EPON.Further simulation experiments show the grant scheduling algorithm can decrease average packet delay and increase network utilization.The results indicate the effectiveness of this algorithm.

    Analysis and application of clutter distribution modeling in UWB SAR difference change detection of target in foliage
    Guang-xue WANG,Xiao-tao HUANG,Zhi-min ZHOU
    2012, 33(2):  76-81.  doi:1000-436X(2012)02-0076-06
    Asbtract ( 55 )   HTML ( 0)   PDF (708KB) ( 204 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In forest area,the intensity backscatter varies quickly.In UWB SAR foliage-concealed target difference change detection,this characteristic had made existing clutter models couldn't fit the clutter distribution accurately.To address the problem,the clutter model suitable for uniform scene was derived.After that,by assuming the intensity of forest area backscatter follows Gamma distribution,the clutter model suitable for serious non-stationary scene was established.And the experimental results showed that,in foliage-concealed target difference change detection,the proposed model could fit the clutter distribution more accurately,and an improved detection performance could be achieved.

    Detection for physical-layer network coding in two-way relay channels
    Wei YAN,Yue-ming CAI,Cheng-kang PAN
    2012, 33(2):  82-86.  doi:1000-436X(2012)02-0082-05
    Asbtract ( 67 )   HTML ( 1)   PDF (524KB) ( 109 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The detection for physical-layer network coding (PNC) in two-way relay channels was investigated.Maximum-likelihood (ML) detection not only had great performance but also had high computational complexity.Therefore,without channel state information (CSI) at source nodes,two detection schemes were proposed.The first scheme was likelihood ratio(LR)detection based on LR function,and the other was maximum a posteriori probability (MAP) detection based on MAP rule.Meanwhile,It carried out similar analysis if CSI was available at source nodes.Compared to ML detection which separately detects two source messages,numerical and simulation results show that LR detection outperforms it in terms of BER metric with the requirement for additional noise variance information.And MAP detection is equivalent to ML detection,and it has lower computational complexity.

    R-Vivaldi:distance range-aware IP network coordinate system
    Da-bin WANG,Qiong HUANG,Xiao-long YANG,Ke-ping LONG
    2012, 33(2):  87-92.  doi:1000-436X(2012)02-0087-06
    Asbtract ( 36 )   HTML ( 1)   PDF (743KB) ( 184 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The experience showed that the predicted delay's accuracy was improved when the nodes were chosen around the given delay as anchors.Thus a distance range-aware IP network coordinate system(R-Vivaldi) was proposed.The main idea was:according to the approximate range of the predicted delay,the anchors were re-selected in the radius area of the approximate range to compute the new range.In accordance with the above process,the coordinate system constantly iterated the network distance and dynamically chose anchors until the prediction accuracy meet the requirement.Experiments show that the approach can not only effectively improve the prediction accuracy of delay but also overcome inconsistencies of the prediction accuracy to a certain extent.

    Anonymous authentication scheme based on one-off public key in pervasive computing environments
    Chang-yuan LUO,Shi-wei HUO,Hong-zhi XING
    2012, 33(2):  93-98.  doi:1000-436X(2012)02-0093-06
    Asbtract ( 53 )   HTML ( 2)   PDF (646KB) ( 319 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A signature scheme with the one-off public key was proposed based on identity-based cryptography,which had less calculating and communicating expense compared with available schemes.An anonymous authentication scheme was designed based on the proposed signature scheme.When users committed,service provider together with the trusted center could reveal the malicious user's identity.The proposed scheme can realize strong anonymity and prevent the user committing.

    ε-approximate spatial-window aggregation algorithm in wireless sensor networks
    Jing GAO,Jian-zhong LI,Yu LIU
    2012, 33(2):  99-109.  doi:1000-436X(2012)02-0099-11
    Asbtract ( 33 )   HTML ( 0)   PDF (843KB) ( 116 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficient ε-approximate spatial-window aggregate query processing technique was proposed to approximate aggregate values over arbitrary regions with arbitrary accuracy.A dynamic programming algorithm was devised to compute minimum number of data to refine approximate summation to reach arbitrary accuracy.The proposed algorithm was efficient to compute minimum/maximum values by only transmitting values promising to be in the exact results in order to reduce energy consumption.The experiment using real-world data demonstrates that the algorithms provide high quality results in arbitrary region and reach arbitrary accuracy with low energy cost.

    Technical Report
    Relationship between correlation immune and weight of H Boolean functions
    Jing-lian HUANG,Zhuo WANG
    2012, 33(2):  110-118.  doi:1000-436X(2012)02-0110-09
    Asbtract ( 55 )   HTML ( 0)   PDF (563KB) ( 68 )   Knowledge map   
    References | Related Articles | Metrics

    The Boolean function derivative and e-derivative which together with the derivative so that the weight of Boolean functions can be directly clear characterized and defined as the tools for research and deep into the internal structure of Boolean function value,to discuss a large range in which the H-Boolean functions exist,the issue of whether all different weights of first-order and m-order H Boolean functions exist.For H Boolean functions with m-order correlation immunity,the relationship between its correlation immune order m and dimension n,and the maximum problem of m.Gives the m-order correlation immune H Boolean function exists only in the H Boolean function that with two kinds of weight.The maximum value of correlation immune m is n-2,and the rest of the weight of H Boolean function does not exist above the second-order (including the second-order) correlation immune fuction and a series of results.

    Self-configuration power scheme for femtocell base station
    Peng XU,Xu-ming FANG,Zheng XIANG,Rong HE
    2012, 33(2):  119-124.  doi:1000-436X(2012)02-0119-06
    Asbtract ( 50 )   HTML ( 0)   PDF (733KB) ( 128 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the issue that new femtocells deployed in hierarchical networks would introduce a series of interference,a power self-configuration scheme was proposed.Various kinds of interference that femtocell base station might receive from other base stations were analyzed.Then an optimal power issue was formulized,as was able to maximize the femtocell system capacity on the condition guaranteeing the existing users'normal communication.And the optimal solution was also obtained with lagrange multiplier method.The simulation results show that the proposed scheme cuts down the transmit power of femtocell,increases the throughput and reduces interference for existing users,comparing with the scheme based on received signal strength.

    Integrated artificial immune system for intrusion detection
    Yue-bing CHEN,Chao FENG,Quan ZHANG,Chao-jing TANG
    2012, 33(2):  125-131.  doi:1000-436X(2012)02-0125-07
    Asbtract ( 47 )   HTML ( 0)   PDF (629KB) ( 140 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the practical requirements of intrusion detection,an integrated artificial immune system (IAIS) was proposed.The system combined dendritic cell algorithm(DCA)and negative selection algorithm(NSA).DCA was used to detect behavioral features.NSA was used to detect structural features.IAIS was validated on KDD 99 dataset.Comparisons to other approaches were made.The experimental results show that the detection performance of IAIS is comparable to classic classification algorithm.IAIS does not rely on labeled data to train detectors.It combines behavioral features and structural features to detect intrusions in real-time mode.

    Analysis to stationary transmission model of P2P streaming
    Cheng-wei WAN,Jiang-xing WU,Ju-long LAN
    2012, 33(2):  132-140.  doi:1000-436X(2012)02-0132-09
    Asbtract ( 50 )   HTML ( 0)   PDF (840KB) ( 203 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    It was proved that the P2P streaming system could be modeled by a queuing chain which was composed by multiple M/M/n queuing system according to the queuing theory.Based on this result,the stationary transmission model of P2P streaming was proposed by the analysis on the peer buffer state variation.The transmission characteristics under different chunk schedule strategies were examined by the model,and the results validated the rationality of the proposed model.Further more,the impact of peer number and buffer size on the transmission characteristic was examined.

    Virtual channel model for distributed video coding accounting for quantization noise
    Ming YIN,Shu-ting CAI,Yun XIE,Yun ZHANG
    2012, 33(2):  141-148.  doi:1000-436X(2012)02-0141-08
    Asbtract ( 62 )   HTML ( 1)   PDF (853KB) ( 346 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the inaccuracy model on describing the virtual channel with Laplacian,the rate-distortion performance of distributed video coding is relatively low.The quantization noise will be taken into account for online modeling at the decoder.Further,the dependency among original frames was exploited for estimating the model parameter.Thus,a novel virtual channel model for pixel-domain Wyner-Ziv(PDWZ)coding was proposed.The experimental results show that the proposed model can character the statistics of virtual channel more accurately and the performance of PDWZ based on the proposed model outperforms the one based on Laplacian.

    Academic communication
    Pre-repeat cooperative GBN-ARQ for TDD/TDMA based wireless networks
    Luo-bing DONG,Ke-chu YI,Pei-yi SHEN,Quan YU
    2012, 33(2):  149-155.  doi:1000-436X(2012)02-0149-07
    Asbtract ( 57 )   HTML ( 0)   PDF (838KB) ( 111 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficient pre-repeat cooperative go-back-N automatic repeat request(PC-GBN-CARQ)algorithm for slow fading TDD/TDMA-based Wireless Networks was proposed.Taking advantage of the multiple access property of TDMA,the proposed scheme enabled both the source and the relay to retransmit packets to the destination simultaneously,which could greatly increase the successful probability of the retransmission.When the source was sending a group of data packets,it also sent 8bit of attached message to tell the relay about which packets among the group would be probably error in transmission,which was the result predicted based on TDD reciprocity,so that the relay could also pre-retransmit these packets like the source does.It should be very effective to raise the transmission efficiency.Simulation results show that the proposed algorithms can get an S/N ratio gain of about 5dB compared with the conventional ones for the normalized throughput of 0.7.

    Geographical information based false report filtering scheme in wireless sensor networks
    Zhi-xiong LIU,Jian-xin WANG
    2012, 33(2):  156-163.  doi:1000-436X(2012)02-0156-08
    Asbtract ( 61 )   HTML ( 0)   PDF (679KB) ( 78 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A geographical information based false reports filtering scheme(GFFS)in sensor networks was presented.In GFFS,each node distributes its location information to some other nodes after deployment.When a report was generated for an observed event,it must carry not only MACs from t detecting nodes with distinct key partitions,but also locations of these nodes.Each forwarding node checks not only the correctness of the MAC and the locations carried in the report,but also the legitimacy of the locations.Analysis and simulation results demonstrate that GFFS can resist collaborative false data injection attacks and thus can tolerate much more compromised nodes than existing schemes.

    CT-TDMA:efficient TDMA protocol for underwater sensor networks
    Lu HONG,Feng HONG,Zheng-bao LI,Zhong-wen GUO
    2012, 33(2):  164-174.  doi:1000-436X(2012)02-0164-11
    Asbtract ( 46 )   HTML ( 2)   PDF (768KB) ( 348 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aimed at underwater acoustic sensor networks(UWSN),a novel sender based conflict model with the schemes of allocating continuous time was presented,including local conflict graph(LCG)and a distribute algorithm to generate LCG.Moreover,CT-TDMA,an efficient TDMA protocol based on the conflict model was also proposed,which used heuristic priority rules to allocate transmitting moments for all nodes.CT-TDMA exploits the diversity of propagation delay of different links in UWSN to decrease the idle time between packets at the same receiving node,which helps in improving the throughput.And a heuristic schedule algorithm is applied to shorten the process of allocating continuous time for each node.Simulation results show that,compared with traditional TDMA protocols such as ST-MAC,network throughput of CT-TDMA has increased 20% and end to end delay has decreased 18%;compared to the theoretically optimal scheme with global knowledge,CT-TDMA has achieved 80% network throughput and the end to end delay is only 12% longer.

    Linear complexity of two classes of optimal sets frequency-hopping sequences
    Jun-tao GAO,Yu-pu HU,Xue-lian LI,Shang-rong XIANG
    2012, 33(2):  175-181.  doi:1000-436X(2012)02-0175-07
    Asbtract ( 34 )   HTML ( 1)   PDF (586KB) ( 110 )   Knowledge map   
    References | Related Articles | Metrics

    By using a type of permutation polynomials which were different from power permutations,the two classes of frequency-hopping sequence sets with low linear complexity was transformed into the ones with high linear complexity.The exact values of linear complexity of these sequences were given by applying the theoretical proof.The results show that the two new classes of frequency-hopping sequences sets not only have optimal Hamming correlation,but also have larger linear span and can resist the Berlekamp-Massey attack compared with the two primary classes of frequency-hopping sequence sets.

    Novel full reference perceptual quality metric for audio-visual asynchrony
    Yao-du WEI,Xiang XIE,Jing-ming KUANG,Xin-lu HAN
    2012, 33(2):  182-190.  doi:1000-436X(2012)02-0182-08
    Asbtract ( 46 )   HTML ( 0)   PDF (701KB) ( 319 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A full reference model was proposed to evaluate the perceptual quality of audiovisual asynchrony.A standard synchronization process was used to determine the time difference between audio and video.The mapping between the time difference and the perceptual quality was derived by co-inertia analysis.The co-inertia analysis extracted the most related component from audio and video features,and then formed a mapping for each audiovisual sequence.Audiovisual contents were divided into three categories:clean speech,non speech and mixed speech.The clean speech category was further split into two subcategories.Audio and video features were chosen separately for each category.Subjective test results showed that the proposed model conforms well with subjective results.

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: