• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.189-198
• /
• 2001

In recent years, the predominant part in telecommunications is mobile communications. The next generation network is extending today's voice-only mobile networks to multi-service networks. ATM Network is possible to carry such multi-media traffic and it will be expect to use wireless ATM for the future mobile access network. One of manly important aspects for the performance of wireless ATM is the Medium Access Control (MAC) protocol. The MAC protocol must be able to satisfyingly handle the different ATM services (CBR, VBR, ABR and UBR) with their radically different performance requirements. Additionally, the MAC protocol must be able to cope with the complex radio environment where fading, multi-path propagation interference and burst-errors further complicate the situation. In this paper, a dynamic slot allocation algorithm in wireless ATM is proposed for an efficient channel sharing/media access at the MAC layer. We use equivalent capacity in the allocation of slots for VBR traffic which is variable along the time. It is simple and effective slot allocation method for VBR service. In particular, we consider the slot allocation of a session consisted of several connections for requirement of multimedia traffic. Simulation shows that the cell loss ratio is reduced by re-allocation of extra slots in Mobile Terminal (MT).

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.11
• /
• pp.1144-1155
• /
• 2006

Digital communication networks have become a core technology in advanced building automation systems. BACnet(Building Automation and Control networks) is a standard data communication protocol designed specifically for building automation and control systems. BACnet adopts Master-Slave/Token-Passing(MS/TP) protocol as one of its field level networks. In this study, we introduce a method of implementing a bandwidth allocation scheme in the MS/TP protocol. The bandwidth allocation scheme improves the capability of real-time communication of the original MS/TP protocol. The bandwidth allocation scheme introduced in this paper can be easily implemented in the existing MS/TP protocol with a slight modification. In this study, we actually developed the hardware and firmware of the modified MS/TP communication module in which the bandwidth allocation scheme is implemented. Using the modified MS/TP communication module, we developed an experimental model in order to examine the validity of the bandwidth allocation scheme in the MS/TP protocol. Experimental results show that the modified MS/TP protocol satisfies the requirements of real time communication for periodic and urgent messages of BACnet communication services.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.166-171
• /
• 2003

In this paper, we propose a minimal power data path allocation algorithm for low power circuit design. The proposed algorithm minimizes switching activity for input variables in scheduled CDFG. Allocations are further divided into the tasks of register allocation and module allocation. The register allocation algorithm execute that it eliminate spurious switching activity in functional unit and minimize the numbers of multiplexer. Also, resource allocation method selects a sequence of operations for a module such that the switching activity is reduced. Therefore, the algorithm executes to minimize the switching activity of input values, sequence of operations and number of multiplexer. Experimental results using benchmarks show that power is reduction effect from 13% to 17% power consumption, when compared with the Genesis-lp high-level synthesis system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1569-1586
• /
• 2015

This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l₁-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.169-178
• /
• 1996

Geographically dispersed computing system is made of computers interconnected by a telecommunications network. To make the system operated efficiently, system designer must determine the allocation of data files to each node. In designing such distributed computing system, the most important issue is the determination of the numbers and the locations where database files are allocated. This is commonly referred to as the file allocation problem (FAP)[3]. The proposed model is a 0/l integer programming problem minimizing the sum of file storage costs and communication(query and update) costs. File allocation problem belongs to the class of NP-Complete problems. Because of the complexity, it is hard to solve. So, this paper presents an efficient heuristic algorithm to solve the file allocation problem using Tabu Search Technique. By comparing the optimal solutions with the heuristic solutions, it is believed that the proposed heuristic algorithm gives good solutions. Through the experimentation of various starting points and tabu restrictions, this paper presents fast and efficient method to solve the file allocation problem in the distributed computing system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.566-578
• /
• 2018

In this paper, we design a segment training based individual channel estimation (STICE) scheme for the classical two-way relay network (TWRN) with multi-pair sources (MPS) and amplify-and-forward (AF). We adopt the linear minimum mean square error (LMMSE) channel estimator to minimize the mean square error (MSE) without channel estimation error, where the optimal power allocation strategy from the relay for different sources is obtained. Then the MSE gains are given with different source pairs among the proposed power allocation scheme and the existing power allocation schemes. Numerical results show that the proposed method outperforms the existing ones.

• IE interfaces
• /
• v.16 no.2
• /
• pp.117-124
• /
• 2003

This study focuses on the detailed explanation of the strategic allocation algorithm which can be used as an ATP(Available To Promise) from the perspective of customers, and as a sales plan for sales organizations. A strategic allocation algorithm includes three methods depending on FIXED RATIO, RANK and DEMAND BASIS. In addition, further topics would be discussed regarding the method of system implementation utilizing strategic allocation algorithms and information flow with an aim to integrate such a sales plan into the e-Biz. This study aims to provide a new solution in order to secure emerging competitive factors in today's enterprise world; that is, an achievement of faster business processes. It is suggested that this new solution be implemented in order to achieve an efficient business environment by systemizing the decision making process which in the past was manually conducted.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.4
• /
• pp.511-521
• /
• 2010

This paper presents a new algorithm to determine accurate bus-wise transmission loss allocation utilizing path-integrals dictated by the transaction strategy. For any transaction strategy, the total sum of the allocated transmission losses of all buses is equal to the actual loss given by the AC power-flow calculation considering the distributed slack. In this paper, the bus-wise allocation of the transmission loss is calculated by integrating the differential loss along a path determined by the transaction strategy. The proposed algorithm is also compared with Galiana's method, which is the well-known transmission loss allocation algorithm based on integration. The performance of the proposed algorithm is evaluated by case studies carried out on the WSCC 9-bus, IEEE 14-bus, New England 39-bus, and IEEE 118-bus systems. The simulation results show that the proposed algorithm is fast and accurate with a large step size.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.11
• /
• pp.660-668
• /
• 2005

Digital communication networks have become a core technology in advanced building automation systems. BACnet (Building Automation and Control networks) is a standard data communication protocol designed specifically for building automation and control systems. BACnet adopts Master-Slave/Token-Passing (MS/TP) protocol as one of its field level networks. Tn this study, we introduce a method of implementing bandwidth allocation scheme in the MS/TP protocol. The bandwidth allocation scheme improves the capability of real-time communication of the original MS/TP protocol. The bandwidth allocation scheme introduced in this paper can be easily implemented in the existing MS/TP protocol with a slight modification. In this study, we examined the validity of bandwidth allocation scheme using simulation models. The results from the simulation experiment show that the proposed scheme satisfies the requirements of real-time communication.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.430-433
• /
• 2002

Fieldbus traffic consists of periodic, time-critical and time-available data. A bandwidth allocation scheme allocates periodic, time-critical and time-available data traffic to the bandwidth-limited network resource. This paper presents an implementation method of the bandwidth allocation scheme in the user layer of Foundation fieldbus. In this study, an experimental model of a Foundation Fieldbus network system is developed. Using the experimental model, validity of the bandwidth allocation scheme is examined. The results obtained from the experimental model show that the proposed scheme restricts the delay of both periodic and time-critical data to a pre-specified bound. The bandwidth allocation scheme also fully utilized the bandwidth resource of the network system.