• 제목/요약/키워드: Planning Scheme

검색결과 409건 처리시간 0.028초

A reinforcement learning-based network path planning scheme for SDN in multi-access edge computing

  • MinJung Kim;Ducsun Lim
    • International journal of advanced smart convergence
    • /
    • 제13권2호
    • /
    • pp.16-24
    • /
    • 2024
  • With an increase in the relevance of next-generation integrated networking environments, the need to effectively utilize advanced networking techniques also increases. Specifically, integrating Software-Defined Networking (SDN) with Multi-access Edge Computing (MEC) is critical for enhancing network flexibility and addressing challenges such as security vulnerabilities and complex network management. SDN enhances operational flexibility by separating the control and data planes, introducing management complexities. This paper proposes a reinforcement learning-based network path optimization strategy within SDN environments to maximize performance, minimize latency, and optimize resource usage in MEC settings. The proposed Enhanced Proximal Policy Optimization (PPO)-based scheme effectively selects optimal routing paths in dynamic conditions, reducing average delay times to about 60 ms and lowering energy consumption. As the proposed method outperforms conventional schemes, it poses significant practical applications.

Integrated Navigation of the Mobile Service Robot in Office Environments

  • Chung, Woo-Jin;Kim, Gun-Hee;Kim, Mun-Sang;Lee, Chong-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.2033-2038
    • /
    • 2003
  • This paper describes an integrated navigation strategy for the autonomous service robot PSR. The PSR is under development at the KIST for service tasks in indoor public environments. The PSR is a multi-functional mobile-manipulator typed agent, which works in daily life. Major advantages of proposed navigation are as follows: 1) Structured control architecture for a systematic integration of various software modules. A Petri net based configuration design enables stable control flow of a robot. 2) A range sensor based generalized scheme of navigation. Any range sensor can be selectively applied using the proposed navigation scheme. 3) No need for modification of environments. (No use of artificial landmarks.) 4) Hybrid approaches combining reactive behavior as well as deliberative planner, and local grid maps as well as global topological maps. A presented experimental result shows that the proposed navigation scheme is useful for mobile service robot in practical applications.

  • PDF

The Insights of Localization through Mobile Anchor Nodes in Wireless Sensor Networks with Irregular Radio

  • Han, Guangjie;Xu, Huihui;Jiang, Jinfang;Shu, Lei;Chilamkurti, Naveen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권11호
    • /
    • pp.2992-3007
    • /
    • 2012
  • Recently there has been an increasing interest in exploring the radio irregularity research problem in Wireless Sensor Networks (WSNs). Measurements on real test-beds provide insights and fundamental information for a radio irregularity model. In our previous work "LMAT", we solved the path planning problem of the mobile anchor node without taking into account the radio irregularity model. This paper further studies how the localization performance is affected by radio irregularity. There is high probability that unknown nodes cannot receive sufficient location messages under the radio irregularity model. Therefore, we dynamically adjust the anchor node's radio range to guarantee that all the unknown nodes can receive sufficient localization information. In order to improve localization accuracy, we propose a new 2-hop localization scheme. Furthermore, we point out the relationship between degree of irregularity (DOI) and communication distance, and the impact of radio irregularity on message receiving probability. Finally, simulations show that, compared with 1-hop localization scheme, the 2-hop localization scheme with the radio irregularity model reduces the average localization error by about 20.51%.

