• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.832-842
• /
• 2013

Cognitive Radio has attracted intensive interests of the researchers, recently. The data rate always increases in the emerging technologies. The increased data rate poses mainly two challenges for spectrum sensing. One is that the state of primary user (PU) is fast and alternatively varying between "on/off" in a spectrum sensing window. The other is that the asynchronicity among the reports in a cooperative spectrum sensing setting becomes more apparent. Both of them would deteriorate the spectrum sensing performance. Thus, we propose an asynchronous cooperative spectrum sensing method to cope with these two challenges. A likelihood ratio test based spectrum sensing is developed for a single cooperator. The likelihood ratio is obtained in the setting of fast varying PU state. The likelihood ratio test is uniformly powerful according to the Neyman-pearson lemma. Furthermore, the asynchronicity among the cooperators are studied. Two sets of fusion weights are discussed for the asynchronous time among cooperators. One is designed based on the condition probability of the PU state variation and the other one is designed based on the queueing theory. The simulation results are provided with different fusion methods. The performance improvements are demonstrated.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.610-618
• /
• 2016

A green cognitive radio network (CRN), characterized by base stations (BSs) that conserve energy during sleep periods, is a promising candidate for realizing more efficient spectrum allocation. To improve the spectrum efficiency and achieve greener communication in wireless applications, we consider CRNs with an long term evolution advanced (LTE-A) structure and propose a novel energy-saving strategy. By establishing a type of preemptive priority queueing model with a single vacation, we capture the stochastic behavior of the proposed strategy. Using the method of matrix geometric solutions, we derive the performance measures in terms of the average latency of secondary user (SU) packets and the energy-saving degree of BSs. Furthermore, we provide numerical results to demonstrate the influence of the sleeping parameter on the system performance. Finally, we compare the Nash equilibrium behavior and social optimization behavior of the proposed strategy to present a pricing policy for SU packets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3029-3042
• /
• 2022

For over half a century, the United States (US) and its coalition military aircrafts have been using Ultra High Frequency (UHF) band analog modulation (AM) radios in ground-to-air communication and short-range air-to-air communications. Evolving from this, since 2007, the US military and the North Atlantic Treaty Organization (NATO) adopted HAVE QUICK to be used by almost all aircrafts, because it had been revealed that intercepting and jamming of former aircraft communication signals was possible, which placed a serious threat to defense systems. The second-generation Anti-jam Tactical UHF Radio for NATO (SATURN) was developed to replace HAVE QUICK systems by 2023. The NATO Standardization Agreement (STANAG) 4372 is a classified document that defines the SATURN technical and operational specifications. In preparation of this future upgrade to SATURN systems, in this paper, the SATURN technical and operational specifications are reviewed, and the network synchronization, frequency hopping, and communication setup parameters that are controlled by the Network (NET) Time, Time Of Day (TOD), Word Of Day (WOD), and Multiple Word of Day (MWOD) are described in addition to SATURN Edition 3 (ED3) and future Edition 4 (ED4) basic features. In addition, an anti-jamming performance analysis (in reference to partial band jamming and pulse jamming) and the time delay queueing model analysis are conducted based on a SATURN transmitter and receiver assumed model.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.235-244
• /
• 2004

TCP Vegas version provides better performance and more stable services than TCP Tahoe and Reno versions, which are widely used in the current Internet. However, in the situation where TCP Vegas and Reno share the bottleneck link, the performance of TCP Vegas is much smaller than that of TCP Reno. This unfairness is due to the difference of congestion control mechanisms of each TCP use. Several studies have been executed in order to solve this unfairness problem. In this paper, we analyze the minimum window size to maintain the maximum TCP performance of link bandwidth. In addition, we propose an algorithm which maintains the TCP performance and improves fairness by selective packet drops in order to allocate proper window size of each TCP connections. To evaluate the performance of the proposed algorithm, we have measured the number of data bytes transmitted between end-to-end systems by each TCP connections. The simulation results show that the proposed algorithm maintains the maximum TCP performance and improves the fairness.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1804-1820
• /
• 1997

