• Title/Summary/Keyword: 슬롯할당

Search Result 164, Processing Time 0.035 seconds

A Study on the Bandwidth Assignment Scheme for Video Data Using Dynamic Parameters in the Wireless ATM Networks (무선 ATM망에서 동적 변수를 이용한 비디오 데이터의 대역폭 할당방식에 대한 연구)

  • Jang, Dong-Hyeok;Kim, Seung-Hwan;Lee, Sun-Sook;Kwon, Oh-Seok
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.73-78
    • /
    • 2002
  • In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.

Dynamic Channel Allocation Algorithm for TD-SCDMA Smart Antenna System with Inter-cell Interference (인접 셀 간섭영향을 고려한 TD-SCDMA 스마트 안테나 시스템의 동적 채널 할당 알고리즘)

  • Jang, Min-Seok;Hong, Een-Kee
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.415-422
    • /
    • 2007
  • In this paper, we proposed a new dynamic channel allocation algorithm for TD-SCDMA with cross time slots. In order to reduce the interference in cross time slot, the mobile stations (MSs) are divided into two groups: the Near Group consisting of MSs near by the base station(BS) and the Far Group including the MSs far from the BS. The reverse link for MSs in the Near Group and forward link for MSs in the Far Group are allocated to the cross time slot. In cellular systems, a BS has multiple neighbor BSs. Some of neighbor BSs can operate in the same direction link while the others have cross time slot. Thus, it is required to determine which BS has the most significant impact in terms of interference. We divide each cell into 6 areas based on the direction of arrival of smart antenna and the most significant neighbor sector is determined with this division. The proposed allocation method and area division method can avoid the severe interference in cross time slots and increase the system capacity about 2%~9% compared to FCA, and 0.5%~1.3% compared to RCA.

  • PDF

Time Slot Assignment Algorithm with Graph Coloring (그래프 채색에 의한 타임 슬롯 할당 알고리즘)

  • Kwon, Bo-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.52-60
    • /
    • 2008
  • A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

Dynamic Slot Allocation Scheme for Voice Service in WATM (WATM에서 음성 서비스를 위한 동적 슬롯 할당 알고리즘)

  • 김관웅;박준성;정경택;전병실
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.9A
    • /
    • pp.1601-1608
    • /
    • 2001
  • 본 논문에서는 무선 ATM 환경에서 음성과 같은 실시간 서비스가 요구되는 트래픽의 QoS를 보장하기 위한 구현 방법을 제안하였다. 음성은 셀이 발생되는 토크스퍼트 구간과 셀이 발생되지 않는 휴지구간이 주기적으로 반복되는 특성을 갖는다. 따라서 음성과 같은 실시간 서비스의 QoS를 보장하기 위해서는 휴지구간 상태에 있는 음성단말의 수와 음성단말의 상태를 고려하여 음성단말의 수에 관계없이 일정한 QoS를 보장할 수 있어야 한다. 음성단말의 수에 관계없이 일정한 연결 지연시간을 제공하기 위하여, 휴지 상태에 있는 음성 단말 수와 휴지 상태의 지속시간에 따라서 동적으로 음성 예약 슬롯을 할당하는 방식을 제안한다. 컴퓨터 시뮬레이션을 통하여 slotted-ALOHA나 NC-PRMA 같은 기존의 슬롯 할당방법과 비교하였으며, 그 결과 제안된 방법이 동적으로 예약슬롯을 할당하여 부하에 관계없이 음성 트래픽에 일정한 지연시간과 낮은 충돌율을 제공하면서 프레임에 예약슬롯의 오버헤드를 최소화하므로, 채널 사용 효율을 높일 수 있음을 알 수 있었다.

  • PDF

Channel Switching Considered Scheduling in Multi-Channel Wireless Sensor Networks (멀티채널 무선 센서 네트워크에서 채널 변경을 고려한 스케줄링 방법)

  • Yeoum, Sanggil;Lee, Hyun;Kim, Dongsoo;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.185-187
    • /
    • 2014
  • 멀티채널 무선 센서 네트워크에서 기존의 스케줄링 방법들은 각 노드마다 다른 채널과 타임슬롯을 할당하는 방법을 채택하여 연구하였다. 하지만 여러 채널과 타임슬롯을 사용함으로써 채널가의 간섭, 채널과 타임슬롯의 할당, 채널 변경에 소모되는 에너지와 딜레이 등 추가로 고려해야할 사항들이 발생하였다. 센서 노드는 저전력의 배터리를 사용하기 때문에 효율적인 채널과 타임슬롯 할당 이외에도 채널 변경에 대해 고려되어야 한다. 본 논문에서는 멀티채널 무선센서네트워크 환경에서 최소한의 채널 변경을 지향하는 효율적인 채널과 타임슬롯을 할당하는 방법을 제안한다.

Dynamic Round size Decision Algorithm for Identification of REID Tag (RFID 태그 인식을 위한 동적 Round Size 결정 알고리즘)

  • Lee Seung-Hyuk;Park Il-Yong;Cho Tae-Kyung;Yoo Hyun-Joong;Park Byoung-Soo;Baek Hyun-Ok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.3
    • /
    • pp.373-378
    • /
    • 2006
  • One of the biggest problems that should be solved in present RFID systems is a reduction of identification efficiency by the collision of singals between different tags. As the number of tags, which should be identified, increases over the size of allocated round, more slots experiences the collision between them. It can causes generation of tag collision assigning the fixed round size and so, allocated round size should be regulated properly. This paper proposes the algorithm which can reduce collision between tags, and allocate specific round size dynamically for efficient tag identification. After each round is finished, the reader allocates the round size dynamically using the collision information of the slot. All collision informations of the slot consists of the number of slots which came into conflict, tags which were realized properly without any conflictions and empty slots. We used slotted aloha algorithm as the collision detection algorithm and finally, checked that this could be used very usefully when this algorithm which was proposed effectively could not know how many number of tags were exisisted through the simulation in advance.

  • PDF

Reserved Slot Allocation Scheme for Voice Service in WATM MAC (무선 비동기 전송모드 매체 접근제어에서 음성서비스를 위한 예약 슬롯 할당 알고리즘)

  • 김관웅;배성환;전병실
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.7
    • /
    • pp.101-108
    • /
    • 2001
  • In this paper we focus on dynamic reservation slot allocation scheme for supporting QoS of a voice traffic in WATM MAC. Especially, voice traffic is the most important real-time object, and so we propose a new MAC protocol for voice traffic over WATM networks in the multimedia environment. According to the characteristics of voice traffic which is repeatedly in silent state and active state, new protocol allocates reservation slots dynamically with respect to the number of silent voice source of which starting time is stored to the state table in base station (BS). The simulation results show that the proposed protocol has better performance than slotted ALOHA in average access delay, collision rate, better than NC-PRMA(Non Collision Packet Reservation Multiple Access) in band width efficiency, and can provide a certain level of QoS requirement by the given slot assignment even though the number of voice terminals is increased.

  • PDF

Performance Analysis on Adaptive Modulation Systems with Multislot Allocation for Multimedia Communications (멀티미디어 통신에 있어서 멀티슬롯 할당을 이용한 적응변조방식에 관한 성능해석)

  • 강희조;이말례;박경열
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.6
    • /
    • pp.625-632
    • /
    • 2000
  • This paper proposes an adaptive multislot allocation algorithm in order to achieve large system capacity and higher throughput data transmissions. The proposed system is the combination of the slow adaptive modulation system, in which the base station dynamically a signs optimum modulation parameters measuring the CNR(carrier to noise power ratio) of each transmission terminal, and the multislot allocation scheme, in which the base station flexibly allocates an appropriate number of TDMA data slots according to the instantaneous load conditions. Computer simulations confirm that the proposed system can tremendously improve average message delay characteristics in comparison with the conventional fixed slot allocation method.

  • PDF

Design of Slot Reservation Multiple Access Algorithm in Single-hop Double Star Coupler WDM Networks (단일홉 이중 성형결합기 구조의 WDM 통신망에서 슬롯 예약 방식의 다중 접근 알고리즘 설계)

  • 엄종훈;김병재;류상률;김승호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.584-586
    • /
    • 1999
  • 본 논문에서는 파장 재사용 이중 단일홉 WDM(Wavelength Division Multiplexing) 통신망에서 전체 노드의 수가 사용 가능한 파장의 수보다 클 경우에 트래픽의 지역성(locality)을 고려하여 시간 분할 다중 접속 (TDMA) 방식으로 파장을 이용하는 다중 접근 알고리즘을 제안한다. 사용 가능한 파장을 그룹내에서 사용하는 전역 파장과 그룹간의 통신에 사용하는 지역 파장으로 나누고 전역 파장은 통신망에 속하는 모든 노드가 공유하고 지역 파장은 그룹내의 노드가 공유한다. 따라서 지역 파장은 모든 그룹 내에서 재사용 가능하기 때문에 전체 파장의 사용율이 증가한다. 모든 노드는 전역파장와 지역 파장으로 동조 가능한 하나의 동조 송신기와 전역 파장 중에 하나의 파장으로 수신 파장이 고정된 고정 수신기와 지역 파장 중에 하나의 파장으로 수신 파장이 고정된 고정 수신기를 가진다. 제안하는 알고리즘은 노드에서 패킷의 전송 요구가 필요한 만큼 슬롯 시간을 할당받아 모든 패킷을 연속해서 전송하는 슬롯 예약 방식을 채택한다. 이 방식은 동조 시간을 최소화함으로써 슬롯 시간을 모드 노드가 균일하게 할당하여 전체 동조 시간이 길어지는 고정 할당 방식보다 파장 사용율이 효율적이다.

  • PDF

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