• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.317-330
• /
• 2004

In this paper, we explore the utility of recently discovered multiple-antenna techniques (namely MIMO techniques) for medium access control (MAC) design and routing in mobile ad hoc networks. Specifically, we focus on ad hoc networks where the spatial diversity technique is used to combat fading and achieve robustness in the presence of user mobility. We first examine the impact of spatial diversity on the MAC design, and devise a MIMO MAC protocol accordingly. We then develop analytical methods to characterize the corresponding saturation throughput for MIMO multi-hop networks. Building on the throughout analysis, we study the impact of MIMO MAC on routing. We characterize the optimal hop distance that minimizes the end-to-end delay in a large network. For completeness, we also study MAC design using directional antennas for the case where the channel has a strong line of sight (LOS) component. Our results show that the spatial diversity technique and the directional antenna technique can enhance the performance of mobile ad hoc networks significantly.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.346-357
• /
• 2010

Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can statistically guarantee three kinds of QoS. The scheduling policy is derived by solving the optimization problems in an ideal system according to QoS constraints. We prove that the practical version of the scheduling policy is optimal in opportunistic scheduling systems. As each scheduling policy has some parameters, we also consider practical parameter adaptation algorithms that require low implementation complexity and show their convergences mathematically. Through simulations, we confirm that our proposed schedulers show good fairness performance in addition to guaranteeing each user's QoS requirements.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.181-190
• /
• 2010

A multitude of overlay network designs for resilient routing, multicasting, quality of service, content distribution, storage, and object location have been proposed. Overlay networks offer several attractive features, including ease of deployment, flexibility, adaptivity, and an infrastructure for collaboration among hosts. In this paper, we explore cooperation among co-existing, possibly heterogeneous, overlay networks. We discuss a spectrum of cooperative forwarding and information sharing services, and investigate the associated scalability, heterogeneity, and security problems. Motivated by these services, we design Synergy, a utility-based overlay internetworking architecture that fosters overlay cooperation. Our architecture promotes fair peering relationships to achieve synergism. Results from Internet experiments with cooperative forwarding overlays indicate that our Synergy prototype improves delay, throughput, and loss performance, while maintaining the autonomy and heterogeneity of individual overlay networks.

• Asia pacific journal of information systems
• /
• v.16 no.4
• /
• pp.1-25
• /
• 2006

This research approached the negotiation problem from the seller's perspective in the make-to-order manufacturing industry in order to solve the multi-attribute automated negotiation problem. To this end, more than 'two negotiation attributes are defined and a preferred value of each negotiation alternative is calculated based on the entropy value of each attribute. And then, the best option is selected according to the utility function of each negotiator, a penalty of negotiation delay, and conviction of possibility of negotiation success. The suggested automated negotiation methods in this study can be employed for the development of advanced automated negotiation systems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.219-227
• /
• 2005

In this paper, an optimal power and rate allocation model is mathematically formulated on the forward link of multicell CDMA mobile systems. The model maximizes total utility considering data rates and fairness among cells under delay and PRER (Post RPL Error Rate) constraints. The two-level power and rate allocation scheme is suggested to solve the proposed model. Experimental results show that the proposed scheme provides a good solution in a fast time.

• Proceedings of the KIEE Conference
• /
• 2006.10a
• /
• pp.162-164
• /
• 2006

There are concern on possible health effects from exposure to electric and magnetic fields. One reflection of this concern is the considerable controversy, delay, and cost increases involved in the construction of utility lines and facilities. To meet such challenges, in this paper we investigated magnetic fields reduction techniqies such as general compaction, in-span compaction, cruciform, vertical, 3way splits phase, and 4way splits phase. As results, we found 1 spacer in-span compaction was appropriate in Korea in view of effectiveness and economy.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.6
• /
• pp.13-18
• /
• 1985

A set of utility programs for automatic generation, minimization and verification of high density PLA layout was developed, which includes equation-to-truth table translator, logic minimizer, PLA product term sorter, file generator for plotting stick diagram, dynamic CMOS PLA layout generator and bipartite row folded CMOS PLA layout generator. Size reduction is performed mainly by logic minimizer and bipartite row folder, and the maximal delay is reduced by sorter. The fOe for automatically generated layout is stored in CIF. Each program was written in Clanguage, and was run on VAX-11/750 (UNIX).

• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2024

Cognitive small cell networks, consisting of macro-cells and small cells, are foreseen as a promising candidate solution to address 5G spectrum scarcity. Recently, many technological issues (such as spectrum sensing, spectrum sharing) related to cognitive small cell networks have been studied, but the common control channel (CCC) establishment problem has been ignored. CCC is an indispensable medium for control message exchange that could have a huge significant on transmitter-receiver handshake, channel access negotiation, topology change, and routing information updates, etc. Therefore, establishing CCC in cognitive small cell networks is a challenging problem. In this paper, we propose a potential game theory-based approach for CCC establishment in cognitive radio networks. We design a utility function and demonstrate that it is an exact potential game with a pure Nash equilibrium. To maintain the common control channel list (CCL), we develop a CCC update algorithm. The simulation results demonstrate that the proposed approach has good convergence. On the other hand, it exhibits good delay and overhead of all networks.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.145-153
• /
• 2008

Existing shortest-path algorithms mainly consider a single attribute. But traveler actually chooses a route considering not single attribute but various attributes which are synthesized travel time, route length, personal preference, etc. Therefore, to search the optimal path, these attributes are considered synthetically. In this study route searching algorithm which selects the maximum utility route using discrete choice model has developed in order to consider various attributes. Six elements which affect route choice are chosen for the route choice model and parameters of the models are estimated using survey data. A multinomial logit models are developed to design the function of route choice model. As a result, the model which has route length, delay time, the number of turning as parameter is selected based on the significance test. We use existing shortest path algorithm, which can reflect urban transportation network such as u-turn or p-turn, and apply it to the real network.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3390-3397
• /
• 2010

The purpose of this study was to evaluate the validity and utility of the Korean-Ages and Stages Questionnaires(K-ASQ) as a screening tool for detecting developmental delay of preschool child in community. Informed consents from parents of 229 children were received for the process of the study. The subjects were 229 parents and the children of three to five years old who did not have reported genetic diseases or developmental delays. The result of this study, validity were calculated for the K-ASQ sensitivity 0.41%, specificity 0.76%, hyper-referral 0.14%, hypo-referral 0.21%. Predictive value of delayed development were K-ASQ 0.70% and that of normal development were K-ASQ 0.77%. K-ASQ can be feasibly used in the setting of health clinic and be the highly predictive criteria for delayed development and normal development.