• Title/Summary/Keyword: centralized algorithm

Search Result 211, Processing Time 0.029 seconds

Multiple Path-Finding Algorithm in the Centralized Traffic Information System (중앙집중형 도로교통정보시스템에서 다중경로탐색 알고리즘)

  • 김태진;한민흥
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.6
    • /
    • pp.183-194
    • /
    • 2001
  • The centralized traffic information system is to gather and analyze real-time traffic information, to receive traffic information request from user, and to send user processed traffic information such as a path finding. Position information, result of destination search, and other information. In the centralized traffic information system, a server received path-finding requests from many clients and must process clients requests in time. The algorithm of multiple path-finding is needed for a server to process clients request, effectively in time. For this reason, this paper presents a heuristic algorithm that decreases time to compute path-finding requests. This heuristic algorithm uses results of the neighbor nodes shortest path-finding that are computed periodically. Path-finding results of this multiple path finding algorithm to use results of neighbor nodes shortest path-finding are the same as a real optimal path in many cases, and are a little different from results of a real optimal path in non-optimal path. This algorithm is efficiently applied to the general topology and the hierarchical topology such as traffic network. The computation time of a path-finding request that uses results of a neighbor nodes shortest path-finding is 50 times faster than other algorithms such as one-to-one label-setting and label-correcting algorithms. Especially in non-optimal path, the average error rate is under 0.1 percent.

  • PDF

Active Vibration Control of Shell Structure Subjected to Internal Unbalanced Excitation (내부 불평형 기진력을 갖는 원통형 구조물의 능동진동제어)

  • Kim, Seung-Ki;Jung, Woo-Jin;Bae, Soo-Ryong;Lee, Sang-Kyu;Kwak, Moon K.
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.27 no.2
    • /
    • pp.195-203
    • /
    • 2017
  • This paper is concerned with the active vibration control of shell structure that is subjected to internal unbalanced excitation by using active mounts and accelerometers. The unbalanced excitation is caused by a rotating unbalanced mass. The control algorithm considered in this study is the negative acceleration feedback (NAF) control. A simplified dynamic model was derived to verify the effectiveness of the NAF control. Four actuators and four accelerometers were mounted on the shell structure, so that the multiple-input and multiple-output (MIMO) NAF controller was designed by both centralized and decentralized ways. Numerical results show that both the decentralized and centralized NAF controllers are effective. Based on the numerical simulation, the proposed decentralized NAF controller was applied to the real shell structure. Experimental results show that the proposed decentralized NAF controller can effectively suppress vibrations of the shell structure.

Internet of Things (IoT) Framework for Granting Trust among Objects

  • Suryani, Vera;Sulistyo, Selo;Widyawan, Widyawan
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1613-1627
    • /
    • 2017
  • The concept of the Internet of Things (IoT) enables physical objects or things to be virtually accessible for both consuming and providing services. Undue access from irresponsible activities becomes an interesting issue to address. Maintenance of data integrity and privacy of objects is important from the perspective of security. Privacy can be achieved through various techniques: password authentication, cryptography, and the use of mathematical models to assess the level of security of other objects. Individual methods like these are less effective in increasing the security aspect. Comprehensive security schemes such as the use of frameworks are considered better, regardless of the framework model used, whether centralized, semi-centralized, or distributed ones. In this paper, we propose a new semi-centralized security framework that aims to improve privacy in IoT using the parameters of trust and reputation. A new algorithm to elect a reputation coordinator, i.e., ConTrust Manager is proposed in this framework. This framework allows each object to determine other objects that are considered trusted before the communication process is implemented. Evaluation of the proposed framework was done through simulation, which shows that the framework can be used as an alternative solution for improving security in the IoT.

A Study on the Power Management Algorithm of Centralized Electric Vehicle Charging System (중앙제어기반 전기자동차 충전시스템의 에너지관리 알고리즘에 관한 연구)

  • Do, Quan-Van;Lee, Seong-Joon;Lee, Jae-Duck;Bae, Jeong-Hyo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.3
    • /
    • pp.566-571
    • /
    • 2011
  • As Plug-in Hybrid Vehicle and Electric Vehicle (PHEV/EV) take a greater share in the personal automobile market, their high penetration levels may bring potential challenges to electric utility especially at the distribution level. Thus, there is a need for the flexible charging management strategy to compromise the benefits of both PHEV/EV owners and power grid side. There are many different management methods that depend on the objective function and the constraints caused by the system. In this paper, the schema and dispatching schedule of centralized PHEV/EV charging spot network are analyzed. Also, we proposed and compared three power allocation strategies for centralized charging spot. The first strategy aims to maximize state of vehicles at plug-out time, the rest methods are equalized allocation and prioritized allocation based on vehicles SoC. The simulation results show that each run of the optimized algorithms can produce the satisfactory solutions to response properly the requirement from PHEV/EV customers.

Collaborative Modeling of Medical Image Segmentation Based on Blockchain Network

  • Yang Luo;Jing Peng;Hong Su;Tao Wu;Xi Wu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.958-979
    • /
    • 2023
  • Due to laws, regulations, privacy, etc., between 70-90 percent of providers do not share medical data, forming a "data island". It is essential to collaborate across multiple institutions without sharing patient data. Most existing methods adopt distributed learning and centralized federal architecture to solve this problem, but there are problems of resource heterogeneity and data heterogeneity in the practical application process. This paper proposes a collaborative deep learning modelling method based on the blockchain network. The training process uses encryption parameters to replace the original remote source data transmission to protect privacy. Hyperledger Fabric blockchain is adopted to realize that the parties are not restricted by the third-party authoritative verification end. To a certain extent, the distrust and single point of failure caused by the centralized system are avoided. The aggregation algorithm uses the FedProx algorithm to solve the problem of device heterogeneity and data heterogeneity. The experiments show that the maximum improvement of segmentation accuracy in the collaborative training mode proposed in this paper is 11.179% compared to local training. In the sequential training mode, the average accuracy improvement is greater than 7%. In the parallel training mode, the average accuracy improvement is greater than 8%. The experimental results show that the model proposed in this paper can solve the current problem of centralized modelling of multicenter data. In particular, it provides ideas to solve privacy protection and break "data silos", and protects all data.

