• ETRI Journal
• /
• v.19 no.3
• /
• pp.98-115
• /
• 1997

The architecture of the CDMA mobile system (CMS) is developed based on three function groups - service resource, service control, and service management groups. In this paper, the CMS architecture is discussed from the point of view of implementing these functions. The variable length packets are used for transmission. The synchronization clock signals are derived form the GPS receiver. The open loop and closed loop techniques are used for the power control. The internationally accepted signaling and network protocols are employed. The call control for the primary services in designed to provide efficient mobile telecommunication services. The softer handoff is implemented in one card. The mobile assisted handoff and the network assisted handoff are employed in the soft and hard handoffs. The authentication is based on the secret data which includes random numbers. The management functions, which include the location management, resource management, cell boundary management and OAM management, are implemented to warrant the system efficiency, maximum capacity and high reliability. The architecture ensures that the CMS is flexible and expandable to provide subscribers with economic and efficient system configuration. The dynamic power control, adaptive channel allocation. and dynamic cell boundary management are recommended for future work.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.26-35
• /
• 2009

In this paper, we investigate how to do resource allocation to guarantee a minimum user data rate at low signaling overhead in multi-cell orthogonal frequency division multiple access (OFDMA) wireless systems. We devise dynamic resource allocation (DRA) algorithms that can minimize the QoS violation ratio (i.e., the ratio of the number of users who fail to get the requested data rate to the total number of users in the overall network). We assume an OFDMA system that allows dynamic control of frequency reuse factor (FRF) of each sub-carrier. The proposed DRA algorithms determine the FRFs of the sub-carriers and allocate them to the users adaptively based on inter-cell interference and load distribution. In order to reduce the signaling overhead, we adopt a hierarchical resource allocation architecture which divides the resource allocation decision into the inter-cell coordinator (ICC) and the base station (BS) levels. We limit the information available at the ICC only to the load of each cell, that is, the total number of sub-carriers required for supporting the data rate requirement of all the users. We then present the DRA with limited coordination (DRA-LC) algorithm where the ICC performs load-adaptive inter-cell resource allocation with the limited information while the BS performs intra-cell resource allocation with full information about its own cell. For performance comparison, we design a centralized algorithm called DRA with full coordination (DRA-FC). Simulation results reveal that the DRA-LC algorithm can perform close to the DRA-FC algorithm at very low signaling overhead. In addition, it turns out to improve the QoS performance of the cell-boundary users, and achieve a better fairness among neighboring cells under non-uniform load distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.5
• /
• pp.103-108
• /
• 2016

In this paper, we propose a resource allocation scheme that guarantees transmission rate for each mobile stations by mitigating interference between a base station-to-mobile station link and a relay station-to-mobile station link. Specifically, we dynamically adjust the boundary between access zone and relay zone using signal to interference plus noise ratio. Moreover, we cluster the mobile stations under sever interference and manage the channel quality of these mobile stations by allocating additional radio resource. Our simulation results show that the proposed scheme can improve the efficiency of radio resources and ensure fairness among mobile stations.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1331-1334
• /
• 2002

Micropayment is an electronic payment system for small value transaction. It needs to use a little amount of resources, such as communication and computation due to its small value. In other words, the processing cost for the micropayment must be less than the value of the payment. Several kinds of transactions are suitable for micropayment, eg. the purchasing of train tickets or digital newspapers. Since micropayment systems are designed for small-amount payment the key factor for any micropayment system design is believed to be the minimization of resource consumption without compromising the standard security. In this paper, we propose an adaptive agent approach to credit-based micropayment system, which employs the concept of dynamic balancing between the resource consumption and the risk in the system. As a result of the dynamic balancing, our system not only solves the problem of global overspending but also uses fewer amount of resources than existing approaches. Our approach limits the amount of money spent by untrusted customers to all merchants. Thus, our approach provides a boundary of the global overspending. In addition, for trusted customers, our approach requires less scale of communication for verifying authorizations than all existing approaches.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2009.10a
• /
• pp.155-159
• /
• 2009

Crack-controlled method which utilizes the dynamic energy such as explosives and propellent gases have been applied to the development of mineral resource and oil and civil engineering. It is necessary to consider the fracture processes associated with the material properties and external forces to control crack propagation using borehole pressure. To investigate the influence of the applied borehole pressure waveform on the crack propagation in rock masses having different material properties, a no-free surface model was used, consisting of a borehole in rock with a continuous boundary. Loading rates ranging from 1 to 100MPa/${\mu}s$ with different rock mass properties was employed to investigate the loading rate dependency of fracture patterns in the rock mass.

• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.19-33
• /
• 2013

In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.