• Title/Summary/Keyword: low power network

Search Result 1,244, Processing Time 0.026 seconds

DNN-Based Dynamic Cell Selection and Transmit Power Allocation Scheme for Energy Efficiency Heterogeneous Mobile Communication Networks (이기종 이동통신 네트워크에서 에너지 효율화를 위한 DNN 기반 동적 셀 선택과 송신 전력 할당 기법)

  • Kim, Donghyeon;Lee, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.10
    • /
    • pp.1517-1524
    • /
    • 2022
  • In this paper, we consider a heterogeneous network (HetNet) consisting of one macro base station and multiple small base stations, and assume the coordinated multi-point transmission between the base stations. In addition, we assume that the channel between the base station and the user consists of path loss and Rayleigh fading. Under these assumptions, we present the energy efficiency (EE) achievable by the user for a given base station and we formulate an optimization problem of dynamic cell selection and transmit power allocation to maximize the total EE of the HetNet. In this paper, we propose an unsupervised deep learning method to solve the optimization problem. The proposed deep learning-based scheme can provide high EE while having low complexity compared to the conventional iterative convergence methods. Through the simulation, we show that the proposed dynamic cell selection scheme provides higher EE performance than the maximum signal-to-interference-plus-noise ratio scheme and the Lagrangian dual decomposition scheme, and the proposed transmit power allocation scheme provides the similar performance to the trust region interior point method which can achieve the maximum EE.

Accessibility Measure of Cultural Facilities Using Urban Network Analysis (Urban Network Analysis를 이용한 문화시설의 접근성 분석)

  • Park, Tae-Sun;Lee, Mee-Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.35 no.2
    • /
    • pp.455-464
    • /
    • 2015
  • Investments into existing cultural facilities are determined based on administrative district-based indices like population and area. Such macro judgment indices, however, fail to consider accessibility of cultural facilities from neighboring administrative districts and thus create problems including wasted budgets and duplicated investments. More recently, the government has made it a goal to increase the level of citizen awareness of these facilities, but achieving this requires the integration of neighboring administrative districts such that characteristics including transportation network and buildings are reflected in a comprehensive manner. This research therefore looks into Urban Network Analysis (UNA) as a means to investigate accessibility of cultural facilities. Use of UNA will make it possible to analyze the transportation network as well as building distribution, explained by building density, settled population, and other important building factors, in tandem, leading to the concentration of cultural facilities and the surrounding economic district being more properly reflected, and thus allowing for greater explanatory power in determining the level of accessibility. To test this, four target research districts were chosen from within the Gyeonggi Province and analyzed in terms of the accessibility of their everyday cultural facilities. Of the four districts of Gunpo, Anyang, Uiwang, and Gwacheon, accessibility of the first two districts, was found to be high, while accessibility was found to be relatively low for the latter two districts. This finding indicates that cultural facilities investments should be concentrated in the districts of Gunpo and Anyang.

A Distributed Method for Constructing a P2P Overlay Multicast Network using Computational Intelligence (지능적 계산법을 이용한 분산적 P2P 오버레이 멀티케스트 네트워크 구성 기법)

  • Park, Jaesung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.6
    • /
    • pp.95-102
    • /
    • 2012
  • In this paper, we propose a method that can construct efficiently a P2P overlay multicast network composed of many heterogeneous peers in communication bandwidth, processing power and a storage size by selecting a peer in a distributed fashion using an ant-colony theory that is one of the computational intelligence methods. The proposed method considers not only the capacity of a peer but also the number of children peers supported by the peer and the hop distance between a multicast source and the peer when selecting a parent peer of a newly joining node. Thus, an P2P multicast overlay network is constructed efficiently in that the distances between a multicast source and peers are maintained small. In addition, the proposed method works in a distributed fashion in that peers use their local information to find a parent node. Thus, compared to a centralized method where a centralized server maintains and controls the overlay construction process, the proposed method scales well. Through simulations, we show that, by making a few high capacity peers support a lot of low capacity peers, the proposed method can maintain the size of overlay network small even there are a few thousands of peers in the network.

