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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1241-1246
• /
• 2005

This paper proposes an adaptive multislot allocation algorithm in order to achieve larger 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 assigns optimum modulation parameters measuring the SNR 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.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1242-1250
• /
• 2015

It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high-rate wireless personal area network (HR-WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable-service interval-based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR-WPAN compared to existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3841-3861
• /
• 2017

Virtualized small cell network is a promising architecture which can realize efficient utilization of the network resource. However, conventional full duplex self-backhauls lead to residual self-interference, which limits the network performance. To handle this issue, this paper proposes a virtual resource allocation, in which the residual self-interference is fully exploited by employing a physical-layer network coding (PNC) aided self-backhaul scheme. We formulate the features of PNC as time slot and information rate constraints, and based on that, the virtual resource allocation is formulated as a mixed combinatorial optimization problem. To solve the problem efficiently, it is decomposed into two sub problems, and a two-phase iteration algorithm is developed accordingly. In the algorithm, the first sub problem is approximated and transferred into a convex problem by utilizing the upper bound of the PNC rate constraint. On the basis of that, the convexity of the second sub problem is also proved. Simulation results show the advantages of the proposed scheme over conventional solution in both the profits of self-backhauls and utility of the network resource.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.511-527
• /
• 2024

This paper proposes a block-based self-organizing time-division multiple access (BSO-TDMA) protocol for very high frequency (VHF) data exchange system (VDES) in shipborne ad-hoc networks (SANETs). The BSO-TDMA reduces the collisions caused by the simultaneous transmission of automatic identification system (AIS) messages by uniformly allocating channel resources using a block-wise frame. For this purpose, the BSO-TDMA includes two functional operations: (1) frame configuration and (2) slot allocation. The first operation consists of block division and block selection. A frame is divided into multiple blocks, each consisting of fixed-size subblocks, by using the reporting interval (RI) of the ship. Then, the ship selects one of the subblocks within a block by considering the number of occupied slots for each subblock. The second operation allocates the slots within the selected subblock for transmitting AIS messages. First, one of the unoccupied slots within the selected subblock is allocated for the periodic transmission of position reports. Next, to transmit various types of AIS messages, an unoccupied slot is randomly selected from candidate slots located around the previously allocated slot. Experimental simulations are conducted to evaluate the performance of BSO-TDMA. The results show that BSO-TDMA has better performance than that of the existing SOTDMA.

• Management & Information Systems Review
• /
• v.33 no.5
• /
• pp.85-95
• /
• 2014

This paper suggested an efficient mathematical model for strategic alliance of liner shipping companies. Even though a few previous research papers proposed the mathematical models for container slot chartering and allocation under liner shipping, those models were nonlinear and very difficult to solve. So their models had limits to apply them to real world problems. On the other hand, the model suggested in this paper is easy to solve and apply to real world problems because it is a integer linear programming model. This paper tried to apply the model to the same example problem as used in existing research paper. Excel add-in program, Premium Solver Platform was used to solve the problem and the optimal allocation and slot chartering for containers were able to be found easily. The result also showed that the total container shipping cost for applying the strategic alliance model was reduced compared to non-strategic alliance model.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.41-49
• /
• 2007

Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.65-75
• /
• 1998

We consider connection-oriented wireless cellular networks such as the second generation wireless cellular networks and wirelss ATM networks. In these networks, a separate forward signaling channel is provided for the transmission of paging and channel allocation packets. When a call destined to a user is requested, all the base stations in the user's current location area broadcast the corresponding paging packet across forward signaling channels. By slot mode operation and paging group allocation for fusers in a location area, we can reduce relative power consumption level at battery-operated terminals. However, a sthe number of paging groups is increased for lowering relative power consumption level, a paging packet experiences higher delay to access the forward signaling channel. For the pre-negotiated quality-of-service level, paging packet delay level must be limited. In this paper, we consider static and dynamic multiplexing schemes for paging packets, and develop an analytical method for calculating paging packet delay and relative power consumption levels. Using this analytial method, we investigate the effect of network parameters on the paging packet delay and relative power consumption levels.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.152-153
• /
• 2014

This paper proposes a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system in which an ONU (optical network unit) does not explicitly send its request to an OLT (optical line termination). To estimate the request of the ONU, the OLT monitors the upstream bandwidth usage of the ONU and periodically allocates a probe slot to the ONU.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.93-97
• /
• 2007

In this paper, centralized access control and slot allocation algorithm is proposed for wireless networks. The proposed algorithm is characterized by the contention-based reservation. In order to reduce the collision probability of reservation request, the base station calculates and broadcasts the transmission probability of reservation requests, and the wireless terminal transmits its reservation request with the received transmission probability. The scheduler allocates the uplink data slots based on the successful reservation requests. Simulation results show that the proposed algorithms can provide high channel utilization, and furthermore, maintains constant delay performance in the heavy traffic environment.