• Title/Summary/Keyword: delay constraint

Search Result 134, Processing Time 0.028 seconds

Grant-Free Random Access in Multicell Massive MIMO Systems with Mixed-Type Devices: Backoff Mechanism Optimizations under Delay Constraints

  • Yingying, Fang;Qi, Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.1
    • /
    • pp.185-201
    • /
    • 2023
  • Grant-free random access (GFRA) can reduce the access delay and signaling cost, and satisfy the short transmission packet and strict delay constraints requirement in internet of things (IoT). IoT is a major trend in the future, which is characterized by the variety of applications and devices. However, most existing studies on GFRA only consider a single type of device and omit the effect of access delay. In this paper, we study GFRA in multicell massive multipleinput multiple-output (MIMO) systems where different types of devices with various configurations and requirements co-exist. By introducing the backoff mechanism, each device is randomly activated according to the backoff parameter, and active devices randomly select an orthogonal pilot sequence from a predefined pilot pool. An analytical approximation of the average spectral efficiency for each type of device is derived. Based on it, we obtain the optimal backoff parameter for each type of devices under their delay constraints. It is found that the optimal backoff parameters are closely related to the device number and delay constraint. In general, devices that have larger quantity should have more backoff time before they are allowed to access. However, as the delay constraint become stricter, the required backoff time reduces gradually, and the device with larger quantity may have less backoff time than that with smaller quantity when its delay constraint is extremely strict. When the pilot length is short, the effect of delay constraints mentioned above works more obviously.

An Efficient Packet Scheduling Scheme to support Real-Time Traffic in OFDMA Systems (OFDMA 시스템에서 실시간 트래픽 전송을 위한 효율적 스케쥴링 기법)

  • Park, Jeong-Sik;Cho, Ho-Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1A
    • /
    • pp.13-23
    • /
    • 2007
  • In this paper, a packet scheduling scheme that supports real-time traffic having multi-level delay constraints in OFDMA systems is proposed. The proposed scheme pursues to satisfy the delay constraint first, and then manage the residual radio resource in order to enhance the overall throughput. A parameters named tolerable delay time (TDT) is newly defined to deal with the differentiated behaviors of packet scheduling according to the delay constraint level. Assuming that the packets violating the delay constraint are discarded, the proposed scheme is evaluated in terms of the packet loss probability, throughput, channel utilization. It is then compared with existing schemes for real-time traffic support such as the Exponential Scheduling (EXP) scheme, the Modified Largest Weighted Delay First (M-LWDF) scheme, and the Round robin scheme. The numerical results show that the proposed scheduling scheme performs much better than the aforementioned scheduling schemes in terms of the packet loss probability, while slightly better in terms of throughput and channel utilization.

A QoS-aware Scheduling Algorithm for Multiuser Diversity MIMO-OFDM System (다중 사용자 MIMO-OFDM 시스템에서의 QoS 제공을 위한 스케줄링 기법)

  • An Se-Hyun;Yoo Myung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7A
    • /
    • pp.717-724
    • /
    • 2006
  • In order to maximize the throughput and provide the fairness between users in MIMO-OFDM system, FATM(fairness-aware throughput maximization) scheduling algorithm was proposed. In this paper, a QoS-aware scheduling algorithms for MINO-OFDM system are proposed, each of which is based on FATM. These scheduling algorithms aim to satisfy the different service requirements of various service classes. Three proposed QoS scheduling algorithms called SPQ (Strict Priority Queueing), DCBQ (Delay Constraint Based Queuing), HDCBQ (Hybrid Delay Constraint Based Queuing) are compared through computer simulations. It is shown that HDCBQ algorithm outperforms other algorithms in satisfying different requirements of various service classes.

Capacity of Spectrum Sharing Cognitive Radio with MRC Diversity under Delay Quality-of-Service Constraints in Nakagami Fading Environments

  • Zhang, Ping;Xu, Ding;Feng, Zhiyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.632-650
    • /
    • 2013
  • The paper considers a spectrum sharing cognitive radio (CR) network coexisting with a primary network under the average interference power constraint. In particular, the secondary user (SU) is assumed to carry delay-sensitive services and thus shall satisfy a given delay quality-of-service (QoS) constraint. The secondary receiver is also assumed to be equipped with multiple antennas to perform maximal ratio combining (MRC) to enhance SU performance. We investigate the effective capacity of the SU with MRC diversity under aforementioned constraints in Nakagami fading environments. Particularly, we derive the optimal power allocation to achieve the maximum effective capacity of the SU, and further derive the effective capacity in closed-form. In addition, we further obtain the closed-form expressions for the effective capacities under three widely used power and rate adaptive transmission schemes, namely, optimal simultaneous power and rate adaptation (opra), truncated channel inversion with fixed rate (tifr) and channel inversion with fixed rate without truncation (cifr). Numerical results supported by simulations are presented to consolidate our studies. The impacts on the effective capacity of various system parameters such as the number of antennas, the average interference power constraint and the delay QoS constraint are investigated in detail. It is shown that MRC diversity can significantly improve the effective capacity of the SU especially for cifr transmission scheme.

