• Journal of Navigation and Port Research
• /
• v.29 no.6 s.102
• /
• pp.573-581
• /
• 2005

The outbound containers in a container terminal are classified into a few groups by their weights and stacked separately in a yard for easy and efficient handling. In order to maintain the balance of a ship during loading, containers of heavier weight groups should be fetched out of a yard and loaded onto the ship before those of lighter weight groups. However, the weight information used to determine the weight group is usually imprecise. Therefore stacks will actually be filled with mixture of different weight groups and rehandlings are unavoidable during loading operation. This paper presents a method for estimating the number of rehandlings caused by imprecise information and a scheme for generating a simple but efficient slot assignment rule. Experiments have shown that a rule generated by the proposed method can reduce the number of rehandlings by about $20\%$ compared to the traditional slot assignment method which stacks only the containers of the same weight group in a single stack.

• 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.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.29 no.1
• /
• pp.391-398
• /
• 2005

The outbound containers in a container terminal are classified into a few groups by their weights and stocked separately in a yard for easy and efficient handling. In order to maintain the balance of a ship during loading, containers of heavier weight groups should be fetched out of a yard and loaded onto the ship before those of lighter weight groups. However, the weight information used to determine the weight group is usually imprecise. Therefore stacks will actually be filled with mixture of different weight groups and rehandlings are unavoidable during loading operation. This paper presents a method for estimating the number of rehandlings caused by imprecise information and a scheme for generating a simple but efficient slot assignment rule. Experiments have shown that a rule generated by the proposed method can reduce the number of rehandlings by about 20%compared to the traditional slot assignment method which stacks only the containers of the same weight group in a single stack.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.119-126
• /
• 2011

When ZigBee network supports beacon transmission mechanism, ZigBee devices have the restriction of the transmission range from the coordinator. On the contrary, when it does not support beacon transmission, it is not easy to save the energy through turning into sleep mode. This paper proposes active slot allocation method that allocates a transmission time and does not use the beacon transmission mechanism. It is based on the ZigBee's distributed address assignment mechanism and supports the scalability. This paper explains the active slot structure and the allocation order and describes the operation of ZigBee devices. We verify the proposed mechanism through the simulation and show the performance evaluation. It can be useful on the industrial automation and the environmental surveillance.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.535-537
• /
• 2004

최근 센서 네트워크에 대한 필요성이 증대되면서 센서 기술과 통신 기술 등 센서 네트워크의 기반기술에 대한 연구가 활발하게 진행되고 있다. 특히, 센서 네트워크에서 센서 노드의 수명은 센서의 배터리 전력량에 비례하므로 보다 적은 전력으로 통신을 수행하는 기술들에 관심이 집중되고 있다. 이러한 저전력 통신 프로토콜 가운데 대표적인 것이 시간 분할 다중 접속(TDMA) 기반 MAC 프로토콜이다. 지정된 시간에만 센서 노드의 통신 상태를 정지(sleep)상태에서 유휴(idle)상태로 변경하여 통신을 수행하므로 전력 소비를 최소화시키는 기술이다. 그러나 이웃한 다른 센서들 간의 통신을 간섭하지 않기 위해 센서들은 통신시 서로 다른 주파수를 사용해야 한다. 이러한 제한 사항을 충족시키기 위해서는 센서 노드들이 다양한 주파수를 청취할 수 있어야 하며. 이는 센서 노드 생산시 제조단가의 증가와 직결되어 센서 네트워크의 상용화에 주요한 문제가 될 수 있다. 따라서 본 논문에서는 시간 분할접속(TDMA) 기반 저전력 MAC 프로토콜에서 단일 주파수를 사용한 수 있도록 통신 시간(time slot)을 할당하는 알고리즘을 제안하고자 한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.42-45
• /
• 2003

본 논문은 무선개인통신(PCS)환경에서 기존의 자원경매다중접속(RAMA)방법이 가지고 있는 단점을 보완할 수 있는 새로운 자원경매다중접속방법(MRAMA)을 제안하기 위한 것이다 제안된 방법은 경매표 개념을 도입하여 슬럿 할당 주기 상에서 경매 슬럿(slot)을 낭비하는 단점을 보완할 수 있으며, 할당 주기마다 갱신되는 경매테이블을 채택하고 선점 및 비선점 우선순위규칙이 혼합된 방법을 활용함으로써 빠르고 유연하게 접속, 핸드오프, 자원할당이 가능해진다. 본 논문에서는 다양한 환경에서의 시뮬레이션을 통해 제안된 MRAMA방법이 기존의 RAMA에 비해 더 향상된 성능을 보이고 있음을 증명한다.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.47-53
• /
• 2016

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.