In this paper, an efficient call control procedure is presented for next generation wireless ATM networks and its performance is mathematically analyzed using the open queueing network. This procedure is based on a new scheme called as the cell clustering. When we use the cell clustering scheme, at the time that a mobile connection is admitted to the network, a virtual cell is constructed by choosing a group of neighboring base stations to which the call may probabilistically hand over and by assigning to the call a collection of virtual paths between the base stations. Within a microcell/picocell environment, it is seen that the cell clustering can support effectively a very high rate of handovers, provides very high system capacity, and guarantees a high degree of frequency reuse over the same geographical region without requiring the intervention of the network call control processor each time a handover occurs. But since mobiles, once admitted, are free to roam within the virtual cell, overload condition occurs in which the number of calls to be handled by one base station to exceed that cell site's capacity of radio channel. When an overload condition happens, the quality of service is abruptly degraded. We refer to this as the overload state and in order to quantify the degree of degradation we define two metrics, the probability of overload and the normalized average time spent in the overload state. By using the open network queueing model, we derive closed form expressions for the maximum number of calls that can be admitted into the virtual cell such that the two defined metrics are used as the acceptance criteria for call admission control.

• The Magazine of the IEIE
• /
• v.22 no.8
• /
• pp.33-43
• /
• 1995

생산시스템 분야에서의 다중로봇시스템에 대한 필요성이 증가되고 있기 때문에, 이에 대한 시스템 성능분석이 우선적으로 필요하다. 본 논문에서는 다중로봇시스템의 성능평가를 위한 컴퓨터 시뮬레이션 방법을 제시한다. 먼저 오류회복 기능만을 고려한 다중로봇시스템에 대하여 여러 가지의 모델링 방법 중에서 확장 페트리 네트 모델을 기초로 하여 컴퓨터 시뮬레이션 하는 과정을 제시하고 제시된 시뮬레이션 방법의 유효성을 입증하기 위하여 부가적으로 큐잉모델을 기초로 한 해석적 수식을 유도하여 두 가지의 결과를 비교해 본다. 그 다음, 오류회복 기능에 덧붙여서 충돌회피 기능을 고려한 다중로봇시스템은 해석적 수식을 유도하기 위해서는 강력한 가정들이 필요하며 이러한 가정들 때문에 실제 시스템을 정확히 모델에 반영하기 어려워진다. 따라서, 그 유효성이 입증된 컴퓨터 시뮬레이션을 이용하면 필요한 최적의 운용 변수를 용이하게 선택할 수 있을 것이다. Since there are Increasing demands for multirobot interconnection systems(MRIS) in Industrial manufacturing system, the performance evaluation of the MRIS is first needed. This thesis presents a computer simulation technique for the performance evaluation of the MRIS. First, we consider a error recoverable MRIS. We adopt the extended Petri net model as a computer simulation model that allows an easy evaluation of the performance. To verify the significance of the proposed computer simulation method, mathematical analysis, which is based on the given queueing model, is carried out with some design issues for the MRIS. In addition to this, it is required to analyze the MRIS considering collision avoidance as well as error recovery. In this case, methematial analysis needs hard assumptions which are the constraints for the precise description of real environment. Thus, we present a computer simulation model and its results suggest an optimal operational strategy for the MRIS under given conditions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.847-862
• /
• 1999

