Chanwit Suwannapong

Mr. Chanwit Suwannapong

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 August 2019 in Sensors
Verified
Journal Article
Open access
CSChanwit Suwannapong
Chanwit Suwannapong
CKchatchai khunboa
chatchai khunboa
The Constrained Application Protocol (CoAP) is a simple and lightweight machine-to-machine (M2M) protocol for constrained devices for use in lossy networks which offers a small memory capacity and limited processing. Designed and developed by the Internet Engineering Task Force (IETF), it functions as an application layer protocol and benefits from reliable delivery and simple congestion control. It is implemented for request/response message exchanges over the User Datagram Protocol (UDP) to support the Internet of Things (IoT). CoAP also provides a basic congestion control mechanism. In dealing with its own congestion, it relies on a fixed interval retransmission timeout (RTO) and binary exponential backoff (BEB). However, the default CoAP congestion control is considered to be unable to effectively perform group communication and observe resources, and it cannot handle rapid, frequent requests. This results in buffer overflow and packet loss. To overcome these problems, we proposed a new congestion control mechanism for CoAP Observe Group Communication, namely Congestion Control Random Early Detection (CoCo-RED), consisting of (1) determining and calculating an RTO timer, (2) a Revised Random Early Detection (RevRED) algorithm which has recently been developed and primarily based on the buffer management of TCP congestion control, and (3) a Fibonacci Pre-Increment Backoff (FPB) algorithm which waits for backoff time prior to retransmission. All the aforementioned algorithms were therefore implemented instead of the default CoAP mechanism. In this study, evaluations were carried out regarding the efficiency of the developed CoCo-RED using a Cooja simulator. The congestion control mechanism can quickly handle the changing behaviors of network communication, and thus it prevents the buffer overflow that leads to congestions. The results of our experiments indicate that CoCo-RED can control congestion more effectively than the default CoAP in every condition.

1 June 2019 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
CSChanwit Suwannapong
Chanwit Suwannapong
CKChatchai Khunboa
Chatchai Khunboa
This research presents a way to avoid network congestion during unicast CoAP-based group communication using increased delays between consecutive requests (DCR) in LoWPAN border routers to limit request send rates. It also provides a way to determine DCR values that are suitable for various network group sizes with differing node counts. The optimal DCR is obtained using the least squares approximation method and the relative minimum. Results from experimentation shows a positive relation, that is, an increase in group size necessitates an increase in DCR value. Experiments in various group sizes show favorable network performance and support the proposed congestion control method using DCR.

25 December 2024 in Electronics
Verified
Journal Article
Open access
PDF file
CSChanwit Suwannapong
Chanwit Suwannapong
SASarutte Atsawaraungsuk
Sarutte Atsawaraungsuk
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
Pitsanu ChaichitwanidchakolPitsanu Chaichitwanidchakol
Pitsanu Chaichitwanidchakol
The rapid growth of the Internet of Things (IoT) has contributed to significant challenges in dealing with congestion within IoT communications due to high packet error rates, latency, and interference in networks. With an emphasis on the Constrained Application Protocol (CoAP), the present study aims to propose the design and development of a novel congestion control mechanism, namely, Fast Response Congestion Control—Random Early Detection, abbreviated as FaCoCo-RED, along with performance analysis and comparison of congestion management efficacy between FaCoCo-RED and Default CoAP Congestion Control (Default CoAP CC) under a Cooja simulator on the Contiki OS platform. The findings from both experiment and performance analysis, which were based on statistical testing, showed that, under medium-scale to large-scale node networks across all traffic scenarios in this study, FaCoCo-RED significantly outperformed Default CoAP CC. The improvement can be seen in such metrics as average throughput, packet loss, response time, settling time, and retransmission timeout values (RTOs). The experimental findings also showed that FaCoCo-RED can perform effectively within the IoT networks, thus potentially enhancing the reliability and scalability of CoAP for large-scale and more complex IoT applications in the future.

15 August 2026 in Electronics
Verified
Journal Article
Open access
PDF file
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee
CSChanwit Suwannapong
Chanwit Suwannapong
SASarutte Atsawaraungsuk
Sarutte Atsawaraungsuk
CSChalida Sanemueang
Chalida Sanemueang
TCThipwimon Chompookham
Thipwimon Chompookham
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
Polynomial multiplication is the main operation in lattice-based cryptography. Modular reduction is required to maintain the correctness within finite rings. In this study, the application of lazy reduction is chosen to reduce the frequency of modular operations in the LightSaber cryptosystem. Four polynomial multiplication algorithms, including Schoolbook, Karatsuba (128 and 64 splits), and Toom-3, are evaluated under both conventional and lazy reduction settings within the same polynomial ring domain. The experimental results show that lazy reduction reduces execution time across all evaluated algorithms. The reductions range from 44.52% to 59.15%. When the number of modular reduction operations is considered, they are reduced by more than 99% for Schoolbook and Karatsuba-based methods, and by 57.14% for Toom-3. Under lazy reduction, the number of modular reductions becomes identical across all algorithms. Among the evaluated coefficient-domain methods, Toom-3 achieved the lowest execution time. Karatsuba-based methods provide a more balanced trade-off between performance, memory usage, and structural complexity. This study further examines coefficient growth and evaluates the risk of overflow to ensure numerical reliability. All intermediate values remain within the range of signed 32-bit integers. Furthermore, lazy reduction leads to an increase in peak memory usage across all algorithms, with the most significant increase observed in Schoolbook, while more advanced methods exhibit only modest growth. Since this study focuses on coefficient-domain polynomial multiplication, transform-based approaches such as the Number Theoretic Transform (NTT) are beyond the scope of this work. NTT operates in a different computational domain and involves distinct implementation trade-offs. Accordingly, the reported performance comparisons are restricted to the coefficient-domain methods evaluated in this study. In addition, hardware-specific evaluations are beyond the scope of this work, because the primary objective is to provide an algorithm-level analysis of computational efficiency, modular reduction behavior, and numerical safety under controlled conditions. Under the evaluated Python implementation and the LightSaber parameter configuration, the results show that lazy reduction is an effective technique for reducing computational overhead in coefficient-domain polynomial multiplication. The observed performance remains dependent on the structural characteristics of each multiplication algorithm.

1 January 2024 in Journal of Interdisciplinary Mathematics
Verified
Journal Article
Closed access
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
CSChalida Sanemueang
Chalida Sanemueang
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee
CSChanwit Suwannapong
Chanwit Suwannapong
SASarutte Atsawaraungsuk
Sarutte Atsawaraungsuk
In this research, a new technique based on quantum key distribution (QKD) is described to lower the likelihood that eavesdroppers can intercept two-party communications without being detected by the sender and the recipient. The central idea is to enhance BB84 by increasing two quantum gates, Pauli-X gate and Pauli-Z gate, on both the sender and receiver sides to change the direction of each quantum state. This signifies that three control parameters must be specified to control three gates on both sides, excluding the control parameter for the quantum gate that generates a random bit on the sender side. In fact, the possibility that eavesdroppers may discreetly capture the information is 0.5 for nearly all methods. However, the probability of information captured by an eavesdropper decreases to 0.25 when all conceivable cases from Tables 1 through 7 are considered. Therefore, the proposed technique for exchanging the secret key is more secure and should be chosen for the implementation.