Multi-Cluster based Dynamic Channel Assignment for Dense Femtocell Networks

  • Kim, Se-Jin;Cho, IlKwon;Lee, ByungBog;Bae, Sang-Hyun;Cho, Choong-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권4호
    • /
    • pp.1535-1554
    • /
    • 2016
  • This paper proposes a novel channel assignment scheme called multi-cluster based dynamic channel assignment (MC-DCA) to improve system performance for the downlink of dense femtocell networks (DFNs) based on orthogonal frequency division multiple access (OFDMA) and frequency division duplexing (FDD). In order to dynamically assign channels for femtocell access points (FAPs), the MC-DCA scheme uses a heuristic method that consists of two steps: one is a multiple cluster assignment step to group FAPs using graph coloring algorithm with some extensions, while the other is a dynamic subchannel assignment step to allocate subchannels for maximizing the system capacity. Through simulations, we first find optimum parameters of the multiple FAP clustering to maximize the system capacity and then evaluate system performance in terms of the mean FAP capacity, unsatisfied femtocell user equipment (FUE) probability, and mean FAP power consumption for data transmission based on a given FUE traffic load. As a result, the MC-DCA scheme outperforms other schemes in two different DFN environments for commercial and office buildings.

재난안전통신 환경에서 고출력 단말의 자원할당 기법 (Resource Allocation Scheme for Public Safety Communications with High-Power User Equipment)

  • 남종현;신오순
    • 전자공학회논문지
    • /
    • 제54권2호
    • /
    • pp.9-15
    • /
    • 2017
  • 본 논문은 원활한 통신이 어려운 재난안전통신 환경에서 고출력 단말이 한정된 주파수 자원을 효율적으로 이용할 수 있는 자원할당 기법을 제안한다. 고출력 단말을 도입함에 따라 단말 당 전송률이 증가하고 서비스 영역이 커질 수 있지만 일반 단말과 동일한 주파수 자원을 재사용할 경우 간섭도 증가하여 재난지역 및 인접 지역 전체 시스템 성능 저하의 원인이 된다. 간섭에 의해 기존 셀룰러 시스템 성능에 영향을 미칠 수 있기 때문에 3GPP (3rd Generation Partnership Project)에서는 고출력 단말의 사용 가능 주파수 대역을 상향링크 788-798MHz, 하향링크 758-768MHz로 제한하고 있다. 이러한 제약조건 하에서 단말의 최저 성능 보장을 위한 자원할당 방식을 제안하고 제안한 자원할당 방식의 성능을 모의실험을 통해 검증한다.

An Energy Efficient Clustering Algorithm in Mobile Adhoc Network Using Ticket Id Based Clustering Manager

  • Venkatasubramanian, S.;Suhasini, A.;Vennila, C.
    • International Journal of Computer Science & Network Security
    • /
    • 제21권7호
    • /
    • pp.341-349
    • /
    • 2021
  • Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.

Purchasing and Inventory Policy in a Supply Chain under the Periodic Review: A Single Manufacturer and Multiple Retailers’ Case

  • Prasertwattana, K.;Chiadamrong, N.
    • Industrial Engineering and Management Systems
    • /
    • 제3권1호
    • /
    • pp.38-51
    • /
    • 2004
  • Over the years, most or many companies have focused their attention to the effectiveness and efficiency of their business units. As a new way of doing business, these companies have begun to realize the strategic importance of planning, controlling, and designing their own supply chain system. This paper analyzes the coordination issues in supply chains that consist of one manufacturer and multiple retailers operating under uncertain end customer demand and delivery lead-time. We use the Genetic Algorithm (GA) to determine the appropriate ordering and inventory level at which the manufacturer and multiple retailers can maximize the profit of the chain. This is performed under three controlling policies: the traditionally centralized controlling policy under the manufacturer's perspective, the entire chain’s perspective, and lastly the coordinating controlling policy with an incentive scheme. The outcome from the study reveals that the coordinating controlling policy with an incentive scheme can outperform the traditional centralized controlling policies by creating a win-win situation in which all members of the chain benefit from higher profit, thus resulting in more willingness from all members to join the chain.

구간 교통량의 표준오차를 이용한 최적 O/D 표본수 산출 (Optimal O/D Sample Size Computation using link Volume Estimates)

  • 윤성순;김원규
    • 대한교통학회지
    • /
    • 제12권1호
    • /
    • pp.75-84
    • /
    • 1994
  • In this paper we address the issue of how an optimal sample size computation relates the level of precision required for travel demand estimations and transportation planning. We approach the problem by 1) deriving a theoretical solution, 2) developing a computational procedure (algorithm) to implement the theoretical solution, and 3) demonstrating a practical application. Ultimately, we construct a formal scheme of optimal sample size computation for use in travel data collection processe.

  • PDF

