• Title/Summary/Keyword: Node distribution

Search Result 596, Processing Time 0.026 seconds

Design of an Effecient Local Area Computer Communication Network Controller for Office Automation (Contention Resolution Algorithm Based on CSMA/CD) (사무자동화를 위한 근거리 컴퓨터 통신망 콘트롤러 개발에 관한 연구)

  • 이명수;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.2
    • /
    • pp.137-145
    • /
    • 1986
  • The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.

  • PDF

Evaluation of Mammary Gland Calcification in Dogs; Radiography and Computed Tomography

  • Kim, Soochan;Kwon, Kyunghun;Choi, Hojung;Lee, Youngwon
    • Journal of Embryo Transfer
    • /
    • v.32 no.3
    • /
    • pp.183-192
    • /
    • 2017
  • The mammary gland tumor (MGT) is the most common neoplasia in intact female dogs. Of these, 50% are malignant and metastasis to the other sites are often occurred. Therefore, it is very important for decision of treatment plan and prognosis to differentiate benign tumor from malignancies. Calcification of MGT is a very important imaging finding. The purpose of this study was to investigate the radiological and computed tomographic images of the MGT and the morphology and distribution of calcifications in the MGT using the Breast Imaging Reporting and Data System classification. A total of 42 dogs with MGT were included in this study. The dogs were divided into two groups into benign and malignant groups based upon histologic or cytologic results. The appearance of calcification in the tumor on radiographs and CT images was analyzed for the HU value of pre- and post-contrast injection, margin, surface, and shape of the tumor and the lymph node abnormalities. On radiographs, the positive predictive value of malignant and benign tumors was 72.72 and 85.71%, respectively. On CT examinations, the positive predictive value of malignant and benign tumors was the same value of 83.33%. The maximum diameter of the tumor and the presence of abnormal lymph nodes on CT images showed a strong correlation with malignancies. Therefore, it is thought that radiographs and CT provide useful information for evaluating MGT in dogs.

A Feedback-Diffusion Algorithm for Data Compression in Wireless Sensor Networks (무선 센서 네트워크에서 데이터 압축을 위한 피드백 배포 기법)

  • Yeo, myung-ho;Seong, dong-ook;Lee, seok-jae;Yoo, jae-soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.87-91
    • /
    • 2008
  • Data compression techniques are traditional and effective to reduce the network traffic. Generally, sensor data exhibit strong correlation in both space and time. Many algorithms have been proposed to utilize these characteristics. However, each sensor just utilizes neighboring information, since its communication range is restrained. The distribution and characteristics of whole sensor data provide other opportunities to enhance the compression technique. In this paper, we propose an orthogonal approach for compression algorithm. The base station or a super node generates useful information for compression of sensor data and broadcasts it into sensor networks. Every sensor that received the information compresses their sensor data and transmits them to the base station. We define this approach as feedback-diffusion. In order to show the superiority of our approach, we compare it with the existing aggregation algorithms in terms of the lifetime of the sensor network. As a result, our experimental results show that the whole network lifetime was prolonged by about 30%.

  • PDF

An Energy-Efficient Sensor Network Clustering Using the Hybrid Setup (하이브리드 셋업을 이용한 에너지 효율적 센서 네트워크 클러스터링)

  • Min, Hong-Ki
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.1
    • /
    • pp.38-43
    • /
    • 2011
  • Cluster-based routing is high energy consumption of cluster head nodes. A recent approach to resolving the problem is the dynamic cluster technique that periodically re-selects cluster head nodes to distribute energy consumption of the sensor nodes. However, the dynamic clustering technique has a problem that repetitive construction of clustering consumes the more energies. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects cluster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. A simulation result were compared with the performances of two of the most widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient, Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 26.5% and 20% more efficient than LEACH and HEED, respectively.

Development for Wetland Network Model in Nakdong Basin using a Graph Theory (그래프이론을 이용한 낙동강 유역의 습지네트워크 구축모델 개발)

  • Rho, Paikho
    • Journal of Wetlands Research
    • /
    • v.15 no.3
    • /
    • pp.397-406
    • /
    • 2013
  • Wetland conservation plan has been established to protect ecologically important wetlands based on vegetation integrity, spatial distribution of endangered species, but recently more demands are concentrated on the landscape ecological approaches such as topological relationship, neighboring area, spatial arrangements between wetlands at the broad scale. Landscape ecological analysis and graph theory are conducted to identify spatial characteristics related to core nodes and weak links of wetland networks in Nakdong basin. Regular planar model, which is selected for wetland networks, is applied in the Nakdong basin. The analysis indicates that 5 regional groups and 4 core wetlands are extracted with 15km threshold distance. The IIC and PC values based on the binary and probability models suggest that the wetland group C composed of main stream of Nakdong river and Geumho river is the most important area for wetland network. Wetland conservation plan, restoration projected of damaged and weak links between wetlands should be proposed through evaluating the node, links, and networks from wetlands at the local to the regional scale in Nakdong basin.