Design and Implementation of a Fault-Tolerant Caching System for Dynamic Heterogeneous Cache Server Networks (동적 이기종 캐시 서버 네트워크에서의 내결함성 캐싱 시스템 설계 및 구현)

  • Hyeon-Gi Kim;Gyu-Sik Ham;Jin-Woo Kim;Soo-Young Jang;Chang-Beom Choi
    • Journal of IKEEE
    • /
    • v.28 no.3
    • /
    • pp.458-464
    • /
    • 2024
  • This study proposes a fault-tolerant caching system to address the issue of caching content imbalance caused by the dynamic departure and participation of cache servers in a heterogeneous cache server network, and validates it in both real and virtual environments. With the increase of large-scale media content requiring various types and resolutions, the necessity of cache servers as key components to reduce response time to user requests and alleviate network load has been growing. In particular, research on heterogeneous cache server networks utilizing edge computing and low-power devices has been actively conducted recently. However, in such environments, the irregular departure and participation of cache servers can occur frequently, leading to content imbalance among the cache servers deployed in the network, which can degrade the performance of the cache server network. The fault-tolerant caching algorithm proposed in this study ensures stable service quality by maintaining balance among media contents even when cache servers depart. Experimental results confirmed that the proposed algorithm effectively maintains content distribution despite the departure of cache servers. Additionally, we built a network composed of seven heterogeneous cache servers to verify the practicality of the proposed caching system and demonstrated its performance and scalability through a large-scale cache server network in a virtual environment.

A Route Repair Scheme for Reducing DIO Poisoning Overhead in RPL-based IoT Networks (RPL 기반 IoT 네트워크에서 DIO Poisoning 오버헤드를 감소시키는 경로 복구 방법)

  • Lee, Sung-Jun;Chung, Sang-Hwa
    • Journal of KIISE
    • /
    • v.43 no.11
    • /
    • pp.1233-1244
    • /
    • 2016
  • In the IoT network environments for LLNs(Low power and Lossy networks), IPv6 Routing Protocol for Low Power and Lossy networks(RPL) has been proposed by IETF(Internet Engineering Task Force). The goal of RPL is to create a directed acyclic graph, without loops. As recommended by the IETF standard, RPL route recovery mechanisms in the event of a failure of a node should avoid loop, loop detection, DIO Poisoning. In this process, route recovery time and control message might be increased in the sub-tree because of the repeated route search. In this paper, we suggested RPL route recovery method to solve the routing overhead problem in the sub-tree during a loss of a link in the RPL routing protocol based on IoT wireless networks. The proposed method improved local repair process by utilizing a route that could not be selected as the preferred existing parents. This reduced the traffic control packet, especially in the disconnected node's sub tree. It also resulted in a quick recovery. Our simulation results showed that the proposed RPL local repair reduced the recovery time and the traffic of control packets of RPL. According to our experiment results, the proposed method improved the recovery performance of RPL.

eRPL : An Enhanced RPL Based Light-Weight Routing Protocol in a IoT Capable Infra-Less Wireless Networks (사물 인터넷 기반 기기 간 통신 무선 환경에서 향상된 RPL 기반 경량화 라우팅 프로토콜)

  • Oh, Hayoung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.10
    • /
    • pp.357-364
    • /
    • 2014
  • The first mission for the IoT based hyper-connectivity communication is developing a device-to-device communication technique in infra-less low-power and lossy networks. In a low-power and lossy wireless network, IoT devices and routers cannot keep the original path toward the destination since they have the limited memory. Different from the previous light-weight routing protocols focusing on the reduction of the control messages, the proposed scheme provides the light-weight IPv6 address auto-configuration, IPv6 neighbor discovery and routing protocol in a IoT capable infra-less wireless networks with the bloom filer and enhanced rank concepts. And for the first time we evaluate our proposed scheme based on the modeling of various probability distributions in the IoT environments with the lossy wireless link. Specifically, the proposed enhanced RPL based light-weight routing protocol improves the robustness with the multi-paths locally established based on the enhanced rank concepts even though lossy wireless links are existed. We showed the improvements of the proposed scheme up to 40% than the RPL based protocol.

