• Title/Summary/Keyword: Path set

Search Result 752, Processing Time 0.024 seconds

Group Dynamic Source Routing Protocol for Wireless Mobile Ad Hoc Networks (무선 이동 애드 혹 네트워크를 위한 동적 그룹 소스 라우팅 프로토콜)

  • Kwak, Woon-Yong;Oh, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11A
    • /
    • pp.1034-1042
    • /
    • 2008
  • It is very hard, but important to sustain path stability for a reliable communication in mobile ad hoc networks. We propose a novel source routing protocol that establishes a group path with virtual multiple paths to enable a robust communication. The entire mobile nodes form a disjoint set of clusters: Each has its clusterhead as a cluster leader and a unique cluster label to identify itself from other clusters. A group path is a sequence of cluster labels instead of nodes and the nodes with the same label collaborate to deliver packets to a node with next label on the group path. We prove by resorting to simulation that our proposed protocol outperforms the existing key routing protocols, even for a network with a high node mobility and a high traffic.

Environment Adaptive WBAN Routing based on Residual energy (에너지량에 기반한 환경 적응 WBAN 라우팅 알고리즘)

  • Kim, Wee-Yeon;Kim, Dae-Young;Shin, Sang-Bae;Cho, Jin-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.1
    • /
    • pp.89-99
    • /
    • 2011
  • In this paper, we propose an routing algorithm for ultra low power and high reliable transmission in WBAN environment. This algorithm is to minimize energy consumption and to maximize the life and reliability for medical devices. Also, this algorithm is not only medical devices but also non-medical devices is to minimize energy consumption and to maximize the life of device. The combination of the distance from the previous node and residual energy calculates weight. The calculated weight is used to calculate the weight of full path by cumulative weights. The full path to the smallest of the weights are set to the path. Also this algorithm is able to select another path to avoid the error path by determining the link status between nodes, when occurs link error and congestion. In this paper, we show that WSN routing algorithm based on shortest hop count routing algorithm and EAR routing algorithm compared to ensure high reliability and low power characteristic of WBAN to be verified through simulations.

Service Function Chaining Architecture for Distributed 5G Mobile Core Networks (분산 모바일 코어기반 5G 네트워크에서의 Service Function Chaining 적용구조)

  • Sun, Kyoungjae;Kim, Younghan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1914-1924
    • /
    • 2016
  • In this paper, considering virtualized Evolved Packet Core(vEPC) network for 5G mobile network, we propose architecture for supporting Service Function Chaining(SFC) in 5G mobile network. Using SFC in 5G network, dynamic path configuration and providing network services based on subscriber and traffic information. SFC technology provides logical ordered set of network functions and delivers packet through providing logical path over the physical network. Based on the perspective of 5G core network in distributed manner, we design hierarchical SFC architecture to manage SFC for global path including vEPC and SGi-LAN network, and internal path between virtualized network functions in each cloud. In this paper, we define architecture and call flow for establishing data path using SFC. Finally, we design testbed architecture for real implementation based on open source software.

Analysis of Subthreshold Swing Mechanism by Device Parameter of Asymmetric Double Gate MOSFET (소자 파라미터에 따른 비대칭 DGMOSFET의 문턱전압이하 스윙 분석)

  • Jung, Hakkee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.1
    • /
    • pp.156-162
    • /
    • 2015
  • This paper has analyzed how conduction path and electron concentration for the device parameters such as oxide thickness, channel doping, and top and bottom gate voltage influence on subthreshold swing of asymmetric double gate MOSFET. Compared with symmetric and asymmetric double gate MOSFET, asymmetric double gate MOSFET has the advantage that the factors to be able to control the short channel effects increase since top and bottom gate oxide thickness and voltages can be set differently. Therefore the conduction path and electron concentration for top and bottom gate oxide thickness and voltages are investigated, and it is found the optimum conditions that the degradation of subthreshold swing, severe short channel effects, can reduce. To obtain the analytical subthreshold swing, the analytical potential distribution is derived from Possion's equation. As a result, conduction path and electron concentration are greatly changed for device parameters, and subthreshold swing is influenced by conduction path and electron concentration of top and bottom.

A study of set route path avoiding traffic concentration in Mobile Ad hoc Network (MANET에서 트래픽 집중현상을 회피하는 경로설정에 관한 연구)

  • Oh, Dong-keun;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.781-783
    • /
    • 2014
  • Mobile ad hoc network(MANET) consists of node that has mobility. MANET has increased overhead that caused by frequent topology changes. For reducing overhead, hierarchical network that communicates through cluster head node has been researched. When traffic is concentrated on cluster head node, cluster member node can't send message. To solve this problem, we proposed Step Parent algorithm. Proposed algorithm, cluster member node checks traffic of cluster head node using route path of other cluster head node in efficient coverage area. When cluster head node has increased traffic, cluster member node make a new route path by route path by routing path to another cluster head node. So cluster member node sends a message to destination node, we check improving delivery ratio.

  • PDF

