• Title/Summary/Keyword: hidden node

Search Result 136, Processing Time 0.022 seconds

A Study on the Soiution of Inverse Kinematic of Manipulator using Self-Organizing Neural Network and Fuzzy Compensator (퍼지 보상기와 자기구성 신경회로망을 이용한 매니퓰레이터의 역기구학 해에 관한 연구)

  • 김동희;이수흠;신위재
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.3
    • /
    • pp.79-85
    • /
    • 2001
  • We obtain a solution of inverse kinematic of 3 axis manipulator by using a self-organizing neral network(SONN) with a fuzzy compensator. The self-organizing neural network using the gaussian potential function as the activation function has one hidden layer in the first learning time. The network obtains the optimal number of node by increasing the number of hidden layer node through the learning, and the fuzzy compensator has the optimal loaming rate of neutral network. In this results, we can confirmed that the learning rate is improved and the rapid convergence to the steady-state.

  • PDF

On the usefulness of RTS/CTS in wireless ad-hoc networks (무선 Ad-hoc 네트워크에서 RTS/CTS의 사용여부에 관한 연구)

  • Kim, Mo-Ses;Mo, Jeong-Hoon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.310-312
    • /
    • 2005
  • 무선 Ad-hoc 네트워크상에서 hidden node problem을 해결하기 위해 도입된 RTS/CTS의 사용여부는 네트워크의 처리량(throughput)에 영향을 미친다. 이는 RTS/CTS가 hidden node problem을 해결해주지만 거기에서 발생하는 overhead 때문에 처리량이 떨어질 수도 있기 때문이다. 기존 관련 연구에서는 RTS/CTS의 사용여부를 패킷의 크기에 따라 달리 해야 한다고 말하고 있다. 그리고 이를 구현하기 위해서 RTSThreshold라는 값을 사용하고 있다. 만약 이 값보다 패킷의 크기가 작으면 RTS/CTS는 사용 되지 않고, 만약 이 값보다 패킷의 크기가 크면 RTS/CTS가 사용된다. 이렇게 RTS/CTS의 사용여부를 결정해주는 RTSThreshold값을 결정하기 위해선 네트워크의 처리량에 영향을 줄 수 있는 모든 인자들을 고려해 보아야 할 것이다. 조사한 바에 의하면 이미 관련 연구에서 physical preamble의 크기, 노드의 수, 그리고 data rate와 RTSThreshold와의 관계를 연구 했었지만, 그밖에 네트워크의 처리량에 영향을 줄 수 있는 carrier sense range나 네트워크의 크기와의 관계는 연구가 되지 않았었다. 따라서 본 논문에서는 이 두가지 인자와 RISThreshold와의 관계를 살펴보고자 모의실험을 수행하였고 그 결과를 분석하였다. 두 인자가 어느 정도 RTSThreshold를 결정하는데 영향을 줄 것이라 예상했었지만, 실험 결과를 분석한 결과 carrier sense range나 네트워크의 크기는 RTSThreshold를 결정하는데 크게 영향을 주지 않는 것으로 나타났다.

  • PDF

Autonomous TDMA for VANETs with improved robustness (강인성을 개선한 VANET에서의 자율 TDMA)

  • Park, Hye-bin;Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.2
    • /
    • pp.55-62
    • /
    • 2018
  • VANET is a rapidly emerging service area with strict requirements of a few milliseconds' latency. Because current systems don't guarantee ultra-low latency, it has been proposed a latency-guaranteed Autonomous ATDMA(ATDMA) in which autonomous joining/leaving is allowed without coordinator's scheduling. In this study, we extended ATDMA to operate in non-perfect decoding environments with existing hidden nodes, channel fading and node density variation, and named it ATDMA revision(ATDMA-R). We also evaluated the performance of ATDMA and ATDMA-R, and showed the robustness of ATDMA-R through various realistic simulation scenarios.

On the enhancement of the learning efficiency of the adaptive back propagation neural network using the generating and adding the hidden layer node (은닉층 노드의 생성추가를 이용한 적응 역전파 신경회로망의 학습능률 향상에 관한 연구)

  • Kim, Eun-Won;Hong, Bong-Wha
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.2
    • /
    • pp.66-75
    • /
    • 2002
  • This paper presents an adaptive back propagation algorithm that its able to enhancement for the learning efficiency with updating the learning parameter and varies the number of hidden layer node by the generated error, adaptively. This algorithm is expected to escaping from the local minimum and make the best environment for the convergence of the back propagation neural network. On the simulation tested this algorithm on three learning pattern. One was exclusive-OR learning and the another was 3-parity problem and 7${\times}$5 dot alphabetic font learning. In result that the probability of becoming trapped in local minimum was reduce. Furthermore, the neural network enhanced to learning efficient about 17.6%~64.7% for the existed back propagation. 

An Efficient Multi-Channel MAC Protocol for Cognitive Ad-hoc Networks with Idle Nodes Assistance (무선 인지 애드 혹 네트워크를 위한 휴지 노드를 활용하는 효율적인 다중 채널 MAC 프로토콜)

  • Gautam, Dinesh;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.39-45
    • /
    • 2011
  • In this paper, we propose an efficient multichannel MAC protocol with idle nodes assistance to avoid the multi-channel hidden terminal problem in cognitive radio ad hoc network and further to improve the performance of the network. The proposed MAC protocol can be applied to the cognitive radio adhoc network where every node is equipped with the single transceiver and one common control channel exists for control message negotiation. In the proposed protocol, the idle nodes available in the neighbour of communication nodes are utilized because the idle nodes have the information about the channels being utilized in their transmission range. Whenever the nodes are negotiating for the channel, idle nodes can help the transmitting and receiving nodes to select the free data channel for data transfer. With the proposed scheme, we can minimize the hidden terminal problem and decrease the collision between the secondary users when selecting the channel for data transfer. As a result, the performance of the network is increased.

A Study on New Algorithm for K Shortest Paths Problem (복수최단경로의 새로운 해법 연구)

  • Chang ByungMan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.8-14
    • /
    • 2002
  • This article presents a new algorithm for the K Shortest Paths Problem which develops initial K shortest paths, and repeal to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution which comprises K shortest paths among shortest paths to traverse each arc is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, one inward arc of this crossing node, which has minimum detouring distance, is chosen, and a new path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. This algorithm, requires worst case time complexity of $O(Kn^2),\;and\;O(n^2)$ in the case $K{\leq}3$.

  • PDF

An Energy Efficient Multichannel MAC Protocol for QoS Provisioning in MANETs

  • Kamruzzaman, S.M.;Hamid, Md. Abdul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.684-702
    • /
    • 2011
  • This paper proposes a TDMA-based multichannel medium access control (MAC) protocol for QoS provisioning in mobile ad hoc networks (MANETs) that enables nodes to transmit their packets in distributed channels. The IEEE 802.11 standard supports multichannel operation at the physical (PHY) layer but its MAC protocol is designed only for a single channel. The single channel MAC protocol does not work well in multichannel environment because of the multichannel hidden terminal problem. Our proposed protocol enables nodes to utilize multiple channels by switching channels dynamically, thus increasing network throughput. Although each node of this protocol is equipped with only a single transceiver but it solves the multichannel hidden terminal problem using temporal synchronization. The proposed energy efficient multichannel MAC (EM-MAC) protocol takes the advantage of both multiple channels and TDMA, and achieves aggressive power savings by allowing nodes that are not involved in communications to go into power saving "sleep mode". We consider the problem of providing QoS guarantee to nodes as well as to maintain the most efficient use of scarce bandwidth resources. Our scheme improves network throughput and lifetime significantly, especially when the network is highly congested. The simulation results show that our proposed scheme successfully exploits multiple channels and significantly improves network performance by providing QoS guarantee in MANETs.

PAPG: Private Aggregation Scheme based on Privacy-preserving Gene in Wireless Sensor Networks

  • Zeng, Weini;Chen, Peng;Chen, Hairong;He, Shiming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4442-4466
    • /
    • 2016
  • This paper proposes a privacy-preserving aggregation scheme based on the designed P-Gene (PAPG) for sensor networks. The P-Gene is constructed using the designed erasable data-hiding technique. In this P-Gene, each sensory data item may be hidden by the collecting sensor node, thereby protecting the privacy of this data item. Thereafter, the hidden data can be directly reported to the cluster head that aggregates the data. The aggregation result can then be recovered from the hidden data in the cluster head. The designed P-Genes can protect the privacy of each data item without additional data exchange or encryption. Given the flexible generation of the P-Genes, the proposed PAPG scheme adapts to dynamically changing reporting nodes. Apart from its favorable resistance to data loss, the extensive analyses and simulations demonstrate how the PAPG scheme efficiently preserves privacy while consuming less communication and computational overheads.

Adaptive Range-Based Collision Avoidance MAC Protocol in Wireless Full-duplex Ad Hoc Networks

  • Song, Yu;Qi, Wangdong;Cheng, Wenchi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3000-3022
    • /
    • 2019
  • Full-duplex (FD) technologies enable wireless nodes to simultaneously transmit and receive signal using the same frequency-band. The FD modes could improve their physical layer throughputs. However, in the wireless ad hoc networks, the FD communications also produce new interference risks. On the one hand, the interference ranges (IRs) of the nodes are enlarged when they work in the FD mode. On the other hand, for each FD pair, the FD communication may cause the potential hidden terminal problems to appear around the both sides. In this paper, to avoid the interference risks, we first model the IR of each node when it works in the FD mode, and then analyze the conditions to be satisfied among the transmission ranges (TRs), carrier-sensing ranges (CSRs), and IRs of the FD pair. Furthermore, in the media access control (MAC) layer, we propose a specific method and protocol for collision avoidance. Based on the modified Omnet++ simulator, we conduct the simulations to validate and evaluate the proposed FD MAC protocol, showing that it can reduce the collisions effectively. When the hidden terminal problem is serious, compared with the existing typical FD MAC protocol, our protocol can increase the system throughput by 80%~90%.

Inspection of Automotive Oil-Seals Using Artificial Neural Network and Vision System (인공신경망과 비전 시스템을 이용한 자동차용 오일씰의 검사)

  • 노병국;김기대
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.8
    • /
    • pp.83-88
    • /
    • 2004
  • The Classification of defected oil-seals using a vision system with the artificial neural network is presented. The artificial neural network fur classification consists of 27 input nodes, 10 hidden nodes, and one output node. The selection of the number of the input nodes is based on an observation that the difference among the defected, non-defected, and smeared oil-seals is greatly pronounced in the 26 step gray-scale level thresholding. The number of the hidden nodes is chosen as a result of a trade-off between accuracy and computing time. The back-propagation algorithm is used for teaching the network. The proposed network is capable of successfully classifying the defected from the smeared oil-seals which tend to be classified as the defected ones using the binary thresholding. It is envisaged that the proposed method improves the reliability and productivity of the automotive vision inspection system.