• ETRI Journal
• /
• v.40 no.2
• /
• pp.237-245
• /
• 2018

The Distributed Modulated Wideband Converter (DMWC) is a networking system developed from the Modulated Wideband Converter, which converts all sampling channels into sensing nodes with number variables to implement signal undersampling. When the number of sparse subbands changes, the number of nodes can be adjusted flexibly to improve the reconstruction rate. Owing to the different attenuations of distributed nodes in different locations, it is worthwhile to find out how to select the optimal sensing node as the sampling channel. This paper proposes the spectrum sensing of DMWC based on a Markov random field (MRF) to select the ideal node, which is compared to the image edge segmentation. The attenuation of the candidate nodes is estimated based on the attenuation of the neighboring nodes that have participated in the DMWC system. Theoretical analysis and numerical simulations show that neighboring attenuation plays an important role in determining the node selection, and selecting the node using MRF can avoid serious transmission attenuation. Furthermore, DMWC can greatly improve recovery performance by using a Markov random field compared with random selection.

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

Wireless Sensor Network (WSN) field is mainly studied to monitor and characterize large-scale physical environments to track various environmental or physical conditions, such as temperature, pressure, wind speed and humidity. WSN can be used in various applications such as wild surveillance, military target tracking and monitoring, dangerous environmental exploration and natural disaster relief. We design probabilistic mobile models that apply to mobile ad hoc network mobile environments. A probabilistic shift model proposed by dividing the number of moving nodes and the distance of travel into two categories to express node movement characteristics. The proposed model of movement through simulation was compared with the existing random movement model, ensuring that the width and variation rate of the first node node node node (FND) was stable regardless of the node movement rate. In addition, when the proposed mobile model is applied to the routing protocol, the superiority of network life can be verified from measured FND values. We overcame the limitations of the existing random movement model, showing excellent characteristics in terms of energy efficiency and stable in terms of changes in node movement.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.3
• /
• pp.1-4
• /
• 2010

RS-485, communication bases from small network system must prepare in collision. The collision is that mean the data transfer breaks. For a stabilized communication chooses 1:N polling methods. But polling is low speed in addition to maybe overload Master device. So, usual N:N Prefers a communication. In this case, must be preparing to avoid collision or some solutions. Generally, to after collision retransmits after short time. It's called delay time for short time. When making a delay time, uses address of each systems. (Address of each node) If the many nodes collided, the each node has different delay time. When making a delay time, uses a usual random number. Making a random number is hard job. So uses a usual pseudorandom number. It is more difficult from small size MCU. The Chaos random number provides stabled value. Finally, when uses the Chaos random number, the stability and reliability of system get better.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3944-3951
• /
• 2000

In this paper, we propose the new FEC(Forward Error Correction) code method, so called RCNC(Random Connection Node Convolutional) code with security property. Recently, many wireless communication systems, which can prouide integrated semices of various media types and hil rales, are required to haue the ability of secreting information and error correclion. This code system is a kind qf conuolulional code, but it Ius various code formats as each node is connected differently. And systems hy using RCNC codes haue all. ability of error correction as well as information protection. We describe the principle of operating RCNC codes, including operation examples. In this paper, we also show the peiformance of BER(Bit Error Rate) and verify authority of network system with computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.994-1005
• /
• 2011

In this paper, we propose a novel approach to optimize the movement of mobile sink node, called AMSP(Adaptive Mobile Sink Path) for mobile sensor network environments. Currently available studies usually suffer from unnecessary data transmission resulting from random way point approach. To address the problem, we propose a method which uses the Hilbert curve to create a path. The proposed method guarantees shorten transmission distance between the sink node and each sensor node by assigning orders of the curve according to sensor node density. Furthermore, The schedule of the sink node is informed to all of the sensing nodes so that the Duty Cycle helps the network be more energy efficient. In our experiments, the proposed method outperforms the existing works such as TTDD and CBPER by up to 80% in energy consumption.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1151-1153
• /
• 2007

