• Title/Summary/Keyword: node state

Search Result 508, Processing Time 0.026 seconds

Packet Loss Patterns Adaptive Feedback Scheduling for Reliable Multicast

  • Baek, Jin-Suk;Kim, Cheon-Shik;Hong, You-Sik
    • Journal of Ubiquitous Convergence Technology
    • /
    • v.1 no.1
    • /
    • pp.28-34
    • /
    • 2007
  • Tree-based reliable multicast protocols provide scalability by distributing error-recovery tasks among several repair nodes. These repair nodes perform local error recovery for their receiver nodes using the data stored in their buffers. We propose a packet loss patterns adaptive feedback scheduling scheme to manage these buffers in an efficient manner. Under our scheme, receiver nodes send NAKs to repair nodes to request packet retransmissions only when the packet losses are independent events from other nodes. At dynamic and infrequent intervals, they also send ACKs to indicate which packets can be safely discarded from the repair node's buffer. Our scheme reduces delay in error recovery because the requested packets are almost always available in the repair node's buffers. It also reduces the repair node's workload because (a) each receiver node sends infrequent ACKs with non-fixed intervals and (b) their sending times are fairly distributed among all the receiver nodes.

  • PDF

Instrumentation based Neural Networks for Real-time detecting of Energized Insulator (오손 애자자의 실시간 검출을 위한 계측기반 신경망)

  • Kim, Jong-Man;Kim, Young-Min
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2004.05c
    • /
    • pp.25-29
    • /
    • 2004
  • For detecting of Energized Insulator, a new Lateral Information Propagation Networks(LIPN) has been proposed. Faulty insulator is reduced the rate of insulation extremely, and taken the results dirty and injured. It is necessary to be actions that detect the faulty insulator and exchange the new one. And thus, we have designed the LIPN to be detected that insulators by the real time computation method through the inter-node diffusion. 1n the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. Information propagates among neighbor nodes laterally and inter-node interpolation is achieved. Through the results of simulation experiments, we difine the ability of real-time detecting the faulty insulators.

  • PDF

Propagation Neural Networks for Real-time Recognition of Error Data (에라 정보의 실시간 인식을 위한 전파신경망)

  • 김종만;황종선;김영민
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2001.11a
    • /
    • pp.46-51
    • /
    • 2001
  • For Fast Real-time Recognition of Nonlinear Error Data, a new Neural Network algorithm which recognized the map in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of map, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear map information is processed.

  • PDF

Simulation of ULP Self-Sustaining Sensor Node System (ULP 자기유지 센서노드 시스템의 시뮬레이션)

  • Kim, Yun-Ho;Seong, Yeong-Rak;Oh, Ha-Ryoung;Park, Jun-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1435-1443
    • /
    • 2009
  • In this paper, an energy harvesting sensor network system is modeled and simulated by using the DEVS (Discrete Event System Specification) formalism. The system is composed of a sink (master) node, which is battery or mains powered, and a set of sensor (slave) nodes, each of which harvests ambient energy and converts it into electrical energy. For simulation, (i) the behavior of energy harvesting and storing circuits of the slave node is partitioned into a set of piecewise continuous segments and then each segment is represented as a discrete state; (ii) the interaction among the master node and components of the slave node is investigated preciously; and (iii) the investigated result is modeled and simulated by using the DEVS formalism.

An Efficient Shortcut Path Algorithm using Depth in Zigbee Network (Zigbee 네트워크에서 Depth를 이용한 효율적인 중간 경로 감소 알고리즘)

  • Kim, Duck-Young;Jung, Woo-Sub;Cho, Sung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1475-1482
    • /
    • 2009
  • In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.

