• 제목/요약/키워드: OPTIMAL NUMBER OF USERS

Search Result 147, Processing Time 0.024 seconds

Simulation of Contaminant Draining Strategy with User Participation in Water Distribution Networks

  • Marlim, Malvin S.;Kang, Doosun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2021.06a
    • /
    • pp.146-146
    • /
    • 2021
  • A contamination event occurring in water distribution networks (WDNs) needs to be handled with the appropriate mitigation strategy to protect public health safety and ensure water supply service continuation. Typically the mitigation phase consists of contaminant sensing, public warning, network inspection, and recovery. After the contaminant source has been detected and treated, contaminants still exist in the network, and the contaminated water should be flushed out. The recovery period is critical to remove any lingering contaminant in a rapid and non-detrimental manner. The contaminant flushing can be done in several ways. Conventionally, the opening of hydrants is applied to drain the contaminant out of the system. Relying on advanced information and communication technology (ICT) on WDN management, warning and information can be distributed fast through electronic media. Water utilities can inform their customers to participate in the contaminant flushing by opening and closing their house faucets to drain the contaminated water. The household draining strategy consists of determining sectors and timeslots of the WDN users based on hydraulic simulation. The number of sectors should be controlled to maintain sufficient pressure for faucet draining. The draining timeslot is determined through hydraulic simulation to identify the draining time required for each sector. The effectiveness of the strategy is evaluated using three measurements, such as Wasted Water (WW), Flushing Duration (FD), and Pipe Erosion (PE). The optimal draining strategy (i.e., group and timeslot allocation) in the WDN can be determined by minimizing the measures.

  • PDF

Optimization of the Similarity Measure for User-based Collaborative Filtering Systems (사용자 기반의 협력필터링 시스템을 위한 유사도 측정의 최적화)

  • Lee, Soojung
    • The Journal of Korean Association of Computer Education
    • /
    • v.19 no.1
    • /
    • pp.111-118
    • /
    • 2016
  • Measuring similarity in collaborative filtering-based recommender systems greatly affects system performance. This is because items are recommended from other similar users. In order to overcome the biggest problem of traditional similarity measures, i.e., data sparsity problem, this study suggests a new similarity measure that is the optimal combination of previous similarity and the value reflecting the number of co-rated items. We conducted experiments with various conditions to evaluate performance of the proposed measure. As a result, the proposed measure yielded much better performance than previous ones in terms of prediction qualities, specifically the maximum of about 7% improvement over the traditional Pearson correlation and about 4% over the cosine similarity.

Performance Analysis of Proportional Fair Scheduling with Partial Feedback Information for Multiuser MIMO-OFDMA Systems (다중 사용자 MIMO-OFDMA 시스템에서 부분 궤환 정보를 이용한 비례적 공정 스케줄링의 성능 분석)

  • Kang, Min-Gyu;Byun, Il-Mu;Park, Jin-Bae;Kim, Kwang-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6A
    • /
    • pp.643-651
    • /
    • 2008
  • In this paper, we analyze the performance of normalized SNR based proportional fair scheduling with partial feedback information for multiuser MIMO-OFDMA systems. The closed form expression on the downlink capacity of the selective partial CQI feedback scheme is derived and its asymptotic behavior is investigated. From the performance analysis and numerical results, it is found that the optimal growth rate of downlink capacity can be achieved with bounded average feedback overhead irrespective of the number of users.

