• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.558-564
• /
• 2018

In distributed estimation where each node can collect only partial information on the parameter of interest without communication between nodes and quantize it before transmission to a fusion node which conducts estimation of the parameter, we consider a novel quantization technique employed at local nodes. It should be noted that the performance can be greatly improved if each node can transmit its measurement to one designated node (namely, head node) which can quantize its estimate using the total rate available in the system. For this case, the best strategy at the head node would be simply to partition the parameter space using the generalized Lloyd algorithm, producing the global codewords, one of which is closest to the estimate is transmitted to a fusion node. In this paper, we propose an iterative design algorithm that seeks to efficiently assign the codewords into each of quantization partitions at nodes so as to achieve the performance close to that of the system with the head node. We show through extensive experiments that the proposed algorithm offers a performance improvement in rate-distortion perspective as compared with previous novel techniques.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.46-55
• /
• 2020

Ad Hoc network is a special wireless network, mainly because the nodes are no control center, the topology is flexible, and the networking could be established quickly, which results the transmission stability is lower than other types of networks. In order to guarantee the transmission of data packets in the network effectively, an improved Queue Ad Hoc On-demand Distance Vector Routing protocol (Q-AODV) for node detection by using blockchain technology is proposed. In the route search process. Firstly, according to the node's daily communication record the cluster is formed by the source node using the smart contract and gradually extends to the path detection. Then the best optional path nodes are chained in the form of Merkle tree. Finally, the best path is chosen on the blockchain. Simulation experiments show that the stability of Q-AODV protocol is higher than the AODV protocol or the Dynamic Source Routing (DSR) protocol.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.3
• /
• pp.211-217
• /
• 2017

In this paper, we propose a bidirectional full duplex MAC (Medium Access Control) protocol for underwater acoustic networks. An underwater sensor node can set a back-off timer according to the priority of transmission. When the back-off timer expires, the underwater sensor node acquires a transmission opportunity. If a source node wants to send data to a destination node, it broadcasts RTS (Request-To-Send) including ID of the destination node to neighbor nodes. The destination node receiving RTS sends CTS (Clear-To-Send) to the source node to inform the bidirectional full duplex communication. After the source node receives CTS, the source node and the destination node can send the data to each other. In the underwater environment, the existing MAC protocol may take a lot of time for successful transmission of data due to long underwater propagation delay. On the other hand, the proposed bidirectional full duplex MAC protocol improves the throughput by shortening the time for successful transmission of data. In this paper, we analyze the throughput of the proposed bidirectional full duplex MAC protocol. In addition, we show that the proposed bidirectional full duplex MAC protocol has better performance in the presence of the long underwater propagation delay compared with existing MAC protocols for underwater environments.

• Nuclear Engineering and Technology
• /
• v.28 no.5
• /
• pp.488-499
• /
• 1996

We have extended the source projection analytic nodal discrete ordinates method (SPANDOM) for more flexible applicability in analysis of hexagonal assembly cores. The method (SPANDOM-FH) does not invoke transverse integration but instead solves the discrete ordinates equation analytically after the source term is projected and represented in hybrid form of high-order polynomials and exponential functions. SPANDOM-FH which treats a hexagonal node as one node is applied to two fast reactor benchmark problems and compared with TWOHEX. The results of comparison indicate that the present method SPANDOM-FH predicts accurately $k_eff$ and flux distributions in hexagonal assembly cores. In addition, SPANDOM-FH gives the continuous two dimensional intranodal scalar flux distributions in a hexagonal node. The reentering models between TWOHEX and SPANDOM were also compared and it was confirmed that SPANDOM's model is more realistic. Through the results of benchmark problems, we conclude that SPANDOM-FH has the sufficient accuracy for the nuclear design of fast breeder reactor (FBR) cores with hexagonal assemblies.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.6
• /
• pp.1061-1068
• /
• 2019

Cooperative networks transmit signals form the source node to the destination node via several relay node where the combining and demodulation of relay aided signals provide the benefit of performance enhancement and data rate increment. In general, a repetitive manner transmission scheme in which the received signal from the source node is amplified/re-generated and forward to the destination node is widely used. In this paper, we analyzed the performance of cooperative networks using the mixed transmission scheme. The conventional modulation scheme is used in the source-relay links, and space-time code is applied in the relay-destination links. To reduce the complexity of the overall system, we adopt differential modulation which bypasses channel state information. We analyze bit error rate (BER) of the proposed system by considering the number of relay nodes, and the performances depending on the strength of transmission signal in the source-relays and rely-destination links are compared. In addition, we also discuss the system performance with the signal strength and the number of relay nodes simultaneously.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.87-94
• /
• 2007

