• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 가을 학술발표논문집 Vol.32 No.2 (1)
• /
• pp.559-561
• /
• 2005

CAN(Controller Area Network)은 시스템이 간단하고 저렴하게 구현 할 수 있는 필드버스(Field bus)로써 1980년대 독일의 BOSCH사에 의해 자동차 제어용 네트워크로 개발되었고, 실시간 계측제어 능력이 우수하여 산업전반(산업 자동화, 건을 자동화, 의료 장비, 열차, 중장비 차량)에 사용되고 있다. 본 논문에서는 CAN의 단일 마스터 시스템(Single Master System)에서 마스터 노드에 문제가 발생할 때, 전체 시스템이 다운되는 현상을 악기 위해 마스터 노드를 동적으로 변화시키는 동적 마스터 시스템(Dynamic Master System)을 제안하고 기존의 시스템과 비교하여 시스템의 가용성을 알아보았다.

• ETRI Journal
• /
• 제28권1호
• /
• pp.99-102
• /
• 2006

In this letter, we study the protection problem in wavelength division multiplexing (WDM) optical networks, and propose a novel dynamic heuristic algorithm called differentiated reliable segment protection (DRSP). Differing from previous work, DRSP can effectively avoid the trap problem and is able to find a feasible solution for each connection request. Therefore, DRSP outperforms the previous work. Simulation results have shown to be promising.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.927-928
• /
• 2006

In this paper, we propose a dynamic emotion system involving the state equation and the output equation from the control theory. In our emotion system, the state equation accepts external stimulus and generates emotions. And the output equation modifies the intensity of emotions in accordance with personalities and circumstances. The validity of the proposed emotion system is shown by two simulation works which express emotions according to personalities and circumstances.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2010년도 한국컴퓨터종합학술대회논문집 Vol.37 No.2(A)
• /
• pp.145-146
• /
• 2010

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.483-486
• /
• 1998

In parallel system, the execution times of tasks cannot be accurately estimated and tasks may arrive at any time. In case, processors are overweighted with workload, the system utilization deteriorates. To solve this problem, dynamic load balancing that rearranges tasks in overloaded processors is required. We prospose the improved dynamic load balancing algorithm for $\textsc{k}-ary$ n-cubes using the property of ring and MWA which is the dynamic load balancing one for mesh. The proposed algorithm which uses the global load information has less communication cost than GDE, DDE and load difference within 1.

• Journal of information and communication convergence engineering
• /
• 제9권3호
• /
• pp.282-286
• /
• 2011

Recently, a name retrieval function is widely used on navigation systems. In this paper, we propose the new dynamic hashing algorithm for a name retrieval function on it. The proposed dynamic hashing algorithm by constructing an index using the variance information of character is the better than existing methods in terms of storage capacity and retrieval speed. The algorithm proposed in this paper can be useful on systems that have limited resources as well as navigation systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4662-4677
• /
• 2018

The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.

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

This paper investigates the channel selection problem with dynamic users and the asymmetric interference relation in distributed opportunistic spectrum access systems. Since users transmitting data are based on their traffic demands, they dynamically compete for the channel occupation. Moreover, the heterogeneous interference range leads to asymmetric interference relation. The dynamic users and asymmetric interference relation bring about new challenges such as dynamic random systems and poor fairness. In this article, we will focus on maximizing the tradeoff between the achievable utility and access cost of each user, formulate the channel selection problem as a directional graphical game and prove it as an exact potential game presenting at least one pure Nash equilibrium point. We show that the best NE point maximizes both the personal and system utility, and employ the stochastic learning approach algorithm for achieving the best NE point. Simulation results show that the algorithm converges, presents near-optimal performance and good fairness, and the directional graphical model improves the systems throughput performance in different asymmetric level systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1213-1237
• /
• 2019

Vehicular Ad-hoc Network (VANET) facilities envision future Intelligent Transporting Systems (ITSs) by providing inter-vehicle communication for metrics such as road surveillance, traffic information, and road condition. In recent years, vehicle manufacturers, researchers and academicians have devoted significant attention to vehicular communication technology because of its highly dynamic connectivity and self-organized, decentralized networking characteristics. However, due to VANET's high mobility, dynamic network topology and low communication coverage, dissemination of large data packets (e.g. multimedia content) is challenging. Clustering enhances network performance by maintaining communication link stability, sharing network resources and efficiently using bandwidth among nodes. This paper proposes a mobility-based, multi-hop clustering algorithm, (MBCA) for multimedia content broadcasting over an IEEE 802.11p-LTE-enabled hybrid VANET architecture. The OMNeT++ network simulator and a SUMO traffic generator are used to simulate a network scenario. The simulation results indicate that the proposed clustering algorithm over a hybrid VANET architecture improves the overall network stability and performance, resulting in an overall 20% increased cluster head duration, 20% increased cluster member duration, lower cluster overhead, 15% improved data packet delivery ratio and lower network delay from the referenced schemes [46], [47] and [50] during multimedia content dissemination over VANET.

• 한국통신학회논문지
• /
• 제25권4B호
• /
• pp.593-603
• /
• 2000

본 논문에서는 공중망 게이트웨이에서 데이터통신의 전송속도를 증가시키기 위한 동적경로제어방식이 제시된다. 그리고 공중망 환경에 적합한 게이트웨이의 새로운 구조를 제안하고 분석한다. 여기서는 게이트웨이 전송경로자원의 효율적인 동적할당과 시스템 호 처리율의 향상을 위하여 가상 큐를 사용하였다. 그 결과, 기존의 고정경로제어에 비하여 제안된 방식은 최대 60%까지 향상된 경로이용율을 나타내었다. 특히 발생 트래픽이 한정된 경우 이 방식은 최소한의 대기시간을 유지하면서도 고속 데이터통신을 제공할 수 있었다. 뿐만 아니라 제안된 방식에서는 트래픽에 따라 호 접속망의 할당주기가 변화되므로 다양한 트래픽이 쉽게 적용된다. 따라서 제안된 동적경로제어에 의한 게이트웨이는 공중망에서의 고속 데이터통신의 응용에 적합할 것으로 사료된다.