• Title/Summary/Keyword: control networks

Search Result 4,035, Processing Time 0.026 seconds

Design and Implementation of Distributed Parking Space Management Service in Scalable LPWA-Based Networks (대규모 LPWA기반 네트워크에서 분산된 주차 공간 관리서비스의 설계 및 구현)

  • Park, Shinyeol;Jeong, Jongpil;Park, Dongbeom;Park, Byungjun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.10
    • /
    • pp.259-268
    • /
    • 2018
  • Due to the development of cities and the increase of vehicles, effective control of parking space management service in cities is needed. However, the existing parking lot management system does not provide limited or convenient service in terms of space and time. In this paper, we propose distributed parking space management service based on large scale LPWA (Low-Power Wide-Area). The parking sensor collects parking space information from the parking lot and is transmitted over a low-power wide network. All parking data is processed and analyzed in the IoT cloud. Through a parking space management service system in all cities, users are given the temporal convenience of determining the parking space and the area efficiency of the parking space.

Performance analysis of the Resource Reservation Schemes using Mobile Cluster based H-MRSVP in Wireless Mobile Networks (무선 이동망에서 이동 클러스터 기반의 H-MRVP를 이용한 자원관리 기법의 성능 분석)

  • Ma, Gyeong-Min;Won, Jeong-Jae;Lee, Hyeong-U;Jo, Chung-Ho
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.283-292
    • /
    • 2002
  • This paper develops a scheme of resource management for guaranteeing QoS of realtime traffic in wireless mobile internet environments Mobile terminal has significant impact on the QoS originating mobility provided to a real-time application. The currently proposed MRSVP is not clear the boundary of resource reservation tregion and also can give rise to signal overhead to maintain sessions. To solve above problem, we propose the new reservation protocol, mobile cluster based H-MRSVP to combine MRSVP with moving cluster concept. In this paper, we analytically design our model for guaranteeing the QoS of realtime traffic and compare the three schemes: guard channel allocation schemes, DCA and our model. The performance measures are the probabilities of new call blocking, handoff dropping, resource utilization and service completion versus the system offered Erlang load. Consequently, Simulation indicate our model is more flexible than DCA in a view pint of channel utilization and gains the advantage over guard channel scheme with respects to the mobility.

Sparse Distributed Memory with Monotonic Decision Function (단조 결정 함수를 갖는 축약 분산 기억 장치)

  • Gwon, Hui-Yong;Jang, Jeong-U;Im, Seong-Jun;Jo, Dong-Seop;Hwang, Hui-Yung
    • The KIPS Transactions:PartB
    • /
    • v.8B no.1
    • /
    • pp.105-113
    • /
    • 2001
  • 최근 축약 분산 기억 장치(SDM)가 적응적 문제 해결 능력과 하드웨어화의 용이성으로 인해 현실성이 있는 신경망의 한 모델로 제안되었다. 그러나 다층 인식자의 개별 뉴런이 선형 또는 비선형 결정 함수로 해 공간을 이분하고 그들이 다양하게 결합함으로써 일반적인 문제 해결 능력을 갖는데 비해, 축약 분산 기억 장치의 뉴런은 해 공간에서 자신을 중심으로 한 일정 반경 영역을 안과 밖으로 이분하고 이들을 단순하게 합하므로써, 해 공간이 실수 공간과 같이 크기 관계를 갖는 경우 비효율적인 모델로 된다. 본 논문에서는 이러한 축약 분산 기억 장치의 특성과 그 원인을 규명하고, 문제의 해 공간이 단조 증가 또는 감소 결정 함수로 양분되는 경우, 기존의 축약 분산 기억 장치에 크기 비교 과정을 도입함으로써, 주어진 문제를 효율적으로 해결할 수 있는 수정된 축약 분산 기억 장치 모델을 제안한다. 아울러 제안된 모델을 ATM망에서의 호 수락 제어 과정에 적용한 예를 보인다.최근 축약 분산 기억 장치(SDM)가 적응적 문제 해결 능력과 하드웨어화의 용이성으로 인해 현실성이 있는 신경망의 한 모델로 제안되었다. 그러나 다층 인식자의 개별 뉴런이 선형 또는 비선형 결정 함수로 해 공간을 이분하고 그들이 다양하게 결합함으로써 일반적인 문제 해결 능력을 갖는데 비해, 축약 분산 기억 장치의 뉴런은 해 공간에서 자신을 중심으로 한 일정 반경 영역을 안과 밖으로 이분하고 이들을 단순하게 합하므로써, 해 공간이 실수 공간과 같이 크기 관계를 갖는 경우 비효율적인 모델로 된다. 본 논문에서는 이러한 축약 분산 기억 장치의 특성과 그 원인을 규명하고, 문제의 해 공간이 단조 증가 또는 감소 결정 함수로 양분되는 경우, 기존의 축약 분산 기억 장치에 크기 비교 과정을 도입함으로써, 주어진 문제를 효율적으로 해결할 수 있는 수정된 축약 분산 기억 장치 모델을 제안한다. 아울러 제안된 모델을 ATM망에서의 호 수락 제어 과정에 적용한 예를 보인다.

  • PDF

User Scheduling Algorithm Based on Signal Quality and Inter-User Interference for Outage Minimization in Full-Duplex Cellular Networks (전이중 셀룰라 네트워크에서 아웃티지 최소화를 위한 신호 품질과 사용자간 간섭량 기반의 사용자 스케쥴링 알고리즘)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2576-2583
    • /
    • 2015
  • In a full-duplex (FD) wireless cellular network, uplink (UL) users induce the severe inter-user interference to downlink (DL) users. Therefore, a user scheduling that makes a pair of DL user and UL user to use the same radio resource simultaneously influences the system performances significantly. In this paper, we first formulate an optimization problem for user scheduling to minimize the occurrence of outage, aiming to guarantee the quality of service of users, and then we propose a suboptimal user scheduling algorithm with low complexity. The proposed scheduling algorithm is designed in a way where the DL user with a worse signal quality has a higher priority to choose its UL user that causes less interference. Simulation results show that the FD system using the proposed user scheduling algorithm achieves the optimal performance and significantly decreases the outage probability compared with the conventional half-duplex cellular system.

Radionuclides of Ground waters in Busan (부산지역 지하수의 방사성물질 특성)

  • Jeon, Dae-Young
    • Journal of Soil and Groundwater Environment
    • /
    • v.14 no.5
    • /
    • pp.51-61
    • /
    • 2009
  • This study was performed to research the characteristic of radionuclides of 80 groundwater monitoring networks in Busan. According to the research, average concentration of Uranium was $4.33\;{\mu}g/L$, maximum concentration of Uranium was $171.55\;{\mu}g/L$ among the 80 sampling sites. One sample exceeded the Proposal standard of drinking water in USA in Uranium ($30\;{\mu}g/L$) and four samples exceeded the recommendatory value of WHO about Uranium ($15\;{\mu}g/L$). Radon and gross-$\alpha$ concentration of all samples were far less than the Proposal standard of drinking water in USA. In this study average concentration of radionuclides in underground water wasn't too high, but needed to control the concentration of them to prevent exposure to the people. And it needs to be taken measures in some sites with high concentration of Uranium by closing the pipe line or etc through more studies.

Morphology Formation and Application of Interpenetrating Polymer Network (IPN) Materials (Interpenetrating Polymer Network(IPN)의 모폴로지 형성과 그 응용)

  • Kim, Sung-Chul
    • Polymer(Korea)
    • /
    • v.29 no.1
    • /
    • pp.1-7
    • /
    • 2005
  • Interpenetrating polymer network (PN) is a mixture of network polymers. The characteristics of IPN material is the control of morphology during the IPN synthesis. By controlling the relative kinetics of chemical reaction (as well as gellation) and phase separation, the morphology of IPN can be controlled to obtain materials with nano-scale domain and also the co-continuous phase. Other important advantage is the fact that the morphology is permanent due to the presence of the physical interlocking between the networks. The combination of hydrophilic polyurethane and hydrophobic polystyrene in IPN form provides enhanced blood compatibility due to the co-existence of the hydrophilic and hydrophobic domains in nano-scale on the surface. The reaction temperature, reaction pressure and the degree of crosslinking were varied during the IPN synthesis and the morphology and blood compatibility of the resulting IPN materials were studied.

