• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5218-5233
• /
• 2018

The coexisting wireless body area networks (WBAN) is a very challenging issue because of strong inter-networks interference, which seriously affects energy consumption and spectrum utilization ratio. In this paper, we study a power control strategy with nearest neighbor nodes distribution for coexisting WBAN based on stochastic geometry. Using homogeneous Poisson point processes (PPP) model, the relationship between the transmission power and the networks distribution is analytically derived to reduce interference to other devices. The goal of this paper is to increase the transmission success probability and throughput through power control strategy. In addition, we evaluate the area spectral efficiency simultaneously active WBAN in the same channel. Finally, extensive simulations are conducted to evaluate the power control algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.404-409
• /
• 1998

In this paper, we propose a learning algorithm of fuzzy neural networks with trapezoidal fuzzy weights. This fuzzy neural networks can use fuzzy numbers as well as real numbers, and represent linguistic information better than standard neural networks. We construct trapezodal fuzzy weights by the composition of two triangles, and devise a learning algorithm using the two triangular membership functions, The results of computer simulations on numerical data show that the fuzzy neural networks have high fitting ability for target output.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.9 no.2
• /
• pp.46-55
• /
• 1984

The purpose of this parer is to provide a survey of the state of the art of routing methods in store-and-forward computer networks. The survey is carried out in line with a new taxonomy： heuristic methods, user-optimization methods, and system-optimization methods. This taxonomy on routing algorithms is based on two viewpoints： the level of optimization and the relative difficulty for the implementation in real computer networks. Some actual methods implemented in real computer networks are surveyed as well as the theoretical studies in the literature. This paper concludes with some points in need of further researches.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.143-146
• /
• 2004

Differentiated services (DiffServ) has been widely accepted as the service model to adopt for providing quality-of­service (QoS) over the next-generation IP networks. There is a growing need to support QoS in mobile ad hoc networks. Supporting DiffServ in mobile ad hoc networks, however, is very difficult because of the dynamic nature of mobile ad hoc networks, which causes network congestion. The network congestion induces long transfer packet delay and low throughput which make it very difficult to support QoS in mobile ad hoc networks. We propose DiffServ module to support differentiated service in mobile ad hoc networks through congestion control. Our DiffServ module uses the periodical rate control for real time traffic and also uses the best effort bandwidth concession when network congestion occurs. Network congestion is detected by measuring the packet transfer delay or bandwidth threshold of real time traffic. We evaluate our mechanism via a simulation study. Simulation results show our mechanism may offer a low and stable delay and a stable throughput for real time traffic in mobile ad hoc networks.

• Journal of the Korean Society for information Management
• /
• v.7 no.1
• /
• pp.96-120
• /
• 1990

Academic and research computer networks are the essential communications component that can provide scientists and engineers with convenient access to local and remote computing and information resources. Nowadays, academic and research computer networks, providing access to a variety of resources and information services, can significantly increase the productivity of scientists and engineers. In Korea there have been some activities of academic and research networks since early of 1980. This study presents background of development of computer network, summaries the types of services offered by academic and research computer networks and analyses the potential benefits resulting from their availability. Use and need of Korean researchers about academic and research computer networks are also reviewed as well as it prospects Korean Computer Network for Education and Research & Development, a new national-base network being implemented by government.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.713-724
• /
• 2016

Energy consumption has become a main problem of sustainable development in communication networks and how to communicate with high energy efficiency is a significant topic that researchers and network operators commonly concern. In this paper, an energy-efficient multicast algorithm in multi-hop wireless networks is proposed aiming at new generation wireless communications. Traditional multi-hop wireless network design only considers either network efficiency or minimum energy consumption of networks, but rarely the maximum energy efficiency of networks. Different from previous methods, the paper targets maximizing energy efficiency of networks. In order to get optimal energy efficiency to build network multicast, our proposed method tries to maximize network throughput and minimize networks' energy consumption by exploiting network coding and sleeping scheme. Simulation results show that the proposed algorithm has better energy efficiency and performance improvements compared with existing methods.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.847-864
• /
• 2012

In recent years, using computer networks (wired and wireless networks) has been widespread in many applications. As computer networks become increasingly complex, the accompanied potential threats also grow to be more sophisticated and as such security has become one of the major concerns in them. Prevention methods alone are not sufficient to make them secure; therefore, detection should be added as another defense before an attacker can breach the system. Intrusion Detection Systems (IDSs) have become a key component in ensuring systems and networks security. An IDS monitors network activities in order to detect malicious actions performed by intruders and then initiate the appropriate countermeasures. In this paper, we present a survey and taxonomy of intrusion detection systems and then evaluate and compare them.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.213-226
• /
• 2021

Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.157-162
• /
• 2022

In reason of the high capacity and low latency, the 5G wireless networks used nowadays in many of life applications such as: remote surgery and guiding vehicle. The high requirements of 5G networks makes it more vulnerable for security threats and attacks. This paper presents some challenges faced by 5G networks and presets some of the security solutions.