• ETRI Journal
• /
• v.14 no.3
• /
• pp.1-15
• /
• 1992

Stand-slone 신호 중계 교환기인 SMX-1(Signalling Message eXchange No.1)은 통신망의 신경계인 공통선 신호망(Common Channel Signalling Network)의 하부 구조를 구성하는 시스팀이다. SMX-1에 총괄명 번역서비스를 수용하게 되면 통신망 사용자에게 통신망 내부의 구성 및 구성 요소의 변화에 구속되지 않고 지속적인 지능망 서비스를 제공할 수 있게 된다. 본 연구에서는 SMX-1의 설계 이념에 부합되도록 신호연결 제어부의 기능을 소프트웨어 및 하드웨어적으로 분산화하여 설계, 구현함으로써 SMX-1의 고신뢰성 및 신속성을 추구하였다. 소프트웨어적으로는 총괄명번역 서비스 제공을 위해 국제 전신 전화 자문 회의(CCITT)권고 Q.711-Q.714에서 정의하고 있는 신호연결 제어부(SCCP:Signalling Connection Control Part)의 기능을 관리 기능(SCMG : SCCP Management Part)과 루팅 제어 기능(SCRC : SCCP Routing Control Part)으로 분리하여 각각의 기능을 이중화하여 설계, 구현하였다. 하드웨어적으로는 관리 기능을 하나의 보드로 집중화하고 루팅 제어 기능을 여러개의 보드로 분산화하였다. 분산되어 있는 루팅 제어기능이 총괄명번역 서비스를 수행하기 위하여 사용하는 루팅 제어 데이터의 일치성을 유지하기 위하여, 관리 기능에 루팅 제어 데이터를 총괄적으로 관리하는 루팅 제어 데이터 관리 기능(RCDMFB : Routing Control Data Management Function Block)과 운용 관리 기능 (OMS : Operation and Management Subsystem)의 제원관리 지원기능을 구현하였다.

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

This is the first part of the four-part paper describing the development of a packet-switched computer network named the KORNET In this paper, we present the overview of the KORNET, and discuss various aspects on the development of the netwo management center (NMC). The NMC acts as a nerve center of the network, performing such functions as network monitoring, subscriber and network management and routing manage-ment using operator dialogues. In the implementation of the NMC, we have developed various application softwares that include operator interface, primary/srcondary pan, session layer and packet level adaptor. As for packet, link and physical level protocols, we have modified the XODIAC X.25 originally developed by Data General, Inc. All the net-work protocols we have developed comply completely with the CCITT recommendations.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.1-13
• /
• 2003

In this paper, LAC(Look-ahead AGV Controller) has been developed for efficient routing of parts in semiconductor and LCD production systems. Several procedures have been developed as sub-modules. LACP(Look-ahead AGV Control Procedure) which controls AGVs using the information on the current and future status of the systems is the main element of the LAC. To support LACP, DSP(Destination Selection Procedure) which determines a destination of a part and AGV call time, SSP(Source Selection Procedure)which selects a part coming next to a buffer when the buffer becomes available. and RTM(Response Time Model) which estimates empty travel time of AGVs and waiting time for an available AGV have been developed. A simulation experiment shows that LAC reduces part's flow time, AGV utilization, average and maximum inventory level of a central buffer, empty travel time of an AGV, and waiting time for an available AGV.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.371-378
• /
• 2010

In this paper, we propose a new energy-efficient routing algorithm for sensor networks that selects a least energy consuming path among the paths formed by node with highest remaining energy and provides long network lifetime and uniform energy consumption by nodes. The pair distribution of the energy consumption over all the possible routes to the base station is one of the design objectives. Also, an alternate route search mechanism is proposed to cope with the situation in which no routing information is available due to lack of remaining energy of the neighboring nodes. Simulation results show that our algorithm extends the network lifetime and enhances the network reliability by maintaining relatively uniform remaining energy distribution among sensor nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.101-106
• /
• 2010

As a part of preparing the sniffing attack, this routing method presented in this thesis decreases the risk rates of the leaking of information through separating valid data and transmitting by a multi-path. then data is transmitted from start node to destination node on distributed sensor network. The level of reduction in leaking of information by the sniffing attack is proved by experimental result thich compare the case described above with the case of transmitting whole data with the single path by simulation, and the algorithm for choosing the routing path is showed by proof of the theorem.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.395-402
• /
• 2007

Wireless sensor networks have many sensor nodes which response sudden events in a sensor fields. Some efficient routing protocol is required in a sensor networks with mobile sink node. A data-path template is offered for the data announcement and data request from source node and sink node respectively. Sensed data are transferred from source node to sink node using short-distance calculation. Typical protocols for the wireless networks with mobile sink are TTDD(Two-Tier Data Dissemination) and CBPER(Cluster-Based Power-Efficient Routing). The porposed SPDR(Short-Path Data Routing) protocol in this paper shows more improved energy efficiencies from the result of simulations than the typical protocols.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.19-28
• /
• 2002

A new class of applications based on event interactions are emerging for the wide-area network such as Internet, which is characterized as loose coupling, heterogeneity. and asynchrony. Content-barred publish/subscribe systems are widely being studied to implement the extent notification service for wide-area networks. In this paper, we analyze some problems of the content-based routing algorithm in SIENA, a recently developed as a representative event notification service architecture, and develop an enhanced routing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3257-3274
• /
• 2012

Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.581-588
• /
• 2002

In this paper, we newly propose the optical CDMA routing scheme for the radio access network. At the radio base station (RBS), the received radio signals are multiplied by the PN codes and converted to the CDMA radio signals. In the next optical CDMAS are performed and multiplxed by using the PN codes which are the addresses of the routing mobile switching center (MSC). At the MSC, the CDMA radio signals are routined to another MSC by the CDM receiver at the routing node. In the case MSC is equal to the desired MSC, the radio signal is correlated by the two-layerd spectrum despreading at a time. Finally we theoretically analyze the signal-to-interference and noise power ratio of regenerated signal and the routing error probability and show the availability of proposed scheme.