Study on Development of Artificial Neural Network Forecasting Model Using Runoff, Water Quality Data (유출량 및 수질자료를 이용한 인공신경망 예측모형 개발에 관한 연구)

  • Oh, Chang-Ryeol;Jin, Young-Hoon;Kim, Dong-Ryeol;Park, Sung-Chun
    • Journal of Korea Water Resources Association
    • /
    • v.41 no.10
    • /
    • pp.1035-1044
    • /
    • 2008
  • It is critical to study on data charateristics analysis and prediction for the flood disaster prevention and water quality monitoring because discharge and TOC data in a river channel are strongly nonlinear. Therefore, in the present study, prediction models for discharge, TOC, and TOC load data were developed using approximation component in the last level and detail components segregated by wavelet transform. The results show that the developed model overcame the persistence phenomenon which could be seen from previous models and improved the prediciton accuracy comparing with the previous models. It might be expected that the results from the present study can mitigate flood disaster damage and construct active alternatives to various water quality problems in the future.

A Method for Minimizing the Number of Clusters in Ad-Hoc Networks (Ad-Hoc 네트워크에서 클러스터 수를 최소화하기 위한 방안)

  • Bang Sang-Won
    • Journal of Internet Computing and Services
    • /
    • v.5 no.6
    • /
    • pp.21-30
    • /
    • 2004
  • In Ad-Hoc network, the cluster structure enables effective use of multiple channels, reduces the number of control messages, and increase the scalability of network, Also, it is employed for reducing the number of broadcast messages in an Ad-Hoc network. With the consideration of these advantages, it is desirable that a cluster structure keeps a few clusters in the network, Generally, the cluster formation scheme based on connectivity yields fewer clusters than the other schemes. However, the connectivity based scheme may yield even more clusters than the other schemes according to the network topology. In this paper, a cluster formation scheme dividing the cluster formation into two phases is proposed. In the first phase, the lowest connectivity host in neighborhood initiates the cluster formation. Then, an adjustment procedure for affiliating a lot of the lowest connectivity hosts is employed. In the second phase, the hosts which were not affiliated to the first phase clusters are grouped into one or more clusters through criterions of connectivity and host ID. As a result, the proposed scheme yields a fewer clusters compared with existing other schemes in fully distributed method. The simulation results proves that our scheme is better than LIDCP(3) and HCCP(3).

  • PDF

Design Call Control of Mechanism for Multiparty Conference in SIP and Case Study (SIP에서 멀티파티 컨퍼런스를 위한 호 처리 메커니즘 설계 및 사례 연구)

  • Jeong Dong-Youl;Min Jun-Sik;Cheon Suh-Hyun
    • Journal of Internet Computing and Services
    • /
    • v.4 no.5
    • /
    • pp.77-86
    • /
    • 2003
  • This paper introduces the extension of SIP protocol for Multiparty Conference and the implementation of IP-based Multi-Conference. SIP protocol is a signaling protocol for initiating, modifying and terminating interactive sessions (voice, video, text, application). Multiparty conference system is implemented by RTP protocol for real time transmission and by H.323 for call setup. As H.323 fits into PSTN, it has some problems (call setup delay, hard implementation) for IP applications. IETF developed SIP protocol used for signaling in IP networks. However this SIP protocol doesn't explain signal protocol about multimedia conference, which is different from the existing H.323. So this paper describes the extension of SIP according to SIP Specification and case study for the multimedia conference.

  • PDF

Design and Evaluation of an Early Intelligent Alert Broadcasting Algorithm for VANETs (차량 네트워크를 위한 조기 지능형 경보 방송 알고리즘의 설계 및 평가)

  • Lee, Young-Ha;Kim, Sung-Tae;Kim, Guk-Boh
    • Journal of Internet Computing and Services
    • /
    • v.13 no.4
    • /
    • pp.95-102
    • /
    • 2012
  • The development of applications for vehicular ad hoc networks (VANETs) has very specific and clear goals such as providing intellectual safe transport systems. An emergency warning technic for public safety is one of the applications which requires an intelligent broadcast mechanism to transmit warning messages quickly and efficiently against the time restriction. The broadcast storm problem causing several packet collisions and extra delay has to be considered to design a broadcast protocol for VANETs, when multiple nodes attempt transmission simultaneously at the access control layer. In this paper, we propose an early intelligent alert broadcasting (EI-CAST) algorithm to resolve effectively the broadcast storm problem and meet time-critical requirement. The proposed algorithm uses not only the early alert technic on the basis of time to collision (TTC) but also the intelligent broadcasting technic on the basis of fuzzy logic, and the performance of the proposed algorithm was compared and evaluated through simulation with the existing broadcasting algorithms. It was demonstrated that the proposed algorithm shows a vehicle can receive the alert message before a collision and have no packet collision when the distance of alert region is less than 4 km.