Loading...

Table of Content

    26 November 2010, Volume 28 Issue 6
    Communication Engineering
    Load Balancing Energy Efficient Clustering for Wireless Sensor Networks
    LEI Lei1;2, XUE Xiao-long1, ZHOU Jin-hua1, XU Zong-ze1
    2010, 28(6):  551-561.  doi:10.3969/j.issn.0255-8297.2010.06.001
    Asbtract ( 1933 )   PDF (859KB) ( 1808 )  
    Related Articles | Metrics

    In this paper, the load balancing problem in clustering wireless sensor networks (WSN) is investigated, and an energy efficient clustering algorithm for achieving load balancing in WSN presented. The proposed algorithm computes optimal network cluster numbers based on the network model, and adjusts the range of the cluster by coordinating the communication range of the node. The nodes select cluster headers in a distributed and iterative manner to form an appropriate architecture of the network topology. In simulations under different network conditions, performance of the algorithm is compared with two typical clusering algorithms of WSN, LEACH and HEED. The results show that the proposed algorithm performs better than the other two algorithms, and can effectively balance the load of nodes. Thus it reduces energy consumption of the nodes and prolongs the network’s lifespan.

    Parallel Multi-user Detection with Adaptive Weighting for STBC-OFDM Systems
    LIN Jing, GAN Liang-cai
    2010, 28(6):  561-566.  doi:10.3969/j.issn.0255-8297.2010.06.002
    Asbtract ( 1758 )   PDF (754KB) ( 1812 )  
    Related Articles | Metrics

    By exchanging information between Turbo decoding and multi-user detector, an iterative algorithm for adaptive weighting parallel multi-user detection is proposed. The method is applied to space time block coded orthogonal frequency division multiplexing (STBC-OFDM) systems. Multi-user signals are separated using the algorithm, and the obtained soft bit information is used as the prior information for Turbo decoding. The extrinsic information obtained in Turbo decoding is then used as a priori information for weighting coefficients in the next iteration of adaptive weighting multi-user detection. Simulation results show that the proposed method converges rapidly in space time block coded OFDM systems. Compared with adaptive partial parallel multi-user detection, trail-and-error multi-user detection, and the conventional parallel interference cancellation multi-user detection, the proposed technique offers gains of 1.8 dB, 2.5 dB and 3.0 dB respectively.

    Load Balancing by Dividing IP Flow over Heterogeneous Wireless Networks
    2010, 28(6):  567-572.  doi:10.3969/j.issn.0255-8297.2010.06.003
    Asbtract ( 1726 )   PDF (865KB) ( 2198 )  
    Related Articles | Metrics

    Abstract: As the traffic blocking probability of traditional hard load balancing methods is generally high over heterogeneous wireless networks, we propose a load balancing algorithm based on dividing the IP flow (LBD) over heterogeneous wireless networks based on the idea of soft load balancing. Through numerical analysis, we obtain the optimal flow-dividing ratio to determine the volume of traffic delivered to each network, which
    maintains network load balance. Simulation results show that the proposed method outperforms traditional hard load balancing techniques in terms of traffic blocking and packet loss probabilities.

    Performance of Vertical Handoff Decision Algorithm based on Hysteretic Levels
    XIE Sheng-dong
    2010, 28(6):  573-579.  doi:10.3969/j.issn.0255-8297.2010.06
    Asbtract ( 1718 )   PDF (637KB) ( 1254 )  
    Related Articles | Metrics

     The handoff probability of a node depends on all the states before current moment, and considering all the states is impossible. So traditional analysis method only take the states of the previous moment into consideration, which results in large errors. A vertical handoff algorithm based on hysteretic levels of received signal strength and distance is proposed in heterogeneous networks which are composed of cellular network and wireless local area network. A two-tracking method is also proposed for analyzing the algorithm performance, which resolves the deficiencies in tradition methods. We justify the analysis effects of the new method from the number of handoffs and the block probability. Simulation results show that they are coincided with the analysis results.

    Channel Selection Based on EWA Game Abstraction in Cognitive Radio Network
    FENG Wen-jiang, ZHOU Chao, JIANG Wei-heng
    2010, 28(6):  580-584.  doi:10.3969/j.issn.0255-8297.2010.06.005
    Asbtract ( 1797 )   PDF (683KB) ( 1483 )  
    Related Articles | Metrics

    A priority table of available channels in a network is structured by analyzing channel availability with cooperative spectrum sensing. Using this table, a channel selection learning algorithm based on the experience-weight attraction (EWA) game learning is proposed. Simulations are carried out to compare the learning automata-based algorithm with no-regret learning algorithm. The results show that, by learning historical experience, the algorithm can select channels with the best availability for cognitive users, increase the effective system throughput, and have better equity in resource allocation.

    Dynamic Load Balancing and Stability Analysis for 3G Network Security Management
    HUANG Jie, HUANG Bei, HUANG Qiu-cen
    2010, 28(6):  585-591.  doi:10.3969/j.issn.0255-8297.2010.06.006
    Asbtract ( 1723 )   PDF (714KB) ( 1414 )  
    Related Articles | Metrics

    To deal with massive data produced by the 3G network security management system, a load balancing algorithm is developed. Base on Hayat’s dynamic load balancing model for a distributed system, a stochastic load-transfer delay model is proposed using selective load allocation. The optimal value of the load balancing gain is given via simulation. Stability of the load balancing method is a key issue in parallel computation.
    Unstable behaviors can greatly influence the performance. By analyzing stability of the improved algorithm using the control theory and the related techniques, a formula for the percentage of excessive load is revised to satisfy the demand of 3G-network security management.

    Signal and Information Processing
    Images Steganography against Blind Detection Using Integer Wavelet Transform
    TAO Ran, ZHANG Tao, LI Wen-xiang, ZHENG Er-gong, PING Xi-jian
    2010, 28(6):  592-600.  doi:10.3969/j.issn.0255-8297.2010.06.007
    Asbtract ( 1817 )   PDF (3079KB) ( 1631 )  
    Related Articles | Metrics

    Abstract: Based on the principle of blind detection techniques, a data hiding scheme that modifies high frequency integer-wavelet coefficients is proposed. Coefficients of a subband above a wavelet denoising threshold are chosen for data embedding. To preserve the histogram of wavelet coefficients, an adjustment strategy is introduced around the threshold. Since most blind detection methods select classification features according to
    differences of statistical distributions between the cover and stego images, the proposed method can resist blind detection. Experimental results show that the method outperforms previous steganographic methods such as LSB matching and pixel-value differencing in terms of the capability of resisting current typical universal blind detecting methods.

    Automatic Boundary Extraction of Breast Tumor Lesions in Ultrasound Images Using Normalized Cut Algorithm
    SU Yan-ni, WANG Yuan-yuan
    2010, 28(6):  601-608.  doi:10.3969/j.issn.0255-8297.2010.06.008
    Asbtract ( 1755 )   PDF (2850KB) ( 2270 )  
    Related Articles | Metrics

    A modified normalized cut (Ncut) method considering the weighted gray values of neighborhood pixels is proposed to automatically segment the breast tumor lesion in ultrasonic images. The method partitions a breast ultrasound image into clusters with Ncut, and uses different gray values and the spatial distribution of each cluster to obtain an initial contour of the breast tumor. Then, for a small percentage of inaccurate segmentation, an active contour model together with a region-scalable fitting term is used to adjust the initial boundary for the final result. The proposed method is applied to a database of 112 clinical ultrasonic breast tumor images. The results show that the proposed method can realize boundary extraction of tumors efficiently and automatically without any manual intervene. Meanwhile the computation complexity is low. Therefore, the method can be used to improve the degree of automation in computer-aided diagnosis.

    Segmentation of Medical Images Based on Three Dimensional Pulse Coupled Neural Network Model
    SHI Jun, CHANG Qian, ZHONG Jin
    2010, 28(6):  609-615.  doi:10.3969/j.issn.0255-8297.2010.06.009
    Asbtract ( 2124 )   PDF (1234KB) ( 1776 )  
    Related Articles | Metrics

     In this study, the 2D pulse coupled neural network (PCNN) model is extended to the 3D space, and a new rule for optimal image segmentation, named product mutual information (PMI), is proposed. Based on the 3D PCNN and PMI, an automatic segmentation algorithm is developed for 3D medical image segmentation. Three-dimensional CT lung images are segmented with the proposed method, showing reduced execution time and improved computation efficiency with high segmentation accuracy. The method is potentially useful for
    medical image segmentation.

    Mosaicing of Multiple Spectrum Images Acquired from Unmanned Airship with SIFT Feature Matching
    SU Jun-ying
    2010, 28(6):  616-620.  doi:10.3969/j.issn.0255-8297.2010.06.010
    Asbtract ( 1877 )   PDF (822KB) ( 2086 )  
    Related Articles | Metrics

     A multi-spectral remote sensing image mosaic technique with scale invariant feature transform (SIFT) feature matching is proposed to deal with images obtained from an unmanned airship. The acquired pictures usually do not meet the specifications of aerial photography because the airship is unstable in wind. We propose to use SIFT feature vectors with spectral information to improve robustness of the mosaicing algorithm. The BBF(best-bin-first) algorithm and RANSAC(random sample consensus)methods are used for coarse and fine matching processing, and error removal. The optimal transformation matrix from SIFT feature matching calculation is used to achieve image mosaicing. Experimental results show that the algorithm can produce a large number of matching feature points to obtain a stable transformation matrix for further image mosaicing, with accuracy that meets the needs of image interpretation.

    General Regular Polygon Method for Camera Calibration in Machine Vision
    ZHANG Yi-cheng, TU Da-wei, ZHAO Qi-jie, WANG Mei
    2010, 28(6):  621-627.  doi:10.3969/j.issn.0255-8297.2010.06.011
    Asbtract ( 2253 )   PDF (1578KB) ( 2146 )  
    Related Articles | Metrics

    Abstract: We expand certain special regular polygon models for camera calibration in machine vision to a general regular polygon model, and propose the general regular polygon calibration method. For general regular polygons, geometrical characteristics on the polygon plane are analyzed. We determine two types of vanishing point according to the cross ratio and the harmonic-conjugate rules in projective geometry. One type is formed by every edge vector of the polygon, and the other formed from the center of the inscribed circle to the tangent points. The camera’s intrinsic parameters can then be calculated. Calculation can be done in this way because the direction from the vanishing point to the optic center is the same as that of the vector making the vanishing point. Finally, the general regular polygon calibration method is validated by camera calibration experiments with four specific regular polygons: regular triangle, square, regular pentagon, and regular hexagon. Experimental results also show that, among the four specific regular polygons, calibration accuracy of the regular pentagon model is the highest, while that of the square model is the lowest.

    Two-Dimensional Direction-of-Arrival Estimation Based on Special Array
    ZHAO Da-yong1;2, DIAO Ming1, WU Xiao-qiang1
    2010, 28(6):  628-632.  doi:10.3969/j.issn.0255-8297.2010.06.012
    Asbtract ( 1554 )   PDF (805KB) ( 1465 )  
    Related Articles | Metrics

    A new method for estimating two-dimensional direction-of-arrival based on a special linear array is presented. Rotational invariance of the virtual array can be obtained from rotational invariance of the reference array using the method of two-direction expansion, which improves the array’s expansion ability and eliminate redundant data of the forth-order cumulant matrix. Using the new method, the signal subspace can be estimated from only two forth-order cumulant matrices. DOA estimation can be achieved by the 2D ESPRIT method. The theoretical analysis and simulation results show that this method has low computation cost, excellent expansion ability, high estimation precision, and good practicality.

    Electronic Engineering
    Decoder with Low Resource Overhead for Multi-edge Type LDPC Codes Based on Cache
    XIE Dong-fu1, WANG Lin2, CHEN Ping-ping1
    2010, 28(6):  633-638.  doi:10.3969/j.issn.0255-8297.2010.06.013
    Asbtract ( 1756 )   PDF (1230KB) ( 1984 )  
    Related Articles | Metrics

    To study low cost and low power applications, we propose a decoding architecture with low resource overhead for multi-edge-type low density parity check (LDPC) codes. The architecture links the check node computed unit and variable node computed unit by cache. The analysis and experiments show that, compared with the traditional partial parallel decoding architecture, the decoding architecture described in this paper cuts about 50% RAM for storing iterative information when the check matrix is random, about 90% MUX for transmitting iterative information, and about 80% variable node computation unit for generating iterative information transmitted form variable nodes to check nodes.

    Control and System
    Analysis of Key Events in Complex Systems Using Influence Nets
    YANG Cui-rong, WANG Ming-zhe, LIAO Jing-jing
    2010, 28(6):  639-645.  doi:10.3969/j.issn.0255-8297.2010.06.014
    Asbtract ( 1661 )   PDF (616KB) ( 1434 )  
    Related Articles | Metrics

    To analyze key events of complex systems, the event sequence diagram is translated to an influence network. By colored petri net (CPN) modeling and simulation, the influence network is used to analyze sensitivity of the system events and search key event sets. According to the output of the CPN model, conditional probability and baseline probability are obtained statistically. The relationship between causal strength and conditional probability is linearized to obtain the causal strength value objectively. We apply the proposed method in a ballistic missile defense system. The results show that the method is straightforward and practical. It is useful in decision-making of complex simulation systems.

    Simplified Dual-Quaternion Navigation Algorithm
    WU Gao-long1;2, LIU Hua-wei1, HAO Shun-yi1, ZHANG Zong-lin1
    2010, 28(6):  646-655.  doi:10.3969/j.issn.0255-8297.2010.06.015
    Asbtract ( 1729 )   PDF (3079KB) ( 1251 )  
    Related Articles | Metrics

    Abstract: The original dual-quaternion navigation algorithm involves many complex operations and requires a large amount of computation. A  implified algorithm is proposed for dual-quaternion navigation to make extraction of gravitational velocity and position vectors easier. The notation of the simplified algorithm is unambiguous. After that, the formula for extracting non-gravitational velocity is further simplified. Simulation shows that the simplified method provides the same precision as the original dual-quaternion algorithm, both being better than the traditional strap-down navigation algorithm. The computation complexity of the proposed method is the least among the three, while position error of the approximate algorithm is close to that of the original dual-quaternion algorithm.

    Modeling and Switching in Unmanned Aerial Vehicle for Mars Exploration
    YAO Ke-ming1, LIU Yan-bin2, LU Yu-ping2, XIE Qi-yuan2
    2010, 28(6):  655-650.  doi:10.3969/j.issn.0255-8297.2010.06.016
    Asbtract ( 1723 )   PDF (3079KB) ( 1470 )  
    Related Articles | Metrics

     Unmanned aerial vehicle for Mars exploration is a development direction in the future deep space exploration. In this paper, modeling and switching of Mars vehicles are studied. The flight process of the vehicle is briefly described, and a mathematical model established. The steady state performance is analyzed under conditions with and without a parachute. Systems for controlling position and altitude are designed, and switching control is realized. Simulation shows that the model is stable and feasible, and the proposed switching control methods can guarantee security and stability of the switching process.