P2P 및 Mobile Network, Reputations System 등의 분산 시스템은 sybil attack 에 노출되어 있다. sybil attack 은 한 명의 사용자가 다수의 식별자를 가진 것으로 위장하여 시스템 내에서 마치 실제 다수의 사용자인 양 시스템을 악용하는 공격방법이다. sybil attack 을 막기 위한 다양한 노력이 진행되었고, 최근에 SybilGuard 라는 social network 를 이용한 방어 방법이 제시되었다. SybilGuard 는 악의적인 사용자를 막기 위하여, Random Walk 의 변형이면서 결정적인 경로의 특징을 가지는 임의경로(Random Route)를 사용하여 악의적인 사용자의 sybil attack 을 방어한다. SybilGuard 는 sybil node 의 개수를 제한하고, 이들을 하나의 동일한 그룹으로 분류할 수 있도록 하여 시스템 내에서 가짜 식별자의 개수를 제한한다. 이를 위해 각 노드가 시스템에 돌어올 때 Verifier(V)노드가 이들 노드를 확인하게 되는데, 이를 위해 시스템 내의 선한 노드(Honest Node)를 사용하여 이들을 확인한다. 이 때, honest node 들은 verifier 의 요청에 따라 확인요청을 수행하게 되는데, social network 의 특성상 몇몇 노드들은 사회적인 명망으로 매우 큰 링크수를 가지게 될 것이며, 따라서 이들 노드들이 처리해야할 요청의 양이 매우 많아지게 될 것이다. 따라서 이들 honest node 들 간에 로드분포를 균등하게 하는 것이 요구되며, 이 논문에서는 부하 조절을 하기 위한 기법을 제시하고, 이들을 평가한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.147-169
• /
• 2024

In pace with the development of network technology at lightning speed, social networks have been extensively applied in our lives. However, as social networks retain a large number of users' sensitive information, the openness of this information makes social networks vulnerable to attacks by malicious attackers. To preserve the link privacy of individuals in social networks, an uncertain graph method based on node random response is devised, which satisfies differential privacy while maintaining expected data utility. In this method, to achieve privacy preserving, the random response is applied on nodes to achieve edge modification on an original graph and node differential privacy is introduced to inject uncertainty on the edges. Simultaneously, to keep data utility, a divide and conquer strategy is adopted to decompose the original graph into many sub-graphs and each sub-graph is dealt with separately. In particular, only some larger sub-graphs selected by the exponent mechanism are modified, which further reduces the perturbation to the original graph. The presented method is proven to satisfy differential privacy. The performances of experiments demonstrate that this uncertain graph method can effectively provide a strict privacy guarantee and maintain data utility.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.90-95
• /
• 2000

In the Ordered Core Based Tree(OCBT) protocol, a core location is the most important feature to affect the performance. In this paper, the location placement of multiple level cores is studied. The proposed algorithm isthat each node in the network evaluates a sum of shortest path costs from all the other nodes and the entirenetwork is divided into a hierarchy region to have 3-logical level(Small, Medium, Large). The node to have thelowest cost in each S-Region is decided to be a core node. Then, the core nodes in the each S-Region evaluatea sum of shortest path costs from all the other core nodes in the same M-Region. The core node to have thelowest cost is decided to be the upper level core node. Similarly the highest level core node is decided in theL-Region. The proposed algoritthm is compared with conventional two methods to put the core nodes in thenetwork One is the random method to put the core nodes randomly. The other is the center method to locatethe core node at the nearest node from the center of each S-Region and then to locate the highest level corenode at the nearest core node from the center of the entire network. Extensive simulations are performed in theview of mean tree cost and join latency. Simulation results show that the proposed algorithm has betterperformance than random method or center method.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.99-103
• /
• 2003

In this note we find the exact Probability distribution of d$\_$n, i/ the outdegree of the node i, in a random recursive tree with n nodes. For i = i$\_$n/ increasing as a linear function on n, we show that d$\_$n/,i$\_$n/ is asymptotically normal.