• Title/Summary/Keyword: Timeslot

Search Result 32, Processing Time 0.026 seconds

Virtual Slot Multiple Access for Wireless Personal Area Network (WPAN을 위한 가상 슬롯 기반 다중 접근 방식)

  • Hwang Do-Youn;Kwon Eui-Hyeok;Lim Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.837-843
    • /
    • 2006
  • IEEE802.15.3 and IEEE802.15.4 have defined the hybrid MAC protocols based on TDMA and CSMA where a multi-frame TDMA structure is employed so that multiple data frames can be transmitted within one timeslot to guarantee minimum delay bounds of isochroous traffic. However, TDMA has an intrinsic problem that cannot dynamically allocate optimal length of timeslot to each station. Therefore the idle timeslot can be produced by stations when each transmission queue is instantaneously empty during its timeslot, which would waste lots of timeslots especially in the multi-frame TDMA systems. In this paper, we propose a more flexible multiple-access scheme for the multi-frame TDMA system based on the concept of virtual slot which is accessible by every station with the highest priority for slot owner and lower priority for other stations. Finally, our simulation results from various environments show that proposed scheme can achieve magnitude improvement of total system throughput and average message delay by maximizing channel utilization.

A Real-Time Algorithm for Timeslot Assignment in ISM System with DVB-RCS

  • Lee, Ik-Sun;Sung, Chang-Sup;Jin, Gwang-Ja;Han, Ki-Seop
    • ETRI Journal
    • /
    • v.29 no.3
    • /
    • pp.329-335
    • /
    • 2007
  • This paper considers a timeslot assignment problem in an interactive satellite multimedia (ISM) system with digital video broadcast-return channel via satellite (DVB-RCS). The timeslot assignment problem is formulated as a binary integer programming to maximize the overall weighted throughput and is shown to be NP-hard. Thus, three real-time heuristic algorithms including ratio-based, packet-size (PS)-based, and transmission gain (TG)-based are derived, and some computational experiments are made. Considering the results, the ratio-based heuristic algorithm is demonstrated to be the most effective and efficient. We propose adapting the ratio-based heuristic algorithm to the timeslot assignment problem to greatly improve the ISM system utilization.

  • PDF

Improving Efficiency of Timeslot Assignment for Non-realtime Data in a DVB-RCS Return Link: Modeling and Algorithm

  • Lee, Ki-Dong;Cho, Yong-Hoon;Lee, Ho-Jin;Oh, Deock-Gil
    • ETRI Journal
    • /
    • v.25 no.4
    • /
    • pp.211-218
    • /
    • 2003
  • This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

  • PDF

Real-time Integrated Timeslot and Code Allocation Scheme for the CDMA/TDD System Supporting Voice and Data Services (음성 및 데이터 서비스를 지원하는 CDMA/TDD 시스템을 위한 실시간 통합 타임슬롯 및 코드 할당 체계)

  • Chang, Kun-Nyeong;Lee, Ki-Dong
    • Korean Management Science Review
    • /
    • v.25 no.2
    • /
    • pp.25-42
    • /
    • 2008
  • CDMA/TOD with asymmetric capacity allocation between uplink and downlink is a highly attractive solution to support the next generation mobile systems. This is because flexible asymmetric allocation of capacity to uplink and downlink usually improves the utilization of the limited bandwidth. In this paper, we mathematically formulate an optimal timeslot and code allocation problem, which is to maximize the total utility considering the numbers of codes(channels) allocated to each data class and the forced terminations of previously allocated codes. We also suggest a real-time integrated timeslot and code allocation scheme using Lagrangean relaxation and subgradient optimization techniques. Experimental results show that the proposed scheme provides high-quality solutions in a fast time.

QoS-based Optimal Timeslot Allocation for MF-TDMA Broadband Satellite Systems (MF-TDMA 광대역 위성시스템을 위한 QoS 기반 최적 타임슬롯 할당 체계)

  • Chang Kun-Nyeong;Lee Ki-Dong;Park You-Jin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.4
    • /
    • pp.141-157
    • /
    • 2004
  • In this paper, we consider broadband satellite systems using MF-TDMA(Multi-Frequency Time Division Multiple Access) scheme. First, we analyze return link, superframe structure, and QoS( Quality of Service) parameters in broadband satellite systems, and mathematically formulate the QoS-based optimal timeslot allocation problem as a nonlinear integer programming problem for broadband satellite systems with clear-sky and rain-fade satellite terminals, and multiple data classes. Next, we modify the proposed problem to solve it within in a fast time, and suggest the QoS-based optimal timeslot allocation scheme. Extensive simulation results show that the proposed scheme finds an optimal solution or a near optimal solution within 5ms at Pentium IV PC.

