• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.2
• /
• pp.130-139
• /
• 1995

A hierarchical placement system based on routing region assignment has been developed to increase the probability of routing completion after placement. While most of the existing placement systems attempt to reduce the cell density at the portions where routing density is high, our method is distinguished in that specific routing regions are allocated to secure complete routing where the routing density is greater than the routing capacity. Hierarchy is vuilt by clustering and recursive paritioning, and the initial placement obtained by partitioning at each level is improved by using the region refinement algorithm. After placement at each hierarchical level, global routing is performed and fouting regions are assigned, if routing density is greater than routing capacity, to be considered at the next level of placement. the proposed algorithm has been implemented and applied to place several industrical gate-array circuits. A couple of circuits which cannot be routed by using conventional placement techniques can be completely routed by using our new placement technique with routing region assignment.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.269-278
• /
• 2001

Routing region modeling method of auto_routing systems are use the grid and the non-grid type. Though grid type has a few electrical and physical element on PCB, grid type has disadvantage which decrease the auto-routing speed dur to constraint with board and gird size. Thus it increase the memory capacity, Non-grid type(Shape baed type) use the region processing type, so it has 44.2% memory decrease effect than grid type in routing region. Thus, via number has 55% decrease effect, total routing time is increased 83.8% than conventional PCB system. In this paper we developed high speed PCB auto-routing system without memory waste by using shaped type applicant with auction algorithm which reaching the destination from one-point with best speed and solving the path problem. Also, this system developed by Visual C++ in IBM Pentium computer Window environment, and compatible with other PC.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.257-260
• /
• 2001

Routing region modeling methods for PCB auto-routing system in Shape based type(non-grid method) used region process type and the shape located in memory as a individual element, and this element consumed small memory due to unique data size. In this paper we design PCB(Printed Circuit Board) auto-routing system using the auction algorithm method that 1) Could be reached by solving the shortest path from single original point to various destination, and 2) Shaped based type without any memory dissipation with the best speed. Also, the auto-routing system developed by Visual C++ in Window environment, and can be used in IBM Pentium computer or in various individual PC system.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.59-67
• /
• 2009

In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.4
• /
• pp.432-440
• /
• 2015

UGVs(Unmanned Ground Vehicles) are robots that can substitute humans in reconnaissance operations of potentially dangerous and contaminated sites. Currently, there have been active research on utilizing UGVs in military environments. Much resrach has been focused on exploiting the weakness of topology-based routing and instead utilize location-based routing for the networking of UGVs. It is generally assumed that location-based routing methods can fully utilize the location information gained from GPS. However, this may not be possible in tactical environments due to enemy GPS jamming and LOS(Line of Sight) limitations. To solve this problem, we propose a location-based routing scheme utilizing low control message that can calibrate the location information using GPS information as well as location of neighboring UGV, movement direct and speed information. Also utilizing topology-based routing scheme to solve incorrect location information in GPS jamming region.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.137-148
• /
• 2012

In this paper, we proposed the location-aware coordinate routing algorithm for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. The x, y and z coordinate axes from divided address space of 16 bit to solve this problems. However, coordinate routing does not take account of wireless link condition. If wiress link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose the location-aware coordinate routing algorithm considering wiress link condition, where reliable data transmission is made and the consumed enegy is minimize. and we compared and connected region and transition region of ZigBee location based routing in the aspect of average number of multi hops, subordinate packet delivery ratio, delay time, and energy consumption of proposed algorithm. It turned out that there were improvements in performances of each items.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.177-180
• /
• 2011

In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.69-77
• /
• 2006

Geocasting is a form of communication that transmits messages to all nodes within a given geographical region(i.e., the geocasting region). Most of conventional onery aware protocols were based on shortest-hop routing that is, they minimized the cost in terms of the distance and total transmission energy not considering both the residual energy at each node and the link error ratio when selecting the routes for communication. In this paper we propose a MLRG(Maximum Lifetime Reliable Geocast) protocol for energy-efficient and reliable geocasting in Ad-hoc networks. The proposed MLRG, a position-based and routing-based geocasting algorithm, maximizes the network lifetime using newly defined cost function and selecting the energy balanced routes on the basis of each node's residual energy, and provides a reliable communication considering the link error ratio.

• Convergence Security Journal
• /
• v.19 no.5
• /
• pp.19-24
• /
• 2019

It is impossible to apply the routing protocol in the wired environment because MANET consists of only mobile nodes. Therefore, routing protocols considered these characteristics are required. In particular, if malicious nodes are not excluded in the routing phase, network performance will be greatly reduced. In this paper, we propose intrusion detection technique based on region to improve routing performance. In the proposed technique, the whole network is divided into certain areas, and then attack detection within the area using area management node is performed. It is a proposed method that can detect attack nodes in the path through cooperation with each other by using completion message received from member nodes. It also applied a method that all nodes participating in the network can share the attack node information by storing the detected attack node and sharing. The performance evaluation of the proposed technique was compared with the existing security routing techniques through the experiments and the superior performance of the proposed technique was confirmed.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.267-276
• /
• 2004

The modeling methods of routing region used in the automatic placement/routing system are a grid and non-grid. Because the gird method is curbed by its size and a board if the electrical and physical elements on PCB are of small quantity, it has many memories. Therefore, it has demerit which decreases the speed of automatic placement/routing. The Shape-based type, non-grid method, makes the shapes exist as an in dividual element in a memory by using a region-processing method. Each individual element needs very small memory since it has its unique data size. Therefore, this paper aimed to develope the automatic placement/routing system which can automatically place and route the PCB without dissipation of memory at a high speed. To this aim, the auction algorithm method was applied which can make the memories be most rapidly reached from the original point to various destinations. Also, this system was developed by the Visual C++ in the Widows environment of IBM Pentium computer in order to use it in an individual PC system.