Stability of Slotted Aloha with Selfish Users under Delay Constraint

  • Chin, Chang-Ho;Kim, Jeong-Geun;Lee, Deok-Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.3
    • /
    • pp.542-559
    • /
    • 2011
  • Most game-theoretic works of Aloha have emphasized investigating Nash equilibria according to the system state represented by the number of network users and their decisions. In contrast, we focus on the possible change of nodes' utility state represented by delay constraint and decreasing utility over time. These foregone changes of nodes' state are more likely to instigate selfish behaviors in networking environments. For such environment, in this paper, we propose a repeated Bayesian slotted Aloha game model to analyze the selfish behavior of impatient users. We prove the existence of Nash equilibrium mathematically and empirically. The proposed model enables any type of transmission probability sequence to achieve Nash equilibrium without degrading its optimal throughput. Those Nash equilibria can be used as a solution concept to thwart the selfish behaviors of nodes and ensure the system stability.

Two Phase Heuristic Algorithm for Mean Delay constrained Capacitated Minimum Spanning Tree Problem (평균 지연 시간과 트래픽 용량이 제한되는 스패닝 트리 문제의 2단계 휴리스틱 알고리즘)

  • Lee, Yong-Jin
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.367-376
    • /
    • 2003
  • This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

On a Logical Path Design for Optimizing Power-delay under a Fixed-delay Constraint (고정 지연 조건에서 전력-지연 효율성의 최적화를 위한 논리 경로 설계)

  • Lee, Seung-Ho;Chang, Jong-Kwon
    • The KIPS Transactions:PartA
    • /
    • v.17A no.1
    • /
    • pp.27-32
    • /
    • 2010
  • Logical Effort is a simple hand-calculated method that measures quick delay estimation. It has the advantage of reducing the design cycle time. However, it has shortcomings in designing a path for minimum area or power under a fixed-delay constraint. In this paper, we propose an equal delay model and, based on this, a method of optimizing power-delay efficiency in a logical path. We simulate three designs of an eight-input AND gate using our technique. Our results show about 40% greater efficiency in power dissipation than those of Logical Effort method.

Cell Association Scheme for Uplink Heterogeneous Cellular Networks (이기종 셀룰러 네트워크에서의 상향 링크 셀 접속 기법)

  • Lee, Hyung Yeol;Sang, Young Jin;Park, Jin Bae;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.5
    • /
    • pp.393-400
    • /
    • 2013
  • In conventional single-tier networks, downlink based association is the best association scheme for the uplink association because all macro base stations have the same physical specification. However, in uplink heterogeneous cellular networks, a downlink based cell association cannot be the best for uplink any more because of the difference of physical specification between the different base station. In this paper, we will propose a uplink based cell association scheme, and devise performance metric for describing a uplink performance in heterogeneous cellular networks. Then, we will discuss the necessity of the uplink based association by observing outage probability, delay constraint outage probability, delay constraint outage capacity.

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

  • Hong, Daniel W.;Hong, Choong-Seon;Lee, Gil-Haeng
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.733-746
    • /
    • 2005
  • In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

  • PDF

Distributed Multi-Hop Relay Scheme to Reduce Delay-Constrained Broadcast Outage Probability (전달 시간 제한이 있는 브로드캐스트 아웃티지 확률을 감소시키는 분산적인 다중 홉 중계 기법)

  • Ko, Byung Hoon;Byun, Ilmu;Rhee, Duho;Jeon, Ki Jun;Kim, Beom Mu;Lee, Seong Ro;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.2
    • /
    • pp.219-226
    • /
    • 2013
  • Distributed multi-hop relay scheme to reduce delay-constrained outage probability for broadcast network is proposed. We consider multi-hop relay scheme, which is similar to distributed beamforming, where multiple nodes simultaneously relay packets, and we propose channel access control and power control for relaying nodes to satisfy energy constraint. Compared with flooding which is multi-hop relay scheme used for ZigBee, the proposed scheme is better in terms of outage probability and average reception throughput.