In mobile ad hoc networks the most popular on demand routing protocols are the Dynamic Source Routing (DSR) protocol and the Ad hoc On demand Distance Vector (AODV) routing protocol. These and other representative standard routing protocols are designed to find and maintain only a single path. Whenever there is a link break on the active route, source node has to invoke a route discovery process from the beginning and it causes a lot of overhead. Multipath routing protocols, which can alleviate these problems by establishing multiple alternative paths between a source and a destination, are widely studied. In this paper we propose a node disjoint multipath discovery technique based on AODV local route discovery. This technique can find and build completely separated node disjoint multi paths from a source to a destination as many as possible. It will make routing more robust and stable.

• 전기의세계
• /
• v.17 no.2
• /
• pp.11-15
• /
• 1968

One of the most important methods used in the modern analysis of linear networks and systems is the signal flow graph technique, first introduced by S.J. Mason in 1953. In essence, the signal-flow graph technique is a graphical method of solving a set of simultaneous. It can, therefore, be regarded as an alternative to the substitution method or the conventional matrix method. Since a flow-graph is the pictorial representation of a set of equations, it has an obvious advantage, i.e., it describes the flow of signals from one point of a system to another. Thus it provides cause-and-effect relationship between signals. And it often significantly reduces the work involved, and also yields an easy, systematic manipulation of variables of interest. Mason's formula is very powerful, but it is applicable only when the desired quantity is the transmission gain between the source node and sink node. In this paper, author summarizes the signal-flow graph technique, and stipulates three rules for conversion of an arbitrary nonsource node into a source node. Then heuses the conversion rules to obtain various quantities, i.e., networks gains, functions and parameters, through simple graphical manipulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.776-783
• /
• 2011

In this paper, assuming that the transmitter can exploit imperfect channel state information (CSI), the diversity-multiplexing tradeoff (DMT) functions of three adaptive decode-and-forward (DF) relay protocols, each of which uses multiple-antennas at the destination node, at the relay node, or at the source node are derived. When the imperfect CSI qualities for the source-relay link, the relay-destination link, and the source-destination link are subject to asymptotic conditions, the additional diversity gains attainable by exploiting the imperfect CSI at the transmitter for those three adaptive DF relay protocols are investigated.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.4
• /
• pp.237-244
• /
• 2007

In this paper we investigate the benefits of a data aggregation to prolong the lifetime of wireless sensor networks. To reduce the overload of messages from source node to sink node, data aggregation technique is generally used at intermediate node in path. The DD-G(Directed Diffusion-Greedy) can diminish the consumption of node energy by establishing energy effective single path from source to destination. In this case, the nodes near sink node have some problems, i) overly concentration of energy consumption, ii) increase of message delay time. To solve these problems, we propose a new data aggregation method which consider distribution of network overload, especially at the nodes close to sink node. The result shows that it can save energy and network delay time.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.170-170
• /
• 2023

Providing safe and readily available water is vital to maintain public health. One of the most prevalent methods to prevent the spread of waterborne diseases is applying chlorine injection to the treated water before distribution. During the water transmission and distribution, the chlorine will experience a reduction, which can imply potential risks for human health if it falls below the minimum threshold. The ability to determine the appropriate initial intensity of chlorine at the source would be significant to prevent such problems. This study proposes two methods that integrate hydraulic and water quality modeling to determine the suitable intensity of chlorine to be injected into the source water to maintain the minimum chlorine concentration (e.g., 0.2 mg/l) at each demand node. The water quality modeling employs the first-order decay to estimate the rate of chlorine reduction in the water. The first method utilizes a backtracking algorithm to trace the path of water from the demand node to the source during each time step, which helps to accurately determine the travel time through each pipe and node and facilitate the computation of time-dependent chlorine decay in the water delivery process. However, as a backtracking algorithm is computationally intensive, this study also explores an alternative approach using a water age. This approach estimates the elapsed time of water delivery from the source to the demand node and calculate the time-dependent reduction of chlorine in the water. Finally, this study compares the outcomes of two approaches and determines the suitable and effective method for calculating the chlorine intensity at the source to maintain the minimum chlorine level at demand nodes.