Please wait a minute...

Current Issue

    25 July 2008, Volume 29 Issue 7
    Papers
    Study of methods for constructing punctured binary array pairs
    Ting JIANG,Jiong SHI,Zheng ZHOU
    2008, 29(7):  1-6.  doi:1000-436X(2008)07-0001-06
    Asbtract ( 0 )   HTML ( 0)   PDF (1359KB) ( 50 )   Knowledge map   
    References | Related Articles | Metrics

    Quasi-perfect punctured binary array pairs and doubly quasi-perfect punctured binary array pairs are good periodic correlation signals.They are extension of the perfect punctured binary array pairs.As a complement to the theory of punctured binary array pairs,three methods were proposed for constructing perfect punctured binary array pairs,quasi-perfect punctured binary array pairs and doubly quasi-perfect punctured binary array pairs,which base on the methods for constructing perfect binary array pairs,quasi-perfect binary array pairs and doubly quasi-perfect binary array pairs.A composite method for constructing quasi-perfect punctured binary array pairs and doubly quasi-perfect punctured binary array pairs; a method for constructing perfect punctured binary array pairs using perfect punctured binary array pairs and quasi-perfect punctured binary array pairs; a method for constructing quasi-perfect punctured binary array pairs using quasi-perfect punctured binary array pairs and doubly quasi-perfect punctured binary array pairs.

    Novel threshold-based TOA estimation algorithm for IR-UWB systems
    Shao-hua WU,Qin-yu ZHANG,Nai-tong ZHANG
    2008, 29(7):  7-13.  doi:1000-436X(2008)07-0007-07
    Asbtract ( 0 )   HTML ( 0)   PDF (1846KB) ( 590 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aim at the performance drawbacks of those existent TOA estimation algorithms of IR-UWB systems,a TC (threshold-crossing) algorithm was proposed whose normalized threshold was set based on the MMR (maximum to minimum energy sample ratio) of the energy samples.The relationship between the optimal normalized threshold and MMR was investigated through simulations,from which the mathematical model of MMR based optimal normalized threshold calculation was built.The model is well independent of channel models,which make it widely applicable.Moreover,effects of the length of energy-integration-interval were considered,which enables the model being functional without any modifications when different energy-integration-interval lengths are used.Simulation results show that the proposed MMR-TC algorithm outperforms those existent algorithms at nearly all SNR ranges.

    Robust wireless transmission scheme for scalable video streaming
    Ying-bo SHI,Cheng-ke WU,You-xi ZHOU,Ying FENG
    2008, 29(7):  14-19.  doi:1000-436X(2008)07-0014-06
    Asbtract ( 0 )   HTML ( 0)   PDF (1522KB) ( 135 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An adaptive unequal loss protection (ULP) scheme for scalable video streaming over wireless networks was proposed.Based on the available network bandwidth and the packet loss rate estimation,unequal amounts of FEC protec-tion were assigned to each layer and the sending rate was determined by dynamically selecting the number of layers to transmit.To restrain the video transmission error propagation,the FEC assignment algorithm for the base layer was de-veloped by exploring the unequal importance existing in different frames of a group of pictures (GOP),and unequal amounts of protection were allocated to different base layers of a GOP in order to minimize the decoder distortion.The experiment results show that the proposed scheme can largely improve the error resilience of the scalable video bit stream and the performance of video streaming network transmission system.

    Novel clustering algorithm for wireless sensor networks
    Jing HU,Lian-feng SHEN,Tie-cheng SONG,De-sheng REN
    2008, 29(7):  20-26.  doi:1000-436X(2008)07-0020-07
    Asbtract ( 0 )   HTML ( 0)   PDF (1579KB) ( 299 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The energy supply of nodes will be limited strictly in the wireless sensor networks (WSN).Considering the characteristic,the responsive distributed clustering algorithm (RDCA) was proposed.The nodes implementing this algo-rithm can elect cluster heads based on local topology information and decide which cluster to join based on cost function without the location information,and the algorithm rather suits for the periodical WSN.The results of analysis and simu-lation indicate that the RDCA can provide better load-balancing of cluster heads and less protocol overhead.Comparing with LEACH protocol,RDCA improves the uniformity of energy consumption so that the network lifetime was pro-longed about 40%.

    Sliding window multiplication in finite field GF(2n)
    Zhong LI,Yi WANG,Dai-yuan PENG
    2008, 29(7):  27-31.  doi:1000-436X(2008)07-0027-05
    Asbtract ( 0 )   HTML ( 0)   PDF (825KB) ( 503 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Some published finite field GF(2n) multiplication algorithms are studied,and a new algorithm for finite field GF(2n) multiplication based on sliding window technology was presented.The analysis and simulation results indicate that,compared with the fixed window algorithm,the new algorithm to achieve better efficiency.

    Models of bounds on end-to-end delay of long-range dependence traffic based on fractal leaky buckets
    Lian-ming ZHANG,Da-zu HUANG,Zhi-gang CHEN
    2008, 29(7):  32-38.  doi:1000-436X(2008)07-0032-07
    Asbtract ( 0 )   HTML ( 0)   PDF (1219KB) ( 426 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to get upper bounds on end-to-end delay of networks with LRD (long-range dependence) input traffic,a network model was presented based on FLB (fractal leaky bucket) and GPS (generalized processor sharing),and the result that FLB do not increase the bounds of network delay was proved by network calculus,and the optimal and as-ymptotic deterministic upper bounds of end-to-end delay of LRD business were derived.Numerical results demonstrate that FLB can improve the effect of the self-similar degree of LRD business on the end-to-end delay,and bounds on end-to-end delay based on FLB are tighter than those based on leaky bucket.

    Novel fair exchange protocol based on concurrent signature
    Guang-hui CHEN,Si-han QING,Zhi-feng QI,Yi-xian YANG
    2008, 29(7):  39-43.  doi:1000-436X(2008)07-0039-05
    Asbtract ( 0 )   HTML ( 1)   PDF (715KB) ( 583 )   Knowledge map   
    References | Related Articles | Metrics

    Based on perfect concurrent signature,a novel fair exchange protocol was presented.In this protocol anyone can't identify who has signed which signature when two parties have exchanged their two ambiguous signatures and rela-tive data items.Not until the initial signer publishes a secret information,are the two signatures bound to respective signer concurrently.After that,the other party sends the key of decrypting goods,and thus the two parties can fairly get each other's data items without the trusted third party (TTP),which avoids the possibility of two parties' collusion and the bottleneck of the TTP involvement.Through analysis,this protocol well ensures some significant properties of fair ex-change,such as fairness,non-repudiation and abuse-free etc.What's more,it only needs four messages between two par-ties and it is very simple and highly efficient.

    Linear complexity and k-error linear complexity for 2p-periodic binary sequences
    Lin TAN,Wen-feng QI
    2008, 29(7):  44-49.  doi:1000-436X(2008)07-0044-06
    Asbtract ( 0 )   HTML ( 0)   PDF (1056KB) ( 131 )   Knowledge map   
    References | Related Articles | Metrics

    The stability of the linear complexity was an important index to scale a sequence's randomicity.For 2mpn-periodic binary sequences,where p was a odd prime and 2 was a primitive root module p2,made use of the tools such as polynomial factorization,provides the bounds of the minimum value k such that the k-error linear complexity is strictly less than the linear complexity.

    Analysis on the Internet AS-level topology
    Xin ZHANG,Hai ZHAO,Li-fei WANG,Chao LI
    2008, 29(7):  50-61.  doi:1000-436X(2008)07-0050-12
    Asbtract ( 0 )   HTML ( 0)   PDF (1880KB) ( 841 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Internet topological structure analysis is great significant for the application and further development of the network.Based on the large time span analysis of the massive authorized AS-level topology data,the evolution relations between the main characteristics of the network and the degree value of nodes were gained.By analyzing time-slicing data,several important characteristics related to network hierarchy and the high-level nodes major influence on the net-work topology were found.Then through a hierarchical modeling method,the great significance of network topology hi-erarchy was proved by experimental data.Combined the analysis of results,the important conclusions were got.With the Internet AS-level topology tending very slow homogenization,the high-level nodes represented by max-core controlled the main characteristics of network topology stability,such as cluster,power-law and hierarchy.

    Least square single-tone frequency estimator in non-Gaussian colored noise
    Shuang-ping LIU,Xiang WEN,Zhi-gang WANG
    2008, 29(7):  62-68.  doi:1000-436X(2008)07-0062-07
    Asbtract ( 0 )   HTML ( 1)   PDF (1197KB) ( 231 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A least square frequency estimator of single-tone sinusoidal wave in non-Gaussian colored noise was proposed.Firstly,the spectral line of symbol-rate-sinusoid to band nearby zero was transferred by a mixer.Then the transferred signal was filtered and decimated to get a new one in Gaussian white noise.Finally,fine estimation of signal baud was got by applying least square criterion to the phase difference of extracted sinusoid.Differing from other FFT-based algo-rithms,the new one overcomes the shortcoming of finite resolving capability in frequency and can provide more accurate estimation for automatic modulation recognition and other application.

    Research of routing addressing strategy based on H.225.0 Annex G protocol for inter-domain communication
    Rui LI,Zhan-wu YU
    2008, 29(7):  69-74.  doi:1000-436X(2008)07-0069-06
    Asbtract ( 0 )   HTML ( 0)   PDF (1215KB) ( 137 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To the question,lower visiting efficiency between administrator domains in multimedia communication,and based on H.225 Annex G protocol,we referenced the telephone number coded pattern in ITU-T E.164 protocol and the method in resolving process of DNS,a routing addressing strategy for inter-domain communication was proposed.This strategy was based on quasi-homo-administrative domain (qhAD) and used H.225 Annex G protocol message to ex-change address templates between superior level and lower level administrator domains.Therefore,they could get real-time address information.And all level administrator domains could keep a routing table of all ancestors.When it originated a call,it applied for resolving an address to the furthest quasi-homo-level ancestor directly.So the resolving process could be done in a relatively small domain.By analyzing the delay time for algorithm performance and simulat-ing the algorithm model,the qhAD strategy reduces the delay of addressing greatly.It can also decrease the using and traffic of communication channels.

    On the linear span of a class of low correlation sequence family
    Jin-bing TIAN,Xiang-yong ZENG,Lei HU
    2008, 29(7):  75-80.  doi:1000-436X(2008)07-0075-06
    Asbtract ( 0 )   HTML ( 0)   PDF (1469KB) ( 20 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In cryptography and communication systems,application of low correlation sequences with large linear span can efficiently improve security of data,and the design of sequences with these properties was an important research problem.A useful approach to construct sequence families with low correlation was based on d-form functions,and the Key's method can determine the linear span of these sequences.For a positive even integer n and any positive integers r relatively prime to 2n/2-1,a class of low correlation sequence families S(r)was proposed,and each family contained 2n-binary sequences of period 2n-1.For some suitable values of the parameter r,the linear span of those sequences in S(r)was equal to n2n/2-3,or n2n/2-4.The constructed sequences with large linear span have a wide range of application since the parameter n can take any even integer.

    Study of the interference reducing capability of time reversal techniques in underwater acoustic MIMO systems
    Da-zhi PIAO,Qi-hu LI,Chang-yu SUN
    2008, 29(7):  81-87.  doi:1000-436X(2008)07-0081-07
    Asbtract ( 0 )   HTML ( 0)   PDF (2382KB) ( 309 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The intersymbol interference (ISI) and co-channel interference in a general TRM (time reversal mirror) MIMO (multiple-input-multiple-output) system was analyzed,the expression of interference was derived,and the interference reducing effects in terms of array configuration,channel,and transmitted signal were studied through an image source model in a typical shallow water channel.The computation result of signal to interference ratio was compared with the signal to interference ratio in an outdoor wireless channel,it can see that there is more rich multipath in the shallow water channel with small seabed attenuation coefficient,so the TRM can get a better spatial focusing and a better interference reduction capability.The interference reducing capability of TRM in MIMO systems is mainly decided by the richness of multipath,the element spacing and the number of TRM element.

    Technical Report
    Vector precoding research based on geometric mean decomposition in MIMO system
    Xuan GENG,Ling-ge JIANG,Chen HE
    2008, 29(7):  88-93.  doi:1000-436X(2008)07-0088-06
    Asbtract ( 0 )   HTML ( 0)   PDF (1575KB) ( 796 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the transceiver structure combing geometric mean decomposition (GMD) with vector precoding,the op-timum solution for perturbation vector was researched under minimizing minimum square error (MMSE) criterion.By expanding the range of perturbation vector,two schemes were proposed.In the first scheme,the perturbation vector had only continuous values.In the second scheme,the perturbation vector was generalized to have both continuous and dis-crete values.In both schemes,the optimum perturbation vectors were obtained by minimizing the square error between transmitted and received signals.Simulation shows that the second scheme can offer great performance gain when an-tenna number is large.

    Pricing and game theory based admission control scheme
    Hui ZHANG,Xu-ming FANG
    2008, 29(7):  94-102.  doi:1000-436X(2008)07-0094-09
    Asbtract ( 0 )   HTML ( 0)   PDF (761KB) ( 249 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By using Cobb-Douglas utility function to construct a price function,the fairness of resource utilization under different load condition was achieved.To be closer to the real system,it is assumed that more than one user could be con-sidered at the access moment,and a game is used to judge the access,which guaranteed the fairness use of resource.Since video and IPTV can tolerate a certain degree of packet lose,and the data can tolerate a certain degree of delay,therefore a game is used to decide whether to degrade ongoing calls or to reject a new call request to maximize the re-source utility under the precondition of fairness of resource utilization.The analysis and simulation results show that,by using this pricing function and game approach,the fairness of resource utilization is well achieved,while the resource utilization is maximized.

    Telephone number coding schemes based on characteristics of user's name
    Gui-ming FANG,Zhi-mei WU,Wei ZHAO
    2008, 29(7):  103-108.  doi:1000-436X(2008)07-0103-06
    Asbtract ( 0 )   HTML ( 0)   PDF (795KB) ( 125 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The individualized telephone number database was proposed that the telephone number derived directly from user's name.It is useful to avoid too much disorder numbers memorized in human brains,to block unsolicited call,and to process calling as the user is busy properly.Phonetic alphabets or other characteristic of Chinese name can be mapped to digital keypad without duplicating.The mapping rules should be as simple as possible.It can be evaluated by PCA (prin-cipal component analysis).Some mapping schemes for examples were proposed and evaluated.

    Research on a stochastic distribution multibit Trie tree IP classification algorithm
    Feng-jun SHANG,Ying-jun PAN,Xue-zeng PAN,Bin BI
    2008, 29(7):  109-117.  doi:1000-436X(2008)07-0109-09
    Asbtract ( 0 )   HTML ( 0)   PDF (963KB) ( 314 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The typical IP classification algorithms was surveyed and a novel IP classification scheme was proposed based on the stochastic distribution,which is based on non-collision hash Trie-tree algorithm and XOR hash algorithm.The core of algorithm consists of three parts:structure the non-collision hash function,which is constructed mainly based on destination/source port and protocol type field so that the hash function usually can avoid space explosion problem; intro-duce multibit Trie-tree based the key value of XOR hash in order to reduce time complexity; lookup every rule index to en-sure the validity that the final rule index was got.The test results show that the classification rate of multibit Trie tree algo-rithm is up to 2 million packets per second and the maximum memory consumed is 1MB for 10 000 rules.

    Academic communication
    Research of AODV routing protocol based on link availability prediction
    Li HONG,Ting-pei HUANG,Wei-xia ZOU,Shu-rong LI,Zheng ZHOU
    2008, 29(7):  118-123.  doi:1000-436X(2008)07-0118-06
    Asbtract ( 0 )   HTML ( 0)   PDF (1049KB) ( 311 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The AODV routing protocol could not adapt to high dynamic topology change well.According to extend the AODV routing algorithm by the link availability prediction,the nodes selected the most stable path to route based on the power of received packets and the link continuous availability time,and started the route maintenance in advance before the link broken.The simulation results demonstrate that the improved AODV routing protocol increased the packet deliv-ery ratio and decreases the average end-to-end delay,and the reliability of the routing protocol is strengthened.

    Peak-to-average power ratio reduction method for OFDM systems
    Meng ZHOU,Guo-fang TU,Jian-ming ZHOU
    2008, 29(7):  124-128.  doi:1000-436X(2008)07-0124-05
    Asbtract ( 0 )   HTML ( 0)   PDF (1028KB) ( 975 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A low complexity peak-to-average power ratio (PAPR) reduction method was proposed for orthogonal fre-quency division multiplexing (OFDM) systems.Firstly time-domain oversampling is performed,and then power nor-malization is adopted which is followed by clipping.Finally,the output clipped signals are filtered by a low-pass filter.In addition,effects of clipping on over sampled OFDM signals in terms of signal-to-noise ratio and sig-nal-to-noise-plus-distortion,etc were analyzed.Simulation results demonstrate that,compared with traditional clipping technique,the proposed method can effectively reduce the PAPR re-growth after filtering.

    Load-balanced broadcast routing in wireless Ad hoc networks
    Tian HU,Hao ZHOU,Bao-hua ZHAO
    2008, 29(7):  129-134.  doi:1000-436X(2008)07-0129-06
    Asbtract ( 0 )   HTML ( 0)   PDF (581KB) ( 419 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In Ad hoc networks,where mobile hosts are powered by batteries,if a small set of batteries are drained out too early,the entire network may be partitioned.So a crucial issue is to improve the energy efficiency with an objective of balanced energy consumption.A greedy algorithm called WMST was proposed,and its time complexity is O(n2).This algorithm considered initial energy of each node and energy consumption of each communication.Simulation experi-ments demonstrated that the performance of the proposed algorithm improves the load balance and lifetime.Finally,fu-ture extensions were discussed.

    Hybrid optimization algorithm for routing problem in dynamic networks
    Jiang-qing WANG,Jun QIN,Zi-mao LI
    2008, 29(7):  135-140.  doi:1000-436X(2008)07-0135-06
    Asbtract ( 0 )   HTML ( 1)   PDF (1158KB) ( 630 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A routing problem was investigated where both dynamic network environment and real-time customer requests were considered,a hybrid optimization algorithm called Evo-Ant was proposed.The advantage of the algorithm is that it incorporates ant colony algorithm for exploration and evolutionary algorithm for exploitation,and uses real-time infor-mation during the optimization process.In order to discuss the performance of the proposed algorithm,a mixed integral programming model for dynamic vehicle routing problem was formulated,and benchmark functions were constructed.The performance of the algorithm is evaluated by comparing its results with some exact algorithms and heuristic algo-rithms for randomly generated test problems.The results show that the proposed algorithm can achieve a higher per-formance gain,and is well suited to problems containing dynamic network environment and real-time customer requests.

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: