• Title/Summary/Keyword: Time slot

Search Result 585, Processing Time 0.032 seconds

Design of Dynamic Slot Assignment Protocol for Wireless Multimedia Communication (무선 멀티미디어 통신을 위한 동적 슬롯 할당 MAC 프로토콜 설계)

  • Yoe Hyun;Kang Sang-Wook;Koh Jin-Gwang
    • Journal of Internet Computing and Services
    • /
    • v.4 no.5
    • /
    • pp.61-68
    • /
    • 2003
  • In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and Maximizing channel utilization. Data terminals with random data packets are not provided slot reservation with PRMA protocol. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, and contended their quality of service, Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. So the terminal which wants to request for ABR type service, is allocated a minimum bandwidth from system for the first time, If the system have some extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot, As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization high.

  • PDF

Performance Enhancement of Slot-Count Selection Algorithm with Weight Differentiation in Gen-2 RFID Systems (Gen-2 RFID 시스템에서 가중치 차별화를 통한 슬롯 카운트 선택 알고리즘의 성능 향상)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.3
    • /
    • pp.561-566
    • /
    • 2011
  • In EPCglobal Class-1 Gen-2 RFID system, a slot-count selection algorithm has been proposed to determine the slot-count size depending on the status of reply slot. In the slot-count selection algorithm of Gen-2, the slot-count value is increased or decreased by the weight C, which is identical and independent of the slot status. It has an advantage that the algorithm is simple, but it is difficult to maintain an optimal slot-count size. Therefore, in this paper, we propose an adaptive slot-count selection algorithm, which applies the parameter C differently based on the result of tag replies. Through simulations, it is demonstrated that the collision rate for the proposed scheme is about 42% and 65% lower than the schemes proposed by Wang and Gen-2. Therefore, the adaptive slot-count selection algorithm achieves faster tag identification time compared with the existing algorithms due to the low collision rate.

The Analysis of the T-shaped Microstripline-Fed Printed Slot Antenna with Unidirectional Radiation (한방향 복사특성을 갖는 T-모양 급전선 마이크로스트립 슬롯 안테나의 해석)

  • Jang, Yong-Woong;Oh, Dong-Jin
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.4
    • /
    • pp.103-109
    • /
    • 1999
  • In this paper, we proposed to a new structure of T-shaped fed microstrip slot antenna using 2-layers dielectric material with a directional radiation characteristic. When the slot antenna of bi-directional radiation want to radiate only one direction, the reflector must be set up, but this antenna does'nt need set up reflector. T-shaped microstrip feed line is proposed for a better impedance matching to the microstrip slot antenna in a various range of slot widths. It was also found that the bandwidth of this antenna is proportional to the slot width. It was also found that the radiation resistance of this feed line structure is quite constant and low regardless to the slot width. We also analyzed this antenna by using the FDTD method, and calculating waves and electric field distribution in the time domain. we also are calculated return loss, VSWR, and radiation pattern in the frequency domain by Fourier transforming the time domain results, respectively. From the measured results, bandwidth was 34.8% in the center frequency. These results were in relatively good accordance with the calculated values.

  • PDF

A Study of Thrust Maximization Using Analytical Method Considering Slot Effect in Pemanent Magnet Linear Synchronous Motor (슬롯효과를 고려한 해석적인 방법에 의한 PMLSM의 출력 최대화에 관한 연구)

  • Lee Dong-Yeup;Kim Duk-Hyun;Kim Gyu-Tak
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.54 no.7
    • /
    • pp.323-328
    • /
    • 2005
  • This paper is proposed maximum thrust design of slotted permanent magnet linear synchronous motor(PMLSM) using surface harmonic method(SHM) considering slot effect. The genetic a1gorithm is used for optimization. The functional are selected the maximum thrust and the minimum detent force. This time. design parameters are set as permanent magnet(PM) width. PM height and slot width. Thrust is increased from 272[N] to 295[N] and detent force is decreased from 5[N] to 2.43[N] greatly in optimum design. Therefore, thrust ripple isn't generating almost. Also, the results of 2D EMC considering slot-effect are compared with ones of experimental and finite element analysis..

A Broadband Eccentric Annular Ring Microstrip Slot Antenna (광대역 특성을 갖는 변형된 원형 링 마이크로스트립 슬롯 안테나)

  • 서영훈;박익모
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.5
    • /
    • pp.773-781
    • /
    • 2000
  • We proposed an eccentric annular ring microstrip slot antenna for improving a narrow bandwidth of the conventional annular ring microstip slot antenna. The proposed antenna has an asymmetric slot and a normal microstrip feedline. This antenna is analyzed and optimized by using the finite difference time domain (FDTD) method. The impedance bandwidth of the optimized antenna is more than 1 octave that is much broader than the conventional annular ring microstrip slot antenna for the same size.

  • PDF

Deep Recurrent Neural Network for Multiple Time Slot Frequency Spectrum Predictions of Cognitive Radio

  • Tang, Zhi-ling;Li, Si-min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.3029-3045
    • /
    • 2017
  • The main processes of a cognitive radio system include spectrum sensing, spectrum decision, spectrum sharing, and spectrum conversion. Experimental results show that these stages introduce a time delay that affects the spectrum sensing accuracy, reducing its efficiency. To reduce the time delay, the frequency spectrum prediction was proposed to alleviate the burden on the spectrum sensing. In this paper, the deep recurrent neural network (DRNN) was proposed to predict the spectrum of multiple time slots, since the existing methods only predict the spectrum of one time slot. The continuous state of a channel is divided into a many time slots, forming a time series of the channel state. Since there are more hidden layers in the DRNN than in the RNN, the DRNN has fading memory in its bottom layer as well as in the past input. In addition, the extended Kalman filter was used to train the DRNN, which overcomes the problem of slow convergence and the vanishing gradient of the gradient descent method. The spectrum prediction based on the DRNN was verified with a WiFi signal, and the error of the prediction was analyzed. The simulation results proved that the multiple slot spectrum prediction improved the spectrum efficiency and reduced the energy consumption of spectrum sensing.

Optimal Packet Scheduling for Energy Harvesting Sources on Time Varying Wireless Channels

  • Kashef, Mohamed;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.121-129
    • /
    • 2012
  • In this paper, we consider a source node that operates over a time varying channel with energy harvesting capability. The goal of the source is to maximize the average number of successfully delivered packets per time slot. The source is able to choose whether to transmit a packet or defer the transmission in each time slot. The decision which is chosen by the source depends on the channel information available and the length of the energy queue. We formulate the problem of finding the optimal policy as a Markovian decision problem. We show some properties of the value function that represents the discounted number of successfully delivered packets per time slot. We prove that the optimal policy is a threshold type policy depending on the state of the channel and the length of the energy queue. We also derive an upper bound for the average number of packets per time slots successfully received by the destination. We show using numerical results that this bound is a tight bound on the performance of the optimal policy. And we consider the case of time varying channel but without channel state information (CSI). Then, we study the impact of channel time varying nature and the availability of CSI. In this case, we show that the optimal policy is a greedy policy. The performance of this greedy policy is also calculated.

Vertex Coloring based Slot Reuse Scheduling for Power Line Communications

  • Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.5
    • /
    • pp.2135-2141
    • /
    • 2015
  • Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

QoS Routing Protocol for Mobile Ad-Hoc Networks (이동 애드혹 네트워크를 위한 QoS 라우팅 프로토콜)

  • Kim, Jong-Sun;Joe, In-Whee;Park, Yong-Jin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.538-540
    • /
    • 2005
  • 본 논문의 목표는 TDMA기반의 이동 애드혹 네트워크에서 AODV 라우팅 프로토콜을 이용해서 QoS를 제공하는 것이다. 우리가 제공하려는 QoS는 종단간에 있어서 각 Flow에 대해 연속적이고도 충분한 대역폭을 보장하는 것이다. TDMA에서 대역폭은 time slot으로 다루어지며 각 노드는 전체 N개의 time slot으로 이루어진 frame단위로 전송을 한다. 본 논문에서는 Hello message와 수정된 AODV 프로토콜을 이용해서 이러한 time slot을 관리함으로써 최대한의 QoS를 보장할 수 있는 기법을 제안한다.

  • PDF

Time Slot Allocation for CDMA/TDD Indoor Wireless Systems

  • Lee Chae Y.;Sung Ki Won
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.144-151
    • /
    • 2002
  • Future wireless communication systems are expected to provide a broad range of multimedia services in which the asymmetry of traffic load between uplink and downlink is a significant feature. The rode division multiple access system with tune division duplex mode (CDMA/TDD) is a good solution to cope with the traffic asymmetry problem. However. the TDD system is subject to inter-cell interference compared to frequency division duplex (FDD) system. Since both uplink and downlink share the same frequency in TDD. uplink and downlink may interfere each other especially when neighboring cells require different rates of asymmetry. Thus, time slot allocation for tells is an important issue in TDD. In this paper. we propose a genetic algorithm based time slot allocation scheme which maximizes the residual system capacity. The proposed scheme allows that each cell employ different level of uplink/downlink asymmetry and satisfies the interference requirement.

  • PDF