Analysis of a Marine Propeller in Steady Flow by a Higher-Order Boundary Element Method (고차경계요소법을 이용한 정상 유동중의 프로펠러 해석)

  • K.J. Paik;S.B. Suh;H.H. Chun
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.38 no.3
    • /
    • pp.31-40
    • /
    • 2001
  • Low-order panel methods are being used to design marine propellers. Since the potential value over each panel for these methods is assumed to be a constant, the accuracy of prediction is known to be limited. Therefore, a higher order boundary element method(HOBEM) has been studied to enhance the accuracy of prediction. In this paper, a HOBEM representing the body boundary surfaces and physical quantities by a 9-node Lagrangian shape function is employed to analyse the flow around marine propellers in steady potential flow. First, the numerical results for a circular wing with thickness variations are compared with Jordan's linear solution. Then, the computational results of two propellers(DTRC 4119 & DTRC 4842 propeller) are compared with the experimental and numerical results published. The pressure distribution on the surface of the propeller is also compared with experimental data.

  • PDF

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

Dynamic Interest Management in Web Simulation for Intelligent Transportation System (지능형 교통 시스템을 위한 동적 정보관리 시뮬레이션)

  • Cho, Kyu-Cheol
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.2
    • /
    • pp.15-22
    • /
    • 2019
  • Simulation methods are being studied for various service models that can be used in industries as the development of web technology. DEVS is being used as a tool to simulate through scenarios using various information. In addition, DEVS/WS integrates web-based DEVS models through a distributed computing environment and can be used as tools for high-performance computing and data distribution. This paper describes a method for simulating an intelligent transportation system in DEVS/WS environment. This paper propose dynamic interest management model(DIMM) applied the genetic algorithm, manage efficiently road information of moving node. And, this paper evaluates performance of the dynamic interest management model in comparing to the none interest management model(NIMM). The transmitted messages and simulation time of the DIMM is saved than that of the NIMM.

Long-circulating and target-specific distributions of cyanine 5.5-labeled hyaluronic acid nanoparticles in mouse organs during 28 days after a single administration

  • Yun, Tae Sik;Lin, Chunmei;Yon, Jung-Min;Park, Seul Gi;Gwon, Lee Wha;Lee, Jong-Geol;Baek, In-Jeoung;Nahm, Sang-Seop;Lee, Beom Jun;Yun, Young Won;Nam, Sang-Yoon
    • Korean Journal of Veterinary Research
    • /
    • v.58 no.4
    • /
    • pp.183-192
    • /
    • 2018
  • Although hyaluronic acid (HA) has been developed as a nanoparticle (NP; 320-400 nm) for a drug delivery system, the tissue targeting efficacy and the pharmacokinetics of HA-NPs are not yet fully understood. After a dose of 5 mg/kg of cyanine 5.5-labeled HA-NPs or HA-polymers was intravenously administrated into mice, the fluorescence was measured from 0.5 h to 28 days. The HA-NPs fluorescence was generally stronger than that of HA-polymers, which was maintained at a high level over 7 days in vivo, after which it gradually decreased. Upon ex vivo imaging, liver, spleen, kidney, lung, testis and sublingual gland fluorescences were much higher than that of other organs. The fluorescence of HA-NPs in the liver, spleen and kidney was highest at 30 min, where it was generally maintained until 4 h, while it drastically decreased at 1 day. However, the fluorescence in the liver and spleen increased sharply at 7 days relative to 3 days, then decreased drastically at 14 days. Conversely, the fluorescence of HA-polymers in the lymph node was higher than that of HA-NPs. The results presented herein may have important clinical implications regarding the safety of as self-assembled HA-NPs, which can be widely used in biomedical applications.

A Near-tip Grid Refinement for the Effective and Reliable Crack Analysis by Natural Element Method (효율적이고 신뢰성있는 자연요소 균열해석을 위한 균열선단 그리드 세분화기법)

  • Cho, Jin-Rae
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.32 no.3
    • /
    • pp.183-190
    • /
    • 2019
  • This paper introduces a near-tip grid refinement and explores its usefulness in the crack analysis by the natural element method(NEM). As a sort of local h-refinement in finite element method(FEM), a NEM grid is locally refined around the crack tip showing high stress singularity. This local grid refinement is completed in two steps in which grid points are added and Delaunay triangles sharing the crack tip node are divided. A plane strain rectangular plate with symmetric edge cracks is simulated to validate the proposed local grid refinement and to examine its usefulness in the crack analysis. The crack analysis is also simulated using a uniform NEM grid for comparison. Unlike the uniform grid, the refined grid provides near-tip stress distributions similar to the analytic solutions and the fine grid. In addition, the refined grid shows higher convergence than the uniform grid, the global relative error to the total number of grid points.