• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.53-63
• /
• 2022

In the paper, we propose a TSCH-based scheduling scheme for IEEE 802.15.4e, which is able to perform the scheduling of its own network by avoiding collision from interference network cluster (INC). Firstly, we model a bipartite graph structure for presenting the slot-frame (channel-slot assignment) of TSCH. Then, based on the bipartite graph edge weight, we utilize the Hungarian assignment algorithm to implement a scheduling scheme. We have employed two features (maximization and minimization) of the Hungarian-based assignment algorithm, which can perform the assignment in terms of minimizing the throughput of INC and maximizing the throughput of own network. Further, in this work, we called the scheme "dual-stage Hungarian-based assignment algorithm". Furthermore, we also propose deep learning (DL) based deep neural network (DNN)scheme, where the data were generated by the dual-stage Hungarian-based assignment algorithm. The performance of the DNN scheme is evaluated by simulations. The simulation results prove that the proposed DNN scheme providessimilar performance to the dual-stage Hungarian-based assignment algorithm while providing a low execution time.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1261-1270
• /
• 2020

The physical security layer of industrial wireless sensor networks in the event of an eavesdropping attack has been investigated in this paper. An optimal sensor selection scheme based on the maximum channel capacity is proposed for transmission environments that experience Nakagami fading. Comparing the intercept probabilities of the traditional round robin (TRR) and optimal sensor selection schemes, the system secure performance is analyzed. Simulation results show that the change in the number of sensors and the eavesdropping ratio affect the convergence rate of the intercept probability. Additionally, the proposed optimal selection scheme has a faster convergence rate compared to the TRR scheduling scheme for the same eavesdropping ratio and number of sensors. This observation is also valid when the Nakagami channel is simplified to a Rayleigh channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1238-1246
• /
• 2000

In a multi-channel network based on wavelength division multiplexing (WDM), an efficient protocol is needed for transmitter and receiver to be tuned to same wavelength during message transmission time. This paper proposes a message scheduling protocol that can efficiently support variable-sized messages, where tunable transceiver has nonzero tuning time. In this protocol, once a node reserves one data channel, it can persistently use the reserved channel till message transmission is finished. Therefore, overhead due to tuning time of the tunable transceiver can be reduced. Moreover, the protocol does not require any global information. Therefore, it can operate independently of the change of the number of nodes, and any new node can join the network at anytime without requiring network initialization. With this protocol, one can avoid data channel and destination conflicts. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.24-33
• /
• 2007

In this paper, two different dynamic cell coordination strategies for frequency flat and selective fading are proposed for efficient subcarrier allocation in the joint consideration of adaptive modulation and variable frequency reuse in the channel-aware OFDMA downlink multicellular environment. Compared to a conventional OFDMA system without cell coordination, where system throughput may become degraded due to the persistent interference from other cells, the proposed system dynamically allows RNC to apply different reuse factors on each subchannel and scheduling in consideration of channel and interference conditions of individual users so as to increase the system throughput and guarantee QoS of each user. In a frequency flat fading, the dynamic scheme with the proposed scheduling achieves on average three times larger throughput than the conventional dynamic scheme [8]. In a selective fading channel, the proposed schemes showed 2.6 times as large throughput as that of a single reuse factor of one for all subchannels.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.439-439
• /
• 2004

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.778-798
• /
• 2014

This paper proposes a novel exposed-terminal-eliminated medium access control (ETE-MAC) protocol by combining channel reservation, collision avoidance and concurrent transmissions to improve multi-access performance of the multihop wireless networks. Based on the proposed slot scheduling scheme, each node senses the control channel (CCH) or the data channel (DCH) to accurately determine whether it can send or receive the corresponding packets without collisions. Slot reservation on the CCH can be simultaneously executed with data packet transmissions on the DCH. Therefore, it resolves the hidden-terminal type and the exposed-terminal type problems efficiently, and obtains more spatial reuse of channel resources. Concurrent packet transmissions without extra network overheads are maximized. An analytical model combining Markov model and M/G/1 queuing theory is proposed to analyze its performance. The performance comparison between analysis and simulation shows that the analytical model is highly accurate. Finally, simulation results show that, the proposed protocol obviously outperforms the link-directionality-based dual-channel MAC protocol (DCP) and WiFlex in terms of the network throughput and the average packet delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1037-1043
• /
• 2006

There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.7
• /
• pp.23-31
• /
• 2012

Resource allocation, such as joint rate control and scheduling, is an important issue in cognitive radio networks. However, it is difficult to jointly consider the rate control and scheduling problem due to the stochastic behavior of channel availability in cognitive radio networks. In this paper, we propose an asymmetric joint rate control and scheduling technique under reliability constraints in cognitive radio networks. The joint rate control and scheduling problem is formulated as a convex optimization problem and substantially decomposed into several sub-problems using a dual decomposition method. An algorithm for secondary users to locally update their rate that maximizes the utility of the overall system is also proposed. The results of simulations revealed that the proposed algorithm converges to a globally optimal solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4044-4062
• /
• 2016

We investigate the optimization of energy consumption in Mobile Cloud environment in this paper. In order to optimize the energy consumed by the CPUs in mobile devices, we put forward using the asymptotic time complexity (ATC) method to distinguish the computational complexities of the applications when they are executed in mobile devices. We propose a multi-scale scheme to quantize the channel gain and provide an improved dynamic transmission scheduling algorithm when offloading the applications to the cloud center, which has been proved to be helpful for reducing the mobile devices energy consumption. We give the energy estimation methods in both mobile execution model and cloud execution model. The numerical results suggest that energy consumed by the mobile devices can be remarkably saved with our proposed multi-scale scheme. Moreover, the results can be used as a guideline for the mobile devices to choose whether executing the application locally or offloading it to the cloud center.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.37-41
• /
• 2018

In this paper, we evaluate the power consumption of IEEE802.15.4e TSCH which uses the specific link scheduling scheme proposed in reference[1]. And we also compares it with the power consumption of conventional single channel IEEE802.15.4. The power consumption of IEEE802.15.4e TSCH is smaller than the conventional one under the any conditions of traffic. The reasons can be explained as the followings. Firstly, TSCH does not have backoff time because of using the collision free link scheduling. Secondly, there is the timing difference of MAC offset parameter between TSCH and conventional IEEE802.15.4 Lastly, the devices in TSCH mode sleep during the time slots which are not assigned to itself.