전력(電力)의 수요측(需要側) 관리방안(管理方案) (Demand Side Management in Power System)

  • 강원구
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1993년도 하계학술대회 논문집 A
    • /
    • pp.45-47
    • /
    • 1993
  • Load Management, is originated from efficiency improvement of energy use, or energy conservaion. Traditionally, electric utilities have constructed new power plants to meet the steadily increasing electricity demand. Power development planning, however, is becoming more difficult in the countries like Korea, Japan, and the United States, and increasing concerns about global environmental problems necessitate changes from existing supply-side options based on fossil-fuel to environmentally agreeable supply strategies. This paper discusses the demand side management strategy with emphasis on the concept, implementation scheme, and current practices employed in utilities.

  • PDF

지식 기반 플랜트 건설 공정 계획 시스템의 개발 (A Knowledge-based Approach to Plant Construction Process Planning)

  • 김우주
    • 지능정보연구
    • /
    • 제7권1호
    • /
    • pp.81-95
    • /
    • 2001
  • 플랜트 건설 프로젝트는 다른 분야의 프로젝트에 비하여 상대적으로 높은 불확실성과 위험을 수반하게 되며, 이는 정확한 플랜트 건설 프로젝트의 관리가 프로젝트의 성공에 있어 매우 중요해진다는 것을 의미한다. 특히 프로젝트 관련 초기 단계에서 이루어지는 공정 계획과 일정 계획 작업의 성패가 곧 전체 플랜트 건설 프로젝트 수행의 성패를 결정하는 주요한 요인으로 인식되고 있다. 그럼에도 불구하고 대부분의 플랜트 건설 사업은 그 특유의 비구조성과 환경의 역동성으로 인해 적시에 정확하고 체계적인 공정 및 일정 계획 수립을 수행하고 있지 못한 실정이다. 따라서 본 연구에서는 이와 같은 문제점을 해결하기 위하여 첫째, 플랜트 건설에 필요한 공정 지식을 모듈화하고, 둘째, 플랜트 건설 문제의 체계적 표현 방법을 마련하였으며, 셋째, 문제에 따라 필요한 공정들을 구성하고 계획을 수립하는 전문가의 지식에 대한 표현 기법과 이의 추론 방법론을 개발하였다. 또한 이렇게 수립된 공정 계획을 바탕으로 프로젝트 초기 단계에서의 일정 계획을 수립하는 휴리스틱 기반 일정 계획 방법론을 제안함으로써 보다 빠르게 공정 계획의 수행 가능성과 경제성을 여러 가지 측면에서 고려해 볼 수 있게 된다. 이와 같은 자동화된 프로젝트 초기 단계의 공정 계획 수립은 계획 수립 소요를 극적으로 단축시키며 따라서 불확실한 상황이나 여건에 대한 고려를 체계적으로 그리고 충분히 수행할 수 있게 함으로써 보다 수립된 공정 계획의 완전성과 정확성을 높이게 될 수 있다. 본 연구에서는 또한 이상의 접근 방법을 시스템으로 구현하였으며, 구현된 플랜트 건설 공정 계획과 일정 계획 수립 시스템은 국내 최대 건설회사의 열병합 발전소와 하수처리장 건설을 위한 실제 프로젝트 관리 업무에 적용하여 그 성과를 경험적으로 중명하였다. 특히 이와 같은 실제 적용 사례는 본 방법론이 다른 플랜트 건설 분야에서도 쉽게 적용되어 프로젝트 관리 업무의 질적 향상과 생산성의 제고에 기여할 수 있음을 시사하고 있다.

  • PDF