• 제목/요약/키워드: random network

검색결과 1,196건 처리시간 0.023초

A New Technique for Localization Using the Nearest Anchor-Centroid Pair Based on LQI Sphere in WSN

  • Subedi, Sagun;Lee, Sangil
    • Journal of information and communication convergence engineering
    • /
    • 제16권1호
    • /
    • pp.6-11
    • /
    • 2018
  • It is important to find the random estimation points in wireless sensor network. A link quality indicator (LQI) is part of a network management service that is suitable for a ZigBee network and can be used for localization. The current quality of the received signal is referred as LQI. It is a technique to demodulate the received signal by accumulating the magnitude of the error between ideal constellations and the received signal. This proposed model accepts any number of random estimation point in the network and calculated its nearest anchor centroid node pair. Coordinates of the LQI sphere are calculated from the pair and are added iteratively to the initially estimated point. With the help of the LQI and weighted centroid localization, the proposed system finds the position of target node more accurately than the existing system by solving the problems related to higher error in terms of the distance and the deployment of nodes.

리플렉티브 메모리 시스템을 이용한 효과적인 네트워크 설계 (Effective Network Design Using Reflective Memory System)

  • 이성우
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제54권6호
    • /
    • pp.403-408
    • /
    • 2005
  • As the increasing integrity of VLSI, the BIST(Built-In Self Test) is used as an effective method to test chips. Generally the pseudo-random test pattern generation is used for BIST. But it requires too many test patterns when there exist random This paper proposes and presents a new efficient network architecture for Reflective Memory System (RMS). A time to copy shared-data among nodes effects critically on the entire performance of the RMS. In this paper, the recent researches about the RMS are investigated and compared. The device named Topology Conversion Switch(TCS) is introduced to realize the proposed network architecture. One of the RMS based industrial control networks, Ethernet based Real-time Control Network (ERCnet), is adopted to evaluate the performance of the proposed network architecture for RMS.

위성 통신에서 신뢰성 향상을 위한 랜덤 선형 네트워크 코딩 기술 (Random Linear Network Coding to Improve Reliability in the Satellite Communication)

  • 이규환;김재현
    • 한국통신학회논문지
    • /
    • 제38B권9호
    • /
    • pp.700-706
    • /
    • 2013
  • 본 논문에서는 위성 통신에서 신뢰성 향상을 위한 랜덤 선형 네트워크 코딩 적용 기술을 제안한다. 제안하는 프로토콜에서는 PEP (Performance Enhancement Proxy)에서 네트워크 코딩된 여분의 패킷을 전송하여 만약 데이터 패킷이 무선 채널 에러에 의해 손실되었다 할지라도 복구 할 수 있다. 또한 본 논문에서는 제안한 프로토콜을 위성 통신에 적용했을 때의 TCP 처리율 수학적 모델을 제시하고 제안한 프로토콜의 성능을 평가했다. 성능 평가 결과, 제안하는 프로토콜은 발신 측 PEP에서 여분의 네트워크 코딩된 패킷을 전송하고 수신 측 PEP에서 여분의 네트워크 코딩된 패킷을 이용하여 손실된 패킷을 복구하기 때문에 패킷 손실률을 감소시켜 기존 TCP보다 처리율 측면에서 우수한 성능을 나타냈다.

A Compensation Control Method Using Neural Network for Mechanical Deflection Error in SCARA Robot with Random Payload

  • Lee, Jong Shin
    • 한국기계기술학회지
    • /
    • 제13권3호
    • /
    • pp.7-16
    • /
    • 2011
  • This study proposes the compensation method for the mechanical deflection error of a SCARA robot. While most studies on the related subject have dealt with the development of a control algorithm for improvement of robot accuracy, this study presents the control method reflecting the mechanical deflection error which is predicted in advance. The deflection at the end of the gripper of SCARA robot is caused by the self-weights and payloads of Arm 1, Arm 2 and quill. If the deflection is constant even though robot's posture and payload vary, there may not be a big problem on robot accuracy because repetitive accuracy, that is relative accuracy, is more important than absolute accuracy in robot. The deflection in the end of the gripper varies as robot's posture and payload change. That's why the moments $M_x$, $M_y$ and $M_z$ working on every joint of a robot vary with robot's posture and payload size. This study suggests the compensation method which predicts the deflection in advance with the variations in robot's posture and payload using neural network. To do this, I chose the posture of robot and the payloads at random, found the deflections by the FEM analysis, and then on the basis of this data, made compensation possible by predicting deflections in advance successively with the variations in robot's posture and payload through neural network learning.

COMPARATIVE ANALYSIS ON MACHINE LEARNING MODELS FOR PREDICTING KOSPI200 INDEX RETURNS

  • Gu, Bonsang;Song, Joonhyuk
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제24권4호
    • /
    • pp.211-226
    • /
    • 2017
  • In this paper, machine learning models employed in various fields are discussed and applied to KOSPI200 stock index return forecasting. The results of hyperparameter analysis of the machine learning models are also reported and practical methods for each model are presented. As a result of the analysis, Support Vector Machine and Artificial Neural Network showed a better performance than k-Nearest Neighbor and Random Forest.

