• Title/Summary/Keyword: Slot Allocation

Search Result 131, Processing Time 0.022 seconds

Performance Analysis of Pequest_solt Allocation Methods for the Priority-Based Multiple Access with Dynamic Permission(PBMA_DP) Protocol (PBMA_DP에서 요구슬롯의 동적할당 방식의 성능 분석)

  • 유태화;최덕규;조영종
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.226-228
    • /
    • 1998
  • PBMA_DP 프로토콜은 우선순위에 따른 수락 확률을 변화시켜준다. 수락 확률수치는 요구슬롯(R-slot)의 개수에 영향을 받는다. 따라서 부하가 많아지면 R-slot의 개수를 줄이고, 부하가 적어지면R-slot의 개수를 늘려 성능의 향상을 꾀할 수 있다. 따라서 본 논문에서는 동적으로 R-slot의 개수를 바꾸어주는 알고리즘 두 가지를 제안한다. R-slot위치는 고정시키고 개수만 변화시키는 방식과 R-slot 위치를 변화시키면서 개수도 변화시키는 방식이다. 또한 단말의 개수를 예측하는 방법에 대해 간단히 설명한다. 위의 두 방식에 대한 모의 실험을 시행하여 성능분석을 행한다.

  • PDF

Priority Based Medium Access Control and Load Balancing Scheme for Shared Situational Awareness in Airborne Tactical Data Link (공중 전술 데이터링크에서 상황인식 공유를 위한 우선순위 기반 매체접속제어와 부하분산 기법)

  • Yang, Kyeongseok;Baek, Hoki;Park, Kyungmi;Lim, Jaesung;Park, Ji Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1210-1220
    • /
    • 2016
  • As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

Downlink Power Allocation for Relay Frequency Reuse (릴레이 주파수재사용을 위한 하향링크 전력 자원 할당)

  • Oh, Chang-Yoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.98-104
    • /
    • 2012
  • We consider the optimum power allocation problem for downlink system throughput maximization in a 2 time slotted relay interference channel. Base station (BS) transmits power to Mobile Station (MS) and Relay Station (RS) in time slot 1 (orthogonal channel). In time slot 2, BS and RS transmit power to each MS, while causing cochannel interference to each other. The obtained optimum power allocation scheme allows simultaneous transmissions of BS and RS when the interference level in time slot 2 is low. However, when the interference level is high, RS shuts down its power. Numerical results are provided to support our analysis.

Interference Resolving Radio Resource Allocation Scheme in a TDD-OFDMA/FDD-CDMA Hierarchical Over lay Cellular System

  • Lee, Yeonwoo;Kim, Kyung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.7
    • /
    • pp.862-869
    • /
    • 2013
  • In order to support a cell-independent traffic asymmetry, the conventional TDD system cannot avoid crossed time slot (CTS) interference. Moreover, the TDD/FDD hierarchical overlay cellular systems is taken into account as a generally accepted cell model in a heterogeneous radio environment. In this paper, we propose an interference resolving radio resource allocation technique in a TDD-OFDMA cellular system that overlays a FDD-CDMA cell. In our proposed scheme, we exploit under-used FDD-CDMA uplink resource by TDD mobile abiding by a region based time slot(TS) allocation which in turn mitigates CTS interference considerably. It is demonstrated that combined with under-used resource utilization scheme based on mobile's location, the proposed technique can reduce CTS interference considerably and support the asymmetric traffic in TDD system.

A Dynamic Signalling Period Allocation Algorithm in Wireless ATM MAC Protocols (무선 ATM MAC 프로토콜에서 동적 신호 주기 할당 알고리즘)

  • 강상욱;신요안;최승철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1004-1014
    • /
    • 1999
  • MAC protocols in wireless ATM has to increase and maintain the system throughput performance. To achieve these purposes, this paper proposes a dynamic control algorithm called DSPA (Dynamic Signalling Period Allocation) for wireless ATM MAC protocol. The proposed DSPA algorithm consists of the following three algorithms. First, a control slot generation algorithm which generates the control slots by utilizing static and dynamic parameters from the terminals, is proposed. Second, a dynamic signalling period allocation algorithm is proposed for a base station to dynamically determine each signalling period according to current terminal states, and thus allocates the optimal signalling periods. Finally, a dynamic slot allocation algorithm is proposed to dynamically determine priorities of the terminals whenever a slot is allocated. Simulation results indicates that DSPA algorithm decreases average packet delay of the terminals by dynamic allocation of signal periods based on the system utilization, and thus increases the limitation of allowable loads that quarantee quality of services. Also the proposed algorithm is shown to maintain stable throughput even in the case of traffic variations.

  • PDF

