• Title/Summary/Keyword: Spreading Code

Search Result 228, Processing Time 0.026 seconds

Dynamic Control of Random Constant Spreading Worm using Depth Distribution Characteristics

  • No, Byung-Gyu;Park, Doo-Soon;Hong, Min;Lee, Hwa-Min;Park, Yoon-Sok
    • Journal of Information Processing Systems
    • /
    • v.5 no.1
    • /
    • pp.33-40
    • /
    • 2009
  • Ever since the network-based malicious code commonly known as a 'worm' surfaced in the early part of the 1980's, its prevalence has grown more and more. The RCS (Random Constant Spreading) worm has become a dominant, malicious virus in recent computer networking circles. The worm retards the availability of an overall network by exhausting resources such as CPU capacity, network peripherals and transfer bandwidth, causing damage to an uninfected system as well as an infected system. The generation and spreading cycle of these worms progress rapidly. The existing studies to counter malicious code have studied the Microscopic Model for detecting worm generation based on some specific pattern or sign of attack, thus preventing its spread by countering the worm directly on detection. However, due to zero-day threat actualization, rapid spreading of the RCS worm and reduction of survival time, securing a security model to ensure the survivability of the network became an urgent problem that the existing solution-oriented security measures did not address. This paper analyzes the recently studied efficient dynamic network. Essentially, this paper suggests a model that dynamically controls the RCS worm using the characteristics of Power-Law and depth distribution of the delivery node, which is commonly seen in preferential growth networks. Moreover, we suggest a model that dynamically controls the spread of the worm using information about the depth distribution of delivery. We also verified via simulation that the load for each node was minimized at an optimal depth to effectively restrain the spread of the worm.

Analysis of Downlink Wideband DS-CDMA Systems with Smart Antenna for Different Spreading Bandwidths in Wideband Multipath Channel

  • Jeon Jun-Soo;Kim Cheol-Sung
    • Journal of electromagnetic engineering and science
    • /
    • v.4 no.4
    • /
    • pp.183-189
    • /
    • 2004
  • In this paper, the Eigen-RAKE receiver in wideband direct sequence code-division multiple access(DS-CDMA) systems with downlink smart antenna is analyzed for different spreading bandwidths(1.25 MHz, 5 MHz, 10 MHz) and different channel environments(macro, micro). The realistic spatio-temporal wideband multipath channel is assumed, one of which is standardized multiple-input single-output(MISO) radio channel model for WCDMA link-level simulations proposed by $3^{rd}$ generation partnership project(3GPP) contributions. We assumed spatial scattering phenomenon in which many unresolvable path signals within a limited range of spatial angle simultaneously contribute to the signals received at the receiver. Several multipaths within one chip are distinguished into each one and the first multipath components are selected as the desired signal and the others are considered self-interference. Downlink DS-CDMA system with eigenbeamformer using wider bandwidth present better performance than that using narrow bandwidth system by employing Eigen-RAKE receiver of many number of branches. It is shown that the downlink eigenbeamformer is more effective in typical urban macro cellular environments when using Eigen-RAKE receiver.

Random Assignment-Transmitter-Based Protocol for Centralized Stread-Spectrum Packet Radio Networks (중앙집중 대역확산 패킷라디오 네트워크를 위한 임의할당-송신기 프로토콜)

  • 노준철;김동인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.4
    • /
    • pp.729-739
    • /
    • 1994
  • In a centralized spread-spectrum packet radio network, a random assignment -transmitter-based spreading code protocol(RA-T) is proposed which permits the contention mode only in the trasmission of a preamble while avoiding collision during the data packet transmission by assigning near-orthogonal spreading codes to each user. Compared to the conventional transmitter-based code scheme, this scheme allows reduction in receiver complexity when only a small number of distinct spreading codes are employed for the preamble transmission. Throughout theoretical and simulation results, it is shown that the use of the RA-T scheme with just two or three distinct codes for the preamble packet achieves most of the performance gain.

  • PDF

Performance Analysis of Large CDMA Random Access Systems with Retransmission Diversity over Fading Channels

  • Yu, Kai;Sun, Yi;Fan, Pingzhi;Lei, Xianfu;Shu, Lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.509-528
    • /
    • 2010
  • The random access systems, with retransmission diversity (RD) employment, over large random spreading code division multiple access (CDMA) channel subject to fading is investigated, under the assumption of infinite number of users and infinite spreading gain with their ratio converging to a constant. The low bound of the signal to interference and noise ratio (SINR) is shown to converge almost surely to a constant. The throughput, spectrum efficiency and energy efficiency in the dominating systems are obtained. The analytical results are confirmed by simulations. We find that in high traffic loads the throughput with fading is higher than that without. When the energy efficiency increases, the spectrum efficiency tends to two contrary values due to SNR increases or decreases. For the ordinary stable systems, the stability region is shown to shrink as the traffic increases and enlarge with RD employment.