기계학습을 이용한 한국어 대화시스템 도메인 분류 (Machine Learning Based Domain Classification for Korean Dialog System)

  • 정영섭
    • 융합정보논문지
    • /
    • 제9권8호
    • /
    • pp.1-8
    • /
    • 2019
  • 대화시스템은 인간과 컴퓨터의 상호작용에 새로운 패러다임이 되고 있다. 자연어로써 상호작용함으로써 인간은 보다 자연스럽고 편리하게 각종 서비스를 누릴 수 있게 되었다. 대화시스템의 구조는 일반적으로 음성 인식, 자연어 이해, 문맥 파악 등의 여러 모듈의 파이프라인으로 이뤄지는데, 본 연구에서는 자연어 이해 모듈의 도메인 분류 문제를 풀기 위해 convolutional neural network, random forest 등의 기계학습 모델을 비교하였다. 사람이 직접 태깅한 총 7개 서비스 도메인 데이터에 대하여 각 문장의 도메인을 분류하는 실험을 수행하였고 random forest 모델이 F1 score 0.97 이상으로 가장 높은 성능을 달성한 것을 보였다. 향후 다른 기계학습 모델들을 추가 실험함으로써 도메인 분류 성능 개선을 지속할 계획이다.

Enhancing Internet of Things Security with Random Forest-Based Anomaly Detection

  • Ahmed Al Shihimi;Muhammad R Ahmed;Thirein Myo;Badar Al Baroomi
    • International Journal of Computer Science & Network Security
    • /
    • 제24권6호
    • /
    • pp.67-76
    • /
    • 2024
  • The Internet of Things (IoT) has revolutionized communication and device operation, but it has also brought significant security challenges. IoT networks are structured into four levels: devices, networks, applications, and services, each with specific security considerations. Personal Area Networks (PANs), Local Area Networks (LANs), and Wide Area Networks (WANs) are the three types of IoT networks, each with unique security requirements. Communication protocols such as Wi-Fi and Bluetooth, commonly used in IoT networks, are susceptible to vulnerabilities and require additional security measures. Apart from physical security, authentication, encryption, software vulnerabilities, DoS attacks, data privacy, and supply chain security pose significant challenges. Ensuring the security of IoT devices and the data they exchange is crucial. This paper utilizes the Random Forest Algorithm from machine learning to detect anomalous data in IoT devices. The dataset consists of environmental data (temperature and humidity) collected from IoT sensors in Oman. The Random Forest Algorithm is implemented and trained using Python, and the accuracy and results of the model are discussed, demonstrating the effectiveness of Random Forest for detecting IoT device data anomalies.

DPW-RRM: Random Routing Mutation Defense Method Based on Dynamic Path Weight

  • Hui Jin;Zhaoyang Li;Ruiqin Hu;Jinglei Tan;Hongqi Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권11호
    • /
    • pp.3163-3181
    • /
    • 2023
  • Eavesdropping attacks have seriously threatened network security. Attackers could eavesdrop on target nodes and link to steal confidential data. In the traditional network architecture, the static routing path and the important nodes determined by the nature of network topology provide a great convenience for eavesdropping attacks. To resist monitoring attacks, this paper proposes a random routing mutation defense method based on dynamic path weight (DPW-RRM). It utilizes network centrality indicators to determine important nodes in the network topology and reduces the probability of important nodes in path selection, thereby distributing traffic to multiple communication paths, achieving the purpose of increasing the difficulty and cost of eavesdropping attacks. In addition, it dynamically adjusts the weight of the routing path through network state constraints to avoid link congestion and improve the availability of routing mutation. Experimental data shows that DPW-RRM could not only guarantee the normal algorithmic overhead, communication delay, and CPU load of the network, but also effectively resist eavesdropping attacks.

Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • 제15권1호
    • /
    • pp.28-36
    • /
    • 2017
  • The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

Energy-saving Strategy Based on an Immunization Algorithm for Network Traffic

  • Zhao, Dongyan;Long, Keping;Wang, Dongxue;Zheng, Yichuan;Tu, Jiajing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권4호
    • /
    • pp.1392-1403
    • /
    • 2015
  • The rapid development of both communication traffic and increasing optical network sizes has increased energy consumption. Traditional algorithms and strategies don't apply to controlling the expanded network. Immunization algorithms originated from the complex system theory are feasible for large-scale systems based on a scale-free network model. This paper proposes the immunization strategy for complex systems which includes random and targeted immunizations to solve energy consumption issues and uses traffic to judge the energy savings from the node immunization. The simulation results verify the effectiveness of the proposed strategy. Furthermore, this paper provides a possibility for saving energy with optical transmission networks.