• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2024

Cognitive small cell networks, consisting of macro-cells and small cells, are foreseen as a promising candidate solution to address 5G spectrum scarcity. Recently, many technological issues (such as spectrum sensing, spectrum sharing) related to cognitive small cell networks have been studied, but the common control channel (CCC) establishment problem has been ignored. CCC is an indispensable medium for control message exchange that could have a huge significant on transmitter-receiver handshake, channel access negotiation, topology change, and routing information updates, etc. Therefore, establishing CCC in cognitive small cell networks is a challenging problem. In this paper, we propose a potential game theory-based approach for CCC establishment in cognitive radio networks. We design a utility function and demonstrate that it is an exact potential game with a pure Nash equilibrium. To maintain the common control channel list (CCL), we develop a CCC update algorithm. The simulation results demonstrate that the proposed approach has good convergence. On the other hand, it exhibits good delay and overhead of all networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1679-1686
• /
• 2007

Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.1
• /
• pp.115-121
• /
• 1999

Advanced digital computer technology enables the computer-based controllers to replace the traditional analog controllers used in factory automations. This replacement, however, brings up the side effects caused by the quantization error and non-real-time execution of control software. This paper describes the structure of real-time simulator and controller that can be used for design and verification of real-time digital controllers. The virtual machine concept adopted by the proposed real-time simulator makes the proposed simulator be independent from the specific hardware platforms. The proposed system can also be used in the loosely coupled distributed environments connected through local area network using real-time message passing algorithm and virtual data table based on the shared memory mechanism.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.541-556
• /
• 2020

Wireless networks have become integral to society as they provide mobility and scalability advantages. However, their disadvantage is that they cannot control the media, which makes them vulnerable to various types of attacks. One example of such attacks is the evil twin access point (AP) attack, in which an authorized AP is impersonated by mimicking its service set identifier (SSID) and media access control (MAC) address. Evil twin APs are a major source of deception in wireless networks, facilitating message forgery and eavesdropping. Hence, it is necessary to detect them rapidly. To this end, numerous methods using clock skew have been proposed for evil twin AP detection. However, clock skew is difficult to calculate precisely because wireless networks are vulnerable to noise. This paper proposes an evil twin AP detection method that uses a multiple-feature-based machine learning classification algorithm. The features used in the proposed method are clock skew, channel, received signal strength, and duration. The results of experiments conducted indicate that the proposed method has an evil twin AP detection accuracy of 100% using the random forest algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.5
• /
• pp.1-10
• /
• 2000

In this paper, we propose a Fuzzy Classifier System(FCS) makes the classifier system be able to carry out the mapping from continuous inputs to outputs. The FCS is based on the fuzzy controller system combined with machine learning. Therefore the antecedent and consequent of a classifier in FCS are the same as those of a fuzzy rule. In this paper, the FCS modifies input message to fuzzified message and stores those in the message list. The FCS constructs rule-base through matching between messages of message list and classifiers of fuzzy classifier list. The FCS verifies the effectiveness of classifiers using Bucket Brigade algorithm. Also the FCS employs the Genetic Algorithms to generate new rules and modify rules when performance of the system needs to be improved. Then the FCS finds the set of the effective rules. We will verify the effectiveness of the poposed FCS by applying it to Autonomous Mobile Robot avoiding the obstacle and reaching the goal.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.38-45
• /
• 2004

The ABR point-to-multipoint connection is now playing a more important role than before. Many consolidation algorithms have been proposed to solve the consolidation noise problem and the slow transient response problem. But few timeout algorithms are proposed to handle the non-responsive branches for the multicast connections. Chen’s algorithm needs exchanging control messages between switches [9]. Besides, it may mistake a responsive branch as a non-responsive branch because of fast changes in source rates, which causes wrong information in BRM cells and may lead to network congestion and data losses in the responsive branch. We propose a simple timeout algorithm which can handle the non-responsive branches without exchanging message between switches. The timeout value for each switch is computed locally. Simulation results show that the proposed timeout algorithm can efficiently handle the non-responsive branches and utilize the available bandwidth within a small period of time. In addition, our algorithm could handle the situation when the source rates change quickly.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.744-747
• /
• 1997

High performance digital computer technology enables the digital computer-based controllers to replace traditional analog controllers used for factory automations. This replacement, however, brings up the side effects caused by discrete quantization and non-real-time execution of control softwares. This paper describes the structure of real-time simulator and controller that can be used for design and verification of real-time digital controllers. The virtual machine concept adopted by real-time simulator make the proposed simulator be independent from the specific hardware platforms. The proposed system can also be used in the loosely coupled distributed environments connected through local area network using real-time message passing algorithm and virtual data table based on the shared memory mechanism.

• International Journal of Automotive Technology
• /
• v.8 no.1
• /
• pp.39-48
• /
• 2007

This paper addresses the problem of period and priority assignment in networked control systems (NCSs) using a fixed priority scheduler. The problem of assigning periods and priorities to tasks and messages is formulated as an optimization problem to allow for a systematic approach. The temporal characteristics of an NCS should be considered by defining an appropriate performance index (PI) which represents the temporal behavior of the NCS. In this study, the sum of the end-to-end response times required to process all I/Os with precedence relationships is defined as a PI. Constraints are derived from the task and message deadline requirements to guarantee schedulability. Genetic algorithms are used to solve this constrained optimization problem because the optimization formulation is discrete and nonlinear. By considering the effects of communication, an optimum set of periods and priorities can be holistically derived.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2501-2511
• /
• 1997

This paper presents an authentication model for security on satellite command & control communications. The proposed authentication scheme is based on the modified Shamir's signature scheme using a satellite ID(Identity) and the model uses time stamp for protection of command replay attack from unauthorized center. The message authentication with command counter that includes an available key and the algorithm is for loading and execution of commands in the model. Two-way scheme for key change and confirmation between satellite control center and satellite is also proposed.