A Meta-Analytic Path Analysis on the Outcome Variables of Nursing Unit Managers' Transformational Leadership: Systemic Review and Meta-Analysis (간호단위 관리자의 변혁적 리더십 결과변인에 관한 메타경로분석)

  • Kim, Sunmi;Jeong, Seok Hee
    • Journal of Korean Academy of Nursing
    • /
    • v.50 no.6
    • /
    • pp.757-777
    • /
    • 2020
  • Purpose: The purpose of this study was to identify the outcome variables of nursing unit managers' transformational leadership and to test a hypothetical model using meta-analytic path analysis. Methods: A systematic review and meta-analysis were conducted in accordance with PRISMA guidelines. Data analysis, conducted using R version 3.6.2 software, included 49 studies for the meta-analysis and 119 studies for meta-analytic path analysis. Results: In the meta-analysis, four out of 32 outcome variables were selected. These four variables were empowerment, nursing performance, job satisfaction, and organizational commitment, which showed larger effect sizes than the median and more than five k. The hypothetical model for the meta-analytic path analysis was established by using these four variables and transformational leadership. A total of 22 hypothetical paths including nine direct effects and 13 indirect effects were set and tested. The meta-analytic path analysis showed that transformational leadership had direct effects on the four variables. Finally, eight direct effects, 12 indirect effects, and six mediating effects were statistically significant, and the hypothetical model was verified. Conclusion: Nursing unit managers can use the transformational leadership to improve empowerment, nursing performance, job satisfaction, and organizational commitment of nurses. This study empirically showed the importance of transformational leadership of nursing managers. This finding will be used as evidence to develop strategies for enhancing transformational leadership, empowerment, nursing performance, job satisfaction, and organizational commitment in nursing science and practice.

Indoor Path Recognition Based on Wi-Fi Fingerprints

  • Donggyu Lee;Jaehyun Yoo
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.12 no.2
    • /
    • pp.91-100
    • /
    • 2023
  • The existing indoor localization method using Wi-Fi fingerprinting has a high collection cost and relatively low accuracy, thus requiring integrated correction of convergence with other technologies. This paper proposes a new method that significantly reduces collection costs compared to existing methods using Wi-Fi fingerprinting. Furthermore, it does not require labeling of data at collection and can estimate pedestrian travel paths even in large indoor spaces. The proposed pedestrian movement path estimation process is as follows. Data collection is accomplished by setting up a feature area near an indoor space intersection, moving through the set feature areas, and then collecting data without labels. The collected data are processed using Kernel Linear Discriminant Analysis (KLDA) and the valley point of the Euclidean distance value between two data is obtained within the feature space of the data. We build learning data by labeling data corresponding to valley points and some nearby data by feature area numbers, and labeling data between valley points and other valley points as path data between each corresponding feature area. Finally, for testing, data are collected randomly through indoor space, KLDA is applied as previous data to build test data, the K-Nearest Neighbor (K-NN) algorithm is applied, and the path of movement of test data is estimated by applying a correction algorithm to estimate only routes that can be reached from the most recently estimated location. The estimation results verified the accuracy by comparing the true paths in indoor space with those estimated by the proposed method and achieved approximately 90.8% and 81.4% accuracy in two experimental spaces, respectively.

Research of the Efficient Grid-based Path Planning for Large-Scale Delivery in the Urban Environment (광역 도심 배송을 위한 Efficient Grid 기반 경로 계획 알고리즘 연구)

  • Hanseob Lee;Hoon Jung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.47 no.2
    • /
    • pp.147-154
    • /
    • 2024
  • This study focuses on the path planning algorithm for large-scale autonomous delivery using drones and robots in urban environments. When generating delivery routes in urban environments, it is essential that avoid obstacles such as buildings, parking lots, or any other obstacles that could cause property damage. A commonly used method for obstacle avoidance is the grid-based A* algorithm. However, in large-scale urban environments, it is not feasible to set the resolution of the grid too high. If the grid cells are not sufficiently small during path planning, inefficient paths might be generated when avoiding obstacles, and smaller obstacles might be overlooked. To solve these issues, this study proposes a method that initially creates a low-resolution wide-area grid and then progressively reduces the grid cell size in areas containing registered obstacles to maintain real-time efficiency in generating paths. To implement this, obstacles in the operational area must first be registered on the map. When obstacle information is updated, the cells containing obstacles are processed as a primary subdivision, and cells closer to the obstacles are processed as a secondary subdivision. This approach is validated in a simulation environment and compared with the previous research according to the computing time and the path distance.

An Equilibrium Diffusion Model of Demand and Supply of New Product and Empirical Analysis (신기술 제품의 확산에 관한 수요$\cdot$공급의 균형확산모형과 실증분석)

  • Ha, Tae-Jeong
    • Journal of Technology Innovation
    • /
    • v.13 no.1
    • /
    • pp.113-139
    • /
    • 2005
  • The purpose of this study is to analyse the diffusion process of personal computer (PC) in Korea during the 1990's. To achieve the goal, five research steps have been done such as the literature survey of diffusion theory, set-up of theoretic equilibrium model of supply and demand, derivation of an equilibrium path using Hamiltonian, and empirical analysis. The empirical analysis has been performed based on that equilibrium path. The results can be summarized as follows : First, technological attribute of diffusing product influences the diffusion speed of Product. It has been proven that the size of the network has a significant effect on the diffusion of PC in empirical study Second, supply factors have an important role in the diffusion process. According to the empirical analysis, decreasing cost of production as a result of technological advance promotes the speed of diffusion. This point seems to be manifest theoretically, but existing empirical models have not included supply factors explicitly, Third, it has been found out that expectation of decreasing cost would influence the speed of diffusion negatively as expected ex ante. Theoretically this result is supported by arbitrage condition of purchasing timing.

  • PDF

Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks (하이퍼큐브형 상호연결망의 비쌍형 다대다 서로소인 경로 커버)

  • Park, Jung-Heum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.789-796
    • /
    • 2006
  • An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, $(m{\geq}3)$, with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any $f{\geq}0\;and\;k{\geq}1\;with\;f+k{\leq}m-2$.