본 논문에서는 유한버퍼의(finite-buffered) 동기화된(synchronous) 큐잉모델(queueing model)을 이용하여 명령어들간의 병렬성, 분기명령의 빈도수, 분기예측(branch prediction)의 정확도, 캐쉬미스 등의 파라미터들을 고려하여 프로세서의 명령어 실행율을 예측하며 캐쉬의 성능과 파이프라인 성능간의 관계를 분석할 수 있는 새로운 해석적 모델을 제안하였다. 해석적 모델은 모델의 타당성을 검증하기 위해서 시뮬레이션을 수행하여 얻은 결과와 비교하였다. 해석적 모델과 시뮬레이션을 비교한 결과 대부분 10% 오차 내에서 일치하였다. 본 연구를 통하여 얻은 해석적 모델을 사용하면 시뮬레이션에서는 드러나지 않는 성능제약의 원인에 대한 명확한 규명이 가능하기 때문에 성능향상을 위한 설계자료를 얻을 수 있으며, 시스템 성능 밸런스를 위한 캐쉬와 비순차이슈 파이프라인 성능간의 관계에 대한 정확한 분석이 가능하다.Abstract This research presents a novel analytic model to predict the instruction execution rate of superscalar processors using the queuing model with finite-buffer size and synchronous operation mode. The proposed model is also able to analyze the performance relationship between cache and pipeline. The proposed model takes into account various kinds of architectural parameters such as instruction-level parallelism, branch probability, the accuracy of branch prediction, cache miss, and etc.. To prove the correctness of the model, we performed extensive simulations and compared the results with the analytic model. Simulation results showed that the proposed model can estimate the average execution rate accurately within 10% error compared to simulation results. The proposed model can explain the causes of performance bottleneck which cannot be uncovered by the simulation method only. The model is also able to show the effect of the cache miss on the performance of out-of-order issue superscalar processors, which can provide an valuable information in designing a balanced system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.8
• /
• pp.710-718
• /
• 1991

In this pape, an analysis approach for the performance of serial search burst-format direct sequence spread-spectrum code acquisiion system using matched filter is presented. And an acquistion system using analog matched filter is analyzed by this approach. And special consideration is focused on the effect of the code autocorelation sideobes. The basic idea of thi approach is the constuction of state tansition digram at the time of random packet arrival and the calculation of the packet loss probability, which is deveoped in terms of the following parameters: the false alarm probability. the etection probability, and the probability of receiver blocking obtained from the blocked customers cleae queeing system model. The analysis results reveal that the performance of the acquisition system is degraded by the effet of the code autocorrelation sidelobes above a certain value of SN/chip.

• Journal of Korea Spatial Information System Society
• /
• v.1 no.1 s.1
• /
• pp.29-37
• /
• 1999

Recently, brisk up the construction of the spatial information, many people highly concern to tile information circulation of GIS. Each system like GIS has a structure of the information circulation to itself. In this paper, we study on the performance evaluation method of tile structure which to circulate tile spatial information based on the internet. To do this, we hypothesize values of content and scale of the geo-spatial information on each internet network and volumes of the information to circulate between internet networks. Then we suggest a method to evaluate the performance of the structure to aid the circulation of spatial information based on queueing model. Henceforth, with the volumes of data stored and circulated information of each GIS, this method can help to design the structure to circulate the GIS information more efficiently.

• Journal of IKEEE
• /
• v.7 no.1 s.12
• /
• pp.97-106
• /
• 2003

In ARQ based error control, imperfect error detection leaves error remains on a packet. Aiming for a reduction of error remains in multicopy transmission ARQ system, we propose a rule of requesting a retransmission and deciding a correct copy, (identified as $(m, \;{\sigma})$rule). While the probability of error remains is reduced by the employment of the $(m, \;{\sigma})$ rule at multicopy transmission ARQ, delay and throughput performance may be degraded in comparison with those of conventional single copy transmission ARQ. Thus, we develop an analytical method to evaluate the performance trade-off in multicopy transmission ARQ following the $(m, \;{\sigma})$ rule. From the numerical results obtained by the analytical method, we investigate the effect of channel characteristics on the performance of error remains, packet loss, throughput, and packet delay, and confirm that the adaptability of the $(m, \;{\sigma})$ rule to conform to various QoS requirements with ease.