• 한국군사과학기술학회지
• /
• 제24권1호
• /
• pp.115-122
• /
• 2021

In this paper, we propose a dynamic slot allocation scheme to improve the slot utilization rate in tactical multi-hop networks in which the channel condition varies due to node movements. The proposed scheme takes advantage of the fact that nodes that are more than three hops apart can use the same slot simultaneously. The frame is divided into two parts: the control period and the data period. To know the available slot information within two-hop distance, the node exchanges a slot allocation information with one-hop neighbors during the control period. The node can get the information on idle slots that are not used within two-hop distance but assigned already to other nodes that are more than three-hop away. The identified idle slot can be used by the node, which increases the slot utilization rate. The performance analysis results of the proposed scheme show that it increases the slot utilization rate sufficiently despite the overhead of the control period in the multi-hop networks of the future soldier system.

• ETRI Journal
• /
• 제30권2호
• /
• pp.282-289
• /
• 2008

We propose a new mini-slot transmission scheme for a passive optical network (PON) in which each customer can be switched either to access mode or to internetworking mode dynamically. In this paper, we present the system implementation (called LAN-PON) as well as the performance of the proposed transmission scheme to illustrate its feasibility and benefits. A mini-slot scheme can rapidly reduce the queuing delay, which increases due to the flooding of the deflected packets in a deflection scheme. We evaluate the impact of mode switching time on the bandwidth gain (throughput) and delay of local area network (LAN) traffic in the LAN-PON with a mini-slot scheme. We also analyze a theoretical delay model of the proposed scheme. The simulation results demonstrate that switching time has an impact on LAN performance, and the average packet delay of the proposed scheme is significantly improved compared to that of the deflection scheme.

• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.172-176
• /
• 2011

In the Gen-2 Q-algorithm, the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not optimized in the standard. However, the standard suggests that the reader uses small values of C when the slot-count is large and larger values of C when the slot-count is small. In this case, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round. Through various computer simulations, it is demonstrated that the proposed scheme achieves more stable performances than Gen-2 Q-algorithm.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 가을 학술발표논문집 Vol.28 No.2 (3)
• /
• pp.160-162
• /
• 2001

Cyclic-Reservation Multiple-Access(CRMA) is an access scheme for high-speed local and metropolitan area networks based on folded-bus or dual-bus configurations. CRMA provides high throughput and fairness independent of the network speed or distance. This paper describes a simulation-based quantitative analysis of the performance gains obtained by introducing slot reuse in CRMA. Generally, a longer cycle length means a longer access delay and a lower throughput. There-fore, it is desirable to develop a scheme such that the cycle length is the shortest. In this paper, we will study the problem of reducing the total number of empty slots generated within every cycle. However, it has been shown that the problem is NP-complete under the constraint that all empty slots used by a station in a cycle are required to be consecutive. We present the algorithm that improves previous novel approach by using previous node information. We compare our slots reuse scheme with several slot reuse algorithms such as region scheme (FMR), address schemes, novel approach in terms of the following two important performance criteria: average cycle length and average slot utilization ratio. As compared with the one proposed in novel algorithm, the new scheme makes the cycle length much shorter. Besides, the resulting slot utilization and the access delay are better than those of the other two schemes.

• 한국통신학회논문지
• /
• 제39C권4호
• /
• pp.351-361
• /
• 2014

무선 센서네트워크의 데이터 전송을 위해서 각 노드는 백오프(Back-off)기법을 이용하여 이웃노드와 채널을 경쟁한다. 수중음향 센서네트워크에서도 일반적으로 백오프를 이용하여 노드 간 채널을 경쟁한다. 그러나 수중음향 센서네트워크의 백오프에 이용되는 슬롯타임(Slot-time)은 무선 센서네트워크와는 달리 매우 긴 지연시간을 갖는다. 따라서, 수중음향 센서네트워크에서는 긴 슬롯타임에 의해 각 노드간의 통신성능 저하 문제가 발생한다. 본 논문에서 제안하는 기법은 실제 노드가 배치된 상태를 이웃 노드와의 전파지연 시간을 이용하여 계산하고, 슬롯타임을 노드 스스로 최적화한다. 이러한 방법을 통해 각 노드들 간의 통신에 낭비되는 시간을 줄이고 네트워크 성능을 향상 시킨다. 본 논문에서는 제안하는 기법을 구체적으로 기술하고 제안하는 기법과 기존의 연구와의 성능차를 확인한다. 성능 비교결과 제안하는 기법이 기존의 기법에 비하여 우수한 성능을 갖는 것을 확인 하였다.

• 한국정보통신학회논문지
• /
• 제23권2호
• /
• pp.156-164
• /
• 2019

