• Title/Summary/Keyword: Approach of Network

Search Result 4,556, Processing Time 0.034 seconds

Q Learning MDP Approach to Mitigate Jamming Attack Using Stochastic Game Theory Modelling With WQLA in Cognitive Radio Networks

  • Vimal, S.;Robinson, Y. Harold;Kaliappan, M.;Pasupathi, Subbulakshmi;Suresh, A.
    • Journal of Platform Technology
    • /
    • v.9 no.1
    • /
    • pp.3-14
    • /
    • 2021
  • Cognitive Radio network (CR) is a promising paradigm that helps the unlicensed user (Secondary User) to analyse the spectrum and coordinate the spectrum access to support the creation of common control channel (CCC). The cooperation of secondary users and broadcasting between them is done through transmitting messages in CCC. In case, if the control channels may get jammed and it may directly degrade the network's performance and under such scenario jammers will devastate the control channels. Hopping sequences may be one of the predominant approaches and it may be used to fight against this problem to confront jammer. The jamming attack can be alleviated using one of the game modelling approach and in this proposed scheme stochastic games has been analysed with more single users to provide the flexible control channels against intrusive attacks by mentioning the states of each player, strategies ,actions and players reward. The proposed work uses a modern player action and better strategic view on game theoretic modelling is stochastic game theory has been taken in to consideration and applied to prevent the jamming attack in CR network. The selection of decision is based on Q learning approach to mitigate the jamming nodes using the optimal MDP decision process

A Combined Optimization/Simulation Approach to the Reconfiguration of Express Delivery Service Network for Strategic Alliance (전략적 제휴를 고려한 택배 서비스 네트워크 재설계를 위한 최적화/시뮬레이션 반복기법의 적용)

  • Ko, Chang-Seong;Kim, Hong-Bae;Ko, Hyun-Jeung
    • Journal of Navigation and Port Research
    • /
    • v.37 no.3
    • /
    • pp.321-327
    • /
    • 2013
  • As the market of express delivery services expands rapidly, delivery service companies are exposed to severe competition. As a result of the surplus of delivery companies, they are struggling with remaining competitive at a reasonable price with appropriate level of customer satisfaction. To cope with competition pressures, a strategic alliance is suggested as an effective solution to the challenges faced by small and medium enterprises (SMEs) in express delivery services. Therefore, this study suggests a combined optimization and simulation approach to the reconfiguration of an express delivery service network for strategic alliance with respect to strategy partnership of closing/keeping service centers among companies involved and adjustments of their cutoff times. An illustrative numerical example is presented to demonstrate the practicality and efficiency of the approach.

Study on a Secure Active network Architecture (안전한 액티브 네트워크 구조에 관한 연구)

  • Hong, Sung-Sik;Han, In-Sung;Ryou, Hwang-Bin
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.4 s.304
    • /
    • pp.17-24
    • /
    • 2005
  • The existing passive networks have the only data-storing and transmission functions. On the other hand, the active network which can do operation jobs on the transmitting packets was introduced at 1990's. However, the advantages of activating processing are obviously more complex than traditional networks and raise considerable security issues. In this paper, we propose the safer structure in Active Networks that is based on the discrete approach which resolves the weak point of the Active Network. The proposed system provides the node management and user management in the Active Networks, and improves the security of Packet transmission with packet cryptography and the session.

A Systems Engineering Approach to Implementing Hardware Cybersecurity Controls for Non-Safety Data Network

  • Ibrahim, Ahmad Salah;Jung, Jaecheon
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.12 no.2
    • /
    • pp.101-114
    • /
    • 2016
  • A model-based systems engineering (MBSE) approach to implementing hardware-based network cybersecurity controls for APR1400 non-safety data network is presented in this work. The proposed design was developed by implementing packet filtering and deep packet inspection functions to control the unauthorized traffic and malicious contents. Denial-of-Service (DoS) attack was considered as a potential cybersecurity issue that may threaten the data availability and integrity of DCS gateway servers. Logical design architecture was developed to simulate the behavior of functions flow. HDL-based physical architecture was modelled and simulated using Xilinx ISE software to verify the design functionality. For effective modelling process, enhanced function flow block diagrams (EFFBDs) and schematic design based on FPGA technology were together developed and simulated to verify the performance and functional requirements of network security controls. Both logical and physical design architectures verified that hardware-based cybersecurity controls are capable to maintain the data availability and integrity. Further works focus on implementing the schematic design to an FPGA platform to accomplish the design verification and validation processes.

