• Title/Summary/Keyword: Rate Allocation

Search Result 881, Processing Time 0.032 seconds

Resource Allocation based on Quantized Feedback for TDMA Wireless Mesh Networks

  • Xu, Lei;Tang, Zhen-Min;Li, Ya-Ping;Yang, Yu-Wang;Lan, Shao-Hua;Lv, Tong-Ming
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.3
    • /
    • pp.160-167
    • /
    • 2013
  • Resource allocation based on quantized feedback plays a critical role in wireless mesh networks with a time division multiple access (TDMA) physical layer. In this study, a resource allocation problem was formulated based on quantized feedback for TDMA wireless mesh networks that minimize the total transmission power. Three steps were taken to solve the optimization problem. In the first step, the codebook of the power, rate and equivalent channel quantization threshold was designed. In the second step, the timeslot allocation criterion was deduced using the primal-dual method. In the third step, a resource allocation scheme was developed based on quantized feedback using the stochastic optimization tool. The simulation results show that the proposed scheme not only reduces the total transmission power, but also has the advantage of quantized feedback.

  • PDF

Multi-Slice Joint Task Offloading and Resource Allocation Scheme for Massive MIMO Enabled Network

  • Yin Ren;Aihuang Guo;Chunlin Song
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.794-815
    • /
    • 2023
  • The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

A Chirp Rate Allocation Scheme for Multiple Access Interference Reduction in Chirp Spread Spectrum Systems (처프 확산 대역 시스템에서 다중 접속 간섭의 감소를 위한 처프율 할당 기법)

  • Kim, Kwang-Yul;Lee, Seung-Woo;Kim, Yong-Sin;Lee, Jae-Seang;Kim, Jin-Young;Shin, Yoan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1420-1422
    • /
    • 2016
  • In order to guarantee the multiuser transmission performance of a chirp spread spectrum system, the cross-correlation coefficient (CCC) among multiple users should be carefully considered. In this paper, we propose a chirp rate allocation scheme for reducing the multiple access interference based on the cross-correlation coefficient. The simulation results show that the proposed scheme can improve the multiple access interference performance.

A Method for Client-Server Allocation for Maximum Load Balancing and Automatic Frame Rate Adjustment in a Game Streaming Environment (게임 스트리밍 환경에서 최대 부하 균등 및 자동 프레임 레이트 조절을 위한 클라이언트-서버 배정 방법)

  • Kim, Sangchul
    • Journal of Korea Game Society
    • /
    • v.20 no.4
    • /
    • pp.77-88
    • /
    • 2020
  • Recently, interest in game streaming is high in cloud-based gaming. In game streaming, remote game servers perform graphics rendering and stream the resulting scene images to clients' device on the Internet. We model the client-server allocation (CSA) problem for balancing the GPU load between servers in a game streaming environment as an optimization problem, and propose a simulated annealing-based method. The features of our method are that the method takes into account the constraints on network delay and has the ability to automatically adjust the frame rate of game sessions if necessary.

Social-Aware Resource Allocation Based on Cluster Formation and Matching Theory in D2D Underlaying Cellular Networks

  • Zhuang, Wenqin;Chen, Mingkai;Wei, Xin;Li, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.1984-2002
    • /
    • 2020
  • With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.

A Dynamic Bandwidth Allocation for the Efficient Transmission of VBR Video Sources in ATM Networks (ATM 망에서 VBR 비디오 소스의 효율적인 전송을 위한 동적 대역 할당)

  • 이팔진;최대규;김병옥;김영선;김영천
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.9
    • /
    • pp.1219-1228
    • /
    • 1995
  • In this paper, we propose a dynamic bandwidth allocation scheme for the transmission of VBR video source through ATM based BISDN. In order to efficiently evaluate the required bandwidth, the characteristics of the VBR video sources generated by the MPEG coder are analyzed with variations in the number of GOP and quantizer scale. The required bandwidth for VBR video source is estimated by a prediction algorithm using scene and frame correlations as well as the statistical properties of the VBR video source. Scene correlation represents a strong correlation among the adjacent slices in a frame, and frame correlation represents a strong correlation among the frames. The statistical properties based on the traffic parameters of video sources such as peak rate, average rate, and standard deviation of source are determined through simulation. The performance of the proposed bandwidth allocation scheme is evaluated in terms of the over-allocated bandwidth, bandwidth utilization, and cell loss rate with variations in the quantizer scale and the number of GOP. It is shown that the results of simulation based on the proposed scheme are superior to those of the conventional methods.

  • PDF

