• Title/Summary/Keyword: Minimum connection time

Search Result 51, Processing Time 0.037 seconds

A Study on the Minimum Route Cost Routing Protocol for 6LoWPAN (6LoWPAN을 위한 최소경로비용 라우팅 프로토콜에 관한 연구)

  • Kim, Won-Geun;Kim, Jung-Gyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.1
    • /
    • pp.1-14
    • /
    • 2010
  • It is recently issued scalability, mobility and external internet connection on Wire-less sensor network. The low power wireless sensor networks based on IPv6 technology 6LoWPAN technology is being standardized in the IETF. This paper for the 6LoWPAN environment based on the routing protocol LOAD, route cost applied the packet re-transmission rate which follows in Link Qualities price which uses at course expense and packet transmission Minimum route Cost routing protocol where does on the course wherethe smallest packet re-transmission becomes accomplished proposed. The technique which proposes compared and LOAD and AODV that about 13%, about 16% energy consumption is few respectively averagely, Energy of the entire network equally, used and energy effectiveness and improvement of network life time experiment led and confirmed.

A Study on Management Method of Point and Line Data Using Mobile GIS (모바일 GIS를 이용한 Point 및 Line형 데이터 갱신 방법에 관한 연구)

  • Jeon, Jae-Yong;Cho, Gi-Sung
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.3
    • /
    • pp.3-10
    • /
    • 2007
  • As information communication technology matures, GIS is being evolved from wire communication GIS to mobile GIS. This is due that mobile GIS satisfy mobility, field work, speed and time. Also, this is proper that mobile GIS accomplish investigation, confirmation, input and modification operations of spatial and attribute data at field. I think mobile GIS's use is the best way. Because, Mobile GIS's use can accomplish effectively the management of various kinds facilities in city. On this study, we consider diversified methods a person in charge can management point and line data with more easy and more effective method. The management methods of pint type data are free method, offset method two point method. The management methods of line type data are free method, point connection method, point and line connection method and the minimum distance connection method between point and line.

  • PDF

An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks (연결 지향 네트워크에서 최초 가용 구간을 찾는 효율적인 알고리즘)

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.3
    • /
    • pp.73-80
    • /
    • 2010
  • The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.

Differentiated RWA Algorithm Providing QoS Recovery in the Next Generation Backbone Network based on DWDM (DWDM 기반의 차세대 백본망에서 QoS Recovery를 제공하는 차등적인 RWA 알고리즘)

  • Bae, Jung-Hyun;Song, Hyun-Su;Lee, Hyun-Jin;Kim, Young-Boo;Kim, Sung-Un
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.105-108
    • /
    • 2003
  • In the next generation backbone networks based on dense-wavelength division multiplexing (DWDM), the routing and wavelength assignment with quality-of-service (QoS) recovery is essentially needed to support a wide range of communication-intensive and real-time multimedia services. This paper proposes a new dpmic routing method called as MW-MIPR (MultiWavelength-Minimum Interference Path Routing), which chooses a route that does not interfere too much with many potential future connection requests. This paper also proposes a differentiated RWA mechanisms combined with MW-MIPR algorithm to provide QoS recovery for various multimedia applications in the next generation backbone networks based on DWDM.

  • PDF

Improvement of Learning Capabilities in Multilayer Perceptron by Progressively Enlarging the Learning Domain (점진적 학습영역 확장에 의한 다층인식자의 학습능력 향상)

  • 최종호;신성식;최진영
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.1
    • /
    • pp.94-101
    • /
    • 1992
  • The multilayer perceptron, trained by the error back-propagation learning rule, has been known as a mapping network which can represent arbitrary functions. However depending on the complexity of a function and the initial weights of the multilayer perceptron, the error back-propagation learning may fall into a local minimum or a flat area which may require a long learning time or lead to unsuccessful learning. To solve such difficulties in training the multilayer perceptron by standard error back-propagation learning rule, the paper proposes a learning method which progressively enlarges the learning domain from a small area to the entire region. The proposed method is devised from the investigation on the roles of hidden nodes and connection weights in the multilayer perceptron which approximates a function of one variable. The validity of the proposed method was illustrated through simulations for a function of one variable and a function of two variable with many extremal points.

  • PDF

