Please wait a minute...

Current Issue

    25 February 2015, Volume 36 Issue 2
    Academic papers
    Power control strategy with joint of multi-packet reception and fuzzy logic control
    Jiang-hong HAN,Song-hua HU,Bin LIU,Zhen CHEN,Lei LIU
    2015, 36(2):  11-19.  doi:10.11959/j.issn.1000-436x.2015029
    Asbtract ( 236 )   HTML ( 4)   PDF (1288KB) ( 595 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to meet the needs of energy saving in wireless networks,a power control strategy with joint of multi-packet reception and fuzzy logic was proposed.Firstly,based on the power control with successive interference cancellation (SIC),transmission power was divided into several decodable power levels.Secondly,fuzzy logic control algorithm was adopted to select the optimal transmission power for SIC.In addition,three parameters were designed as fuzzy logic control inputs for power selection,which were the distance between transmitters and receivers,the number of neighboring nodes and the residual energy of transmitters.Simulation results show that power control strategy with joint of multi-packet reception and fuzzy logic control not only betters average network throughput than other power control strategy for SIC,but also saves more energy so that the network lifecycle would be significantly extended.

    Passive UHF tag collision resolution on PHY layer
    Hai-feng WU,Yu ZENG
    2015, 36(2):  20-28.  doi:10.11959/j.issn.1000-436x.2015030
    Asbtract ( 272 )   HTML ( 2)   PDF (1268KB) ( 578 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An algorithm was proposed to separate the collided signals on the PHY layer.The proposed algorithm firstly adopts a dynamic-scale transformation to transform the collided signals to time-scale domains.And then,a transforming matrix would be obtained from the transformation.Finally,least square and minimum mean square error criterion are utilized to separate the collided tag signals.Simulation results show that,in contrast to the conventional signal separation approaches,the proposed algorithm can separate more than two tag signals under single-antenna condition and have better performance of separation even without capture effect.

    New construction of secure range query on encrypted data in cloud computing
    Shao-hui WANG,Zhi-jie HAN,Dan-wei CHEN,Ru-chuan WANG
    2015, 36(2):  29-37.  doi:10.11959/j.issn.1000-436x.2015028
    Asbtract ( 295 )   HTML ( 3)   PDF (1227KB) ( 792 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the information leakage problem resulting from several assertions of previous range query solutions,there is a secure range query scheme with one assertion (SRQSAE scheme),and the scheme is claimed to be secure against ciphertext-only attack.The security analysis on SRQSAE scheme is presented,and it shows SRQSAE scheme can not hide the size of search keyword.A new scheme of secure range query on encrypted data is proposed through introducing random numbers in the generation of search index and trapdoor.The new scheme can provide the privacy guarantee on search range and search keyword,and it achieves high level needs of security without losing efficiency.

    Node localization scheme in wireless sensor networks under beacon drifting scenes
    Xiao-min ZHAO,Hai-yang ZHANG,Yan JIN,Qing-zhang CHEN
    2015, 36(2):  38-47.  doi:10.11959/j.issn.1000-436x.2015032
    Asbtract ( 303 )   HTML ( 4)   PDF (838KB) ( 893 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the accidentally position change of the beacons in wireless sensor networks,a distributed detecting mechanism of drifting beacon nodes is introduced based on self-scoring and consultation,therefore the drifting beacon nodes can be detected automatically.After studying the current node localization methods,an improved localization method is introduced against the localization coverage decreasing situation caused by beacon nodes drifting.A credibility model of the normal node localization method is built,and it is used as a basis to upgrade normal nodes as temporary beacon nodes in localization blind areas.Simulation results show that the performance of this algorithm is superior to other traditional algorithms in error detection rate,positioning error and communication cost aspects,and this algorithm has higher practicability and flexibility.

    Certificateless-based efficient aggregate signature scheme with universal designated verifier
    Yu-lei ZHANG,Dong-rui ZHOU,Chen-yi LI,Yong-jie ZHANG,Cai-fen WANG
    2015, 36(2):  48-55.  doi:10.11959/j.issn.1000-436x.2015033
    Asbtract ( 257 )   HTML ( 3)   PDF (1204KB) ( 2175 )   Knowledge map   
    References | Related Articles | Metrics

    The security model of the certificateless aggregate signature scheme with universal designated verifier was studied,and then a certificateless aggregate signature scheme with universal designated verifier using bilinear pairings was proposed.In the random oracle mode,based on the hardness of the computational Diffie-Hellman problem,the new scheme was proved to be secure against three attacks of certificateless aggregate signature scheme with universal designated verifier.Meanwhile,the scheme satisfies properties of strong designated verify and non-transferability.Furthermore,the length of final aggregate signature is equivalent as the length of signal user’s signature,it is more efficient than others because the pairing computation is fixed among public verifies and designed verifies.

    Safe and secure classification protocol in two-tiered sensor networks
    Rui LI,Jin-guo LI,Hao CHEN
    2015, 36(2):  56-67.  doi:10.11959/j.issn.1000-436x.2015034
    Asbtract ( 255 )   HTML ( 2)   PDF (975KB) ( 564 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A safe and security classification protocol named SSC was proposed for two-tiered sensor networks,which enable storage nodes to process classification correctly without knowing both the value of classifying rules and the data which will be classified.To protect privacy,an oblivious comparison technique was presented.MHash,which enable storage nodes to compare data items from sink and sensors without knowing their values.Based on MHash and prefix membership verification technique,classification target was achieved in protecting the privacy of both sensor collected data and sink issued classification rules.To verify the correctness of classification results,a crossed neighborhood technique was proposed which organize sensors and data items in one sensor in sequences,to allow the sink checking the correctness of sampling classification results.Analysis and experimental results validate the efficacy and efficiency of SSC protocol.

    Community detection algorithm based on local affinity propagation and user profile
    Kun GUO,Wen-zhong GUO,Qi-rong QIU,Qi-shan ZHANG
    2015, 36(2):  68-79.  doi:10.11959/j.issn.1000-436x.2015035
    Asbtract ( 281 )   HTML ( 3)   PDF (1164KB) ( 789 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An algorithm based on local affinity propagation and a new similarity measure concerning user profile is proposed.On one hand,by loosening the exemplar constraint and requiring the messages propagate around a node's neighbors,the algorithm achieves lower time and space complexity without too much lost in clustering accuracy,which makes it adaptable to the mining of large-scale social networks.On the other hand,by designing a hybrid similarity measure based on the topological similarity and the profile similarity of the nodes,the algorithm can effectively tackle the situation of the social networks data without complete user relation information.The experimental results on the artificial datasets and the real-world datasets demonstrate that the algorithm not only has near-linear time complexity and linear space complexity,but also retains high detecting accuracy when handling incomplete networks.

    Measuring and analyzing node families in the Tor anonymous communication network
    Xiao WANG,Bin-xing FANG,Pei-peng LIU,Li2 GUO,Jin-qiao SHI
    2015, 36(2):  80-87.  doi:10.11959/j.issn.1000-436x.2015036
    Asbtract ( 553 )   HTML ( 27)   PDF (1405KB) ( 1391 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Tor family was focused on design and given a family-level measurement of it.Based on Tor node families (over 3000) discovered from live Tor network data (from Jan.2011 to Dec.2012),a few characteristics of Tor node families were revealed,such as family size,bandwidth,geographical distribution as well as operators providing a few big families.The analysis validated the irreplaceable role played by family design in enhancing Tor’s anonymity.Based on the measurement,security analysis showed the serious availability threat a compromised node family can cause to the Tor network.Besides,It also discussed Tor hidden families and the potential anonymity risk caused by them.

    Anonymous aggregator election protocol for wireless sensor networks
    Shuai FU,Jian-feng MA,Hong-tao LI,GQi JIAN
    2015, 36(2):  88-97.  doi:10.11959/j.issn.1000-436x.2015037
    Asbtract ( 221 )   HTML ( 4)   PDF (1237KB) ( 978 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An anonymous cluster head election protocol in clustered wireless sensor networks was proposed.The protocol detailed the decision rules and mode of cluster construction while an anonymous veto protocol based on bilinear pairings was adopted to verify election results,ensuring the successful election of cluster heads.A corresponding anonymous data aggregation scheme was designed,through which data aggregation can be accomplished without revealing the identities of aggregators.Extensive analysis and simulation results show that the proposed protocol achieves anonymity,energy efficiency and security of cluster heads election simultaneously and can resist eavesdropping attacks,node compromise attacks and collusion attacks effectively.

    Research on fractional repetition codes based on group divisible designs
    Bing ZHU,Hui LI,Jun CHEN,Han-xu HOU,Tai ZHOU
    2015, 36(2):  98-105.  doi:10.11959/j.issn.1000-436x.2015038
    Asbtract ( 364 )   HTML ( 10)   PDF (918KB) ( 747 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel design of FR (fractional repetition) codes was proposed which aims at providing efficient repair at the minimum bandwidth regenerating point.The design consisted of an outer MDS (maximum distance separable) code and an inner repetition code,called GDDBFR (group divisible design based FR) codes.The proposed codes can achieve the system storage capacity under the random access model and are available for a wide range of parameters.Despite of the table-based repair,theoretical analysis identifies that GDDBFR codes generally have large node repair alternatives.Furthermore,experimental results show that GDDBFR codes can significantly reduce the failure repair time when compared with legacy RS (Reed-Solomon) codes and regenerating codes in the domain.

    Resource saving oriented dynamic target adaptive acquisition system in wireless sensor networks
    Ke-jiang XIAO,Rui WANG,Li CUI
    2015, 36(2):  106-116.  doi:10.11959/j.issn.1000-436x.2015039
    Asbtract ( 211 )   HTML ( 2)   PDF (2333KB) ( 464 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at dynamic target detection problems in camera sensor networks,a resource saving oriented dynamic target adaptive acquisition system namely EasiRS is built up.EasiRS reuses storage space to decrease the requirement for the storage resources.To solve the problem of continuous images real-time processing caused by dynamics of the monitoring target,an adaptive real-time detection method for image integration detection is proposed.According to the real-time image integration detection,EasiRS does selective transmission for the acquired information to reduce the communication energy consumption and the amount of data that need to transmit the base station.Both indoor and outdoor environmental experiments are conducted.The results demonstrate that although EasiRS needs extra processing time cost,it can decrease storage consumption and transmission energy consumption while maintaining the sensing performance at acceptable level.

    New interest-sensitive and network-sensitive method for user recommendation
    Yan-min SHANG,Peng ZHANG,Ya-nan CAO
    2015, 36(2):  117-125.  doi:10.11959/j.issn.1000-436x.2015040
    Asbtract ( 290 )   HTML ( 4)   PDF (1377KB) ( 621 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new hybrid approach by incorporatin gusers’ interests and users’ friendships together to recommend new friends for target users is proposed.A variation of PageRank—Topic_Friend_PageRank(TFPR) is proposed,which can consider user interests and user friends at same time.Firstly,proposed method uses latent Dirichlet allocation (LDA) to model users’ interests,and weighted-PageRank algorithm to model users’ friendship network,and then merge these two factors into TFPR.This hybrid method models users’ interests and users’ friendships at the same time,and wedemonstrate the effectiveness of proposed hybrid model by using some social network datasets.

    Tight coupling approach for networked control systems from cyber physical system perspective
    Jin-zhi LIN,Ying WU,Gong-yi WU,Jing-dong XU
    2015, 36(2):  126-136.  doi:10.11959/j.issn.1000-436x.2015041
    Asbtract ( 323 )   HTML ( 5)   PDF (3905KB) ( 698 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    From cyber physical system perspective,tightly coupling the communications and computing aspects with physical dynamics is profound.This characteristic is investigated for wireless networked control systems (WNCS).Following the tight coupling principle of CPS,a tight coupling adaptive fuzzy controlling methodology for WNCS is proposed.Through simulation experiments,it is showed that proposed method could adaptively adjust the controlled system's sample period and network channel access priority according to its real time control urgency and the network traffic condition,so as to optimize network utilization and improve the performances of the whole NCS.

    Game-theoretical frequency reuse algorithm in Femtocell network
    Xiong ZHOU,Sui-li FENG,Yue-hua DING,Yong-zhong ZHANG
    2015, 36(2):  137-143.  doi:10.11959/j.issn.1000-436x.2015042
    Asbtract ( 262 )   HTML ( 3)   PDF (1208KB) ( 609 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A game-theoretical frequency reuse algorithm has been proposed for Femtocell network.Firstly,each Femtocell tries to get an available sub-band by sensing its radio circumstance.Then,inner-cluster frequency collisions are avoided by implementing a negotiation mechanism.Lastly,each cluster is regarded as a game player to get the largest utility by using its optimal strategy.Despite Femtocell base stations are randomly installed by users,the proposed method performs well in Femtocell network.Simulation results show that frequency collisions are dramatically reduced and the average capacity of Femtocells is considerably enhanced.

    Privacy preserving algorithm based on trajectory location and shape similarity
    Chao WANG,Jing YANG,Jian-pei ZHANG
    2015, 36(2):  144-157.  doi:10.11959/j.issn.1000-436x.2015043
    Asbtract ( 357 )   HTML ( 6)   PDF (4007KB) ( 1078 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to reduce the privacy disclosure risks when trajectory data is released,a variety of trajectories anonymity methods were proposed.However,while calculating similarity of trajectories,the existing methods ignore the impact that the shape factor of trajectory has on similarity of trajectories,and therefore the produced set of trajectory anonymity has a lower utility.To solve this problem,a trajectory similarity measure model was presented,considered not only the time and space elements of the trajectory,but also the shape factor of trajectory.It is computable in polynomial time,and can calculate the distance of trajectories not defined over the same time span.On this basis,a greedy clustering and data mask based trajectory anonymization algorithm was presented,which maximized the trajectory similarity in the clusters,and formed data "mask" which is formed by fully accurate true original locations information to meet the trajectory k-anonymity.Finally,experimental results on a synthetic data set and a real-life data set were presented; our method offer better utility and cost less time than comparable previous proposals in the literature.

    Physical-layer security transmission method based on spatial modulation with finite alphabet inputs
    Bo CUI,Lu LIU,Xiang-yu LI,Liang JIN
    2015, 36(2):  158-167.  doi:10.11959/j.issn.1000-436x.2015044
    Asbtract ( 331 )   HTML ( 9)   PDF (1811KB) ( 338 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Addressing the problem of wireless physical layer security transmission for finite alphabet input systems,a spatial modulation secure transmission method is proposed.On the basis of information theory,the method utilizes the receive antenna indices of multiple-input multiple-output (MIMO) system to bear information,and randomizes the eavesdropper’s equivalent channel by switching the receive antennas,which can guarantee physical layer security transmission.First,the different receiving performances of the legitimate user and eavesdropper are analyzed in the spatial modulation secure transmission system.Second,the mutual information and secrecy mutual information of the transmission system are calculated,and two sufficient conditions that ensure positive secrecy mutual information are pointed out.Finally,an estimation algorithm of mutual information is provided.Moreover,the symmetry of finite alphabet set is exploited to decrease the computational complexity.Theoretical analysis and numerical simulation results verify the availability of the security transmission method.

    Analysis on the DOA estimation of uniform circular arrays based on compressive sensing
    Lin-shu HUANG,Hao CHA,Hui-juan YE,Kai XU
    2015, 36(2):  168-174.  doi:10.11959/j.issn.1000-436x.2015045
    Asbtract ( 348 )   HTML ( 7)   PDF (1017KB) ( 1130 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to alleviate the serious problem of the low angle resolution after miniaturizing the antenna array of the surface wave radar,the compressed sensing method is proposed for radar antenna array angle estimation method.The sparse signals model is established,the application conditions are analyzed,and the measurement matrix is designed based on the real-time sea state information.By using the matching algorithm,the signal reconstruction is carried on.Simulation results show that if it satisfies the reconstruction condition,the azimuth resolution is improved by the method in the cost of the calculating resources.

    Distributed fair cooperative routing in multi-gates wireless mesh network
    Hong QIAO,Da-fang ZHANG,Kun XIE,Shi-ming HE,Ji ZHANG
    2015, 36(2):  175-185.  doi:10.11959/j.issn.1000-436x.2015046
    Asbtract ( 392 )   HTML ( 5)   PDF (2545KB) ( 944 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Existing cooperative routings cannot fairly allocate the wireless resources,which results in that the throughput of minimum flow cannot satisfy the performance requirement.The multiple flow cooperative routing problem is formulated as a convex optimization problem with the goal of maximizing network utility.Based on dual decomposition and subgradient method,a distributed fair cooperative routing algorithm in multi-gates wireless mesh network-FCRMG is proposed.The simulation results show that,FCRMG can largely improve the throughput of the minimum flow without decreasing the total network throughput,compared with uncooperative routing based on expected transmission time metric and cooperative routing based on contention aware metric.

    Mergeable adaptive tile coding method
    Meng-yu SHI,Quan LIU,Qi-ming FU
    2015, 36(2):  186-192.  doi:10.11959/j.issn.1000-436x.2015047
    Asbtract ( 345 )   HTML ( 7)   PDF (889KB) ( 1003 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve many unnecessary division,mergence supported adaptive tile coding algorithm was presented which would eliminate the unnecessary division.Simulation is conducted on mountain car problem with discrete actions and continuous state space Results show that the proposed method can eliminate the influence of false division in the traditional tile coding method and achieve a more accurate adaptive partition of continuous state space.A higher convergence rate is achieved at the same time.

    Academic telecommunication
    Novel construction of QC-LDPC codes with modified 2-D GRS codes
    Ming ZHAO,Xiao-lin ZHANG
    2015, 36(2):  193-199.  doi:10.11959/j.issn.1000-436x.2015048
    Asbtract ( 316 )   HTML ( 5)   PDF (1038KB) ( 578 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The construction method for QC-LDPC (quasi-cyclic low density parity-check) code with modified two-dimensional generalized reed-solomon (2-D GRS) code is proposed using the generator polynomial of GRS code,so thus the constructed code can have better decoding performance.Meanwhile both the quasi dual-diagonal structure and proper weight distributions are considered during the construction.The QC-LDPC codes with different rates are used to compare with the new designed codes.Experimental results show that the proposed method can accelerate the construction and QC-LDPC codes constructed from the proposed method can have better decoding performance while with low encoding complexity.

    Construction of ZCZ periodic complementary sequence set with flexible subsequences
    Yu-bo LI,Cheng-qian XU,Nan JING,Gang LI,Kai LIU,Hao-chen HU
    2015, 36(2):  200-203.  doi:10.11959/j.issn.1000-436x.2015049
    Asbtract ( 241 )   HTML ( 9)   PDF (813KB) ( 608 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on orthogonal matrices,a construction of zero-correlation zone (ZCZ) periodic complementary sequence sets are proposed.The resultant ZCZ periodic complementary sets have flexible number of subsequences.Moreover,the ZCZ periodic complementary sequence sets are optimal.ZCZ periodic complementary sequence sets with flexible subsequences are more useful in communication systems.

    Design for secure two-party computation protocol based on ElGamal variant’s homomorphic
    Zhi-wei CHEN,Juan-mei ZHANG,Zi-chen LI
    2015, 36(2):  204-211.  doi:10.11959/j.issn.1000-436x.2015050
    Asbtract ( 515 )   HTML ( 43)   PDF (1261KB) ( 1593 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    ElGamal homomorphic characteristics were analyzed.In order to meet the need of protocol design,ElGamal variant was designed,which satisfies additive homomorphism and constant multiplication homomorphism.A homomorphism calculate protocol of linear equation passed by two private point based on the ElGamal variant was also proposed,then the correctness,security and the complexity of computation and communication of the protocol were analyzed to extend the application of thinking to secure two-party line segments intersection scheme.Compared with the similar protocol of solving the geometric problem,a kind of secure two-party computation protocol based on homomorphic encryption system without using the oblivious transfer protocol and the millionaires protocol was put forward,which holds higher efficiency and a lower burden of communication.

    Bandwidth allocation games based on network selection for video communication
    Shu-zhi WEI,Qi ZHU
    2015, 36(2):  212-220.  doi:10.11959/j.issn.1000-436x.2015051
    Asbtract ( 264 )   HTML ( 2)   PDF (1437KB) ( 847 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A bandwidth allocation game based on network selection (BAG-NS) was proposed for video communication in heterogeneous wireless networks.Firstly,according to the video characteristics of different users and current network conditions,the algorithm calculated the weights of network factors and selected the optimum network by combining analytic hierarchy process and entropy theory.Secondly,the user’s utility function with payoff and cost was designed,and a distributed iterative algorithm is used to obtain the Nash equilibrium.Then the existence and uniqueness of the Nash equilibrium are proved.Simulation results show that the proposed algorithm enables different users to reasonably distribute in different networks and takes users’ fairness and network congestion control into consideration,which increases the utilization of network resources,reduces the users’ video distortion,and improves the users’ video quality.

    Outage probability and capacity analysis of distributed MIMO systems over a composite fading channel
    Wen-jie PENG,Yue-heng LI,Tuan-jie XUE,Mei-yan JU,Ping HUANG
    2015, 36(2):  221-230.  doi:10.11959/j.issn.1000-436x.2015052
    Asbtract ( 415 )   HTML ( 19)   PDF (1084KB) ( 916 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The exact closed-form expressions about the outage probability and capacity of distributed MIMO systems over a composite fading channel are derived firstly by using Lognormal approximation to complicated Gamma-lognormal distribution when mobile station (MS) in the cell is fixed at some position and the so-called maximum ratio transmission/selected combining (MRT-SC) and selected transmission/maximum ratio combining (ST-MRC) schemes are adopted in uplink and downlink respectively.Then based on a newly proposed non-uniform MS cell distribution model,which is more consistent with the MS cell hotspot distribution in an actual communication environment,the average outage probability and capacity formulas synthesizing the MS cell position information are further derived.Finally,the accuracy of the approximation method and the rationality of the corresponding theoretical analysis about the system performance are proven and illustrated by computer simulations.

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: