• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1393-1398
• /
• 2003

In this paper, we propose a new switch architecture with one schedule at k-time slots, which k means the allocated time slots for each schedule. A conventional switch system uses a single time slot per each schedule but the proposed switch system uses multiple time slots per each schedule. Both the conventional switch md the proposed switch have same throughput but our switch system occupies multiple cell time slots per each schedule and hence can be implemented in scheduler of simple circuitry compared to the conventional switch. The proposed scheduling method for switch system will be applicable in switch system with high-speed data link rate.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3302-3320
• /
• 2014

An allocation of sensing and reporting times is proposed to improve the sensing performance by scheduling them in an efficient way for cognitive radio networks with cluster-based cooperative spectrum sensing. In the conventional cooperative sensing scheme, all secondary users (SUs) detect the primary user (PU) signal to check the availability of the spectrum during a fixed sensing time slot. The sensing results from the SUs are reported to cluster heads (CHs) during the reporting time slots of the SUs and the CHs forward them to a fusion center (FC) during the reporting time slots of the CHs through the common control channels for the global decision, respectively. However, the delivery of the local decision from SUs and CHs to a CH and FC requires a time which does not contribute to the performance of spectrum sensing and system throughput. In this paper, a super-allocation technique, which merges reporting time slots of SUs and CHs to sensing time slots of SUs by re-scheduling the reporting time slots, has been proposed to sense the spectrum more accurately. In this regard, SUs in each cluster can obtain a longer sensing duration depending on their reporting order and their clusters except for the first SU belonged to the first cluster. The proposed scheme, therefore, can achieve better sensing performance under -28 dB to -10 dB environments and will thus reduce reporting overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.686-693
• /
• 2009

In this paper, we propose an efficient tag sleep method utilizing empty time slots for improving the tag collection performance in active RFID systems. In the proposed tag sleep method, the reader detects the occurrence of empty time slots by carrier sensing and utilizes the wasted empty time slots to transmit sleep commands to the collected tags throughout the framed slotted aloha-based tag collection process, resulting in reducing the time required for tag collection. Via the simulation experiments, we evaluated the performance of the tag collection applied with the proposed tag sleep method, compared with that of the basic tag collection. The simulation results showed that the tag collection applied with the proposed tag sleep method could reduce the average tag collection time by 12.28%, 12.30%, and 13.31 %, for the framed slotted aloha with the fixed 128 time slots and 256 time slots, and the dynamic framed slotted aloha anticollision protocols, respectively.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.166-170
• /
• 2007

This paper discusses stationkeeping of COMS which accommodates two optical payloads. In order to provide good quality images to the users, the east/west stationkeeping which is strong perturbing sources shall be performed outside of mandatory observation time slots asked by users. If the east/west stationkeeping time is resulted inside of the mandatory time slots, it shall be shifted in order to be performed outside of mandatory time slot, or a new stationkeeping shall be planned. This constraint is expected to ask additional fuel consumption in comparison with tradition stationkeeping. This paper analyzes the impact of mandatory time slots to the stationkeeping fuel consumption. Orbit simulations have been conducted to determine validity of given constraints in the light of fuel requirement and stationkeeping accuracy.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.58-68
• /
• 2013

Five-phase reservation protocol (FPRP) is a contention-based media access control protocol for wireless ad hoc networks. FPRP uses a five-phase reservation process to establish slot assignments based on time division multiple access. It allows a node to reserve only one slot in an information frame. Once a node has reserved a slot, it will cease contending for other slots. As a result, there may be less contending nodes in the remaining slots, so the time slots in an information frame are not fully used by FPRP. To improve time slot utilization, this paper proposes an improved pseudo-Bayesian algorithm, based on which an improved contention access mechanism for FPRP is proposed, in which nodes are allowed to contend for more than one slot in a reservation frame according to a certain probability/priority. Simulation results indicate that the proposed mechanism performs better than FPRP in time slot utilization and hence the network throughput under various scenarios.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.247-255
• /
• 2015

In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.899-906
• /
• 2003

In this paper, a channel access control algorithm and a slot allocation algorithm are proposed as MAC protocol for multimedia services in TDMA/TDD-based wireless ATM networks. In the proposed protocol, VBR terminals that require real-time services transmit a reservation request through a random access minislot. VBR terminals, which are successfully transmitted the reservation request, transmits the dynamic parameters through a dynamic parameter minislot without contention. On the other hand, ABR terminals transmit a reservation request with contention basis whenever a non-real-time traffic burst is generated. Based on the received dynamic parameters and the number of requested slots, the base station scheduler allocates a dynamic parameter minislot as well as uplink data slots into VBR terminals. Also the scheduler allocates uplink data slots into ABR terminals in proportion to the number of requested slots.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4122-4143
• /
• 2018

Because of the increment in network scale and test expenditure, simulators gradually become main tools for research on key problems of wireless networking, such as radio resource management (RRM) techniques. However, existing simulators are generally event-driven, causing unacceptably large simulation time owing to the tremendous number of events handled during a simulation. In this article, a mass-processing framework for RRM simulations is proposed for the scenarios with a massive amount of terminals of Internet of Things accessing 5G communication systems, which divides the time axis into RRM periods and each period into a number of mini-slots. Transmissions within the coverage of each access point are arranged into mini-slots based on the simulated RRM schemes, and mini-slots are almost fully occupied in dense scenarios. Because the sizes of matrices during this process are only decided by the fixed number of mini-slots in a period, the time expended for performance calculation is not affected by the number of terminals or packets. Therefore, by avoiding the event-driven process, the proposal can simulate dense scenarios in a quite limited time. By comparing with a classical event-driven simulator, NS2, we show the significant merits of our proposal on low time and memory costs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.29-36
• /
• 2010

Consider an RFID network configured as a star such that a single reader is surrounded by a crowd of tags. In the RFID network, prior to attaining the information stored at a tag, the reader must cognize the tags while arbitrating a collision among tags' responses. For this purpose, we present a tag cognizance scheme based on framed and slotted ALOHA, which statically provides a number of slots in each frame for the tags to respond. For the evaluation of the cognizance performance, we choose the cognizance completion probability and the expected cognizance completion time as key performance measures. Then, we present a method to numerically calculate the performance measures. Especially, for small numbers of tags, we derive them in a closed form. Next, we formulate a problem to find an optimal time structure which either maximizes the cognizance completion probability under a constraint on the cognizance time or minimizes the expected cognizance completion time. By solving the problem, we finally obtain an optimal number of slots per frame for the tags to respond. From numerical results, we confirm that there exist a finite optimal number of slots for the tags to respond. Also, we observe that the optimal number of slots maximizing the cognizance completion probability tends to approach to the optimal number of slots minimizing the expected cognizance completion time as the constraint on the cognizance time becomes loose.