Please wait a minute...

Current Issue

    25 December 2014, Volume 35 Issue 12
    Service customized networking
    2014, 35(12):  1-9. 
    Asbtract ( 1023 )   Knowledge map   
    Related Articles | Metrics
    Today’s Internet faces many challenges, two of which need to be addressed urgently. One is that most bandwidth is taken by OTT services, and the other one is that the content in the Internet is highly redundant. To address these two problems, a novel future Internet architecture, named as service customized networking (SCN), is proposed to provide differentiated services. SCN is designed based on the software-defined networking (SDN) technology. It inherits the two advantages of SDN, that is, separation of control and data plane and programmable networking. Besides, SCN adds the function of network virtualization, and intelligent content scheduling. SCN avoids OTT services taking too much bandwidth through employing the network virtualization technology to provide differentiated services. Besides, SCN effectively eliminates content redundancy by intelligent content scheduling. The results of experiments conducted on a real small-scale testbed indicate that SCN indeed provides differentiated services for different users and largely reduces content redundancy.
    Paper
    Service customized networking
    Yun-jie LIU,Tao HUANG,Jiao ZHANG,Jiang LIU,Hai-peng YAO,Ren-chao XIE
    2014, 35(12):  1-9.  doi:10.3969/j.issn.1000-436x.2014.12.001
    Asbtract ( 540 )   HTML ( 32)   PDF (1010KB) ( 1599 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Today's Internet faces many challenges,two of which need to be addressed urgently.One is that most band-width is taken by OTT services,and the other one is that the content in the Internet is highly redundant.To address these two problems,a novel future Internet architecture,named as service customized networking (SCN),is proposed to pro-vide differentiated services.SCN is designed based on the software-defined networking (SDN) technology.It inherits the two advantages of SDN,that is,separation of control and data plane and programmable networking.Besides,SCN adds the function of network virtualization,and intelligent content scheduling.SCN avoids OTT services taking too much bandwidth through employing the network virtualization technology to provide differentiated services.Besides,SCN ef-fectively eliminates content redundancy by intelligent content scheduling.The results of experiments conducted on a real small-scale testbed indicate that SCN indeed provides differentiated services for different users and largely reduces con-tent redundancy.

    Efficient top-k string similarity query algorithms
    2014, 35(12):  2-20. 
    Asbtract ( 741 )   Knowledge map   
    Related Articles | Metrics
    Computing top-k similar strings based on edit distance, i.e., given a query string σ and string set S, finding k similar strings to σ based on edit distance from S. Firstly, two adaptive filter strategies based on length-skip index are proposed, such that to reduce the times of edit distance computation between two strings. Then the lower bound of edit distance between query string and unmatched string set is proposed, such that to further reduce the times of edit distance computation when processing strings that do not have common signatures with the query string. Finally efficient algorithms to return top-k similar strings are proposed. Experimental results on three real datasets verify the benefits over the state-of-the-art algorithm.
    User interest-aware content replica optimized placement algorithm
    2014, 35(12):  3-27. 
    Asbtract ( 553 )   Knowledge map   
    Related Articles | Metrics
    A user interest-aware content replica optimized placement algorithm (UIARP) is proposed. Firstly, the interest subjects of the user-collective are extracted from their content access logs by clustering algorithms, and according to the weighting of the individual interest degree, their collective interest degree would be got and updated in real time; then under the nonlinear optimization model, replicas of larger collective interest degree have priority to be placed, with the goal of minimizing the average response time, which achieves the maximum match between placing replicas and users’ content demand. This algorithm not only ensures that users get interested replicas quickly, but also improves the system efficiency. From four aspects including average response time, the matching degree of request response, load balancing and the utilization rate of adjacent replicas, using 1-Greedy-Insert or others as compared algorithms, the simulation results show that each metric improves by 30% on average, which verifies the effectiveness of the proposed algorithm.
    Dimension-reduction MUSIC for jointly estimating DOA and polarization using plane polarized arrays
    2014, 35(12):  4-35. 
    Asbtract ( 509 )   Knowledge map   
    Related Articles | Metrics
    Based on the long-vector data modal of polarization sensitive array, a joint estimation of DOA and polarization information algorithm suitable for plane polarized antenna arrays was proposed. Using the condition of partial derivative of spectral function to reduce the dimensionality, the computation significantly was decreased but also guarantees the resolution and estimation accuracy. Simulation results show that the proposed algorithm has better resolution and lower square mean compared to the effective Quaternion-MUSIC algorithm, and reduces computation of estimation.
    Method of overall resource efficiency measure of MIMO wireless communications
    2014, 35(12):  5-44. 
    Asbtract ( 551 )   Knowledge map   
    Related Articles | Metrics
    A general mode of overall resource efficiency measure of communication systems is proposed. Based on it, the specific method of overall resource efficiency measure of multiple input multiple output (MIMO) wireless communication systems is presented. The theory analysis and practice measure results show that although the requirements of the normalized bandwidth and the normalized signal noise ratio (SNR) of MIMO systems are relatively small due to the utilization of the space resource, but the overall resource efficiencies of the existing MIMO systems are low, and the gaps between their performances and their potential capacities are large, when compared to that of the existing communication systems under the basic additive white Gaussian noise (AWGN) channel.
    Coverage repair strategies for wireless sensor networks based on muti-mobile nodes and genetic algorithm
    2014, 35(12):  6-52. 
    Asbtract ( 545 )   Knowledge map   
    Related Articles | Metrics
    A repairing strategy for the coverage of the sensor network based on multi-mobile nodes and path planning is designed. Such mechanism can ultimately repair common nodes in a timely fashion via energy consumption analysis of the nodes by using genetic algorithm to calculate the reasonable moving path of the mobile nodes, which can avoid coverage holes caused by the death of sensor nodes at its best. The global convergence the designed algorithm is proved by stochastic process. Simulation experiments have proven the effectiveness of the designed mechanism and the relevant solution algorithm.
    Flow control random access protocol for event-driven machine-to-machine traffics in LTE network
    2014, 35(12):  7-61. 
    Asbtract ( 529 )   Knowledge map   
    Related Articles | Metrics
    A flow control random access protocol for event-driven machine-to-machine traffics in LTE network is proposed. The beta distribution is adopted to model the event-driven M2M traffics. This protocol uses the random access preamble free ratio in a fixed number of slots to estimate the channel load and calculate the flow control factor to control the flow. The throughput performance of the proposed protocol is modeled and analyzed, and compared with the random access protocol in LTE system. It is shown that the proposed protocol performs much better because it can estimate the system load accurately in most situations and reduce collision by flow control factor.
    Virtual network embedding algorithm based on negotiation in distributed environment
    2014, 35(12):  8-69. 
    Asbtract ( 487 )   Knowledge map   
    Related Articles | Metrics
    The network virtualization is able to offer various customized end-to-end services networks on a shared substrate network. However, the existing virtual network embedding algorithms present many problems in reliability and applicability due to their dependence on a centralized manager node. Hence, a virtual network embedding algorithm in distributed environment is proposed, which implements embedding process by the negotiation of several nodes. Moreover, this algorithm makes improvement in reducing communication cost and length of virtual links. Simulation experiments demonstrate that the proposed algorithm can achieve better performance on efficiency of resources utilization and communication cost.
    Packet-based routing algorithm in DTN based on the intimacy between nodes
    2014, 35(12):  9-77. 
    Asbtract ( 465 )   Knowledge map   
    Related Articles | Metrics
    Through analyzing the moving law of nodes, the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference. Take topological trim according to the weight of edges and dig out groups of nodes which have higher intimacy degree. And also improve the spray and wait routing protocol according to the group of source and destination nodes. Then put forward a packet-based routing algorithm in DTN based on the intimacy between nodes. Simulation result shows that this routing algorithm could effectively increase the delivery ratio and reduce delay.
    Adaptive bandwidth allocation algorithm based on the multi-threshold reservation mechanism
    2014, 35(12):  10-88. 
    Asbtract ( 531 )   Knowledge map   
    Related Articles | Metrics
    An adaptive bandwidth allocation algorithm based on multi-threshold reservation mechanism is proposed to guarantee the quality of service (QoS) of multi-services in heterogeneous wireless networks. With the bandwidth reservation mechanism by setting multi-threshold in each network for every traffic, the adaptive bandwidth allocation scheme according to the transmission rate levels requirements for traffic k and the network status can be formulated as an optimal problem with the constraints of the bandwidth allocation matrix for each traffic and all users based on the multi-homing technology. A procedure of the iterative method is presented to solve the optimal problem of the formulated adaptive bandwidth allocation scheme. The optimized bandwidth allocation matrixes for traffics and for all users are obtained for the real-time network throughput maximization under bandwidth reserving thresholds and network capacity constrains and the bandwidth resource utilization efficiency of heterogeneous wireless network can be increased. Numerical simulation results show that the proposed algorithm can support QoS requiring transmission rate grades, decrease the new call blocking probability, increase the average user access rate and improve the network throughput of the heterogeneous wireless network by 40% to the largest extent.
    Paper
    Efficient top-k string similarity query algorithms
    Zi-yang CHEN,Yu-jun HAN,Xuan WANG,Jun-feng ZHOU
    2014, 35(12):  10-20.  doi:10.3969/j.issn.1000-436x.2014.12.002
    Asbtract ( 204 )   HTML ( 6)   PDF (946KB) ( 1105 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to reduce the times of edit distance computation between two strings.Then the lower bound of edit distance between query string and unmatched string set is proposed,such that to further reduce the times of edit dis-tance computation when processing strings that do not have common signatures with the query string.Finally efficient algorithms to return top-k similar strings are proposed.Experimental results on three real datasets verify the benefits over the state-of-the-art algorithm.

    High capacity cross layer optimization strategy for multi-hop wireless network with interference management
    2014, 35(12):  11-97. 
    Asbtract ( 578 )   Knowledge map   
    Related Articles | Metrics
    A high-throughput cross-layer optimization strategy based on the interference management for the multi-hop multi-base-station wireless network environment was proposed. In the physical layer the successive interference cancellation was used to realize the interference management. In the up layers, first the Voronoi algorithm was used to achieve the zoning, second based on the min-hop algorithm, the initial link allocation and multi-hop routing scheme was established, third optimize the scheme based on the multi-time-slot allocating or multi-hop routing, and at last try to find a better strategy in each iteration. Theoretical analysis shows that the strategy has a polynomial time complexity, and the simulation results show that the entire network throughput has a 2 to 5 fold increase by using interference management.
    Research on greedy reconstruction algorithms of compressed sensing based on variable metric method
    2014, 35(12):  12-105. 
    Asbtract ( 491 )   Knowledge map   
    Related Articles | Metrics
    A variable metric method based gradient pursuit algorithm based on some existing gradient pursuit algorithms was proposed by combining the gradient direction of optimization methods with greedy algorithms. The computational complexity and storage requirements of these algorithms were also analysed and compared. In experimental part, all these algorithms were used to reconstruct one-dimensional audio signal and two-dimensional image signal. Experimental results show that the VMMGP algorithm has the best reconstruction performance among all the gradient pursuit algorithms.
    Grid chaotic attractors based on arc tangent and its secure communication
    2014, 35(12):  13-115. 
    Asbtract ( 557 )   Knowledge map   
    Related Articles | Metrics
    A smooth arc tangent function series approach for creating multi-directional multi-scroll grid chaotic attractors was proposed, including one-directional n-scroll, two-directional n×m-grid scroll, and three-directional n×m×l-grid scroll chaotic attractors. The chotic properties were studied by equilibrium points analysis, numerical simulation, Lyapunov exponents spectrum, bifurcation diagrams and Poincaré section diagrams. Synchronize the two grid multi-scroll chaotic systems with same structure by designing simple linear feedback control lows, which is applied to secure communication. The effectiveness of this method has been verified by simple analysis and numerical simulation.
    Distributed nearneighbor search algorithm based on real-time traffic information in dynamic road network
    2014, 35(12):  14-123. 
    Asbtract ( 513 )   Knowledge map   
    Related Articles | Metrics
    A novel distributed near neighbor search algorithm that makes use of real-time traffic information is presented. The geographic information are stored in the nearest smart camera using Voronoi partition, and cameras are located in the intersection. The intersection unimpeded degree is modeled and the time which vehicle travel between adjacent intersections is estimated. When a vehicle search for some near neighbors, smart cameras set a delay to broadcast the near neighbor search packet based on the traffic parameters collected by smart camera networks. In this way, the near neighbor search packet can be transmitted according to current road conditions. Thus get the path to near targets quickly and effectively. Extensive experiments are londucted on real data sets, and the results show that proposed algorithm is efficient and scalable to large number of concurrent query, significantly outperforming state-of-the-art methods.
    User role analysis method based on directed topological potential
    2014, 35(12):  15-135. 
    Asbtract ( 526 )   Knowledge map   
    Related Articles | Metrics
    The majority of real-world networks are directed, weighted and dynamic. Aiming at the problem of node role analysis in directed weighted network, a novel node role analysis method based on directed topological potential is proposed, which can divide nodes into four roles based on their behavior pattern and local influence. Then, a node role-based dynamic networks evolution analysis method is introduced, which can model the dynamics of behavioral roles representing the main connectivity patterns over time and detect the significant event. The experiment results indicate that proposed approaches can effectively estimate the node role and detect the dynamics of network evolution.
    Comprehensive trust evaluation model in social networks
    2014, 35(12):  16-143. 
    Asbtract ( 538 )   Knowledge map   
    Related Articles | Metrics
    A method was proposed to evaluate the user’s attitude from the interaction experience and deduce the user’s behavior pattern by employing the interactive time series. Further, a new trust evaluation model was constructed by considering the following features: the user’s attitude, the interaction experience and the behavior pattern. The experiment results show that the presented model can be adapted to dynamic and complex social networks, and can efficiently quantify the influence on the trust of three kinds of information, and enhance the availability and accuracy of direct trust evaluation model in social networks.
    Method for trust analysis of exchange process behavior based on noninterference
    2014, 35(12):  17-152. 
    Asbtract ( 433 )   Knowledge map   
    Related Articles | Metrics
    Aiming at the problem of dynamic data security exchange behavior cannot be controlled, methods for trusted analysis of exchange process behavior based on noninterference are proposed. First, the exchange behavior model is formalized from the perspective of the exchange process. Then, the exchange behavior trust constraint rules, exchange behavior trust judgment theorem and security proof are given in different stages and different mode. Finally, a concrete application example shows the availability of the method.
    Halftone image watermarking with block-directed parity-matched error diffusion
    2014, 35(12):  18-161. 
    Asbtract ( 489 )   Knowledge map   
    Related Articles | Metrics
    A robust halftone image watermarking method was proposed. The method was developed in parity domain based on pixel block. Especially, the parity sum of a pixel block was defined by comparing the average of the pixel block with an image-dependent threshold. By altering the pixel block’s parity based on noise-balanced block error diffusion, watermark was spread into the host image. Watermark was retrieved by employing each pixel block’s parity and majority voting strategy, not referring to the original image. Compared with the state-of-the-art method in parity domain, the results indicate that the proposed method has high watermark rate and watermark rate flexibility. Moreover, it is capable of extracting watermark directly from the attacked watermarked image without quantizing it into a halftone image. And it can achieve high robustness against common attacks and print-and-scan attack of different types of printers and scanners.
    Performance analysis of incremental cooperative relaying system over composite multipath/shadowing fading channels
    2014, 35(12):  19-167. 
    Asbtract ( 421 )   Knowledge map   
    Related Articles | Metrics
    Since the performance metrics of digital communication systems over composite multipath/lognormal fading channels is intractable, a mixture Gamma (MG) fading model is used to approximate Nakagami-lognormal (NL) fading model. By using MG fading channel model, some exact closed-form expressions of the average error rate and outage probability for incremental cooperative relaying system are obtained, respectively, where per hop is independent and non-identically distributed. Finally, numerical and simulation results are shown to verify the accuracy of the analytical results. These results show that it is helpful to approximate the composite NL distribution by using the MG distribution in the performance analysis of cooperative relaying systems.
    Survey of privacy preserving data queries in cloud computing
    2014, 35(12):  20-177. 
    Asbtract ( 865 )   Knowledge map   
    Related Articles | Metrics
    Driven by resource sharing, public clouds will become the national infrastructure like electricity grids and the Internet. A core issue in public cloud computing is privacy. It is crucial for public clouds to provide necessary services while protecting data privacy. Existing work on data privacy from the perspectives of privacy preserving computation was survied, integrity verification of public cloud computing results, public cloud data access control, and hardware security in cloud computing. Existing work is analyzed and future research directions for public cloud privacy is discussed.
    Structure and performance analysis of binary differential stochastic process shift keying
    2014, 35(12):  21-189. 
    Asbtract ( 475 )   Knowledge map   
    Related Articles | Metrics
    A novel modulation and demodulation structure based on binary differential stochastic process shift keying (BDSPSK) is proposed. The theoretical bit error rates (BER) under the Gaussian and quasi-static Rayleigh fading channels are derived, respectively. To verify its performances and security, lots of simulations are done by using MATLAB. The simulations’ results show that the BER of the proposed BDSPSK can reach 10?4 when signal to noise ratio (SNR) is about ?2 dB in the Gaussian channel or 25 dB in the Rayleigh fading channel. Meanwhile, the proposed method has a good concealment due to its undetectable property by the generalized second order cyclostationary spectrum, which makes it suit for secure communi-cations in the physical layer.
    Paper
    User interest-aware content replica optimized placement algorithm
    Xiao-long YANG,Xin-xin WANG,Min ZHANG,Ke-ping LONG,Qiong HUANG
    2014, 35(12):  21-27.  doi:10.3969/j.issn.1000-436x.2014.12.003
    Asbtract ( 157 )   HTML ( 3)   PDF (807KB) ( 288 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A user interest-aware content replica optimized placement algorithm (UIARP) is proposed.Firstly,the interest subjects of the user-collective are extracted from their content access logs by clustering algorithms,and according to the weighting of the individual interest degree,their collective interest degree would be got and updated in real time; then under the nonlinear optimization model,replicas of larger collective interest degree have priority to be placed,with the goal of minimizing the average response time,which achieves the maximum match between placing replicas and users’ content demand.This algorithm not only ensures that users get interested replicas quickly,but also improves the system efficiency.From four aspects including average response time,the matching degree of request response,load balancing and the utilization rate of adjacent replicas,using 1-Greedy-Insert or others as compared algorithms,the simulation re-sults show that each metric improves by 30% on average,which verifies the effectiveness of the proposed algorithm.

    2-D honeycomb MI wave communication system
    2014, 35(12):  22-195. 
    Asbtract ( 505 )   Knowledge map   
    Related Articles | Metrics
    To realize the high reliable communication and the wireless power transmission in the wireless underground sensor network, a new type of 2D honeycomb magneto-inductivenetwork was put forward at VLF band. The system model was established, and bandwidth, group velocity and beam forming technologies were researched based on the current dispersion equations. Simulation with Runge-Kutta method was carried out to verify the efficiency of the network. The result show that the omnidirectional propagation can be realized in the proposed honeycomb network with more balanced bandwidth and group velocity in every direction compared with the square lattice structure. Directional communication can also be realized based on the cooperative multi-antenna technology. The proposed honeycomb magneto-inductive network is very suitable to build wireless sensor networks with high connectivity and power efficiency in the underground environments.
    Large-scale duplicate image retrieval technical research for the internet
    2014, 35(12):  23-202. 
    Asbtract ( 485 )   Knowledge map   
    Related Articles | Metrics
    For the typical social media application on the internet, a large-scale distributed duplicate image retrieval approach based on random projection and the block DCT coefficients was proposed. On the basis of Hadoop, this approach exploited image signatures generated by random projection mapping to retrieve HBase efficiently. And candidate images with high-recall were achieved. Then in order to improve the retrieval precision, the block DCT coefficients were used to further filter candidate images. For 12 million images, experimental results showed that with our approach the recall ratio reached 98%, the precision ratio reached 93.2%, and the average retrieval time was 6.7s when H=2 and T=150.
    Research on data loss probability and its impact of CTCS-3 train ground communication based on GSM-R
    2014, 35(12):  24-209. 
    Asbtract ( 477 )   Knowledge map   
    Related Articles | Metrics
    In order to solve the problem that Euroradio’s safe functional module (SFM) of CTCS-3 train control system can not apply protective measures for time-related transmission risks, communication model and failure recovery model for transmission of CTCS-3 train control system are built which based on deterministic and stochastic Petri nets (DSPN). Combining the two models and using TimeNET 4.0 to simulate the result of data loss probability, a conclusion can be concluded that even considering that only data loss will cause dangerous of train control system, the result still can not meet the requirement of SIL4 based on the relevant specification for the CTCS-3.
    Design and implementation of wireless multimedia sensor network node based on DSP and binocular vision
    2014, 35(12):  25-216. 
    Asbtract ( 512 )   Knowledge map   
    Related Articles | Metrics
    In order to meet the requirement of multimedia information acquisition in wireless sensor network, a new wireless multimedia sensor node is designed and implemented with the high-performance DSP processor as the core. ZigBee module is used to implement the wireless communication. In virtue of the powerful computing ability and peripheral interfaces of DSP processor, the multimedia node owns binocular vision and various sensors such as accelerometer. Therefore, it can attain the real-time perception of environmental information and acquire image/video data. Based on the ZigBee protocol, the sensor is able to fulfill short-distance wireless communication and monitoring duty in indoor environment. Experimental results show that the multimedia sensor node designed can accurately obtain and handle the synthetical sensing data in real time. It is suitable for the application of wireless multimedia sensor network.
    Paper
    Dimension-reduction MUSIC for jointly estimating DOA and polarization using plane polarized arrays
    Wei-jian SI,Tong ZHU,Meng-ying ZHANG
    2014, 35(12):  28-35.  doi:10.3969/j.issn.1000-436x.2014.12.004
    Asbtract ( 354 )   HTML ( 7)   PDF (2081KB) ( 585 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the long-vector data modal of polarization sensitive array,a joint estimation of DOA and polarization information algorithm suitable for plane polarized antenna arrays was proposed.Using the condition of partial derivative of spectral function to reduce the dimensionality,the computation significantly was decreased but also guarantees the resolution and estimation accuracy.Simulation results show that the proposed algorithm has better resolution and lower square mean compared to the effective Quaternion-MUSIC algorithm,and reduces computation of estimation.

    Method of overall resource efficiency measure of MIMO wireless communications
    Jin-zhu LIU,Lian-feng SHEN
    2014, 35(12):  36-44.  doi:10.3969/j.issn.1000-436x.2014.12.005
    Asbtract ( 209 )   HTML ( 0)   PDF (831KB) ( 594 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A general mode of overall resource efficiency measure of communication systems is proposed.Based on it,the specific method of overall resource efficiency measure of multiple input multiple output (MIMO) wireless communica-tion systems is presented.The theory analysis and practice measure results show that although the requirements of the normalized bandwidth and the normalized signal noise ratio (SNR) of MIMO systems are relatively small due to the utilization of the space resource,but the overall resource efficiencies of the existing MIMO systems are low,and the gaps between their performances and their potential capacities are large,when compared to that of the existing communication systems under the basic additive white Gaussian noise (AWGN) channel.

    Coverage repair strategies for wireless sensor networks based on muti-mobile nodes and genetic algorithm
    Miao YE,Yu-ping WANG,Jing-xuan WEI
    2014, 35(12):  45-52.  doi:10.3969/j.issn.1000-436x.2014.12.006
    Asbtract ( 249 )   HTML ( 1)   PDF (1556KB) ( 520 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A repairing strategy for the coverage of the sensor network based on multi-mobile nodes and path planning is designed.Such mechanism can ultimately repair common nodes in a timely fashion via energy consumption analysis of the nodes by using genetic algorithm to calculate the reasonable moving path of the mobile nodes,which can avoid cov-erage holes caused by the death of sensor nodes at its best.The global convergence the designed algorithm is proved by stochastic process.Simulation experiments have proven the effectiveness of the designed mechanism and the relevant solution algorithm.

    Flow control random access protocol for event-driven machine-to-machine traffics in LTE network
    Liu YANG,Ping-zhi FAN,Li HAO
    2014, 35(12):  53-61.  doi:10.3969/j.issn.1000-436x.2014.12.007
    Asbtract ( 261 )   HTML ( 6)   PDF (859KB) ( 661 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A flow control random access protocol for event-driven machine-to-machine traffics in LTE network is pro-posed.The beta distribution is adopted to model the event-driven M2M traffics.This protocol uses the random access preamble free ratio in a fixed number of slots to estimate the channel load and calculate the flow control factor to control the flow.The throughput performance of the proposed protocol is modeled and analyzed,and compared with the random access protocol in LTE system.It is shown that the proposed protocol performs much better because it can estimate the system load accurately in most situations and reduce collision by flow control factor.

    Virtual network embedding algorithm based on negotiation in distributed environment
    Yi-ming JIANG,Ju-long LAN,Dong-nian CHENG,Fang-ming WU
    2014, 35(12):  62-69.  doi:10.3969/j.issn.1000-436x.2014.12.008
    Asbtract ( 216 )   HTML ( 1)   PDF (676KB) ( 483 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The network virtualization is able to offer various customized end-to-end services networks on a shared sub-strate network.However,the existing virtual network embedding algorithms present many problems in reliability and ap-plicability due to their dependence on a centralized manager node.Hence,a virtual network embedding algorithm in dis-tributed environment is proposed,which implements embedding process by the negotiation of several nodes.Moreover,this algorithm makes improvement in reducing communication cost and length of virtual links.Simulation experiments demonstrate that the proposed algorithm can achieve better performance on efficiency of resources utilization and com-munication cost.

    Packet-based routing algorithm in DTN based on the intimacy between nodes
    En WANG,Yong-jian YANG,Wei-dan ZHAO,Lin-lu LIU
    2014, 35(12):  70-77.  doi:10.3969/j.issn.1000-436x.2014.12.009
    Asbtract ( 229 )   HTML ( 2)   PDF (717KB) ( 295 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Through analyzing the moving law of nodes,the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference.Take topological trim according to the weight of edges and dig out groups of nodes which have higher inti-macy degree.And also improve the spray and wait routing protocol according to the group of source and destination nodes.Then put forward a packet-based routing algorithm in DTN based on the intimacy between nodes.Simulation result shows that this routing algorithm could effectively increase the delivery ratio and reduce delay.

    Adaptive bandwidth allocation algorithm based on the multi-threshold reservation mechanism
    Geng CHEN,Wei-wei XIA,Lian-feng SHEN
    2014, 35(12):  78-88.  doi:10.3969/j.issn.1000-436x.2014.12.010
    Asbtract ( 265 )   HTML ( 3)   PDF (1575KB) ( 457 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An adaptive bandwidth allocation algorithm based on multi-threshold reservation mechanism is proposed to guarantee the quality of service (QoS) of multi-services in heterogeneous wireless networks.With the bandwidth reserva-tion mechanism by setting multi-threshold in each network for every traffic,the adaptive bandwidth allocation scheme according to the transmission rate levels requirements for traffic k and the network status can be formulated as an optimal problem with the constraints of the bandwidth allocation matrix for each traffic and all users based on the multi-homing technology.A procedure of the iterative method is presented to solve the optimal problem of the formulated adaptive bandwidth allocation scheme.The optimized bandwidth allocation matrixes for traffics and for all users are obtained for the real-time network throughput maximization under bandwidth reserving thresholds and network capacity constrains and the bandwidth resource utilization efficiency of heterogeneous wireless network can be increased.Numerical simula-tion results show that the proposed algorithm can support QoS requiring transmission rate grades,decrease the new call blocking probability,increase the average user access rate and improve the network throughput of the heterogeneous wireless network by 40% to the largest extent.

    High capacity cross layer optimization strategy for multi-hop wireless network with interference management
    Lei SHI,Jiang-hong HAN,Yi SHI,Zhen-chun WEI
    2014, 35(12):  89-97.  doi:10.3969/j.issn.1000-436x.2014.12.011
    Asbtract ( 221 )   HTML ( 0)   PDF (1090KB) ( 414 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A high-throughput cross-layer optimization strategy based on the interference management for the multi-hop multi-base-station wireless network environment was proposed.In the physical layer the successive interference cancella-tion was used to realize the interference management.In the up layers,first the Voronoi algorithm was used to achieve the zoning,second based on the min-hop algorithm,the initial link allocation and multi-hop routing scheme was established,third optimize the scheme based on the multi-time-slot allocating or multi-hop routing,and at last try to find a better strategy in each iteration.Theoretical analysis shows that the strategy has a polynomial time complexity,and the simula-tion results show that the entire network throughput has a 2 to 5 fold increase by using interference management.

    Research on greedy reconstruction algorithms of compressed sensing based on variable metric method
    Pan-pan LIU,Lei LI,Hao-yu WNAG
    2014, 35(12):  98-105.  doi:10.3969/j.issn.1000-436x.2014.12.012
    Asbtract ( 220 )   HTML ( 0)   PDF (2256KB) ( 546 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A variable metric method based gradient pursuit algorithm based on some existing gradient pursuit algorithms was proposed by combining the gradient direction of optimization methods with greedy algorithms.The computational complexity and storage requirements of these algorithms were also analysed and compared.In experimental part,all these algorithms were used to reconstruct one-dimensional audio signal and two-dimensional image signal.Experimental results show that the VMMGP algorithm has the best reconstruction performance among all the gradient pursuit algorithms.

    Grid chaotic attractors based on arc tangent and its secure communication
    Xue-zhi MAO,Yong XU,Jian-ping LIU,Hui-quan MA
    2014, 35(12):  106-115.  doi:10.3969/j.issn.1000-436x.2014.12.013
    Asbtract ( 263 )   HTML ( 3)   PDF (3070KB) ( 494 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A smooth arc tangent function series approach for creating multi-directional multi-scroll grid chaotic attractors was proposed,including one-directional n-scroll,two-directional n×m-grid scroll,and three-directional n×m×l-grid scroll chaotic attractors.The chotic properties were studied by equilibrium points analysis,numerical simulation,Lyapunov exponents spectrum,bifurcation diagrams and Poincaré section diagrams.Synchronize the two grid multi-scroll chaotic systems with same structure by designing simple linear feedback control lows,which is applied to secure communication.The effectiveness of this method has been verified by simple analysis and numerical simulation.

    Distributed nearneighbor search algorithm based on real-time traffic information in dynamic road network
    Chen YE,Zhen-yu YANG,Jian YU,Qi LONG
    2014, 35(12):  116-123.  doi:10.3969/j.issn.1000-436x.2014.12.014
    Asbtract ( 184 )   HTML ( 2)   PDF (1945KB) ( 550 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel distributed near neighbor search algorithm that makes use of real-time traffic information is presented.The geographic information are stored in the nearest smart camera using Voronoi partition,and cameras are located in the intersection.The intersection unimpeded degree is modeled and the time which vehicle travel between adjacent intersec-tions is estimated.When a vehicle search for some near neighbors,smart cameras set a delay to broadcast the near neighbor search packet based on the traffic parameters collected by smart camera networks.In this way,the near neighbor search packet can be transmitted according to current road conditions.Thus get the path to near targets quickly and effec-tively.Extensive experiments are londucted on real data sets,and the results show that proposed algorithm is efficient and scalable to large number of concurrent query,significantly outperforming state-of-the-art methods.

    User role analysis method based on directed topological potential
    Song-qing DUAN,Xing-long YU,Bin WU,Bai WANG
    2014, 35(12):  124-135.  doi:10.3969/j.issn.1000-436x.2014.12.015
    Asbtract ( 187 )   HTML ( 1)   PDF (3279KB) ( 627 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The majority of real-world networks are directed,weighted and dynamic.Aiming at the problem of node role analysis in directed weighted network,a novel node role analysis method based on directed topological potential is pro-posed,which can divide nodes into four roles based on their behavior pattern and local influence.Then,a node role-based dynamic networks evolution analysis method is introduced,which can model the dynamics of behavioral roles represent-ing the main connectivity patterns over time and detect the significant event.The experiment results indicate that pro-posed approaches can effectively estimate the node role and detect the dynamics of network evolution.

    Comprehensive trust evaluation model in social networks
    Xian-jia MENG,Jian-feng MA,Di LU,Yi-chuan WANG
    2014, 35(12):  136-143.  doi:10.3969/j.issn.1000-436x.2014.12.016
    Asbtract ( 265 )   HTML ( 7)   PDF (688KB) ( 854 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A method was proposed to evaluate the user's attitude from the interaction experience and deduce the user's behavior pattern by employing the interactive time series.Further,a new trust evaluation model was constructed by con-sidering the following features:the user's attitude,the interaction experience and the behavior pattern.The experiment results show that the presented model can be adapted to dynamic and complex social networks,and can efficiently quan-tify the influence on the trust of three kinds of information,and enhance the availability and accuracy of direct trust evaluation model in social networks.

    Method for trust analysis of exchange process behavior based on noninterference
    Yi SUN,Xing-yuan CHEN,Xue-hui DU,Cheng LEI
    2014, 35(12):  144-152.  doi:10.3969/j.issn.1000-436x.2014.12.017
    Asbtract ( 204 )   HTML ( 1)   PDF (1921KB) ( 310 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of dynamic data security exchange behavior cannot be controlled,methods for trusted analysis of exchange process behavior based on noninterference are proposed.First,the exchange behavior model is for-malized from the perspective of the exchange process.Then,the exchange behavior trust constraint rules,exchange be-havior trust judgment theorem and security proof are given in different stages and different mode.Finally,a concrete ap-plication example shows the availability of the method.

    Halftone image watermarking with block-directed parity-matched error diffusion
    Kun XIE,Hai-hong ZHENG,Ping ZENG,Tao GUO
    2014, 35(12):  153-161.  doi:10.3969/j.issn.1000-436x.2014.12.018
    Asbtract ( 233 )   HTML ( 5)   PDF (1934KB) ( 275 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A robust halftone image watermarking method was proposed.The method was developed in parity domain based on pixel block.Especially,the parity sum of a pixel block was defined by comparing the average of the pixel block with an image-dependent threshold.By altering the pixel block's parity based on noise-balanced block error diffusion,watermark was spread into the host image.Watermark was retrieved by employing each pixel block's parity and majority voting strategy,not referring to the original image.Compared with the state-of-the-art method in parity domain,the re-sults indicate that the proposed method has high watermark rate and watermark rate flexibility.Moreover,it is capable of extracting watermark directly from the attacked watermarked image without quantizing it into a halftone image.And it can achieve high robustness against common attacks and print-and-scan attack of different types of printers and scanners.

    Performance analysis of incremental cooperative relaying system over composite multipath/shadowing fading channels
    HENGWei-jun CHENG,Yan HUANG
    2014, 35(12):  162-167.  doi:10.3969/j.issn.1000-436x.2014.12.019
    Asbtract ( 255 )   HTML ( 0)   PDF (993KB) ( 197 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Since the performance metrics of digital communication systems over composite multipath/lognormal fading channels is intractable,a mixture Gamma (MG) fading model is used to approximate Nakagami-lognormal (NL) fading model.By using MG fading channel model,some exact closed-form expressions of the average error rate and outage probability for incremental cooperative relaying system are obtained,respectively,where per hop is independent and non-identically distributed.Finally,numerical and simulation results are shown to verify the accuracy of the analytical results.These results show that it is helpful to approximate the composite NL distribution by using the MG distribution in the performance analysis of cooperative relaying systems.

    Comprehensive Review
    Survey of privacy preserving data queries in cloud computing
    Ren-yi XIAO
    2014, 35(12):  168-177.  doi:10.3969/j.issn.1000-436x.2014.12.020
    Asbtract ( 347 )   HTML ( 21)   PDF (548KB) ( 1698 )   Knowledge map   
    References | Related Articles | Metrics

    Driven by resource sharing,public clouds will become the national infrastructure like electricity grids and the Internet.A core issue in public cloud computing is privacy.It is crucial for public clouds to provide necessary services while protecting data privacy.Existing work on data privacy from the perspectives of privacy preserving computation was survied,integrity verification of public cloud computing results,public cloud data access control,and hardware secu-rity in cloud computing.Existing work is analyzed and future research directions for public cloud privacy is discussed.

    Correspondences
    Structure and performance analysis of binary differential stochastic process shift keying
    Zhi-jiang XU,Xiao LING,Kang WANG,Li-min MENG
    2014, 35(12):  178-189.  doi:10.3969/j.issn.1000-436x.2014.12.021
    Asbtract ( 223 )   HTML ( 1)   PDF (2091KB) ( 290 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel modulation and demodulation structure based on binary differential stochastic process shift keying (BDSPSK) is proposed.The theoretical bit error rates (BER) under the Gaussian and quasi-static Rayleigh fading chan-nels are derived,respectively.To verify its performances and security,lots of simulations are done by using MATLAB.The simulations' results show that the BER of the proposed BDSPSK can reach 10?4when signal to noise ratio (SNR) is about ?2 dB in the Gaussian channel or 25 dB in the Rayleigh fading channel.Meanwhile,the proposed method has a good concealment due to its undetectable property by the generalized second order cyclostationary spectrum,which makes it suit for secure communications in the physical layer.

    2-D honeycomb MI wave communication system
    Feng LIU,Zhi-jun ZHANG,Xiao-tong ZHANG,Jin-wu XU
    2014, 35(12):  190-195.  doi:10.3969/j.issn.1000-436x.2014.12.022
    Asbtract ( 187 )   HTML ( 0)   PDF (1353KB) ( 367 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To realize the high reliable communication and the wireless power transmission in the wireless underground sensor network,a new type of 2D honeycomb magneto-inductivenetwork was put forward at VLF band.The system model was established,and bandwidth,group velocity and beam forming technologies were researched based on the cur-rent dispersion equations.Simulation with Runge-Kutta method was carried out to verify the efficiency of the network.The result show that the omnidirectional propagation can be realized in the proposed honeycomb network with more bal-anced bandwidth and group velocity in every direction compared with the square lattice structure.Directional communi-cation can also be realized based on the cooperative multi-antenna technology.The proposed honeycomb mag-neto-inductive network is very suitable to build wireless sensor networks with high connectivity and power efficiency in the underground environments.

    Large-scale duplicate image retrieval technical research for the internet
    Shu-peng WANG,Ming CHEN,Guang-jun WU
    2014, 35(12):  196-202.  doi:10.3969/j.issn.1000-436x.2014.12.023
    Asbtract ( 228 )   HTML ( 1)   PDF (799KB) ( 423 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the typical social media application on the internet,a large-scale distributed duplicate image retrieval ap-proach based on random projection and the block DCT coefficients was proposed.On the basis of Hadoop,this approach exploited image signatures generated by random projection mapping to retrieve HBase efficiently.And candidate images with high-recall were achieved.Then in order to improve the retrieval precision,the block DCT coefficients were used to further filter candidate images.For 12 million images,experimental results showed that with our approach the recall ratio reached 98%,the precision ratio reached 93.2%,and the average retrieval time was 6.7s when H=2 and T=150.

    Research on data loss probability and its impact of CTCS-3 train ground communication based on GSM-R
    Xia ZHANG,Lian-chuan MA,Yuan CAO,Yu-zhuo ZHANG
    2014, 35(12):  203-209.  doi:10.3969/j.issn.1000-436x.2014.12.024
    Asbtract ( 199 )   HTML ( 0)   PDF (472KB) ( 696 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve the problem that Euroradio's safe functional module (SFM) of CTCS-3 train control system can not apply protective measures for time-related transmission risks,communication model and failure recovery model for transmission of CTCS-3 train control system are built which based on deterministic and stochastic Petri nets (DSPN).Combining the two models and using TimeNET 4.0 to simulate the result of data loss probability,a conclusion can be concluded that even considering that only data loss will cause dangerous of train control system,the result still can not meet the requirement of SIL4 based on the relevant specification for the CTCS-3.

    Design and implementation of wireless multimedia sensor network node based on DSP and binocular vision
    Yun-zhou ZHANG,Pei JIANG,Liang GAO,Li-qiang LI
    2014, 35(12):  210-216.  doi:10.3969/j.issn.1000-436x.2014.12.025
    Asbtract ( 194 )   HTML ( 0)   PDF (524KB) ( 526 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to meet the requirement of multimedia information acquisition in wireless sensor network,a new wire-less multimedia sensor node is designed and implemented with the high-performance DSP processor as the core.ZigBee module is used to implement the wireless communication.In virtue of the powerful computing ability and peripheral in-terfaces of DSP processor,the multimedia node owns binocular vision and various sensors such as accelerometer.There-fore,it can attain the real-time perception of environmental information and acquire image/video data.Based on the Zig-Bee protocol,the sensor is able to fulfill short-distance wireless communication and monitoring duty in indoor environ-ment.Experimental results show that the multimedia sensor node designed can accurately obtain and handle the syntheti-cal sensing data in real time.It is suitable for the application of wireless multimedia sensor network.

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: