• 산업경영시스템학회지
• /
• 제28권2호
• /
• pp.101-108
• /
• 2005

In this paper, the design problem of local area networks is defined as finding the network topology minimizing cost subject to reliability constraint. The design problem includes issues such as multiple choices of link type for each possible link, multiple choices of hub type for each hub, and allocation of the users to the hubs. To efficiently solve the problem, a genetic approach is suggested. According to the experiments, the proposed approach improves search performance.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권5호
• /
• pp.199-204
• /
• 2006

To develop a safety-critical network in nuclear power plants that puts more stringent requirements than the competitive commercial ones do, we establish four design criteria - deterministic communication, explicit separation/isolation structure, reliability, verification & validation. According to those design criteria, the fundamental design elements are chosen as follows - a star topology, point-to-point physical link, connection-oriented link control and fixed allocation access control. After analyzing the design elements, we also build a communication architecture with TDM (Time Division Multiplexing) bus switching scheme. Finally, We develop a DDCNet (Deterministic Data Communication Network) based on the established architecture. The DDCNet is composed of 64 nodes and guarantees the transmission bandwidth of 10Mbps and the delay of 10 msec for each node. It turns out that the DDCNet satisfies the aforementioned design criteria and can be adequately utilized for our purpose.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.89-92
• /
• 1996

It is generally recognized that Video On Demand (VOD) service will become a promising interactive service in B-ISDN. We consider a hierarchical two level network architecture for VOD service. The first level consists of connected Local Video Servers(LVSs) in which a limited number of high vision programs are stored. The second level has one Central Video Server(CVS) containing all the programs served in the network. The purpose of this paper is to analyze the network traffic and to propose the storage policy for LVSs. For this purpose, we present an analysis of program storage amount in each LVS, transmission traffic volume between LVSs, and link traffic volume between CVS and LVSs, according to changing the related factors such as demand, the number of LVSs is also presented on the basis of the tradeoffs among program storage cost, link traffic cost, and transmission cost.

• 제어로봇시스템학회논문지
• /
• 제13권3호
• /
• pp.263-267
• /
• 2007

This study proposes a new methodology to estimate the traffic capacity of a personal rapid transit(PRT) system. The proposed method comprises three steps. The first step models the guideway network(GN) of PRT as a digraph, where its node and link represent a station and a one-way guideway link between two stations, respectively. Given local vehicle control strategies, the second step formulates the local traffic capacities through the nodes and links of the GN model. The third step estimates the worst-case local traffic demands based on a shortest-path routing algorithm and an empty vehicle allocation algorithm. By comparing the traffic estimates to the local traffic capacities, we can determine the feasibility of the given GN in traffic capacity.

• Journal of Communications and Networks
• /
• 제14권6호
• /
• pp.710-718
• /
• 2012

The implementation of a common control channel is one of the most challenging issues in cognitive radio networks, since a fully reliable control channel cannot be created without reserving bandwidth specifically for this purpose. In this paper, we investigate a promising solution that exploits the ultra wide band (UWB) technology to let cognitive radio nodes discover each other and exchange control information for establishing a communication link. The contribution of this paper is threefold: (i) We define the communication protocol needed to let cognitive radio nodes discover each other and exchange control information for link set up, (ii) we overcome the gap in coverage, which typically exists between UWB and long-medium range technologies, by using multi-hop communication, (iii) we evaluate the performance of our approach by adopting an accurate channel model and show its benefits with respect to an in-band signaling solution.

• 한국통신학회논문지
• /
• 제25권6A호
• /
• pp.910-917
• /
• 2000

Because the random early detection(RED) algorithm deals all flows with the same best-effort traffic characteristic, it can not correctly control the output link bandwidth for the flows with different traffic characteristics. To remedy this problem, several per-flow algorithms have been proposed. In this paper, we propose a new per-flow type Fair Droptail algorithm which can fairly allocate bandwidth among flows over a shared output link. By evenly allocating buffers per flow, the Fair Droptail can restrict a flow not to use more bandwidth than others. In addition, it can be simply implemented even if it employs the per-flow state mechanism, because the Fair Droptail only keeps each information of flow in active state.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2008년도 정보통신설비 학술대회
• /
• pp.473-477
• /
• 2008

In this paper, we introduce the positioning methods using the grid sensor network. The basic operational principle of grid sensor network can be the wireless communication using the sensor node attached on the objects. Sink node receives the environmental information (e.g., temperature, humidity and so on), and transmits the information to the core database. Since the grid sensor network basically uses wireless communication, it is necessary to observe the place where grid sensor nodes to be installed. In this sense, we carried out the practical measurement on the wireless propagation in an applicable field. In addition, link budget study and SNR estimation works were done in accordance with the results from the measurement.

• 한국정보통신학회논문지
• /
• 제16권4호
• /
• pp.692-700
• /
• 2012

본 논문에서는 UWB 기술 기반 WiMedia 무선 USB Distributed Medium Access Control (D-MAC) 프로토콜의 공평하고 분산적인 SoQ기반 Distributed Reservation Protocol (DRP) 타임슬롯 자원 할당 방법의 성능을 분석하고, DRP 예약 충돌을 회피하기 위해 릴레이 통신 기술을 적용한 SoQ 릴레이 전송 프로토콜을 제안한다. 본 논문에서 제안하는 SoQ 릴레이 전송 프로토콜은 Satisfaction of QoS (SoQ) 알고리즘을 각 단말 디바이스에서 분산적으로 실행하고, 충돌대상 디바이스에게 예약된 QoS 자원을 유지할 수 있도록 Direct Link 뿐만 아니라 릴레이 노드를 경유하여 또 다른 Indirect Link 링크를 예약할 수 있는 자원 예약 프로토콜을 제안한다.

• 한국정보통신학회논문지
• /
• 제17권6호
• /
• pp.1324-1329
• /
• 2013

본 논문에서는 WiMedia D-MAC 기술 기반 Wireless USB 프로토콜에서 분산적인 SoQ기반 Wireless USB Channel 자원 할당 방법의 성능을 분석하고, QoS 성능 향상을 위해 릴레이 통신 기술을 적용한 SoQ 릴레이 전송 프로토콜을 제안한다. 본 논문에서 제안하는 SoQ 릴레이 전송 프로토콜은 Satisfaction of QoS (SoQ) 알고리즘을 각 단말 디바이스 내 WiMedia D-MAC 계층에서 분산적으로 실행하고, 충돌대상 디바이스에게 예약된 QoS 자원을 유지할 수 있도록 Direct Link 뿐만 아니라 릴레이 노드를 경유하여 또 다른 Indirect Link 링크를 예약할 수 있는 자원 예약 프로토콜을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5264-5281
• /
• 2017

Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.