Development of the Transportation History DB System for the Scheduling and Seat Inventory Control (열차계획 및 열차좌석관리를 위한 수송실적 데이터베이스 시스템 개발)

  • 오석문;김영훈;황종규;김용규;이종우
    • Proceedings of the KSR Conference
    • /
    • 1998.05a
    • /
    • pp.23-30
    • /
    • 1998
  • The construction of the transportation history database system is to serve the scheduling and seat inventory controling. Recently, lots of countries have been faced with the advance era because of the new railway transportation system, like the high speed railway and/or magnetic levitation vehicle system. This can be reasonably translated as those of operators are willing to provide the more various and high quality schedule to the customer. Those operators' these ideas make possible to forecast that scheduling process is going to be complicated more and more The seat inventory control, so to speak Yield Management System(YMS), goes a long way to improve the total passenger revenue at the railway business. The YMS forecasts the number of the last reservation value(DCP# END) and recommends the optimal values on the seat sales. The history database system contains infra-data(ie, train, seat, sales) that will be the foundation of scheduling and seat inventory control application programs. The development of the application programs are reserved to the next step. The database system is installed on the pc platform(IBM compatible), using the DB2(RDBMS). And at next step, the platform and DBMS will be considered whether they can meet the users' requirement or not.

  • PDF

Energy Efficiency Analysis of Antenna Selection Scheme in a Multi-User Massive MIMO Network (다중 사용자 거대 다중 안테나 네트워크에서 안테나 선택 기법의 에너지 효율 분석)

  • Jeong, Moo-woong;Ban, Tae-Won;Jung, Bang Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.57-60
    • /
    • 2015
  • Recently, a multi-user massive MIMO (MU-Massive MIMO) network has been attracting tremendous interest as one of technologies to accommodate explosively increasing mobile data traffic. The MU-Massive MIMO network can significantly enhance the network capacity because a base station (BS) equipped with large-scale transmit antennas can transmit high-rate data to multiple users simultaneously. In the MU-Massive MIMO network, transmit antenna selection schemes are generally used to decrease the computational complexity and cost of the BS. In this paper, we investigate the energy efficiency of the transmit antenna selection scheme in the MU-Massive MIMO network and the optimal number of selected transmit antennas for maximizing the energy efficiency.

  • PDF

Improved AP Deployment Optimization Scheme Based on Multi-objective Particle Swarm Optimization Algorithm

  • Kong, Zhengyu;Wu, Duanpo;Jin, Xinyu;Cen, Shuwei;Dong, Fang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1568-1589
    • /
    • 2021
  • Deployment of access point (AP) is a problem that must be considered in network planning. However, this problem is usually a NP-hard problem which is difficult to directly reach optimal solution. Thus, improved AP deployment optimization scheme based on swarm intelligence algorithm is proposed to research on this problem. First, the scheme estimates the number of APs. Second, the multi-objective particle swarm optimization (MOPSO) algorithm is used to optimize the location and transmit power of APs. Finally, the greedy algorithm is used to remove the redundant APs. Comparing with multi-objective whale swarm optimization algorithm (MOWOA), particle swarm optimization (PSO) and grey wolf optimization (GWO), the proposed deployment scheme can reduce AP's transmit power and improves energy efficiency under different numbers of users. From the experimental results, the proposed deployment scheme can reduce transmit power about 2%-7% and increase energy efficiency about 2%-25%, comparing with MOWOA. In addition, the proposed deployment scheme can reduce transmit power at most 50% and increase energy efficiency at most 200%, comparing with PSO and GWO.

Effect Analysis of User-Multiplexing on Delay QoS Performance in Low-Power Wireless Communication Systems (저전력 무선통신 시스템에서 사용자 다중화가 지연 QoS 성능에 미치는 영향 분석)

  • Ahn, Seong-Woo;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.4
    • /
    • pp.69-76
    • /
    • 2011
  • In this paper, we present the analytic model to quantify the system capacity with delay Quality of Service (QoS) constraints, and analyze the effect of user-multiplexing on the delay QoS performance in multiuser low-power wireless communication systems. For this purpose, we define the degree of multiplexing as the number of scheduled users to be served in a frame, and investigate the effect of degree of multiplexing (DoM) on the trade-off of throughput and delay QoS constraints. Through this analysis, we characterize the optimal DoM maximizing the energy efficiency in low-power communication environments. Finally, through the simulation results, we verify that our approach with its optimal DoM yields substantial capacity gain.

Energy-Efficiency of Distributed Antenna Systems Relying on Resource Allocation

  • Huang, Xiaoge;Zhang, Dongyu;Dai, Weipeng;Tang, She
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1325-1344
    • /
    • 2019
  • Recently, to satisfy mobile users' increasing data transmission requirement, energy efficiency (EE) resource allocation in distributed antenna systems (DASs) has become a hot topic. In this paper, we aim to maximize EE in DASs subject to constraints of the minimum data rate requirement and the maximum transmission power of distributed antenna units (DAUs) with different density distributions. Virtual cell is defined as DAUs selected by the same user equipment (UE) and the size of virtual cells is dependent on the number of subcarriers and the transmission power. Specifically, the selection rule of DAUs is depended on different scenarios. We develop two scenarios based on the density of DAUs, namely, the sparse scenario and the dense scenario. In the sparse scenario, each DAU can only be selected by one UE to avoid co-channel interference. In order to make the original non-convex optimization problem tractable, we transform it into an equivalent fractional programming and solve by the following two sub-problems: optimal subcarrier allocation to find suitable DAUs; optimal power allocation for each subcarrier. Moreover, in the dense scenario, we consider UEs could access the same channel and generate co-channel interference. The optimization problem could be transformed into a convex form based on interference upper bound and fractional programming. In addition, an energy-efficient DAU selection scheme based on the large scale fading is developed to maximize EE. Finally, simulation results demonstrate the effectiveness of the proposed algorithm for both sparse and dense scenarios.

Multi-lateral Concurrent Automated Negotiation for Optimal Freight Settlement (최적 수송가격 결정을 위한 다자간 동시 자동협상 방법론 개발)

  • Park, Yong-Sung;Cho, Min-Je;Choi, Hyung-Rim;Kim, Hyun-Soo;Hong, Soon-Goo
    • Journal of Information Technology Services
    • /
    • v.7 no.2
    • /
    • pp.1-12
    • /
    • 2008
  • The development of IT and explosively growing number of Internet users are rapidly spreading and developing e-commerce, while creating diverse on-line transaction methods such as a negotiation, a reverse auction, and a bid. Among these transaction methods, the transactions by means of a negotiation are being made for goods that have no posted price. In particular, the transactions by means of a negotiation are expected to be widely used in the B2B. In order to determine their transportation costs, shippers usually make negotiations with many transporters and logistics companies. And before long, these negotiations are expected to be made on an on-line automated negotiation system. Because of this, this study has tried to develop an automated negotiation methodology that is absolutely necessary for an on-line automated negotiation. This study has estimated and selected the evaluation functions for multi-lateral negotiators' proposals, thus developing an automated negotiation methodology. As a result of this study, a new direction for an automated negotiation has been suggested. Also we expect that this study will be widely used in the automated negotiation of diverse fields.

Applying Deep Reinforcement Learning to Improve Throughput and Reduce Collision Rate in IEEE 802.11 Networks

  • Ke, Chih-Heng;Astuti, Lia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.1
    • /
    • pp.334-349
    • /
    • 2022
  • The effectiveness of Wi-Fi networks is greatly influenced by the optimization of contention window (CW) parameters. Unfortunately, the conventional approach employed by IEEE 802.11 wireless networks is not scalable enough to sustain consistent performance for the increasing number of stations. Yet, it is still the default when accessing channels for single-users of 802.11 transmissions. Recently, there has been a spike in attempts to enhance network performance using a machine learning (ML) technique known as reinforcement learning (RL). Its advantage is interacting with the surrounding environment and making decisions based on its own experience. Deep RL (DRL) uses deep neural networks (DNN) to deal with more complex environments (such as continuous state spaces or actions spaces) and to get optimum rewards. As a result, we present a new approach of CW control mechanism, which is termed as contention window threshold (CWThreshold). It uses the DRL principle to define the threshold value and learn optimal settings under various network scenarios. We demonstrate our proposed method, known as a smart exponential-threshold-linear backoff algorithm with a deep Q-learning network (SETL-DQN). The simulation results show that our proposed SETL-DQN algorithm can effectively improve the throughput and reduce the collision rates.