Blind Multi-User Detector Using Code-Constrained Minimum Variance Method (코드 제한 최소 분산 방법을 이용한 블라인드 다중 사용자 검파기)

  • 임상훈;정형성이충용윤대희
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.215-218
    • /
    • 1998
  • This paper proposes a blind multi-user detector using Code-Constrained Minimum Variance (CCMV) method which directly detects the DS-CDMA signals in a multipath fading channel without estimating the channels. This algorithm reduces the complexity of computation by making a small size data matrix with the order of the channel length. Advantageously it requires to know the spreading code and the time delay of only the desired user.

  • PDF

LS code pair setting and sequential allocation methods

  • Wook, Roh-Dong
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.221-224
    • /
    • 2001
  • A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

  • PDF

Improvement of code acquisition time in DS/SS systems using a hybrid scheme (복합방식을 이용한 직접대역확산통신시스템의 코드획득 성능개선)

  • 조권도;김선영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.684-691
    • /
    • 1996
  • Since the period of a spreading code in DS/SS communication systems is generally long, it is necessary to make the code acquisition as fast as possible. The code acquisition time can be sued as a measure to evaluate the performance of code acquisition systems. The search rate of serial search codee acquisition system used in the coventional CDMA cellular system is lower than that of the matched filter technique. In order to reduce the code acquisition time, this paper proposes hybrid code acquisition system composed filters combined with serial search blocks. In the proposed system, the matched filter sweeps possible code phases fast and the acquired phase information is verified by the serial search block. The mean and the variance of its acquisition time are calculated and compared with those of double dwell serial search system. The results indicate better performance of the proposed system by yielding its small vaues of the mean and the variance of code acquisition time.

  • PDF

Effect of Processing Gain on the Iterative Decoding for a Recursive Single Parity Check Product Code (재귀적 SPCPC에 반복적 복호법을 적용할 때 처리 이득이 성능에 미치는 영향)

  • Chon, Su-Won;Kim, Yong-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9C
    • /
    • pp.721-728
    • /
    • 2010
  • CAMC (constant amplitude multi-code) has a better performance of error correction in iterative decoding than SPCPC (single parity check product code). CAMC benefits from a processing gain since it belongs to a spread spectrum signal. We show that the processing gain enhances the performance of CAMC. Additional correction of bit errors is achieved in the de-spreading of iteratively decoded signal. If the number of errors which survived the iterative decoding is less than or equal to ($\sqrt{N}/2-1$), all of the bit errors are removed after the de-spreading. We also propose a stopping criterion in the iterative decoding, which is based on the histogram of EI (extrinsic information). The initial values of EI are randomly distributed, and then they converge to ($-E_{max}$) or ($+E_{max}$) over the iterations. The strength of the convergence reflects how successfully error correction process is performed. Experimental results show that the proposed method achieves a gain of 0.2 dB in Eb/No.

performance Evaluation of a Multi-Media DS/SSMA System (다매체 직접수열 대역확산 다중접속 시스템의 성능분석)

  • 김홍직;송익호;김상우;한진희
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1996.06a
    • /
    • pp.33-38
    • /
    • 1996
  • A multi-media binary DS/CDMA system with variable processing gain and coherent correlation receivers are considered under additive white Gaussian noise channels. Two types of information sources with different rates and transmitting powers are assumed to be transmitted simultaneously in the same channel. Average signal-to-noise ratios at the correlation receiver outputs for each type of information sources are analytically derived as functions of discrete partial cross-correlations between spreading code sequences. The analysis is expected to provide analytical tools for use in preliminary system design and spreading code selection.

  • PDF

Performance of cellular hybrid DS/FH spread spectrum systems with diversity on nakagami fading channel (나카가미 페이딩 채널하에서 다이버시티를 갖는 셀룰러 하이브리드 DS/FH 확산대역 시스팀의 성능)

  • 조현욱;박상규
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.2
    • /
    • pp.10-21
    • /
    • 1998
  • In this paper, we analyze the anynchrous cellular hybrid DS/FH spread spectrum system with diversity on nonselective Nakagami fading channel. Binary Psk scheme is considered and random spreading code sequences and random hopping patterns are used. We compare the performance of system using hard-limiting correlation receiver with diversity and linear corrleation receiver in Nakagami fading channel. We compute the average bit error probabilities with/without diversity according to spreading code sequence and the number of hop-ping frequencies under the same handwith espansion, and analyze near-far effect. The results show that hard-limiting correlation receiver with diversity gives a good performance over severe fading channel.

  • PDF