• Title/Summary/Keyword: Node Number

Search Result 1,871, Processing Time 0.031 seconds

Mobile Sink Supporting Routing Protocol using Agent of Cluster Node (클러스터 노드의 에이전트를 이용한 이동 싱크 지원 라우팅 프로토콜)

  • Kim, Young-Soo;Suh, Jung-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.6
    • /
    • pp.1208-1214
    • /
    • 2009
  • Sensor networks are vulnerable to data congestion and hot-spot compared with wireless networks. Mobile sink supporting route protocol has such problems as hot-spot and data congestion because agent of cluster node transmits all data packet. Therefore, mobile sink supporting route protocol needs to reduce the number of packets and keep the packets from concentrating on a single node. To solve these problems, we propose mobile sink supporting routing Protocol using agent of cluster node. Cutting down on the number of packets compared with the existing mobile sink supporting routing Protocol, our proposed protocol has reduced both communication overhead and energy consumption.

The Design of Secret Multi-Paths on MRNS(Mixed Radix Numbers System) Network for Secure Transmission (안전한 전송을 위한 MRNS(Mixed Radix Number System)네트워크에서의 비밀 다중 경로의 설계)

  • Kim, Seong-Yeol;Jeong, Il-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1534-1541
    • /
    • 1996
  • Routing security is the confidentiality of route taken by the data transmitted over communication networks. If the route is detected by an adversary, the probability is high that the data lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to a destination node using the shortest direct path. Furthermore, if we use a number of secret routes from a node to a destination node, data security is much stronger since we can transmit partial data rather than entire data along a secret route. Finally, the idea above is implemented on MRNS Network.

  • PDF

A CLB based CPLD Low-power Technology Mapping Algorithm consider Area and Delay time (면적과 지연 시간을 고려한 CLB 구조의 CPLD 저전력 기술 매핑 알고리즘)

  • 김재진;조남경;전종식;김희석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.1169-1172
    • /
    • 2003
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm consider area and delay time is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. The proposed algorithm is examined by using benchmarks in SIS. In the case of that the number of OR-terms is 5, the experiments results show that reduce the power consumption by 30.73% comparing with that of TEMPLA, and 17.11% comparing with that of PLAmap respectively.

  • PDF

Design and Development Digital Line Checker for the Pin Number Testing of Circuit Board Inspection System (디지털 배선 검사기 설계 및 개발에 대한 연구)

  • Park, Young-Seok;Jung, Woon-Ki;Park, Dong-Jin;Kim, Sung-Deok;Ko, Yun-Seok;Ryu, Chang-Keun
    • Proceedings of the KIEE Conference
    • /
    • 2002.04a
    • /
    • pp.96-98
    • /
    • 2002
  • This paper proposes the digital pin line checker which can extremely improve the efficiency of the pine line checking using a micro processor. The line checker is designed which can check efficiently up to maximum 2048 pin. Alarm busser is designed ringing real-timely the case that the pin line is connected differently with real node number. Accordingly the comparing and identifying work visually the node number showing on the displaying board with real node number is avoided after the electronic stimulus enforce to the pin of the fixture by the test engineer. The digital line checker is designed based on the 8051. And the effectiveness and accuracy of the proposed line checking strategy is tested by simulating the several error connections for pin lines on the small scale board.

  • PDF

BF Gray Quadtree : Efficient Image Representation Method (Breadth First Gray Quadtree:화상의 효율적 표현법)

  • Lee, Geuk;Lee, Min-Gyu;Hwang, Hee-Yeung;Lee, Jung-Won
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.5
    • /
    • pp.494-499
    • /
    • 1990
  • A new compact hierarchical representation method image is proposed. This method represents a binary image with the set of decimal numbers. Each decimal number represents the pattern of nonterminal node(gray node) in the quadtree. This pattern implies the combination of its four child nodes. The total number of gray nodes is one third of that terminal nodes. We show that gray tree method is efficient comparing with others which have been studied.

  • PDF

Supporting Intermediate-node Mobility in CCN Real-time Service according to Mobility Detection (CCN 실시간 서비스에서 이동성 탐지에 따른 중간노드의 이동성 지원)

  • Seong, Kukil;Kwon, Taewook
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.12
    • /
    • pp.1438-1446
    • /
    • 2019
  • Recently, the number of mobile users as well as high-speed Internet user has been increasing rapidly. Moreover, traffic is growing fast as services that provide real-time content such as Youtube and Netflix become popular. The problem of traffic control in real-time content services is important because many people use cell phones to receive real-time content. In this regard, the field of CCN is currently being studied. We studied the mobility of nodes among CCN research fields. Node mobility can be divided into three categories : consumer mobility, intermediate node, and provide mobility. In this paper, we propose Mobility Node Support(MD-INS) to support the intermediate-node mobility in CCN real-time services. Experimental results show that the proposed scheme shows better performance than CCN in terms of service disconnection time and packet loss.

P2P Streaming Media Node Selection Strategy Based on Greedy Algorithm

  • Gui, Yiqi;Ju, Shuangshuang;Choi, Hwangkyu
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.570-577
    • /
    • 2018
  • With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

Morphological studies on the hemal node in the Korean native cattle (한우 혈절에 관한 형태학적 연구)

  • Yoon, Yeo-sung
    • Korean Journal of Veterinary Research
    • /
    • v.34 no.2
    • /
    • pp.229-235
    • /
    • 1994
  • The hemal nodes of the Korean native cattle were studied by gross anatomy and light microscopy. Hemal nodes were spherical or ovoid in shape, and red or black in colors. A hemal node consisted of a thick capsule and a hilum, and had extensive subcapsular and deep sinuses distended by a great number of erythrocytes. Although a few lymphatic nodules and tissues were seen in the parenchyma, no typical cortex and medulla was defined. Blood vessels occurred, but lymph vessel was not observed in nodes. The stroma of the hemal node was composed of reticular cells and fibers. The parenchyma consisted of many erythrocytes and lymphocytes, and a few macrophages and megakaryocytes. The capsule and trabecula was a collagenous connective tissue with smooth muscle cells. B-lymphocytes were principally located in the lymphatic nodules of the hemal node. T-lymphocytes were scattered in the diffuse lymphatic tissues of the hemal node.

  • PDF

Design of Stochastic Movement Model Considering Sensor Node Reliability and Energy Efficiency

  • Cho, Do-Hyeoun;Yeol, Yun Dai;Hwang, Chi-Gon
    • 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.

Is Prophylactic Central Node Dissection Omissible? (갑상선유두상암에서 예방적 중심경부림프절제술은 생략할 수 있는가?)

  • Shin, Sung-Chan;Lee, Byung-Joo
    • Korean Journal of Head & Neck Oncology
    • /
    • v.34 no.1
    • /
    • pp.1-7
    • /
    • 2018
  • Papillary thyroid carcinoma has a good prognosis, but the frequency of locoregional lymph node metastasis is high and is known to occur stepwise fashion. Prophylactic central node dissection in papillary thyroid carcinoma is widely performed from the past. But, the pros and cons of the prophylactic central node dissection has been ongoing for a long time. In the American Thyroid Association management guideline for thyroid nodules and differentiated thyroid cancer, which is the most widely used, recommendations about prophylactic central node dissection has been changed in past ten years. In recent systematic review and meta-analysis, prophylactic central node dissection increases the rate of transient hypocalcemia and recurrent laryngeal nerve injury, but there is no difference in the frequency of permanent hypocalcemia or recurrent laryngeal nerve injury. Prophylactic central node dissection has not been shown to improve patient survival, but recurrence has been reported to decrease. According to a questionnaire survey of the members of Korean Scociety of Thyroid-Head and Neck Surgery, Korean doctors tend to perform the prophylactic central node dissection more aggressively than other countries. The reason for this is that Korea has a large number of thyroid surgeries and therefore surgeons are more experienced than other countries.