K-Hop Community Search Based On Local Distance Dynamics

  • Meng, Tao;Cai, Lijun;He, Tingqin;Chen, Lei;Deng, Ziyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3041-3063
    • /
    • 2018
  • Community search aims at finding a meaningful community that contains the query node and also maximizes (minimizes) a goodness metric. This problem has recently drawn intense research interest. However, most metric-based algorithms tend to include irrelevant subgraphs in the identified community. Apart from the user-defined metric algorithm, how can we search the natural community that the query node belongs to? In this paper, we propose a novel community search algorithm based on the concept of the k-hop and local distance dynamics model, which can naturally capture a community that contains the query node. The basic idea is to envision the nodes that k-hop away from the query node as an adaptive local dynamical system, where each node only interacts with its local topological structure. Relying on a proposed local distance dynamics model, the distances among nodes change over time, where the nodes sharing the same community with the query node tend to gradually move together, while other nodes stay far away from each other. Such interplay eventually leads to a steady distribution of distances, and a meaningful community is naturally found. Extensive experiments show that our community search algorithm has good performance relative to several state-of-the-art algorithms.

Improving QoS using Cellular-IP/PRC in Hospital Wireless Network

  • Kim, Sung-Hong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.1 no.2
    • /
    • pp.120-126
    • /
    • 2006
  • In this paper, we propose for improving QoS in hospital wireless network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it has its vulnerability in frequent handoff environment. This handoff state machine using differentiated handoff improves quality of services in Cellular-IP/PRC. Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and most of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

  • PDF

Design of HUST-PTF beamline control system for fast energy changing

  • Li, Peilun;Li, Dong;Qin, Bin;Zhou, Chong;Han, Wenjie;Liao, Yicheng;Chen, Aote
    • Nuclear Engineering and Technology
    • /
    • v.54 no.8
    • /
    • pp.2852-2858
    • /
    • 2022
  • A proton therapy facility is under development at Huazhong University of Science and Technology (HUST). To meet the need for fast energy changes during treatments, a beamline control system (BCS) has been designed and implemented. The BCS coordinates and controls various beamline devices by adopting a distributed architecture divided into three layers: the client, server, and device layers. Among these, the design of the server layer is the key to realize fast energy changes. The server layer adopts the submodule programming paradigm and optimizes the data interface among modules, allowing the main workflow to be separated from the device workflow and data. Furthermore, this layer uses asynchronous, multithreaded, and thread-locking methods to improve the system's ability to operation efficiently and securely. Notably, to evaluate the changing energy status over time, a dynamic node update method is adopted, which can dynamically adjust the update frequency of variable nodes. This method not only meets the demand for fast updates on energy changes but also reduces the server's communication load in the steady state. This method is tested on a virtual platform, and the results are as expected.

A Protocol Analysis Platform for the WTB Redundancy in Train Communication Network(TCN) (철도차량 통신 네트워크(TCN)에서의 WTB 이중화에 대한 프로토콜 분석 플랫폼)

  • Choi, Seok-In;Shon, Jin-Geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.62 no.1
    • /
    • pp.23-29
    • /
    • 2013
  • TCN(train communication network) standard was approved in 1999 by the IEC (IEC 61375-1) and IEEE (IEEE 1473-T) organizations to warrant a reliable train and equipment interoperability. TCN defines the set of communication vehicle buses and train buses. The MVB(multifunction vehicle bus) defines the data communication interface of equipment located in a vehicle and the WTB(wire train bus) defines the data communication interface between vehicles. The WTB and each MVB will be connected over a node acting as gateway. Also, to support applications demanding a high reliability, the standard defines a redundancy scheme in which the bus may be double-line and redundant-node implemented. In this paper we have presented protocol analysis platform for the WTB redundancy which is part of TCN system, to verify communication state of high-speed trains. As a confirmation of its validity, the technology described in this paper has been successfully applied to state monitoring and protocol verification of redundancy WTB based on TCN.

A Study Nuenal Model of Concept Retrieval (개념 검색의 신경회로망 모델에 관한 연구)

  • Kauh, Yong-Hoon;Park, Sang-Hui
    • Proceedings of the KIEE Conference
    • /
    • 1990.11a
    • /
    • pp.450-456
    • /
    • 1990
  • In this paper, production system is implemented with the inferential neural network model using semantic network and directed graph. Production system can be implemented with the transform of knowledge representation in production system into semantic network and of semantic network into directed graph, because directed graphs can be expressed by neural matrices. A concept node should be defined by the state vector to calculated the concepts expressed by matrices. The expressional ability of neunal network depends on how the state vector is defined. In this study, state vector is overlapped and each overlapping part acts as a inheritant of concept.

  • PDF