Please wait a minute...

Current Issue

    25 April 2014, Volume 35 Issue 4
    Gerschgorin disk theorem based spectrum sensing for wideband cognitive radio
    2014, 35(4):  1-10. 
    Asbtract ( 1067 )   Knowledge map   
    Related Articles | Metrics
    Gerschgorin disk theorem (GDT) based wideband spectrum sensing methods, namely Gerschgorin likelihood estimate(GLE) algorithm and Gerschgorin disk radii iteration(GDRI) algorithm, were proposed for cognitive radios. By means of exploring the possibility of utilizing GDT in wideband spectrum sensing, the occupied and the idle licensed subbands was distingwished by respectively identifying the cardinalities of the corresponding subband sets. With an aim to strengthen the performance of GLE and GDRI, a subband continuity based wideband sensing algorithm was further proposed. Simulation results show that GLE sensing performance remains consistent when the SNR is low, whereas GDRI requires no a priori knowledge of the noise power and the PU signal and it overcomes the practical problem of small spectrum observation samples. With salient performance and practical feasibility, the proposed GLE and GDRI may serve as candidate wideband sensing technologies for cognitive radios.
    academic paper
    Gerschgorin disk theorem based spectrum sensing for wideband cognitive radio
    Bin SHEN,Shu WANG,Qiong HUANG,Qian-bin CHEN
    2014, 35(4):  1-10.  doi:10.3969/j.issn.1000-436x.2014.04.001
    Asbtract ( 251 )   HTML ( 1)   PDF (2086KB) ( 623 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Gerschgorin disk theorem (GDT) based wideband spectrum sensing methods, namely Gerschgorin likelihood estimate(GLE) algorithm and Gerschgorin disk radii iteration(GDRI) algorithm, were proposed for cognitive radios. By means of exploring the possibility of utilizing GDT in wideband spectrum sensing, the occupied and the idle licensed subbands was distingwished by respectively identifying the cardinalities of the corresponding subband sets. With an aim to strengthen the performance of GLE and GDRI, a subband continuity based wideband sensing algorithm was further proposed. Simulation results show that GLE sensing performance remains consistent when the SNR is low, whereas GDRI requires no a priori knowledge of the noise power and the PU signal and it overcomes the practical problem of small spectrum observation samples. With salient performance and practical feasibility, the proposed GLE and GDRI may serve as candidate wideband sensing technologies for cognitive radios.

    Expectation of individual packet transmission times in reliable broadcast
    2014, 35(4):  2-16. 
    Asbtract ( 573 )   Knowledge map   
    Related Articles | Metrics
    In one-many transmission model, broadcast/multicast was more effective than unicast at delivery efficiency. The mathematical expectation of individual packet transmission times was a fundamental parameter in the theory of reliable broadcast. Up to now, there were two categories of solutions for this parameter in relevant literatures: exact series solutions and approximate solutions used for analyzing complexities. The former may consume too much computing time, and the latter’s precision was very low in some regions. Combining one series solution with the solution based on the assumption of continuous probability distribution, derive a few simple and high-precision solutions whose physical meanings were more obvious. Simulation shows that the average deviation has been lower than the current solution 2~3 order of magnitude.
    Multi-values discrete particle swarm optimization for cross layer resource allocation in cooperative OFDMA systems
    2014, 35(4):  3-24. 
    Asbtract ( 588 )   Knowledge map   
    Related Articles | Metrics
    The resource allocation problem in cooperative OFDMA systems with mobile stations (MS) on multi-services was investigated. In order to maximize the sum utility of all MS under per-relay power constraint(PPC), an asymptotic optimal resource allocation algorithm based on multi-values discrete particle swarm optimization (MDPSO) was proposed. Unlike the traditional discrete particle swarm optimization (DPSO) algorithm, the proposed one denotes the particle position by discrete multi-value variable. Furthermore, new probability based operations for computing particle velocity and updating particle positions were developed, and the mutation of particle positions was also introduced to overcome the premature convergence problem. The proposed MDPSO can also be applied widely to solve the combinatorial optimization problems (COP). Furthermore, iterative waterfilling was used to complete power allocation. Simulation results show that the proposed method achieves higher sum utility of all MSs and higher degree of user fairness than the existing methods.
    Investigation of traffic adaptation based interference alignment for cognitive radio networks
    2014, 35(4):  4-34. 
    Asbtract ( 660 )   Knowledge map   
    Related Articles | Metrics
    A novel method of adaptive interference alignment (IA) was proposed for cognitive radio networks. The new IA scheme, which was chiefly characterized by off-line feasible set optimization and traffic load oriented adaptation, enables dynamic sharing of channel resource among a pair of primary users and multiple pairs of secondary users. To effectively construct the beam-forming and interference suppression matrix for IA, then not only derive an adaptive closed-form algorithm, but its average degrees of freedom (d.o.f) were also analyzed with random traffic load model and a lower bound is given as well. The analysis is verified with statistic model simulation and the results show that the new method outperforms both modified opportunistic IA and fixed IA in average d.o.f and thus can significantly improve the sum capacity of cognitive users without introducing interference to the primary user. Moreover, due to its simplicity, the scheme is highly desirable to implement in low cost terminals.
    Spectrum access scheme of MAC layer for real-time traffic in cognitive radio network
    2014, 35(4):  5-43. 
    Asbtract ( 731 )   Knowledge map   
    Related Articles | Metrics
    A These protocols have not satisfied the emergent needs of the increasing real-time businesses and high-level service quality. In order to satisfy the requirement for real-time transmission of high broadband service in cognitive radio networks, a low-delay spectrum access scheme of MAC layer, LD-SAS, was proposed. In spectrum sensing phase, the transmission delay can be minimized by choosing the optimum available channel number of sensing channels. In channel access contention phase, the effect of channel conflict problem and deaf terminal problem in multichannel coordination can be reduced by designing channel access frame. The theoretical and experimental results were presented to demonstrate the effectiveness of our proposed protocol. Compared with the traditional MAC protocols for cognitive networks, LD-SAS has shorter delay time and slightly better throughput performance when the probability of channel being idle is bigger.
    Study on game-based incentive mechanism of mobile ad hoc network
    2014, 35(4):  6-52. 
    Asbtract ( 869 )   Knowledge map   
    Related Articles | Metrics
    According to the selfishness of rational mobile ad hoc network nodes showed during the packet forwarding, the selfish behavior statically and dynamically based on game theory were analyzed and modeled. A stern tit for tat strategy(STFT) was proposed to motivate node cooperation, and an infinite repeated game model was established to analyze the node behavior. Then, an incentive-compatible condition was obtained analytically. The dynamic process of selfish node turning to cooperate using the evolutionary game theory was studied, and the evolutionary stability of STFT was proved. Simulation results show that, even if the ratio of selfish nodes is one, by setting punishment parameters reasonably, the overall network performance can be improved 80% at most.
    Contextual access control based on attribute-based encryption with hidden lattice structure for removable storage media
    2014, 35(4):  7-64. 
    Asbtract ( 708 )   Knowledge map   
    Related Articles | Metrics
    To prevent data breaches via removable storage media, the way to enhance the access control capability of hosts within trusted zone with removable storage media attached was explored. Firstly, based on traditional Cipher-text- Policy hiding Attribute-Based Encryption (CP-ABE) schemes, an expression with lattice for attributes was proposed. Each attribute was described as a linear lattice or a subset lattice, and an attribute set was described as a product lattice. Furthermore, the lattice-based multi-level access control model was applied to construct access policies. The new scheme was proven fully secure under the standard model. It effectively simplifies the expression of access policies and satisfies fine-grained access control of sensitive information shared in the context of multi-level security. Secondly, considering the ubiquitous usage of removable storage media, some security attributes associating with the context of use were adopted to construct a lattice structure. Then a dynamic access control could be achieved. Finally, based on authorization and dynamic access control, a layered security solution providing multi-level protection for removable storage media was presented. Security and flexibility of proposed solution was analyzed, and a comparison experiment shows that it still has pretty good efficiency. It also can be applied to information security management in other ubiquitous environments.
    CAM-MAC: channel aware multi-channel MAC protocol in cognitive radio network
    2014, 35(4):  8-73. 
    Asbtract ( 594 )   Knowledge map   
    Related Articles | Metrics
    For multi-channel cognitive radio network (CRN), the inconsistent transmission conditions of common control channel (CCC) and data channels deteriorate the performance of cognitive MAC protocols. Focusing on this problem, a novel channel aware multi-channel cognitive MAC protocol (CAM-MAC) was proposed, which consists of two-level four-way handshaking mechanism. The first level two-way handshaking was optimized to reduce the mean successful reservation time on CCC. The other level two-way handshaking was implemented by a cross-layer approach to adopt the adaptive transmission based on instantaneous SNR on each Nakagami fading data channel to improve the data rate. These mechanisms improve the performance of CAM-MAC. Simulation results validate the throughput of CAM-MAC outper-forms that of the existing one, about 50% improvement in the throughput under certain conditions.
    Eavesdropping against wireless spatial scrambling secure communication: hyperplane clustering
    2014, 35(4):  9-80. 
    Asbtract ( 607 )   Knowledge map   
    Related Articles | Metrics
    The existing eavesdropping method has poor anti-noise performance and high complexity, which makes it not practical. It is shown that the received scrambled signals are distributed within parallel hyperplanes if adequate antennas are equipped by eavesdropper. According to this distribution, a hyperplane clustering (HC) algorithm was presented to blindly estimate the hyperplane parameters which reveal the sending information. Simulation results show that the HC algorithm, compared with the existing MUSIC-like algorithms, holds the advantages of better anti-noise performance and lower computing complexity.
    Performance evaluation of TCP congestion control algorithms in fast long distance network
    2014, 35(4):  10-90. 
    Asbtract ( 695 )   Knowledge map   
    Related Articles | Metrics
    With the development of high-speed networks, a series of high-speed TCP transport protocols have been proposed. Firstly, the improved TCP variants was classified according to their characteristics, and each protocol was given a brief introduction. Then, detailed evaluation and analysis were performed through the simulation and in real network separately. Finally, the shortcomings of these protocols and their future research directions were provided.
    TC2-MAC: an adaptive MAC protocol for wireless sensor network
    2014, 35(4):  11-102. 
    Asbtract ( 726 )   Knowledge map   
    Related Articles | Metrics
    A novel adaptive hybrid medium access control (MAC) protocol TC2-MAC has been proposed. The protocol used binary tree based time-slot-block (TSB) allocation strategy and time slot constrained carrier sense multiple access with collision avoidance (CSMA/CA) method to ensure heterogeneous sensor nodes or different types of traffic obtain personalized quality of service (QoS). In addition, it provided flexible information scheduling mechanism to improve fairness of channel access and enhance network efficiency enable. Results show that TC2-MAC has significant adaptability to the change of network traffic and network topology compared with traditional time division multiple access (TDMA) based MAC.
    academic paper
    Expectation of individual packet transmission times in reliable broadcast
    Kai-yun WANG,You-ping LI,Si-qi KONG,Qiang1 ZHAO,Wei-dong MA
    2014, 35(4):  11-16.  doi:10.3969/j.issn.1000-436x.2014.04.002
    Asbtract ( 134 )   HTML ( 0)   PDF (1213KB) ( 470 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In one-many transmission model, broadcast/multicast was more effective than unicast at delivery efficiency. The mathematical expectation of individual packet transmission times was a fundamental parameter in the theory of reli-able broadcast. Up to now, there were two categories of solutions for this parameter in relevant literatures: exact series solutions and approximate solutions used for analyzing complexities. The former may consume too much computing time, and the latter's precision was very low in some regions. Combining one series solution with the solution based on the as-sumption of continuous probability distribution, derive a few simple and high-precision solutions whose physical mean-ings were more obvious. Simulation shows that the average deviation has been lower than the current solution 2~3 order of magnitude.

    Spectrum sharing scheme in cognitive radio networks based on primary limited feedback
    2014, 35(4):  12-111. 
    Asbtract ( 533 )   Knowledge map   
    Related Articles | Metrics
    A spectrum sharing scheme for a pair of secondary users co-existing with multiple primary users was proposed. The primary users exploit the limited feedback of channel quality information (CQI) to allocate their transmission power and rate. By overhearing the limited feedback of primary CQI, the secondary user accessed the channel with proper transmission power and rate while causing interference to the primary users and so the rate loss of the primary system. Under the primary rate loss constraint, the optimal transmit power and transmission rate for the secondary was obtained to maximize the secondary user throughput. Numerical results show that, with only 3 or 4 bits of feedback to each primary user, the effective throughput of the secondary system is comparable to the case with both primary and secondary transmitters having the perfect CQI of the primary link. The simulation results demonstrate that the proposed spectrum sharing scheme can meet the primary rate loss constraint.
    Green virtual topology design algorithm based on constraint-based routing
    2014, 35(4):  13-123. 
    Asbtract ( 689 )   Knowledge map   
    Related Articles | Metrics
    To reduce the energy consumption of Internet core network, a formulation model for green virtual topology design (GVTD) problem was developed, which employs the following measures: traffic aggregation, network resources allocation on demand, virtual topology design dynamically and multi-granularity sleeping. A heuristic algorithm base on constraint-based routing, namely CBR-GVTD, was proposed, which combines the single-hop and multi-hop routing to establish virtual topology, and makes trade-offs between the network power consumption and routing performance via the constraint-based routing mechanism. The simulation results indicate that CBR-GVTD can achieve at most 62%~90% power saving with very high resource utilization (80%~90% for interface utilization) and excellent routing performance (not more than 5 for maximum routing hops).
    Robust resource allocation algorithm for cognitive radio system
    2014, 35(4):  14-129. 
    Asbtract ( 791 )   Knowledge map   
    Related Articles | Metrics
    For the underlay cognitive radio networks with multiuser under parameter uncertainties, a robust distributed robust power control algorithm was proposed. This algorithm was formulated to minimize total transmit power of SUs under the interference temperature and SINR constraint. Based on euclidean ball-shaped uncertainty, the robust distributed solution of the optimization problem was obtained by using Lagrange dual decomposition theory. The simulation results illustrate that, compared with the non-robust algorithm and traditional SOCP algorithm, the proposed algorithm achieves a better performance and guarantees the QoS requirement for both SUs and PUs under the parameter uncertainty.
    Adaptive fractional-order Darwinian particle swarm optimization algorithm
    2014, 35(4):  15-140. 
    Asbtract ( 698 )   Knowledge map   
    Related Articles | Metrics
    The convergence performance of the fractional-order Darwinian particle swarm optimization (FO-DPSO) algorithm depends on the fractional-order α, and it can easily get trapped in the local optima. To overcome such shortcoming, an adaptive fractional-order Darwinian particle swarm optimization (AFO-DPSO) algorithm was proposed. In AFO-DPSO, both particle’s position and velocity information were utilized adequately, together an adaptive acceleration coefficient control strategy and mutation processing mechanism were introduced for better convergence performance. Testing results on several well-known functions demonstrate that AFO-DPSO substantially enhances the performance in terms of convergence speed, solution accuracy and algorithm stability. Compared with PSO, HPSO, DPSO, APSO, FO-PSO, FO-DPSO and NCPSO, the global optimality of AFO-DPSO are greatly improved.
    Joint channel allocation and power control in femtocell system
    2014, 35(4):  16-147. 
    Asbtract ( 646 )   Knowledge map   
    Related Articles | Metrics
    A joint channel allocation and power control algorithm was proposed, which used convex optimization method to combine channel allocation and power control and limit the range of interference, subgradient method was used to solve the close formula of power and optimize the capacity of fem network. In addition, the algorithm had connected the optimal of fem network and macro network together, thus macro network’s throughput could be maximized. Simulation results prove that system throughput has been greatly improved.
    Novel extended multivariate public key cryptosystem
    2014, 35(4):  17-154. 
    Asbtract ( 667 )   Knowledge map   
    Related Articles | Metrics
    To resist linearization attack and differential attack effectively, a nonlinear invertible transformation based on “tame transformation” was constructed. Incorporated with the Matsumoto-Imai (MI) scheme, a novel extended multivariate public key cryptosystem was proposed. Then, according to the proposed scheme, two practical applications including an encryption scheme and a signature scheme were designed respectively. Analysis results demonstrate that the extended cryptosystem inherits the merit of MI, i.e. efficient computation. Meanwhile, the novel extended scheme can also resist linearization attack, differential attack and algebraic attack.
    academic paper
    Multi-values discrete particle swarm optimization for cross layer resource allocation in cooperative OFDMA systems
    Wei LI,Chun-lin XIONG,De-gang WANG,Xiao-ying ZHANG,Ji-bo WEI
    2014, 35(4):  17-24.  doi:10.3969/j.issn.1000-436x.2014.04.003
    Asbtract ( 242 )   HTML ( 2)   PDF (1345KB) ( 532 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The resource allocation problem in cooperative OFDMA systems with mobile stations (MS) on multi-services was investigated. In order to maximize the sum utility of all MS under per-relay power constraint(PPC), an asymptotic optimal resource allocation algorithm based on multi-values discrete particle swarm optimization (MDPSO) was pro-posed. Unlike the traditional discrete particle swarm optimization (DPSO) algorithm, the proposed one denotes the parti-cle position by discrete multi-value variable. Furthermore, new probability based operations for computing particle veloc-ity and updating particle positions were developed, and the mutation of particle positions was also introduced to over-come the premature convergence problem. The proposed MDPSO can also be applied widely to solve the combinatorial optimization problems (COP). Furthermore, iterative waterfilling was used to complete power allocation. Simulation re-sults show that the proposed method achieves higher sum utility of all MSs and higher degree of user fairness than the existing methods.

    Digital visual media forensics
    2014, 35(4):  18-165. 
    Asbtract ( 683 )   Knowledge map   
    Related Articles | Metrics
    The origin and concept of digital visual media forensics is introduced, representative double compression detection and forgery detection algorithms are introduced in detail afterwards. On this basis, the relationships between different forensic algorithms and existing problems of visual media forensic techniques are discussed. Perspectives of the development of digital visual media forensics are put forward in the end.
    Ustor: cloud storage system based on regenerating codes
    2014, 35(4):  19-173. 
    Asbtract ( 975 )   Knowledge map   
    Related Articles | Metrics
    To ensure reliability of user’s data, multiple clouds are responsible for storing the data. For purpose of minimizing storage cost and repair bandwidth, a method of utilizing functional regenerating codes(FRC) to encode data to several blocks, which are further distributed to different clouds, was proposed. In this way, amount of data downloaded through the network when data loss happens in a single cloud is cut down, and repair cost is cut down as well. This method was successfully applied in a cloud storage system Ustor. Observations can be drawn from the experimental results: first, erasure coding guarantees data reliability, increasing 5%~10% response time compared with non-coding; second, speed of FRC encode, decode and repair are a little slower than Reed-Solomon(RS) code, and the time gap of encoding 256MB by two codes is less than 0.5 seconds; third, compared with traditional RS codes, FRC reduces more than 25% data amount needed to download during a repair in the experiment.
    Packet-loss robust scalable authentication algorithm for compressed image streaming
    2014, 35(4):  20-181. 
    Asbtract ( 555 )   Knowledge map   
    Related Articles | Metrics
    Based on structures and dependencies of the image codestreams, a scalable stream-level authentication approach was proposed to resist packet loss. To construct the authentication algorithm by hash chaining and error-correction coding, the proposed approach can realize optimizing bit-rate allocations and unequal authentication protection. Firstly, the compressed streams of the original image are analyzed to obtain hierarchical structures and coding dependencies. Secondly, in accordance with the differentiation-importance of codestreams to the reconstructed image, sub-important packet is linked to more important packets via hash chains. Finally, these hash values of decoding-independent packets and the digital signature of the whole bitstream are encoded with an error-correction coding algorithm. The proposed scheme has a very low authentication overhead because it signs on the whole image once. Experimental results show that the authenticated image of the proposed scheme has high reconstructed quality than the other three stream-level authentication schemes.
    New efficient network architecture BSN-MOT for parallel processing
    2014, 35(4):  21-190. 
    Asbtract ( 615 )   Knowledge map   
    Related Articles | Metrics
    BSN-MOT as a two-tier architecture that takes the advantages of both the BSN and the MOT was presented. Topological property and many communication and application algorithms are investigated. The communication algorithms include row-tree and column-tree broadcast, one to all broadcast, data sum, matrix multiplication, shortest path rooting and polynomial root finding. In contrast with other two similar tree-based two-tier architectures MMT and OMULT, the results show that the algorithms that run on BSN-MOT are much faster, and BSN-MOT is more competitive.
    academic paper
    Investigation of traffic adaptation based interference alignment for cognitive radio networks
    Heng DONG,Rong-fang SONG
    2014, 35(4):  25-34.  doi:10.3969/j.issn.1000-436x.2014.04.004
    Asbtract ( 206 )   HTML ( 0)   PDF (1327KB) ( 415 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel method of adaptive interference alignment (IA) was proposed for cognitive radio networks. The new IA scheme, which was chiefly characterized by off-line feasible set optimization and traffic load oriented adaptation, en-ables dynamic sharing of channel resource among a pair of primary users and multiple pairs of secondary users. To effec-tively construct the beam-forming and interference suppression matrix for IA, then not only derive an adaptive closed-form algorithm, but its average degrees of freedom (d.o.f) were also analyzed with random traffic load model and a lower bound is given as well. The analysis is verified with statistic model simulation and the results show that the new method outperforms both modified opportunistic IA and fixed IA in average d.o.f and thus can significantly improve the sum capacity of cognitive users without introducing interference to the primary user. Moreover, due to its simplicity, the scheme is highly desirable to implement in low cost terminals.

    Spectrum access scheme of MAC layer for real-time traffic in cognitive radio network
    Rui-fang LI,Quan LIU,Ren-fa LI
    2014, 35(4):  35-43.  doi:10.3969/j.issn.1000-436x.2014.04.005
    Asbtract ( 228 )   HTML ( 3)   PDF (1882KB) ( 641 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    These protocols have not satisfied the emergent needs of the increasing real-time businesses and high-level ser-vice quality. In order to satisfy the requirement for real-time transmission of high broadband service in cognitive radio networks, a low-delay spectrum access scheme of MAC layer, LD-SAS, was proposed. In spectrum sensing phase, the transmission delay can be minimized by choosing the optimum available channel number of sensing channels. In channel access contention phase, the effect of channel conflict problem and deaf terminal problem in multichannel coordination can be reduced by designing channel access frame. The theoretical and experimental results were presented to demonstrate the effectiveness of our proposed protocol. Compared with the traditional MAC protocols for cognitive networks, LD-SAS has shorter delay time and slightly better throughput performance when the probability of channel being idle is bigger.

    Study on game-based incentive mechanism of mobile ad hoc network
    Ying-you WEN,Bo ZHAO,Hong ZHAO
    2014, 35(4):  44-52.  doi:10.3969/j.issn.1000-436x.2014.04.006
    Asbtract ( 250 )   HTML ( 4)   PDF (736KB) ( 995 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the selfishness of rational mobile ad hoc network nodes showed during the packet forwarding, the selfish behavior statically and dynamically based on game theory were analyzed and modeled. A stern tit for tat strat-egy(STFT) was proposed to motivate node cooperation, and an infinite repeated game model was established to analyze the node behavior. Then, an incentive-compatible condition was obtained analytically. The dynamic process of selfish node turning to cooperate using the evolutionary game theory was studied, and the evolutionary stability of STFT was proved. Simulation results show that, even if the ratio of selfish nodes is one, by setting punishment parameters reasona-bly, the overall network performance can be improved 80% at most.

    Contextual access control based on attribute-based encryption with hidden lattice structure for removable storage media
    Bo CHEN,Ling YU,Xiao-hui QIANG,Yan WANG
    2014, 35(4):  53-64.  doi:10.3969/j.issn.1000-436x.2014.04.007
    Asbtract ( 227 )   HTML ( 0)   PDF (1705KB) ( 492 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To prevent data breaches via removable storage media, the way to enhance the access control capability of hosts within trusted zone with removable storage media attached was explored. Firstly, based on traditional Cipher-text-Policy hiding Attribute-Based Encryption (CP-ABE) schemes, an expression with lattice for attributes was proposed. Each attribute was described as a linear lattice or a subset lattice, and an attribute set was described as a product lattice. Furthermore, the lattice-based multi-level access control model was applied to construct access policies. The new scheme was proven fully secure under the standard model. It effectively simplifies the expression of access policies and satisfies fine-grained access control of sensitive information shared in the context of multi-level security. Secondly, considering the ubiquitous usage of removable storage media, some security attributes associating with the context of use were adopted to construct a lattice structure. Then a dynamic access control could be achieved. Finally, based on authorization and dynamic access control, a layered security solution providing multi-level protection for removable storage media was presented. Security and flexibility of proposed solution was analyzed, and a comparison experiment shows that it still has pretty good efficiency. It also can be applied to information security management in other ubiquitous environments.

    CAM-MAC: channel aware multi-channel MAC protocol in cognitive radio network
    Liang WANG,Min SHENG,Yan ZHANG,Xiao MA
    2014, 35(4):  65-73.  doi:10.3969/j.issn.1000-436x.2014.04.008
    Asbtract ( 225 )   HTML ( 4)   PDF (974KB) ( 455 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For multi-channel cognitive radio network (CRN), the inconsistent transmission conditions of common control channel (CCC) and data channels deteriorate the performance of cognitive MAC protocols. Focusing on this problem, a novel channel aware multi-channel cognitive MAC protocol (CAM-MAC) was proposed, which consists of two-level four-way handshaking mechanism. The first level two-way handshaking was optimized to reduce the mean successful reservation time on CCC. The other level two-way handshaking was implemented by a cross-layer approach to adopt the adaptive transmission based on instantaneous SNR on each Nakagami fading data channel to improve the data rate. These mechanisms improve the performance of CAM-MAC. Simulation results validate the throughput of CAM-MAC outper-forms that of the existing one, about 50% improvement in the throughput under certain conditions.

    Eavesdropping against wireless spatial scrambling secure communication: hyperplane clustering
    Lu LIU,Liang JIN,Kai-zhi HUANG,Zhou ZHONG
    2014, 35(4):  74-80.  doi:10.3969/j.issn.1000-436x.2014.04.009
    Asbtract ( 258 )   HTML ( 0)   PDF (1465KB) ( 572 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The existing eavesdropping method has poor anti-noise performance and high complexity, which makes it not practical. It is shown that the received scrambled signals are distributed within parallel hyperplanes if adequate antennas are equipped by eavesdropper. According to this distribution, a hyperplane clustering (HC) algorithm was presented to blindly estimate the hyperplane parameters which reveal the sending information. Simulation results show that the HC algorithm, compared with the existing MUSIC-like algorithms, holds the advantages of better anti-noise performance and lower computing complexity.

    Performance evaluation of TCP congestion control algorithms in fast long distance network
    Guo-dong WANG,Yong-mao REN,Jun LI
    2014, 35(4):  81-90.  doi:10.3969/j.issn.1000-436x.2014.04.010
    Asbtract ( 480 )   HTML ( 11)   PDF (1718KB) ( 713 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the development of high-speed networks, a series of high-speed TCP transport protocols have been pro-posed. Firstly, the improved TCP variants was classified according to their characteristics, and each protocol was given a brief introduction. Then, detailed evaluation and analysis were performed through the simulation and in real network separately. Finally, the shortcomings of these protocols and their future research directions were provided.

    TC2-MAC: an adaptive MAC protocol for wireless sensor network
    Cun-xiang CHEN,Zun-wen HE,Jian-guang JIA,Jing-ming KUANG,Zhong-yu ZHANG,Xiao-bo XU
    2014, 35(4):  91-102.  doi:10.3969/j.issn.1000-436x.2014.04.011
    Asbtract ( 221 )   HTML ( 3)   PDF (1575KB) ( 493 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel adaptive hybrid medium access control (MAC) protocol TC2-MAC has been proposed. The protocol used binary tree based time-slot-block (TSB) allocation strategy and time slot constrained carrier sense multiple access with collision avoidance (CSMA/CA) method to ensure heterogeneous sensor nodes or different types of traffic obtain personalized quality of service (QoS). In addition, it provided flexible information scheduling mechanism to improve fairness of channel access and enhance network efficiency enable. Results show that TC2-MAC has significant adaptabil-ity to the change of network traffic and network topology compared with traditional time division multiple access (TDMA) based MAC.

    Spectrum sharing scheme in cognitive radio networks based on primary limited feedback
    Huan-qin1 GAO,Rong-fang SONG
    2014, 35(4):  103-111.  doi:10.3969/j.issn.1000-436x.2014.04.012
    Asbtract ( 197 )   HTML ( 1)   PDF (1777KB) ( 354 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A spectrum sharing scheme for a pair of secondary users co-existing with multiple primary users was proposed. The primary users exploit the limited feedback of channel quality information (CQI) to allocate their transmission power and rate. By overhearing the limited feedback of primary CQI, the secondary user accessed the channel with proper transmission power and rate while causing interference to the primary users and so the rate loss of the primary system. Under the primary rate loss constraint, the optimal transmit power and transmission rate for the secondary was obtained to maximize the secondary user throughput. Numerical results show that, with only 3 or 4 bits of feedback to each pri-mary user, the effective throughput of the secondary system is comparable to the case with both primary and secondary transmitters having the perfect CQI of the primary link. The simulation results demonstrate that the proposed spectrum sharing scheme can meet the primary rate loss constraint.

    Green virtual topology design algorithm based on constraint-based routing
    Yuan-sheng WU,Bing GUO,Yan SHEN,Ji-he WANG,Xiao-bin LIU
    2014, 35(4):  112-123.  doi:10.3969/j.issn.1000-436x.2014.04.013
    Asbtract ( 223 )   HTML ( 0)   PDF (1364KB) ( 1204 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To reduce the energy consumption of Internet core network, a formulation model for green virtual topology design (GVTD) problem was developed, which employs the following measures: traffic aggregation, network resources allocation on demand, virtual topology design dynamically and multi-granularity sleeping. A heuristic algorithm base on constraint-based routing, namely CBR-GVTD, was proposed, which combines the single-hop and multi-hop routing to establish virtual topology, and makes trade-offs between the network power consumption and routing performance via the constraint-based routing mechanism. The simulation results indicate that CBR-GVTD can achieve at most 62%~90% power saving with very high resource utilization (80%~90% for interface utilization) and excellent routing performance (not more than 5 for maximum routing hops).

    Robust resource allocation algorithm for cognitive radio system
    Yong-jun XU,Xiao-hui ZHAO
    2014, 35(4):  124-129.  doi:10.3969/j.issn.1000-436x.2014.04.014
    Asbtract ( 248 )   HTML ( 2)   PDF (848KB) ( 550 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the underlay cognitive radio networks with multiuser under parameter uncertainties, a robust distributed robust power control algorithm was proposed. This algorithm was formulated to minimize total transmit power of SUs under the interference temperature and SINR constraint. Based on euclidean ball-shaped uncertainty, the robust distrib-uted solution of the optimization problem was obtained by using Lagrange dual decomposition theory. The simulation results illustrate that, compared with the non-robust algorithm and traditional SOCP algorithm, the proposed algorithm achieves a better performance and guarantees the QoS requirement for both SUs and PUs under the parameter uncertainty.

    Adaptive fractional-order Darwinian particle swarm optimization algorithm
    Tong GUO,Ju-long LAN,Yu-feng LI,Shi-wen CHEN
    2014, 35(4):  130-140.  doi:10.3969/j.issn.1000-436x.2014.04.015
    Asbtract ( 298 )   HTML ( 5)   PDF (1102KB) ( 871 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The convergence performance of the fractional-order Darwinian particle swarm optimization (FO-DPSO) al-gorithm depends on the fractional-order α, and it can easily get trapped in the local optima. To overcome such shortcom-ing, an adaptive fractional-order Darwinian particle swarm optimization (AFO-DPSO) algorithm was proposed. In AFO-DPSO, both particle's position and velocity information were utilized adequately, together an adaptive acceleration coefficient control strategy and mutation processing mechanism were introduced for better convergence performance. Testing results on several well-known functions demonstrate that AFO-DPSO substantially enhances the performance in terms of convergence speed, solution accuracy and algorithm stability. Compared with PSO, HPSO, DPSO, APSO, FO-PSO, FO-DPSO and NCPSO, the global optimality of AFO-DPSO are greatly improved.

    Joint channel allocation and power control in femtocell system
    Shi-yao MU,Qi ZHU
    2014, 35(4):  141-147.  doi:10.3969/j.issn.1000-436x.2014.04.016
    Asbtract ( 224 )   HTML ( 3)   PDF (1754KB) ( 201 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A joint channel allocation and power control algorithm was proposed, which used convex optimization method to combine channel allocation and power control and limit the range of interference, subgradient method was used to solve the close formula of power and optimize the capacity of fem network. In addition, the algorithm had connected the optimal of fem network and macro network together, thus macro network's throughput could be maximized. Simulation results prove that system throughput has been greatly improved.

    Novel extended multivariate public key cryptosystem
    Shuai-ting QIAO,Yi-fa LI,Wen-bao HAN
    2014, 35(4):  148-154.  doi:10.3969/j.issn.1000-436x.2014.04.017
    Asbtract ( 188 )   HTML ( 0)   PDF (1377KB) ( 384 )   Knowledge map   
    References | Related Articles | Metrics

    To resist linearization attack and differential attack effectively, a nonlinear invertible transformation based on“tame transformation” was constructed. Incorporated with the Matsumoto-Imai (MI) scheme, a novel extended multivari-ate public key cryptosystem was proposed. Then, according to the proposed scheme, two practical applications including an encryption scheme and a signature scheme were designed respectively. Analysis results demonstrate that the extended cryptosystem inherits the merit of MI, i.e. efficient computation. Meanwhile, the novel extended scheme can also resist linearization attack, differential attack and algebraic attack.

    Overview
    Digital visual media forensics
    Chun-hui FENG,Zheng-quan XU,Xing-hui ZHENG,Li JIANG
    2014, 35(4):  155-165.  doi:10.3969/j.issn.1000-436x.2014.04.018
    Asbtract ( 284 )   HTML ( 6)   PDF (1434KB) ( 643 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The origin and concept of digital visual media forensics is introduced, representative double compression de-tection and forgery detection algorithms are introduced in detail afterwards. On this basis, the relationships between dif-ferent forensic algorithms and existing problems of visual media forensic techniques are discussed. Perspectives of the development of digital visual media forensics are put forward in the end.

    Academic communication
    Ustor: cloud storage system based on regenerating codes
    Qing LIU,Dan FENG,Bai LI
    2014, 35(4):  166-173.  doi:10.3969/j.issn.1000-436x.2014.04.019
    Asbtract ( 312 )   HTML ( 6)   PDF (1496KB) ( 427 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To ensure reliability of user's data, multiple clouds are responsible for storing the data. For purpose of mini-mizing storage cost and repair bandwidth, a method of utilizing functional regenerating codes(FRC) to encode data to several blocks, which are further distributed to different clouds, was proposed. In this way, amount of data downloaded through the network when data loss happens in a single cloud is cut down, and repair cost is cut down as well. This method was successfully applied in a cloud storage system Ustor. Observations can be drawn from the experimental re-sults: first, erasure coding guarantees data reliability, increasing 5%~10% response time compared with non-coding; sec-ond, speed of FRC encode, decode and repair are a little slower than Reed-Solomon(RS) code, and the time gap of en-coding 256MB by two codes is less than 0.5 seconds; third, compared with traditional RS codes, FRC reduces more than 25% data amount needed to download during a repair in the experiment.

    Packet-loss robust scalable authentication algorithm for compressed image streaming
    Xiao-wei YI,Heng-tai MA,Gang ZHENG,Chang-wen ZHENG
    2014, 35(4):  174-181.  doi:10.3969/j.issn.1000-436x.2014.04.020
    Asbtract ( 230 )   HTML ( 0)   PDF (1600KB) ( 388 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on structures and dependencies of the image codestreams, a scalable stream-level authentication ap-proach was proposed to resist packet loss. To construct the authentication algorithm by hash chaining and error-correction coding, the proposed approach can realize optimizing bit-rate allocations and unequal authentication protection. Firstly, the compressed streams of the original image are analyzed to obtain hierarchical structures and coding dependencies. Secondly, in accordance with the differentiation-importance of codestreams to the reconstructed image, sub-important packet is linked to more important packets via hash chains. Finally, these hash values of decoding-independent packets and the digital signature of the whole bitstream are encoded with an error-correction coding algorithm. The proposed scheme has a very low authentication overhead because it signs on the whole image once. Experimental results show that the authenticated image of the proposed scheme has high reconstructed quality than the other three stream-level authenti-cation schemes.

    New efficient network architecture BSN-MOT for parallel processing
    Jiang-yun LI,Li-ting SUN
    2014, 35(4):  182-190.  doi:10.3969/j.issn.1000-436x.2014.04.021
    Asbtract ( 198 )   HTML ( 3)   PDF (13760KB) ( 202 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    BSN-MOT as a two-tier architecture that takes the advantages of both the BSN and the MOT was presented. Topological property and many communication and application algorithms are investigated. The communication algo-rithms include row-tree and column-tree broadcast, one to all broadcast, data sum, matrix multiplication, shortest path rooting and polynomial root finding. In contrast with other two similar tree-based two-tier architectures MMT and OM-ULT, the results show that the algorithms that run on BSN-MOT are much faster, and BSN-MOT is more competitive.

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: