• 한국정보통신학회논문지
• /
• 제25권9호
• /
• pp.1267-1270
• /
• 2021

In this paper, we propose a distributed routing algorithm for mobile ad hoc networks (MANET) where mobile devices can be utilized as relays for communication between remote source-destination nodes. The objective of the proposed algorithm is to minimize the end-to-end communication delay caused by transmission failure with deep channel fading. In each hop, the node needs to select the next relaying node by considering a tradeoff relationship between the link stability and forward link distance. Based on such feature, we formulate the problem with partially observable Markov decision process (MDP) and apply deep reinforcement learning to derive effective routing strategy for the formulated MDP. Simulation results show that the proposed algorithm outperforms other baseline schemes in terms of the average end-to-end delay.

• 한국정보통신학회논문지
• /
• 제25권12호
• /
• pp.1960-1963
• /
• 2021

In this paper, we propose a multiplay Thompson sampling algorithm in multipath communication system. Multipath communication system has advantages on communication capacity, robustness, survivability, and so on. It is important to select appropriate network path according to the status of individual path. However, it is hard to obtain the information of path quality simultaneously. To solve this issue, we propose Thompson sampling which is popular in machine learning area. We find some issues when the algorithm is applied directly in the proposal system and suggested some modifications. Through simulation, we verified the proposed algorithm can utilize the entire network paths. In summary, our proposed algorithm can be applied as a path allocation in multipath-based communications system.

• ETRI Journal
• /
• 제28권5호
• /
• pp.676-679
• /
• 2006

In this letter, we propose an adaptive hard handoff algorithm with a dynamic hysteresis value based on the received signal strength from the serving base station, for mobile cellular communication systems. A discrete-time method is presented to evaluate handoff algorithms analytically. Performance is evaluated in terms of the average number of handoffs, the probability of link degradation, and the average handoff delay. Numerical results and simulations demonstrate that the proposed algorithm outperforms the handoff algorithm with fixed hysteresis values and the handoff algorithm using both threshold and hysteresis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.3040-3053
• /
• 2015

Wideband code division multiple access (WCDMA), high speed packet access (HSPA) and HSPA+ are third generation partnership project (3GPP) standards. These systems are the major wireless communication standards. In order to test the performance of WCDMA/HSPA/HSPA+ signal in a base station, the measurement hardware is required to the evaluation of the transmitted signals. In this paper, the algorithm for the performance measurement of the WCDMA/HSPA/HSPA+ is proposed. Also, the performance of the measurement algorithm is used to evaluate the generated signal by the WCDMA/HSPA/HSPA+ signal generator. Generally, the algorithm of normal modems cannot be applied to the measurement system because the signal measurement equipment needs to guarantee the high accuracy. So, the WCDMA/HSPA/HSPA+ signal measurement algorithm for the accurate measurement is proposed. By the simulation, it is confirmed that the proposed measurement algorithm has good performance compared with the specification. Therefore, the proposed algorithm can be usefully applied to verify the performance of the measurement using the simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3572-3593
• /
• 2015

This article investigates the topology control problem in the space information network (SIN) using a hierarchical autonomous system (AS) approach. We propose an AS network topology control (AS-TC) algorithm to minimize the time delay in the SIN. Compared with most existing approaches for SIN where either the purely centralized or the purely distributed control method is adopted, the proposed algorithm is a hybrid control method. In order to reduce the cost of control, the control message exchange is constrained among neighboring sub-AS networks. We prove that the proposed algorithm achieve logical k-connectivity on the condition that the original physical topology is k-connectivity. Simulation results validate the theoretic analysis and effectiveness of the AS-TC algorithm.

• Journal of Information Processing Systems
• /
• 제15권4호
• /
• pp.890-903
• /
• 2019

The single carrier frequency domain equalization (SC-FDE) technology is an important part of the broadband wireless access communication system, which can effectively combat the frequency selective fading in the wireless channel. In SC-FDE communication system, the accuracy of timing synchronization directly affects the performance of the SC-FDE system. In this paper, on the basis of Schmidl timing synchronization algorithm a timing synchronization algorithm suitable for FPGA (field programmable gate array) implementation is proposed. In the FPGA implementation of the timing synchronization algorithm, the sliding window accumulation, quantization processing and amplitude reduction techniques are adopted to reduce the complexity in the implementation of FPGA. The simulation results show that the algorithm can effectively realize the timing synchronization function under the condition of reducing computational complexity and hardware overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권5호
• /
• pp.1412-1430
• /
• 2024

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs. Although it can achieve better decoding performance than SCAN algorithm, it has high latency. In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed. In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first. Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward. The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further. Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency. Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.81-82
• /
• 2006

Most work on cooperative diversity has assumed that the cooperating group (source and partners) and the associated average channel conditions between terminals (source, partners, and destination) are predetermined. In practical situations, however, it is important to develop the efficient algorithms for assigning the terminals with good inter-user channels for cooperating groups. In this paper, we propose the partner assignment algorithm for cooperative diversity in mobile communication systems. The proposed partner assignment algorithm is investigated by using the path loss model for mobile communication systems. Numerical results show that the proposed partner assignment algorithm provides the comparable probability of cooperative transmission to the partner assignment algorithm using exhaustive search. The probability of cooperative transmission increases with the number of users, which gives potential benefits of practical implementation to user cooperation in mobile communication systems.

• 전력전자학회논문지
• /
• 제16권1호
• /
• pp.50-57
• /
• 2011

본 논문에서는 마이컴(ATmega-2560) 기반의 디지털 통신 방식을 이용한 새로운 부하분담(Load-sharing) 알고리즘(Algorithm)을 제안한다. 기존의 아날로그 방식과 달리 고속 통신과 디지털 제어를 수행하고 실시간 제어를 위한 시분할 토큰버스 방식을 적용함으로서 효율적인 부하분담 및 리던던시(Redundancy)를 구현하였다. 또한 자동 ID 설정 알고리즘을 적용함으로서 시스템 비용을 낮추었으며, 제어기의 전압 및 전류 적분값을 공유하는 새로운 알고리즘으로 시스템의 속응성을 향상시켰다. 제작된 병렬 시스템은 각 모듈마다 독립된 제어기가 구성되어 있으며, 마스터(Master) 모듈의 지령치에 따라 슬레이브(Slave) 모듈이 부하분담을 수행한다. 본 논문에서는 PSIM을 통한 시뮬레이션과 시작품 제작을 통해 제안된 알고리즘의 타당성을 검증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6063-6079
• /
• 2019

When the length of sampling data sequence is too large, the method of gesture recognition based on traditional Dynamic Time Warping (DTW) algorithm will lead to too long calculation time, and the accuracy of recognition result is not high.Support vector machine (SVM) has some shortcomings in precision, Edit Distance on Real Sequences(EDR) algorithm does not guarantee that noise suppression will not suppress effective data.A new method based on Improved Interpolation Dynamic Time Warping (IIDTW)algorithm is proposed to improve the efficiency of gesture recognition and the accuracy of gesture recognition. The results show that the computational efficiency of IIDTW algorithm is more than twice that of SVM-DTW algorithm, the error acceptance rate is FAR reduced by 0.01%, and the error rejection rate FRR is reduced by 0.5%.Gesture recognition based on IIDTW algorithm can achieve better recognition status. If it is applied to unlock mobile phone, it is expected to become a new generation of unlock mode.