Wei Kuang Lai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wei Kuang Lai has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Chin-Shiuh Shieh
National Kaohsiung University of Science and Technology
8 shared publications - You-Chiun Wang
Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan
5 shared publications - Ting-Huan Kuo
Department of Computer Science and Engineering, National Sun Yat-sen University 70 Lienhai Rd.,Kaohsiung City, 80424 , Taiwan
3 shared publications - Chenn-Jung Huang
Department of Computer Science & Information Engineering, National Dong Hwa University, Hualien 974301, Taiwan
2 shared publications - Chih Kun Tai
Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan, ROC
2 shared publications - Chao-Ping Yang
Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan
1 shared publication
Latest Publications
- 14 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (13) , 11813-11824
Delay-Aware Container Scheduling in Kubernetes
Kubernetes is a powerful tool to manage containerized applications, which is also regarded as one promising platform to support microservices in edge computing. The scheduler is a key component of Kubernetes. It allocates each pod (i.e., a set of running containers) to one worker node (i.e., a machine). The default scheduler in Kubernetes is designed for the cloud environment containing homogeneous nodes. However, IoT edge nodes usually have various computing power and network bandwidth. This article proposes a delay-aware container scheduling (DACS) algorithm to address the issue of node heterogeneity in edge computing. To efficiently assign pods to worker nodes, DACS takes account of not only residual resources of worker nodes but also potential delays caused by the pod assignment. We build a Kubernetes cluster by VMware to evaluate system performance. Experimental results reveal that DACS can significantly reduce both processing and network delays, thereby helping Kubernetes perform more efficiently in an edge environment.
- 14 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (13) , 11813-11824
Delay-Aware Container Scheduling in Kubernetes
Kubernetes is a powerful tool to manage containerized applications, which is also regarded as one promising platform to support microservices in edge computing. The scheduler is a key component of Kubernetes. It allocates each pod (i.e., a set of running containers) to one worker node (i.e., a machine). The default scheduler in Kubernetes is designed for the cloud environment containing homogeneous nodes. However, IoT edge nodes usually have various computing power and network bandwidth. This article proposes a delay-aware container scheduling (DACS) algorithm to address the issue of node heterogeneity in edge computing. To efficiently assign pods to worker nodes, DACS takes account of not only residual resources of worker nodes but also potential delays caused by the pod assignment. We build a Kubernetes cluster by VMware to evaluate system performance. Experimental results reveal that DACS can significantly reduce both processing and network delays, thereby helping Kubernetes perform more efficiently in an edge environment.
- Open Access
Genetic Approach for Joint Transmission Grouping in Next-Generation Cellular Networks
Coordinated multipoint joint transmission (JT) is one of the critical downlink transmission technologies to improve network throughput. However, multiple cells in a JT group should have the same user data to transmit simultaneously, resulting in a considerable backhaul burden. Even when cells are already equipped with caches in fifth-generation networks, JT groups, without effectively utilizing the caching data, still cause unnecessary backhaul data traffic. In this article, we investigate the JT grouping problem with the consideration of caches at cells. Then, we propose a genetic approach to solve the above problem with the objective of minimizing the amount of backhaul data traffic subject to the data-rate requirement of each user. The simulation results show that our proposed generic algorithm can significantly decrease the backhaul bandwidth consumption compared to the two baselines.
Open AccessGenetic Approach for Joint Transmission Grouping in Next-Generation Cellular Networks
Coordinated multipoint joint transmission (JT) is one of the critical downlink transmission technologies to improve network throughput. However, multiple cells in a JT group should have the same user data to transmit simultaneously, resulting in a considerable backhaul burden. Even when cells are already equipped with caches in fifth-generation networks, JT groups, without effectively utilizing the caching data, still cause unnecessary backhaul data traffic. In this article, we investigate the JT grouping problem with the consideration of caches at cells. Then, we propose a genetic approach to solve the above problem with the objective of minimizing the amount of backhaul data traffic subject to the data-rate requirement of each user. The simulation results show that our proposed generic algorithm can significantly decrease the backhaul bandwidth consumption compared to the two baselines.
- Open Access
- 13 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (18) , 3321
A D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure Paths
The Device-to-Device (D2D) communication introduced in 3GPP’s Release 12 is a promising option for the accommodation of increasing traffic demand and the alleviation of core networks’ loading. The D2D communication mode prevails in scenarios where mobile users in proximity form a communication group sharing the same interest in digital content. A user can download intended content from peers in the same communication group rather than from the Internet via the base station. This article addresses the routing issue within D2D communication groups. It is, in effect, a path selection problem. We define a utility function considering both delay and throughput. The path selection problem can be formulated as an NP-hard optimization problem. A Bidirectional and InCremental A-star (BICA*) algorithm incorporating the concept of bidirectional search and lifelong planning is developed to tackle the NP-hard optimization problem. Simulations reveal that the proposed approach outperforms existing ones in terms of less delay, higher throughput, and higher satisfaction ratio. The Greedy approach, Two-Stage Relay Selection (TSRS), and the standard A* algorithm were included in the comparative study. The throughput improvements of the proposed scheme are up to 23% and 46.5% compared to TSRS and Greedy, respectively. The proposed scheme possesses the lowest delay and the highest satisfaction rate, among others. With less computational time, the proposed BICA* is more responsive than the standard A* in dynamic environments.
- 13 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (18) , 3321
Open AccessA D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure Paths
The Device-to-Device (D2D) communication introduced in 3GPP’s Release 12 is a promising option for the accommodation of increasing traffic demand and the alleviation of core networks’ loading. The D2D communication mode prevails in scenarios where mobile users in proximity form a communication group sharing the same interest in digital content. A user can download intended content from peers in the same communication group rather than from the Internet via the base station. This article addresses the routing issue within D2D communication groups. It is, in effect, a path selection problem. We define a utility function considering both delay and throughput. The path selection problem can be formulated as an NP-hard optimization problem. A Bidirectional and InCremental A-star (BICA*) algorithm incorporating the concept of bidirectional search and lifelong planning is developed to tackle the NP-hard optimization problem. Simulations reveal that the proposed approach outperforms existing ones in terms of less delay, higher throughput, and higher satisfaction ratio. The Greedy approach, Two-Stage Relay Selection (TSRS), and the standard A* algorithm were included in the comparative study. The throughput improvements of the proposed scheme are up to 23% and 46.5% compared to TSRS and Greedy, respectively. The proposed scheme possesses the lowest delay and the highest satisfaction rate, among others. With less computational time, the proposed BICA* is more responsive than the standard A* in dynamic environments.
- Open Access
Unlicensed Spectrum Allocation for LTE and Wi-Fi Coexistence with HAP
In order to accommodate the ever-increasing traffic demands, numerous approaches have been developed to improve spectrum utilization. Among others, the coexistence of LTE (Long-Term Evolution) and Wi-Fi, addressed by the 3GPP (3rd Generation Partnership Project) with hyper access points (HAPs) as bridges, is well recognized as a promising candidate solution. Aimed at improving the spectrum utilization of the unlicensed bands by following LTE-Unlicensed (LTE-U), this article contributes to the determination of the optimal time ratio, δ, for the time-division multiplexing of LTE and Wi-Fi over unlicensed bands. Symmetric allocation with a duty cycle of 50% cannot be an optimal option. Asymmetric allocation according to the quality of service (QoS) requirements and traffic demands should be considered. The problem is formulated as an optimization problem optimizing the total throughput. The lower and upper bounds of δ are obtained according to the QoS requirements of Wi-Fi and the admission control requirements of LTE. The detailed procedure for finding an adequate δ is developed and presented. A series of simulations are conducted to demonstrate the feasibility and effectiveness of the proposed approach. Simulation results show that the proposed approach improves the total throughput without compromising the fairness of Wi-Fi, as intended. Ten percent of improvement in throughput compared with LTE-U can be achieved.
Open AccessUnlicensed Spectrum Allocation for LTE and Wi-Fi Coexistence with HAP
In order to accommodate the ever-increasing traffic demands, numerous approaches have been developed to improve spectrum utilization. Among others, the coexistence of LTE (Long-Term Evolution) and Wi-Fi, addressed by the 3GPP (3rd Generation Partnership Project) with hyper access points (HAPs) as bridges, is well recognized as a promising candidate solution. Aimed at improving the spectrum utilization of the unlicensed bands by following LTE-Unlicensed (LTE-U), this article contributes to the determination of the optimal time ratio, δ, for the time-division multiplexing of LTE and Wi-Fi over unlicensed bands. Symmetric allocation with a duty cycle of 50% cannot be an optimal option. Asymmetric allocation according to the quality of service (QoS) requirements and traffic demands should be considered. The problem is formulated as an optimization problem optimizing the total throughput. The lower and upper bounds of δ are obtained according to the QoS requirements of Wi-Fi and the admission control requirements of LTE. The detailed procedure for finding an adequate δ is developed and presented. A series of simulations are conducted to demonstrate the feasibility and effectiveness of the proposed approach. Simulation results show that the proposed approach improves the total throughput without compromising the fairness of Wi-Fi, as intended. Ten percent of improvement in throughput compared with LTE-U can be achieved.
- Open Access
- 24 June 2022
- Published by MDPI AG in Electronics
- Vol. 11 (13) , 1977
Detection of Adversarial DDoS Attacks Using Symmetric Defense Generative Adversarial Networks
DDoS (distributed denial of service) attacks consist of a large number of compromised computer systems that launch joint attacks at a targeted victim, such as a server, website, or other network equipment, simultaneously. DDoS has become a widespread and severe threat to the integrity of computer networks. DDoS can lead to system paralysis, making it difficult to troubleshoot. As a critical component of the creation of an integrated defensive system, it is essential to detect DDoS attacks as early as possible. With the popularization of artificial intelligence, more and more researchers have applied machine learning (ML) and deep learning (DL) to the detection of DDoS attacks and have achieved satisfactory accomplishments. The complexity and sophistication of DDoS attacks have continuously increased and evolved since the first DDoS attack was reported in 1996. Regarding the headways in this problem, a new type of DDoS attack, named adversarial DDoS attack, is investigated in this study. The generating adversarial DDoS traffic is carried out using a symmetric generative adversarial network (GAN) architecture called CycleGAN to demonstrate the severe impact of adversarial DDoS attacks. Experiment results reveal that the synthesized attack can easily penetrate ML-based detection systems, including RF (random forest), KNN (k-nearest neighbor), SVM (support vector machine), and naïve Bayes. These alarming results intimate the urgent need for countermeasures against adversarial DDoS attacks. We present a novel DDoS detection framework that incorporates GAN with a symmetrically built generator and discriminator defense system (SDGAN) to deal with these problems. Both symmetric discriminators are intended to simultaneously identify adversarial DDoS traffic. As demonstrated by the experimental results, the suggested SDGAN can be an effective solution against adversarial DDoS attacks. We train SDGAN on adversarial DDoS data generated by CycleGAN and compare it to four previous machine learning-based detection systems. SDGAN outperformed the other machine learning models, with a TPR (true positive rate) of 87.2%, proving its protection ability. Additionally, a more comprehensive test was undertaken to evaluate SDGAN’s capacity to defend against unseen adversarial threats. SDGAN was evaluated using non-training data-generated adversarial traffic. SDGAN remained effective, with a TPR of around 70.9%, compared to RF’s 9.4%.
- 24 June 2022
- Published by MDPI AG in Electronics
- Vol. 11 (13) , 1977
Open AccessDetection of Adversarial DDoS Attacks Using Symmetric Defense Generative Adversarial Networks
DDoS (distributed denial of service) attacks consist of a large number of compromised computer systems that launch joint attacks at a targeted victim, such as a server, website, or other network equipment, simultaneously. DDoS has become a widespread and severe threat to the integrity of computer networks. DDoS can lead to system paralysis, making it difficult to troubleshoot. As a critical component of the creation of an integrated defensive system, it is essential to detect DDoS attacks as early as possible. With the popularization of artificial intelligence, more and more researchers have applied machine learning (ML) and deep learning (DL) to the detection of DDoS attacks and have achieved satisfactory accomplishments. The complexity and sophistication of DDoS attacks have continuously increased and evolved since the first DDoS attack was reported in 1996. Regarding the headways in this problem, a new type of DDoS attack, named adversarial DDoS attack, is investigated in this study. The generating adversarial DDoS traffic is carried out using a symmetric generative adversarial network (GAN) architecture called CycleGAN to demonstrate the severe impact of adversarial DDoS attacks. Experiment results reveal that the synthesized attack can easily penetrate ML-based detection systems, including RF (random forest), KNN (k-nearest neighbor), SVM (support vector machine), and naïve Bayes. These alarming results intimate the urgent need for countermeasures against adversarial DDoS attacks. We present a novel DDoS detection framework that incorporates GAN with a symmetrically built generator and discriminator defense system (SDGAN) to deal with these problems. Both symmetric discriminators are intended to simultaneously identify adversarial DDoS traffic. As demonstrated by the experimental results, the suggested SDGAN can be an effective solution against adversarial DDoS attacks. We train SDGAN on adversarial DDoS data generated by CycleGAN and compare it to four previous machine learning-based detection systems. SDGAN outperformed the other machine learning models, with a TPR (true positive rate) of 87.2%, proving its protection ability. Additionally, a more comprehensive test was undertaken to evaluate SDGAN’s capacity to defend against unseen adversarial threats. SDGAN was evaluated using non-training data-generated adversarial traffic. SDGAN remained effective, with a TPR of around 70.9%, compared to RF’s 9.4%.
- 28 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (2) , 1585-1597
TSSM: Time-Sharing Switch Migration to Balance Loads of Distributed SDN Controllers
Software-defined networking (SDN) makes network management easier by using a controller to govern all switches, but the controller may become a performance bottleneck. Distributed SDN control is a promising solution, which lets multiple controllers divide the work, where each controller manages a part of the network. Switch migration is one common means to the load balance of controllers, which transfers some switches to different subnets based on the workloads of their controllers. The paper proposes a time-sharing switch migration (TSSM) scheme to provide more refined load sharing for controllers, which allows two controllers to share a switch’s load sequentially in the same period. When a controller is overloaded, TSSM finds assistant controllers to share its workload by selecting proper switches for migration and also deciding the time to perform migration. In this way, the workload of each controller can be kept below a given threshold. We implement the TSSM scheme on the open network operating system (ONOS) to attest to its feasibility. Experimental results show that TSSM can reduce 98% of the occurrences of overload for controllers as compared with the original OpenFlow method. Moreover, TSSM can save about 78% of the migration cost than the churn-triggered migration method.
- 28 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (2) , 1585-1597
TSSM: Time-Sharing Switch Migration to Balance Loads of Distributed SDN Controllers
Software-defined networking (SDN) makes network management easier by using a controller to govern all switches, but the controller may become a performance bottleneck. Distributed SDN control is a promising solution, which lets multiple controllers divide the work, where each controller manages a part of the network. Switch migration is one common means to the load balance of controllers, which transfers some switches to different subnets based on the workloads of their controllers. The paper proposes a time-sharing switch migration (TSSM) scheme to provide more refined load sharing for controllers, which allows two controllers to share a switch’s load sequentially in the same period. When a controller is overloaded, TSSM finds assistant controllers to share its workload by selecting proper switches for migration and also deciding the time to perform migration. In this way, the workload of each controller can be kept below a given threshold. We implement the TSSM scheme on the open network operating system (ONOS) to attest to its feasibility. Experimental results show that TSSM can reduce 98% of the occurrences of overload for controllers as compared with the original OpenFlow method. Moreover, TSSM can save about 78% of the migration cost than the churn-triggered migration method.
- 5 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 16 (3) , 3488-3499
Joint Resource and Power Management for D2D Communication Across Multiple Service Providers
Device-to-device (D2D) communication broadens the applicability of cellular networks, which permits user equipments (UEs) to converse with each other without the relay by a base station (BS) . D2D pairs can reuse the spectrum resources allocated to cellular UEs but they would cause interference. How to well manage resources and transmitted power for UEs is critical. This article considers a radio access network (RAN) sharing scenario, where multiple service providers (SPs) collocate in the BS and have dedicated resources. To serve the maximum UEs, we propose a joint resource allocation and power control with RAN sharing (JAPS) scheme. Each SP allocates the dedicated resource to UEs and decides initial power to meet their signal-to-interference-plus-noise ratio (SINR) demands and restrain interference. Then, SPs can borrow resources from each other (i.e., inter-SP loan) to serve more UEs and better resource utilization. Finally, the power of senders is carefully adjusted to improve the signal quality. Simulation results show that JAPS can achieve a high service ratio, improve D2D throughput, and raise energy efficiency.
- 5 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 16 (3) , 3488-3499
Joint Resource and Power Management for D2D Communication Across Multiple Service Providers
Device-to-device (D2D) communication broadens the applicability of cellular networks, which permits user equipments (UEs) to converse with each other without the relay by a base station (BS) . D2D pairs can reuse the spectrum resources allocated to cellular UEs but they would cause interference. How to well manage resources and transmitted power for UEs is critical. This article considers a radio access network (RAN) sharing scenario, where multiple service providers (SPs) collocate in the BS and have dedicated resources. To serve the maximum UEs, we propose a joint resource allocation and power control with RAN sharing (JAPS) scheme. Each SP allocates the dedicated resource to UEs and decides initial power to meet their signal-to-interference-plus-noise ratio (SINR) demands and restrain interference. Then, SPs can borrow resources from each other (i.e., inter-SP loan) to serve more UEs and better resource utilization. Finally, the power of senders is carefully adjusted to improve the signal quality. Simulation results show that JAPS can achieve a high service ratio, improve D2D throughput, and raise energy efficiency.
- Open Access
- 13 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 141223-141232
Task Scheduling With Multicore Edge Computing in Dense Small Cell Networks
As a reaction and complement to cloud computing, edge computing is a computing paradigm designed for low-latency computing. Edge servers, deployed at the boundary of the Internet, bridge those distributed end devices and the centralized cloud server, forming a harmonic architecture with low latency and balanced loadings. Elaborated task scheduling, including task assignment and processor dispatching, is essential to the success of edge computing systems in dense small cell networks. Plenty of issues need to be considered, such as servers’ computing power, storage capacity, loadings, bandwidth and tasks’ sizes, delays, partitionability, etc. This study contributes to the task scheduling for multicore edge computing environments. We first show that this scheduling problem is an NP -hard problem. An efficient and effective heuristic is then proposed to tackle the problem. Our Multicore Task assignment for maximum Rewards (MAR) scheme differs from most previous schemes in jointly considering all three critical factors: namely task partitionability, multicore, and task properties. A task’s priority is decided by its cost function, which takes into account the task’s size, deadline, partitionability, cores’ loadings, processing power, and so forth. First, tasks from end devices are assigned to edge servers considering servers’ loadings and storage. Next, tasks are assigned to the cores of the selected server. Simulations compare the proposed scheme with First-Come-First-Serve (FCFS), Shortest Task First (STF), Delay Priority Scheduling (DPS), and Green Greedy Algorithm (GGA). Simulations demonstrate that the task completion ratio can be significantly increased, and the number of aborted tasks can be greatly reduced. Compared with FCFS (First-Come-First-Serve), STF (Shortest Task First), DPS (Delay Priority Scheduling), and GGA (Green Greedy Algorithm), the improvement in task completion ratio for hotspots is up to 26%, 25%, 22%, and 9%, respectively.
- 13 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 141223-141232
Open AccessTask Scheduling With Multicore Edge Computing in Dense Small Cell Networks
As a reaction and complement to cloud computing, edge computing is a computing paradigm designed for low-latency computing. Edge servers, deployed at the boundary of the Internet, bridge those distributed end devices and the centralized cloud server, forming a harmonic architecture with low latency and balanced loadings. Elaborated task scheduling, including task assignment and processor dispatching, is essential to the success of edge computing systems in dense small cell networks. Plenty of issues need to be considered, such as servers’ computing power, storage capacity, loadings, bandwidth and tasks’ sizes, delays, partitionability, etc. This study contributes to the task scheduling for multicore edge computing environments. We first show that this scheduling problem is an NP -hard problem. An efficient and effective heuristic is then proposed to tackle the problem. Our Multicore Task assignment for maximum Rewards (MAR) scheme differs from most previous schemes in jointly considering all three critical factors: namely task partitionability, multicore, and task properties. A task’s priority is decided by its cost function, which takes into account the task’s size, deadline, partitionability, cores’ loadings, processing power, and so forth. First, tasks from end devices are assigned to edge servers considering servers’ loadings and storage. Next, tasks are assigned to the cores of the selected server. Simulations compare the proposed scheme with First-Come-First-Serve (FCFS), Shortest Task First (STF), Delay Priority Scheduling (DPS), and Green Greedy Algorithm (GGA). Simulations demonstrate that the task completion ratio can be significantly increased, and the number of aborted tasks can be greatly reduced. Compared with FCFS (First-Come-First-Serve), STF (Shortest Task First), DPS (Delay Priority Scheduling), and GGA (Green Greedy Algorithm), the improvement in task completion ratio for hotspots is up to 26%, 25%, 22%, and 9%, respectively.
- Open Access
- 24 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 212608-212622
Probabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks
A flooding algorithm aims to distribute messages to all nodes within the mobile environment. In a simple flooding scheme, every node broadcasts a newly received message. However, this simple mechanism generates massive redundant messages, which is referred to as the broadcast storm problem. To ease the negative effect of the broadcast storm problem, we proposed a novel scheme, Probabilistic Second-chance broadcasting with/without Global positioning system information (PSG) in wireless ad hoc networks, which amalgamates the merits of probability-based and location-based flooding algorithms. PSG eases the broadcast storm problem by reducing the total number of transmissions and does not require hello messages from neighboring nodes, yet achieves better results than Multipoint Relaying Flooding (MPR), a neighbor-knowledge-based flooding scheme, by accurately determining whether subsequent forwarding is advantageous while a node receives a broadcasting message. We also discuss the advantages of a two-phase/second-time algorithm and utilize a simplified topology to further explain and demonstrate the merits of second-time broadcasting. We compare our PSG scheme with the simple flooding scheme, the probabilistic schemes with different preassigned probabilities, and the MPR schemes with or without the overhead of hello messages. The simulation results show that our scheme demands fewer forwarding nodes to rebroadcast messages and therefore lowers the total number of transmissions. PSG scales down a large number of collisions and attains high delivery ratios compared to other flooding algorithms.
- 24 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 212608-212622
Open AccessProbabilistic Second-Chance Broadcasting With/Without Global Positioning System Information in Wireless Ad Hoc Networks
A flooding algorithm aims to distribute messages to all nodes within the mobile environment. In a simple flooding scheme, every node broadcasts a newly received message. However, this simple mechanism generates massive redundant messages, which is referred to as the broadcast storm problem. To ease the negative effect of the broadcast storm problem, we proposed a novel scheme, Probabilistic Second-chance broadcasting with/without Global positioning system information (PSG) in wireless ad hoc networks, which amalgamates the merits of probability-based and location-based flooding algorithms. PSG eases the broadcast storm problem by reducing the total number of transmissions and does not require hello messages from neighboring nodes, yet achieves better results than Multipoint Relaying Flooding (MPR), a neighbor-knowledge-based flooding scheme, by accurately determining whether subsequent forwarding is advantageous while a node receives a broadcasting message. We also discuss the advantages of a two-phase/second-time algorithm and utilize a simplified topology to further explain and demonstrate the merits of second-time broadcasting. We compare our PSG scheme with the simple flooding scheme, the probabilistic schemes with different preassigned probabilities, and the MPR schemes with or without the overhead of hello messages. The simulation results show that our scheme demands fewer forwarding nodes to rebroadcast messages and therefore lowers the total number of transmissions. PSG scales down a large number of collisions and attains high delivery ratios compared to other flooding algorithms.
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (2) , 1016-1029
Efficient Scheduling, Caching, and Merging of Notifications to Save Message Costs in IoT Networks Using CoAP
IoT devices are widely deployed and many of them have limited capabilities. CoAP (constrained application protocol) is developed to integrate such devices into the web environment. Specifically, client devices register their interested data with IoT devices, which will keep notifying them of the status of sensing data. However, client devices have different demands in terms of minimum and maximum periods to receive notifications, whereas IoT devices usually offer notifications at regular intervals. Some IoT devices would send much more notifications than necessary, which wastes bandwidth and energy. To conquer this problem, the paper proposes a group-based message management (GMM) framework for CoAP proxies to efficiently coordinate the sending of notifications from IoT devices and forward them to client devices. GMM curtails superfluous notifications by three modules. The scheduling module groups client devices based on their demands, and finds an optimal observation period for each group. The caching module adjusts the Max-Age value to allow a proxy reusing its cached notifications to answer requests. The merging module combines the notifications originated from different IoT devices queried by the same client device, so as to save bandwidth. Simulation results show that GMM not only reduces unnecessary notifications but also conserves energy of devices.
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (2) , 1016-1029
Efficient Scheduling, Caching, and Merging of Notifications to Save Message Costs in IoT Networks Using CoAP
IoT devices are widely deployed and many of them have limited capabilities. CoAP (constrained application protocol) is developed to integrate such devices into the web environment. Specifically, client devices register their interested data with IoT devices, which will keep notifying them of the status of sensing data. However, client devices have different demands in terms of minimum and maximum periods to receive notifications, whereas IoT devices usually offer notifications at regular intervals. Some IoT devices would send much more notifications than necessary, which wastes bandwidth and energy. To conquer this problem, the paper proposes a group-based message management (GMM) framework for CoAP proxies to efficiently coordinate the sending of notifications from IoT devices and forward them to client devices. GMM curtails superfluous notifications by three modules. The scheduling module groups client devices based on their demands, and finds an optimal observation period for each group. The caching module adjusts the Max-Age value to allow a proxy reusing its cached notifications to answer requests. The merging module combines the notifications originated from different IoT devices queried by the same client device, so as to save bandwidth. Simulation results show that GMM not only reduces unnecessary notifications but also conserves energy of devices.