Adaptive Buffer and Burst Scheme and Its Characteristics for Energy Saving in Core IP Networks (에너지 절약을 위해 적응적 버퍼링 기법을 이용한 버스트 구성 방법 및 특성)

  • Han, Chimoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.34-42
    • /
    • 2012
  • This paper analyses the energy saving basic power models in core IP networks, and proposes the adaptive buffer and burst scheme which is a possible energy saving method, and its implementation algorithm in core IP networks. Especially this paper describes the adaptive buffer and burst scheme dynamically varying the buffering interval B according to the input traffic volume of ingress router, and explains the operation principle of proposed scheme. This method is to adjust the buffering interval B according to input traffic volume of ingress router, that is increasing the interval B when input traffic volume is low, and decreasing the interval B when input traffic volume is high between some given interval regions. This method can gets the high energy saving effect as decreasing the transition number of idle/active in networks when input traffic volume is low, and decreasing the transition number of idle/active by the continuous of burst packets in transit router when input traffic volume is high. This paper shows the increasing of asleep rate for the energy saving of core IP networks and confirms the energy saving of core IP networks by the computer simulation. We confirmed that proposed method can be save the energy of IP networks by properly trade off network performances.

Entity Authentication Scheme for Secure WEB of Things Applications (안전한 WEB of Things 응용을 위한 개체 인증 기술)

  • Park, Jiye;Kang, Namhi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.5
    • /
    • pp.394-400
    • /
    • 2013
  • WoT (Web of Things) was proposed to realize intelligent thing to thing communications using WEB standard technology. It is difficult to adapt security protocols suited for existing Internet communications into WoT directly because WoT includes LLN(Low-power, Lossy Network) and resource constrained sensor devices. Recently, IETF standard group propose to use DTLS protocol for supporting security services in WoT environments. However, DTLS protocol is not an efficient solution for supporting end to end security in WoT since it introduces complex handshaking procedures and high communication overheads. We, therefore, divide WoT environment into two areas- one is DTLS enabled area and the other is an area using lightweight security scheme in order to improve them. Then we propose a mutual authentication scheme and a session key distribution scheme for the second area. The proposed system utilizes a smart device as a mobile gateway and WoT proxy. In the proposed authentication scheme, we modify the ISO 9798 standard to reduce both communication overhead and computing time of cryptographic primitives. In addition, our scheme is able to defend against replay attacks, spoofing attacks, select plaintext/ciphertext attacks, and DoS attacks, etc.

Cascade CNN with CPU-FPGA Architecture for Real-time Face Detection (실시간 얼굴 검출을 위한 Cascade CNN의 CPU-FPGA 구조 연구)

  • Nam, Kwang-Min;Jeong, Yong-Jin
    • Journal of IKEEE
    • /
    • v.21 no.4
    • /
    • pp.388-396
    • /
    • 2017
  • Since there are many variables such as various poses, illuminations and occlusions in a face detection problem, a high performance detection system is required. Although CNN is excellent in image classification, CNN operatioin requires high-performance hardware resources. But low cost low power environments are essential for small and mobile systems. So in this paper, the CPU-FPGA integrated system is designed based on 3-stage cascade CNN architecture using small size FPGA. Adaptive Region of Interest (ROI) is applied to reduce the number of CNN operations using face information of the previous frame. We use a Field Programmable Gate Array(FPGA) to accelerate the CNN computations. The accelerator reads multiple featuremap at once on the FPGA and performs a Multiply-Accumulate (MAC) operation in parallel for convolution operation. The system is implemented on Altera Cyclone V FPGA in which ARM Cortex A-9 and on-chip SRAM are embedded. The system runs at 30FPS with HD resolution input images. The CPU-FPGA integrated system showed 8.5 times of the power efficiency compared to systems using CPU only.

Very Short- and Long-Term Prediction Method for Solar Power (초 장단기 통합 태양광 발전량 예측 기법)

  • Mun Seop Yun;Se Ryung Lim;Han Seung Jang
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.6
    • /
    • pp.1143-1150
    • /
    • 2023
  • The global climate crisis and the implementation of low-carbon policies have led to a growing interest in renewable energy and a growing number of related industries. Among them, solar power is attracting attention as a representative eco-friendly energy that does not deplete and does not emit pollutants or greenhouse gases. As a result, the supplement of solar power facility is increasing all over the world. However, solar power is easily affected by the environment such as geography and weather, so accurate solar power forecast is important for stable operation and efficient management. However, it is very hard to predict the exact amount of solar power using statistical methods. In addition, the conventional prediction methods have focused on only short- or long-term prediction, which causes to take long time to obtain various prediction models with different prediction horizons. Therefore, this study utilizes a many-to-many structure of a recurrent neural network (RNN) to integrate short-term and long-term predictions of solar power generation. We compare various RNN-based very short- and long-term prediction methods for solar power in terms of MSE and R2 values.