Optimal Configuration of SVC for Satellite Broadcasting Service with Ku/Ka Bands

  • Luong, Ngoc Thuy Dung;Sohn, Won
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.11a
    • /
    • pp.188-191
    • /
    • 2010
  • The study investigated the optimal configuration of SVC (Scalable Video Coding) to apply to the satellite broadcasting service, and compared the performance of the SVC with that of the AVC (Advanced Video Coding). To get the optimal configuration, we analyzed the optimal bit rate allocation between the layers and the optimal scalability which requires the least bit rate for the required PSNR for various kinds of contents using JSVM. As a result of investigation, we found that the optimal bit rate allocation occurs when the bit rate of the base layer is minimum, and the spatial scalability shows the best performance. The performance of SVC is similar to that of AVC for spatial scalability, but it depends on contents.

  • PDF

Impact of Correlation on Superposition Coding in NOMA for Interactive Mobile Users in 5G System: Achievable Sum Rate Perspective

  • Chung, Kyuhyuk
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.39-45
    • /
    • 2020
  • The fifth generation (5G) mobile communication has been more commercialized worldwide. One of the promising 5G technologies is non-orthogonal multiple access (NOMA). We present the achievable sum rate of non-orthogonal multiple access (NOMA) with correlated superposition coding (SC). Then this paper investigates the impacts of correlation on the achievable sum rate of correlated SC NOMA. It is shown that the achievable sum rate of correlated SC NOMA is greater than that of standard independent SC NOMA, for the most of the values of the power allocation factor over the meaningful range of the user fairness. In result, correlated SC could be a promising scheme for NOMA.

Incorporated Multi-State Nash Equilibriums For The Generation Allocation Considered Ramp Rate In the Competitive Power Market (경쟁적 전력시장에서 Ramp-rate를 고려한 발전량배분의 다중시간 통합 내쉬균형)

  • Park, Yong-Gi;Song, Hyoung-Yong;Lee, Joo-Won;Park, Jong-Bae;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.569_570
    • /
    • 2009
  • This paper presents a methodology to find the profit maximized Nash Equilibriums of each generator(or GenCo), which considers the Ramp-rate of each generator under a competitive market environment. The ramp-rate of a generator is one of the physical or technical constraints of a generator and means the ability to increase or decrease the output instantaneously. In this paper, we found several Nash Equilibriums of the generation allocation problem through Dynamic Programming in a competitive market. Individual generators participate in a game to maximize its profit through competitions and play a game with bidding strategies of its generation quantities in a spot market.

  • PDF

Scheduling Algorithms for Downlink Rate Allocation in Heterogeneous CDMA Networks

  • Varsou, Aikaterini C.;Poor, H. Vincent
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.199-208
    • /
    • 2002
  • The downlink rate scheduling problem is considered for CDMA networks with multiple users carrying packets of heterogeneous traffic (voice/audio only, bursty data only or mixed traffic), with each type having its own distinct quality of service requirements. Several rate scheduling algorithms are developed, the common factor of which is that part of the decision on which users to serve is based on a function of the deadline of their head-ofline packets. An approach of Andrews et al., in which the basic Earliest-Deadline-First algorithm is studied for similar systems, is extended to result in better performance by considering a more efficient power usage and by allowing service of more than one user per timeslot if the power resources permit it. Finally, the performance of the proposed schemes is compared through simulations.