• The Journal of Information Systems
• /
• v.15 no.4
• /
• pp.211-224
• /
• 2006

This study investigates the application of data mining techniques such as artificial neural networks, rough sets, and induction teaming to the intrusion detection systems. To maximize the effectiveness of data mining for intrusion detection systems, we introduced the asymmetric costs with false positive errors and false negative errors. And we present a method for intrusion detection systems to utilize the asymmetric costs of errors in data mining. The results of our empirical experiment show our intrusion detection model provides high accuracy in intrusion detection. In addition the approach using the asymmetric costs of errors in rough sets and neural networks is effective according to the change of threshold value. We found the threshold has most important role of intrusion detection model for decreasing the costs, which result from false negative errors.

• International journal of advanced smart convergence
• /
• v.10 no.2
• /
• pp.1-9
• /
• 2021

In the Internet-of-Things (IoT) and artificial intelligence (AI), complete implementations are dependent largely on the speed of the fifth generation (5G) networks. However, successive interference cancellation (SIC) in non-orthogonal multiple access (NOMA) of the 5G mobile networks can be still decoding latency and receiver complexity in the conventional SIC NOMA scheme. Thus, in order to reduce latency and complexity of inherent SIC in conventional SIC NOMA schemes, we propose a rate-lossless non-SIC NOMA scheme. First, we derive the closed-form expression for the achievable data rate of the asymmetric 2PAM non-SIC NOMA, i.e., without SIC. Second, the exact achievable power allocation interval of this rate-lossless non-SIC NOMA scheme is also derived. Then it is shown that over the derived achievable power allocation interval of user-fairness, rate-lossless non-SIC NOMA can be implemented. As a result, the asymmetric 2PAM could be a promising modulation scheme for rate-lossless non-SIC NOMA of 5G networks, under user-fairness.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.43-51
• /
• 2021

As the number of mobile devices has been increasing tremendously, system capacity should be enlarged in future next generation communication, such as the fifth-generation (5G) and beyond 5G (B5G) mobile networks. For such future networks, non-orthogonal multiple access (NOMA) has been considered as promising multiple access technology. In this paper, to reduce both latency and complexity in existing NOMA, we propose non-successive interference cancellation (SIC) NOMA with asymmetric binary pulse amplitude modulation (2PAM), nearly without bit-error rate (BER) loss. First, we derive the closed form of BER expressions for non-SIC NOMA with asymmetric 2PAM, especially under Rayleigh fading channels. Then, it is shown that the BER performance of the stronger channel user who is supposed to perform SIC in conventional NOMA can be nearly achieved by the proposed non-SIC NOMA with asymmetric 2PAM, especially without SIC. Furthermore, we also show that the BER performance of the weaker channel user in conventional NOMA can be more closely achieved by the proposed non-SIC NOMA with asymmetric 2PAM. These BERs are shown to be achieved over the part of the power allocation range, which is consistent with the NOMA principle of user fairness. As a result, the non-SIC NOMA scheme with asymmetric 2PAM could be considered as a promising NOMA scheme toward next generation communication.

• International Journal of Advanced Culture Technology
• /
• v.9 no.4
• /
• pp.307-314
• /
• 2021

Recently, positively asymmetric binary pulse amplitude modulation (2PAM) has been proposed to improve the bit error rate (BER) performance of the weak channel gain user, with a tolerable BER loss of the strong channel gain user, for non-orthogonal multiple access (NOMA). However, the BER loss of the stronger channel gain user is inevitable in such positively asymmetric 2PAM NOMA scheme. Thus, we propose the negatively asymmetric 2PAM NOMA scheme. First, we derive closed-form expressions for the BERs of the negatively asymmetric 2PAM NOMA. Then, simulations demonstrate that for the stronger channel gain user, the BER of the proposed negatively asymmetric 2PAM NOMA improves, compared to that of the conventional positively asymmetric 2PAM NOMA. Moreover, we also show that for the weaker channel gain user, the BER of the proposed negatively asymmetric 2PAM NOMA is comparable to that of the conventional positively asymmetric 2PAM NOMA, over the power allocation range less than about 10 %.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.376-384
• /
• 2009

In this article, we demonstrate that the asymmetric key-based architecture for securing wireless sensor networks recently introduced by Haque et al. is insecure under impersonation attack, since it does not provide authentication semantics. In addition, we show that, for the scheme to work correctly, the resulting key distribution construction should be symmetric and group-wise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5338-5359
• /
• 2017

In-band full-duplex (IBFD) wireless communication supports symmetric dual transmission between two nodes and asymmetric dual transmission among three nodes, which allows improved throughput for distributed IBFD wireless networks. However, inter-node interference (INI) can affect desired packet reception in the downlink of three-node topology. The current Half-duplex (HD) medium access control (MAC) mechanism RTS/CTS is unable to establish an asymmetric dual link and consequently to suppress INI. In this paper, we propose a medium access control mechanism for use in distributed IBFD wireless networks, FD-DMAC (Full-Duplex Distributed MAC). In this approach, communication nodes only require single channel access to establish symmetric or asymmetric dual link, and we fully consider the two transmission modes of asymmetric dual link. Through FD-DMAC medium access, the neighbors of communication nodes can clearly know network transmission status, which will provide other opportunities of asymmetric IBFD dual communication and solve hidden node problem. Additionally, we leverage FD-DMAC to transmit received power information. This approach can assist communication nodes to adjust transmit powers and suppress INI. Finally, we give a theoretical analysis of network performance using a discrete-time Markov model. The numerical results show that FD-DMAC achieves a significant improvement over RTS/CTS in terms of throughput and delay.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.46-59
• /
• 2004

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

• International journal of advanced smart convergence
• /
• v.9 no.4
• /
• pp.34-41
• /
• 2020

Nowadays, the advanced smart convergences of the artificial intelligence (AI) and the internet of things (IoT) have been more and more important, in the fifth generation (5G) and beyond 5G (B5G) mobile communication. In 5G and B5G mobile networks, non-orthogonal multiple access (NOMA) has been extensively investigated as one of the most promising multiple access (MA) technologies. In this paper, we investigate the achievable data rate for the asymmetric binary pulse amplitude modulation (2PAM), in non-orthogonal multiple access (NOMA). First, we derive the closed-form expression for the achievable data rate of the asymmetric 2PAM NOMA. Then it is shown that the achievable data rate of the asymmetric 2PAM NOMA reduces for the stronger channel user over the entire range of power allocation, whereas the achievable data rate of the asymmetric 2PAM NOMA increases for the weaker channel user improves over the power allocation range less than 50%. We also show that the sum rate of the asymmetric 2PAM NOMA is larger than that of the conventional standard 2PAM NOMA, over the power allocation range larger than 25%. In result, the asymmetric 2PAM could be a promising modulation scheme for NOMA of 5G systems, with the proper power allocation.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.5
• /
• pp.1-7
• /
• 2004

A regular logical topology requires little processing time for routing purposes which may be a desirable property for high-speed networks. Asymmetric bilayered ShuffleNet, proposed by us as a logical topology, can be used to a wavelength division multiplexing ring network to increase the network capacity compared to ShuffleNet. In this paper, asymmetric bilayered ShuffleNet is imbedded on a wavelength division multiplexing ring with the objective of minimizing the total number of wavelengths assigned.