A Slot Scheduling Algorithm for Balancing Power Consumption in Tree-based Sensor Networks (트리 기반 센서네트워크에서 전력 소모 균형을 위한 슬랏 스케쥴링 알고리즘)

  • Kim, Je-Wook;Oh, Roon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5A
    • /
    • pp.502-510
    • /
    • 2011
  • In this paper, we propose a slot scheduling algorithm for balancing power consumption in tree-based sensor networks. In this type of networks, nodes with lower depths tend to consume more energy than those with higher depths, thereby reducing the life time of the network. The proposed algorithm allocates a series of receiving slots first and then a series of sending slots. This way of slot allocation eases packet aggregation and filtering, and thus reduces traffic load on nodes near a sink. We compare the proposed algorithm and the frame-slot allocation algorithm employed in the TreeMAC by resorting to simulation. The simulation results showed that the proposed approach well achieves the balancing of power consumption.

An Optimization Model for Railway Slot Allocation Reflecting the Operational Policies (운영 정책을 반영한 철도 슬롯 할당을 위한 최적화 모형 연구)

  • Park, Bum Hwan;Hong, Soon-Heum;Kim, Chung-Soo
    • Journal of the Korean Society for Railway
    • /
    • v.15 no.5
    • /
    • pp.524-530
    • /
    • 2012
  • Recently, open access policy to railway operation has been widely discussed. Compared to the case of Korea, European countries have dealt with this topic over a few decades. The competition on railway slots incurs an important technological problem about how to optimally allocate railway slots requested from RUs to them. In other words, the authority should be able to coordinate the timetables requested from RUs in the non-discriminatory manner. Related with the coordination, compared to the other European countries, which have done many studies and experiments especially on auction mechanisms, Korean railway has paid less attention to this topic and there have not been any related studies. Our study analyses the state-of-the-arts about the railway slot allocation especially focusing on the auction mechanisms and the associated optimization problems. And we suggest a new railway slot allocation mechanism and related optimization model reflecting the adjustment within the tolerance and the operational policies between railway undertakings.

Downlink Performance Improvement of TDD CDMA Cellular Networks with Time Slot and Fixed Hopping Station Allocations

  • Zhou, Rui;Nguyen, Hoang Nam;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.247-253
    • /
    • 2007
  • In this paper, downlink capacity of time duplex division (TDD) based cellular wireless networks utilizing fixed hopping stations is investigated. In the network, a number of fixed subscriber stations act as hopping transmission stations between base stations and far away subscribers, forming a cellular and ad hoc mobile network model. At the radio layer, TDD code division multiple access (CDMA) is selected as the radio interface due to high efficiency of frequency usage. In order to improve the system performance in terms of downlink capacity, we propose different time slot allocation schemes with the usage of fixed hopping stations, which can be selected by either random or distanced dependent schemes. Performance results obtained by computer simulation demonstrate the effectiveness of the proposed network to improve downlink system capacity.

Downlink Space Division Multiple Access with Dynamic Slot Allocation for Multi-User MIMO Systems (복수 사용자 MIMO 시스템을 위한 동적 슬롯 할당 하향링크 공간분할 다중접속 기술)

  • 임민중
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.10
    • /
    • pp.61-67
    • /
    • 2004
  • The next generation cellular wireless communication systems require high data rate transmissions and large system capacities. In order to meet these requirements, multiple antennas can be used at the base and mobile stations, forming MIMO(Multiple Input Multiple Output) channels. This paper proposes a MIMO SDMA(Space Division Multiple Access) technique with dynamic slot allocation which allows the transmitter to efficiently transmit parallel data streams to each of multiple receivers. The proposed technique can increase system capacities significantly by transmitting a larger number of data streams than conventional MIMO techniques while minimizing the performance degradation due to the beamforming dimension reduction.

Joint Transmission Slot Assignment, FSO Links Allocation and Power Control for Hybrid RF/FSO Wireless Mesh Networks

  • Zhao, Yan;Shi, Wenxiao;Shi, Hanyang;Liu, Wei;Wu, Pengxia
    • Current Optics and Photonics
    • /
    • v.1 no.4
    • /
    • pp.325-335
    • /
    • 2017
  • Hybrid radio frequency/free space optical (RF/FSO) wireless mesh networks have attracted increasing attention for they can overcome the limitations of RF and FSO communications and significantly increase the throughput of wireless mesh networks (WMNs). In this article, a resource assignment optimization scheme is proposed for hybrid RF/FSO wireless mesh networks. The optimization framework is proposed for the objective of maximizing throughput of overall hybrid networks through joint transmission slot assignment, FSO links allocation and power control with the consideration of the fading nature of RF and FSO links. The scheme is formulated as an instance of mixed integer linear program (MILP) and the optimal solutions are provided using CPLEX and Gurobi optimizers. How to choose the appropriate optimizer is discussed by comparing their performance. Numerous simulations are done to demonstrate that the performance of our optimization scheme is much better than the current case of having the same topology.