Studies on the Manufacturing of Carbonaceous Products (Ⅰ) Effects of the Binder by Cutting Condition of Coal Tar (炭素製品 製造에 關한 硏究 (第 1 報) Coal tar의 Cutting 條件에 依한 粘結劑로서의 檢討)

  • Won Dal Hyun;Ju Seong Lee;Hi Wook Kim
    • Journal of the Korean Chemical Society
    • /
    • v.8 no.3
    • /
    • pp.98-102
    • /
    • 1964
  • As a practical method to produce the carbonaceous binder, the destructive distillation of coal tar has been studied. The optimum condition on binder in various temp. and cutting time were examined and the compositions of pitch were also examined in connection with ${\alpha},\;{\beta}\;and\;{\gamma}$ by solvent extraction. Coke powder was mixed with binder as treated pitch in the proportions of 77% of coke to 23% of pitch, to give a plastic mix which could then be pressed into molding. The properties of baked body after molding was tested. It was found that cutting of the coal tar at 350${\circ}C$, for 30 min., at 300${\circ}C$. for 1 hr., and at 250${\circ}C$. for 8 hrs. were good condition. Particularly, we found that the cutting of the coal tar obtained by destructive distillation at high temp. and in minimum period of time had shown the best condition for utilization of carbonaceous pitch as binder. The above mentioned cutting condition results in good quality of pitch which is available to be used as binder in carbon industry.

  • PDF

Switching Element Disjoint Multicast Scheduling for Avoiding Crosstalk in Photonic Banyan-Type Switching Networks(Part I):Graph Theoretic Analysis of Crosstalk Relationship (광 베니언-형 교환 망에서의 누화를 회피하기 위한 교환소자를 달리하는 멀티캐스트 스케줄링(제1부):누화 관계의 그래프 이론적 분석)

  • Tscha, Yeong-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.3
    • /
    • pp.447-453
    • /
    • 2001
  • In this paper, we consider the scheduling of SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks constructed with directional couplers. This ensures that at most, one connection holds each SE in a given time thus, neither crosstalk nor blocking will arise in the network. Such multicasting usually takes several routing rounds hence, it is desirable to keep the number of rounds(i.e., scheduling length) to a minimum. We first present the necessary and sufficient condition for connections to pass through a common SE(i.e., make crosstalk) in the photonic Banyan-type networks capable of supporting one-to-many connections. With definition of uniquely splitting a multicast connection into distinct subconnections, the crosstalk relationship of a set of connections is represented by a graph model. In order to analyze the worst case crosstalk we characterize the upper bound on the degree of the graph. The successor paper(Part II)[14] is devoted to the scheduling algorithm and the upper bound on the scheduling length. Comparison with related results is made in detail.

  • PDF

A Client Agent Framework for Dynamic Connection with Web Services (웹 서비스 동적 연동을 위한 클라이언트 에이전트 프레임워크)

  • Park, Young-Joon;Lee, Woo-Jin
    • The KIPS Transactions:PartA
    • /
    • v.16A no.5
    • /
    • pp.339-346
    • /
    • 2009
  • In order to connect web services, clients generally should use heavy frameworks such as .Net framework and Java run-time environment, which require high performance hardware resources like a personal computer. Therefore, it is impossible for sensor nodes to handle web services due to their limited resources. In this paper, a client agent framework is proposed for dynamically connecting web services in the client node with limited resources. A client agent, which is managed by the framework in other server, has full capability for connecting web services, while a real client has a simple connection module with the client agent. In this framework, a client agent is dynamically generated using the WSDL in the web service server. By using the framework, sensor nodes or mobile devices can enhance their functionalities and services by accessing web services with minimum resources.

Finding Rectilinear(L1), Link Metric, and Combined Shortest Paths with an Intelligent Search Method (지능형 최단 경로, 최소 꺾임 경로 및 혼합형 최단 경로 찾기)

  • Im, Jun-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.43-54
    • /
    • 1996
  • This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m+eloge+NlogN) and O(eloge+NlogN) time, respectively, and O(e+N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

  • PDF

Automation of One-Dimensional Finite Element Analysis of a Direct-Connection Spindle System of Machine Tools Using ANSYS (ANSYS를 활용한 공작기계 직결주축 시스템의 1차원 유한요소해석 자동화)

  • Choi, Jin-Woo
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.14 no.2
    • /
    • pp.127-133
    • /
    • 2015
  • In this study, an analytical model was developed for one-dimensional finite element analysis (1D FEA) of a spindle system of machine tools and then implemented to automate the FEA as a tool. FEA, with its vibration characteristics such as natural frequencies and modes, was performed using the universal FEA software ANSYS. VBA of EXCEL was used to provide the programming environment for its implementation. This enabled graphic user interfaces (GUIs) to be developed to allow interactions of users with the tool and, in addition, an EXCEL spreadsheet to be linked with the tool for data arrangement. The language of ANSYS was used to develop a code to perform the FEA. It generates an analytical model of the spindle system based on the information at the GUIs and subsequently performs the FEA based on the model. Automation helps identify the near-optimal design of the spindle system with minimum time and efforts.