Job-aware Network Scheduling for Hadoop Cluster

  • Liu, Wen;Wang, Zhigang;Shen, Yanming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.237-252
    • /
    • 2017
  • In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.

An Enhanced Neural Network Approach for Numeral Recognition

  • Venugopal, Anita;Ali, Ashraf
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.3
    • /
    • pp.61-66
    • /
    • 2022
  • Object classification is one of the main fields in neural networks and has attracted the interest of many researchers. Although there have been vast advancements in this area, still there are many challenges that are faced even in the current era due to its inefficiency in handling large data, linguistic and dimensional complexities. Powerful hardware and software approaches in Neural Networks such as Deep Neural Networks present efficient mechanisms and contribute a lot to the field of object recognition as well as to handle time series classification. Due to the high rate of accuracy in terms of prediction rate, a neural network is often preferred in applications that require identification, segmentation, and detection based on features. Neural networks self-learning ability has revolutionized computing power and has its application in numerous fields such as powering unmanned self-driving vehicles, speech recognition, etc. In this paper, the experiment is conducted to implement a neural approach to identify numbers in different formats without human intervention. Measures are taken to improve the efficiency of the machines to classify and identify numbers. Experimental results show the importance of having training sets to achieve better recognition accuracy.

Partial Discharge Pattern Recognition of Cast Resin Current Transformers Using Radial Basis Function Neural Network

  • Chang, Wen-Yeau
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.293-300
    • /
    • 2014
  • This paper proposes a novel pattern recognition approach based on the radial basis function (RBF) neural network for identifying insulation defects of high-voltage electrical apparatus arising from partial discharge (PD). Pattern recognition of PD is used for identifying defects causing the PD, such as internal discharge, external discharge, corona, etc. This information is vital for estimating the harmfulness of the discharge in the insulation. Since an insulation defect, such as one resulting from PD, would have a corresponding particular pattern, pattern recognition of PD is significant means to discriminate insulation conditions of high-voltage electrical apparatus. To verify the proposed approach, experiments were conducted to demonstrate the field-test PD pattern recognition of cast resin current transformer (CRCT) models. These tests used artificial defects created in order to produce the common PD activities of CRCTs by using feature vectors of field-test PD patterns. The significant features are extracted by using nonlinear principal component analysis (NLPCA) method. The experimental data are found to be in close agreement with the recognized data. The test results show that the proposed approach is efficient and reliable.

Neural network based tool path planning for complex pocket machining (신경회로망 방식에 의한 복잡한 포켓형상의 황삭경로 생성)

  • Shin, Yang-Soo;Suh, Suk-Hwan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.7
    • /
    • pp.32-45
    • /
    • 1995
  • In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

  • PDF

Scalable Search based on Fuzzy Clustering for Interest-based P2P Networks

  • Mateo, Romeo Mark A.;Lee, Jae-Wan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.157-176
    • /
    • 2011
  • An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.

Ant Colony Optimization and Data Centric Routing Approach for Sensor Networks

  • Lim, Shu-Yun;Lee, Ern-Yu;Park, Su-Hyun;Lee, Hoon-Jae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.2
    • /
    • pp.410-415
    • /
    • 2007
  • Recent advances in sensor network technology have open up challenges for its effective routing. Routing protocol receives most of the attention because routing protocols might differ depending on the application and network architecture. In the rapidly changing environment and dynamic nature of network formation efficient routing and energy consumption are very crucial. Sensor networks differ from the traditional networks in terms of energy consumption. Thus, data-centric technologies should be used to perform routing to yield an energy-efficient dissemination. By exploiting the advantages of both ant colony optimization techniques in network routing and the ability of data centric muting to organize data for delivery, our approach will cover features for building an efficient autonomous sensor network.