Optimal Buffer and Timeslot Allocation Scheme for Broadband Satellite Networks (광대역 위성 네트워크를 위한 최적 버퍼 및 타임슬롯 할당 체계)

  • Chang Kun-Nyeong;Park You-Jin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.1
    • /
    • pp.117-129
    • /
    • 2006
  • In this paper, we consider broadband satellite networks using MF-TDMA (Multi-Frequency Time Division Multiple Access) scheme. We analyze the number of expected lost packets in each terminal, and mathematically formulate optimal buffer and timeslot allocation model to minimize the weighted sum of the numbers of expected lost packets. We also suggest optimal buffer and timeslot allocation scheme based on Lagrangean relaxation technique to solve the proposed model in a fast time. Extensive experiments show that the proposed scheme provides encouraging results.

Design of Variable Timeslot for Hybrid MAC (하이브리드 MAC을 위한 가변 타임슬롯 설계)

  • Ryu, Jeong-Kyu;Lee, Seong-Real
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.6
    • /
    • pp.613-619
    • /
    • 2020
  • Hybrid media access control (MAC) is used in internet of things (IoT) network, because of communication feature concern with data capacity and communication interval between gateway and sensor nodes and the cost efficiency. Hybrid MAC consists of TDMA and CSMA generally. The distance between gateway and sensor node is openly changed in marine IoT network. Therefore, it is needed to control the period of timeslot of hybrid MAC used in marine IoT network. In this paper, the design rule of TDMA timeslot with the variable period depending on communication distance was proposed. It was confirmed from the analysis that 72 times communication between gateway and sensor nodes is possible in LoRa network by using the proposed TDMA variable timeslot scheme.

EPON Bandwidth Allocation Scheme for Improved Utilization (Bandwidth 이용률을 높이기 위한 EPON 대역 할당 기법)

  • 윤춘희;이성창
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.89-94
    • /
    • 2003
  • Passive Optical Network(PON) architecture is a very simple. However media access protocol is necessary to the PON because the ONUs should share a channel in the upsteam direction. We propose the design of dynamic bandwidth allocation algorithm for improved bandwidth utilization in the broad bandwidth access network that uses Ethernet PON. The object of our study shall be to decrease a unused remainder bandwidth of granted timeslot for a upstream traffic transmission. We propose that OLT notifies ONU of maximum transmission window during discovery and ONU request a amount under maximum transmission window after it checks a frame length. We confirm that the proposed algorithm shown improving performance from bandwidth utilization and queueing delay point of view through the simulation result.

Contention Free Period Allocation by Nash Arbitration in Overlapped WBAN Environment (중첩된 WBAN 환경에서 내쉬중재를 이용한 비경쟁구간 할당 방안)

  • Shin, Sang-Bae;Cho, Jin-Sung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06d
    • /
    • pp.221-224
    • /
    • 2011
  • 본 논문에서는 중첩 된 WBAN(Wireless Body Area Network) 환경에서 비경쟁 전송구간의 신뢰성 있는 전송을 위해 한정된 자원(비경쟁 전송구간)을 각각의 WBAN에게 할당하는 방안을 제안한다. 이를 위해 협동적 게임 이론(cooperative game theory)을 바탕으로 한정된 자원(비경쟁 전송구간)을 효율적이고 공평하게 할당 할 수 있도록 내쉬중재(Nash arbitration) 기법을 통한 자원 할당 방안을 살펴본다. 내쉬중재 협상해법을 통해 WBAN 간 비경쟁 전송구간의 충돌 없이 신뢰성 있는 전송을 보장한다. 또한, 각 WBAN의 비경쟁 전송 구간 내의 디바이스 우선순위와 할당받은 timeslot의 개수를 고려하여 전략 선택에 따른 형평성과 각 WBAN이 비경쟁전송 구간 내에 요구하는 최소한의 timeslot을 보장한다.

A Proposed Scheme for Channel and Timeslot Co-Scheduling Data Aggregation in MWSNs: An Algorithm Design (MWSN에서 채널 및 타임 슬롯 공동 스케줄링 데이터 집계를 위한 제안 계획 : 알고리즘 설계)

  • Vo, Vi Van;Kim, Moonseong;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.05a
    • /
    • pp.44-46
    • /
    • 2020
  • Aggregating data with an optimal delay, which is a critical problem in Wireless Sensor Networks applications, is proven as NP-hard. In this paper, we focus on optimizing the aggregation delay by presenting an idea for channel and timeslot co-scheduling data aggregation in MWSNs. The proposed scheme, which names Break and Join, maximizes the number of sensor nodes to be scheduled in a working period, so that the overall number of working periods and data collection delay are reduced.