Contention-based Reservation MAC Protocol for Burst Traffic in Wireless Packet Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.2
    • /
    • pp.93-97
    • /
    • 2007
  • In this paper, centralized access control and slot allocation algorithm is proposed for wireless networks. The proposed algorithm is characterized by the contention-based reservation. In order to reduce the collision probability of reservation request, the base station calculates and broadcasts the transmission probability of reservation requests, and the wireless terminal transmits its reservation request with the received transmission probability. The scheduler allocates the uplink data slots based on the successful reservation requests. Simulation results show that the proposed algorithms can provide high channel utilization, and furthermore, maintains constant delay performance in the heavy traffic environment.

Study on the wormhole detection and prevention algorithm for MANET (MANET에서 wormhole 공격의 탐지 및 방지를 위한 알고리즘에 대한 연구)

  • Kim, Jae-Honh;Kim, Se-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • pp.494-497
    • /
    • 2008
  • In Mobile ad hoc networks (MANET), nodes could transmit packets for each other to communicate beyond their transmission range without centralized control. Unlike infrastructure-based wireless networks, due to the unique characteristics of MANETs such as open network architecture, stringent resource constraints and highly dynamic network topology, networks are vulnerable to wormhole attacks launched through colluding nodes. In this paper, we develop an wormhole detection and prevention algorithm for MANET.

  • PDF

Robust decentralized control of structures using the LMI Hcontroller with uncertainties

  • Raji, Roya;Hadidi, Ali;Ghaffarzadeh, Hosein;Safari, Amin
    • Smart Structures and Systems
    • /
    • v.22 no.5
    • /
    • pp.547-560
    • /
    • 2018
  • This paper investigates the operation of the $H_{\infty}$ static output-feedback controller to reduce dynamic responses under seismic excitation on the five-story and benchmark 20 story building with parametric uncertainties. Linear matrix inequality (LMI) control theory is applied in this system and then to achieve the desired LMI formulations, some transformations of the LMI variables is used. Conversely uncertainties due to material properties, environmental loads such as earthquake and wind hazards make the uncertain system. This problem and its effects are studied in this research. Also to decrease the transition of large amount of data between sensors and controller, avoiding the disruption of whole control system and economy problems, the operation of the decentralized controllers is investigated in this paper. For this purpose the comparison between the performance of the centralized, fully decentralized and partial decentralized controllers in uncoupled and coupled cases is performed. Also, the effect of the changing the number of stories in substructures is considered. Based on the numerical results, the used control algorithm is very robust against the parametric uncertainties and structural responses are decreased considerably in all the control cases but partial decentralized controller in coupled form gets the closest results to the centralized case. The results indicate the high applicability of the used control algorithm in the tall shear buildings to reduce the structural responses and its robustness against the uncertainties.

Implicit Scheduling Algorithm for Dynamic Slot Assignment in Wireless ATM Networks (무선 ATM 네트워크에서의 동적 대역 할당을 위한 묵시적 스케쥴링 알고리즘)

  • 황민재;강충구;김용진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1229-1238
    • /
    • 1999
  • To maximize the statistical multiplexing gain in wireless ATM MAC, a centralized scheduling function must be provided for the dynamic slot assignment in the wireless ATM access point. Exploiting the dynamic parameters received in the wireless ATM access point, the centralized scheduler will execute a dynamic slot assignment to determine bandwidth required for individual wireless terminal. In this paper, we propose a new scheduling algorithm, which can effectively reduce a burden of the explicit signaling requirement of transmitting the dynamic parameters in a timely manner. We have demonstrated that the proposed approach outperforms the existing schemes in terms of the timeliness of transmitting the dynamic parameters, which is a critical factor to the performance of delay-sensitive service classes, and works as an effective means of dynamic slot assignment without heavily relying on the dynamic parameters in the wireless ATM networks.

  • PDF

Fast Recovery Routing Algorithm for Software Defined Network based Operationally Responsive Space Satellite Networks

  • Jiang, Lei;Feng, Jing;Shen, Ye;Xiong, Xinli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2936-2951
    • /
    • 2016
  • An emerging satellite technology, Operationally Responsive Space (ORS) is expected to provide a fast and flexible solution for emergency response, such as target tracking, dense earth observation, communicate relaying and so on. To realize large distance transmission, we propose the use of available relay satellites as relay nodes. Accordingly, we apply software defined network (SDN) technology to ORS networks. We additionally propose a satellite network architecture refered to as the SDN-based ORS-Satellite (Sat) networking scheme (SDOS). To overcome the issures of node failures and dynamic topology changes of satellite networks, we combine centralized and distributed routing mechanisms and propose a fast recovery routing algorithm (FRA) for SDOS. In this routing method, we use centralized routing as the base mode.The distributed opportunistic routing starts when node failures or congestion occur. The performance of the proposed routing method was validated through extensive computer simulations.The results demonstrate that the method is effective in terms of resoving low end-to-end delay, jitter and packet drops.