• Title/Summary/Keyword: Planning Scheme

Search Result 409, Processing Time 0.031 seconds

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
    • /
    • v.13 no.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.10a
    • /
    • 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)
    • /
    • v.6 no.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)
    • /
    • v.10 no.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 (재난안전통신 환경에서 고출력 단말의 자원할당 기법)

  • Nam, Jong-Hyun;Shin, Oh-Soon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.2
    • /
    • pp.9-15
    • /
    • 2017
  • In this paper, we propose a resource allocation scheme for high-power user equipment (HPUE) in public safety communication environments. The use of HPUE is being considered to increase the throughput and communication range of a UE in the disaster area where normal communication links are not available. However, HPUE may cause higher interference to UE's in adjacent cells that are allocated to the same radio resources. Therefore, it is necessary to deal with the potential interference through frequency planning and resource allocation. The performance of the proposed resource allocation scheme is evaluated through simulations in 3GPP public safety communication scenarios.

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
    • /
    • v.21 no.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
    • /
    • v.3 no.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.

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

  • 윤성순;김원규
    • Journal of Korean Society of Transportation
    • /
    • v.12 no.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 (전력(電力)의 수요측(需要側) 관리방안(管理方案))

  • Kang, Won-Koo
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • 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 (지식 기반 플랜트 건설 공정 계획 시스템의 개발)

  • 김우주
    • Journal of Intelligence and Information Systems
    • /
    • v.7 no.1
    • /
    • pp.81-95
    • /
    • 2001
  • Plant construction projects usually take much higher uncertainty and risks than the projects from other domains. This implies the importance of plant construction project management should be more emphasized than the other domain. Especially, the overall successes of the projects often depend on the performance of process planning and scheduling performed at the initial stage of the project. However, most plant construction projects suffer great difficulties in establishing proper process planning and scheduling timely because of unstructureness and dynamicity of environment of the project itself In this paper, we propose a knowledge-based process planning and scheduling approach in a plant construction domain to cope this problem. First, we modulize process planning knowledge and present the knowledge representation scheme. Second, we propose an inferencing mechanism to build a process planning for plant construction based on the represented process planning knowledge. Since our approach automate the initial process planning, which was usually done by manual way, it can improve the correctness and also completeness of the process plan and schedule by reducing the time to plan and allowing simulations on the various situation. We also design and implement this our approach as a real working system, and it is successfully applied to real plant construction cases from a leading construction company in Korea. Based on this success, we expect our approach can be easily applied to the projects of other areas, while contributing to enhancement in productivity and quality of project management.

  • PDF