본 논문에서는 네트워크가 수시로 결합, 분리되는 군집 드론 네트워크를 위한 효과적인 동적 슬롯 재할당 기법을 제안한다. 네트워크별 리더 노드는 드론들간의 주기적인 정보교환을 통해 이웃 네트워크의 슬롯할당정보를 파악한다. 해당 정보를 이용하여 리더 노드는 네트워크가 결합되는 경우, 경쟁방식을 적용했을 때의 슬롯할당 성공확률을 기준으로 경쟁 또는 비경쟁방식으로 슬롯을 재할당한다. 제안하는 기법에서 비경쟁방식으로 슬롯을 재할당하면 충돌없이 슬롯을 재할당하며 네트워크 규모와 무관하게 항상 동일한 성능을 보장할 수 있다. 그리고 경쟁방식을 적용하면 네트워크 결합에 의해 재할당해야하는 슬롯의 개수를 최소화할 수 있다. 실험을 통해 제안하는 기법이 동적인 군집 드론 네트워크에서 경쟁 방식에 비해 항상 우수하거나 최소한 동일한 성능을 보임을 확인한다.

• 경영과학
• /
• 제10권1호
• /
• pp.127-137
• /
• 1993

The blocking probabilities of nx64Kb/s multi-slot calls are generally much higher than that of single slot calls. In order to improve these blocking probabilities of multi-slot calls, we propose a scheme which searches the different numbers of time slots for different types of calls. We analyze the performance of our scheme in a double-buffered time-space-time switching network which accommodates multi-slot calls as well as single-slot calls. The proposed method yields the reduced blocking probabilities, the increased traffic handling capacity and teh reduced CPU processing load, compared with those of the conventional methods.

• Wind and Structures
• /
• 제12권1호
• /
• pp.1-19
• /
• 2009

In this paper, the airflow around an ideal thin plate (hereafter referred to as ITP) with various ratios of central slot is simulated by using the finite-difference-method (FDM)-based Arbitrary-Lagrangian-Eulerian descriptions for the rigid oscillating body. The numerical procedure employs the second-order projection scheme to decouple the governing equations, and the multigrid algorithm with three levels to improve the computational efficiency in evaluating of the pressure equation. The present CFD method is validated through comparing the computed flutter derivatives of the ITP without slot to Theodorsen analytical solutions. Then, the unsteady aerodynamics of the ITP with and without central slot is investigated. It is found that even a smaller ratio of central slot of the ITP has notable effects on pressure distributions of the downstream section, and the pressure distributions on the downstream section will further be significantly affected by the slot ratio and the reduced wind speeds. Continuous increase of $A_2^*$ with the increase of central slot may be the key feature of the slotted ITP. Finally, flutter analyses based on the flutter derivatives of the slotted ITP are performed, and moreover, flutter instabilities of a scaled sectional model of a twin-deck bridge with various ratios of deck slot are investigated. The results confirm that the central slot is effective to improve bridge flutter stabilities, and that the flutter critical wind speeds increase with the increase of slot ratio.

• Journal of information and communication convergence engineering
• /
• 제8권5호
• /
• pp.519-523
• /
• 2010

In Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter of Q-algorithm, is not defined in the standard. In this case, if the number of tags within the reader's identification range is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation before the query round begins. Through computer simulations, it is demonstrated that the proposed scheme achieves more stable performance than Gen-2 Q-algorithm.

• 한국통신학회논문지
• /
• 제40권10호
• /
• pp.1889-1899
• /
• 2015

본 논문은 위성 랜덤 액세스 채널에서 데이터의 신속한 전송을 위한 다중 슬롯 예약 기법을 제안한다. R-CRDSA(Reservation scheme with Contention Resolution Diversity Slotted ALOHA)에서는 각 단말이 하나의 프레임에서 하나의 슬롯만을 예약하여 사용하기 때문에 트래픽 부하가 낮은 상황에서 많은 슬롯이 낭비되는 문제가 발생하고, 상대적으로 크기가 큰 데이터를 전송하려는 위성 단말은 사용되지 않는 슬롯이 있다고 하더라도 여러 개의 프레임을 사용하여 데이터를 전송하기 때문에 지연시간이 증가한다. 본 논문에서 제안하는 다중 슬롯 예약 기법에서 각 단말은 자신의 패킷과 함께 데이터의 크기를 함께 전송하며 각 단말에서 발생한 데이터의 크기와 슬롯 예약 상태를 고려하여 다수의 슬롯을 예약하여 데이터를 전송한다. 따라서 각 위성단말은 다수의 슬롯을 예약하여 데이터를 전송하기 때문에 기존 슬롯 예약 기반의 위성 랜덤액세스기법에 비해 적은 수의 프레임을 사용하여 자신의 데이터를 전송할 수 있다. 또한 본 논문은 모의실험을 통해 기존 슬롯 예약 기반의 위성 랜덤 액세스 기법 대비 제안 기법의 성능 향상을 확인하였다.