• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2012년도 춘계학술대회
• /
• pp.616-619
• /
• 2012

RFID 시스템에서 다수의 태그가 동시에 자신의 ID를 리더기에 전송하게 되면 충돌로 인해 리더기의 태그 인식 시간이 지연 된다. 따라서 리더기의 태그 인식시간을 줄이기 위한 효율적인 충돌방지 기술이 필요하다. 이 논문에서는 DFSA(Dynamic Framed Slotted Aloha)를 기반으로 태그 수를 추정하여 충돌을 피하는 새로운 방식에 대해서 제안한 후 시뮬레이션을 통하여 기존의 방법과 성능을 비교한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권2호
• /
• pp.550-565
• /
• 2018

Cognitive radio technology is still the key technology of future mobile communication systems. Previous studies have focused on improving spectrum utilization and less energy consumption. In this paper, we propose an Overhead Reduced Scheme (ORS) for green cooperative spectrum sensing. Compared to traditional cooperative sensing scheme, ORS scheme divides the sensing time into three time slots and selects the best multi-mode user to report decisions. In consideration of reporting channel deviation, we derive closed-form expressions for detection probability and false alarm probability of ORS scheme based on Rayleigh fading channel. Simulation results show that ORS scheme can improve the perception accuracy while reducing the perceived delay and energy consumption in the process of perception, so as to realize the green communication.

• 경영과학
• /
• 제28권1호
• /
• pp.43-52
• /
• 2011

The basic objective of broadcast scheduling is to get the smallest length TDMA frame, where many nodes are allowed to transmit simultaneously in a single time slot in a conflict-free manner. The secondary objective is to maximize the number of such transmissions for maximum use of the channel. An Artificial Bee Colony (ABC) with ranking strategy is proposed in this paper for the broadcast scheduling problem. Our proposed method is very efficient for generating initial and neighbor feasible solutions. We can get the best number of time slots and transmission utilization comparing to previous researches.

• 한국경영과학회지
• /
• 제15권2호
• /
• pp.17-31
• /
• 1990

This problem analyzed in this paper is to specify a schedule for thesis committee allowing maximum committee members' preference over thesis topics and meeting time-slots while satisfying other related scheduling requirements such as prohibiting simultaneous assignment of a committee member to more than one committee at a time. Two mathematical programming applroaches are presented to solve the thesis committee scheduling problem in a professional graduate school. They include LP-based branch-and-bound approach with network subproblems. Characterization of the problem is analyzed to develop an efficient solution algorithm. Implementation and computational experiments are also performed for real size problems on an IBM PC/AT to show the relative performance of the propsoed approaches along with an ordinary ILP solution approach.

• 한국신재생에너지학회:학술대회논문집
• /
• 한국신재생에너지학회 2008년도 추계학술대회 논문집
• /
• pp.349-352
• /
• 2008

The most concerning issue in these days is the energy crisis by increasing threat of global warming and depletion of natural resources. In the situations, the Plug-in Hybrid Electric Vehicle (PHEV) is drawing attention from many countries for the next generation's car which has higher fuel efficiency and lower environmental impact. This paper presents simulation results about the limit capacity of central power-grid which doesn't have enough surplus electric power for charging PHEVs. Therefore, this paper also presents a smart charging system that can charge the PHEVs with a function of distributing demands of charging. The smart charging system is an agent facility between the government and consumer, which can recommend the best time to charge the battery of PHEVs by the lowest energy cost. This function of choosing time-slots is the technical system for the government which wants to control the consumption rate of electric power for PHEVs. Finally, this paper presents the economic feasibility of PHEVs from the two kinds of price system, midnight electric price and home electric price.

• 한국통신학회논문지
• /
• 제14권1호
• /
• pp.1-10
• /
• 1989

본 논문에서는 기존의 계산 알고리즘으로 다원 트래픽의 호손율을 계산할 때 발생하는 오버플로우 및 언더플로우 문제를 해결할 수 있는 계산 알고리즘을 제안하며, 이러한 계산 알로리즘을 이용하여 하나의 T 스위치망에서 스위치의 크기에 따른 호의 종류별 호손율과 전송 시스템에서 중계선 수에 따른 호손율을 계산하여 각 트래픽 특성을 분석하였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권3호
• /
• pp.180-185
• /
• 2005

Microstrip antennas generally have a lot of advantages that are thin profile, lightweight, low cost, and conformability to a shaped surface application with integrated circuitry. In addition to military applications, they have become attractive candidates in a variety of commercial applications such as mobile satellite communications, the direct broadcast system (DBS), global positioning system (GPS), and remote sensing. Recently, many of the researches have been achieved for improving the impedance bandwidth of microstrip antennas. The basic form of the microstrip antenna, consisting of a conducting patch printed on a grounded substrate, has an impedance bandwidth of $1\~2\%$. For improvement of narrow bandwidth of microstrip patch, we were designed U-slot microstrip patch antenna in this paper. This antenna had wide bandwidth for all personal communication services (PCS) and IMT-2000. For the design of U-slot microstrip patch antenna using a finite difference time domain(FDTD) method. This numerical method could get the frequency property of U-slot patch antenna and the electromagnetic fields of slots.

• Journal of Communications and Networks
• /
• 제15권3호
• /
• pp.321-328
• /
• 2013

In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.345-348
• /
• 2004

Every bridge node participating in multiple piconets and forming a scatternet should schedule the inter-piconet traffics in an efficient manner. Frequent piconet switching due to short polling intervals for the links of a bridge node leads to considerable time slots loss caused by the guard time and power consumption for transceiving and processing. On the other hand, restrained piconet switching may result in failures of fulfilling QoS (Quality of Service) requirements for some links. Tn this paper, we present a QoS aware inter-piconet scheduling scheme minimizing the piconet switching events within guaranteed QoS requirements. According to simulation results, the proposed scheme is confirmed to have great improvement in throughput and number of switching events over the credit scheme as current inter-piconet scheduling scheme for the scatter mode.

• 한국IT서비스학회:학술대회논문집
• /
• 한국IT서비스학회 2003년도 춘계학술대회
• /
• pp.577-583
• /
• 2003

Due to the widespread availability of the internet, large-scale and dynamic distributed projects in industry are becoming popular. We present a distributed, collaborative, and adaptive control approach for decentralized multiple projects, which is one of representative project environments in modern e-enterprises. In this paper we deal with short term scheduling and rescheduling of resources, which are shared by multiple projects. We in specific, address the dynamic nature of the situation. We model this as a dynamic economy, where the multiple local markets are established and cleared over time trading resource time slots(goods). Local markets are modeled using a combinatorial auction mechanism. Due to the dynamic and distributed nature of economy, through our approach we can achieve higher levels of flexibility, scalability and adaptability.