• Journal of Convergence Society for SMB
• /
• v.4 no.1
• /
• pp.7-15
• /
• 2014

In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2459-2464
• /
• 2009

In sensor network there are no nodes or servers that are exclusively responsible for packet forwarding and routing. Instead, sensor nodes participating in network communications perform these activities. Thus, they are vulnerable to the alteration and forgery of message in the process of packet forwarding and routing. To solve this problem, a security to ensure authentication and integrity of routing and forwarding messages should be required. To do this, we propose the hash chain-based digital signature model where it takes less time to compute in generating and verifying the digital signature model, unlike he public key-based digital signature model, and verify if this model is proper by comparing computation times between tow models.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.415-418
• /
• 2018

To reduce the flooding overhead of typical AODV, we propose a local flooding initiated by a destination. The proposed routing protocol determines the one-hop neighbor nodes around the shortest path between source and destination by overhearing, and periodically generate flooding at the destination to cope with topology changes. This flooding process involves only one-hop neighbor nodes around the shortest path for reducing the flooding overhead and forms multiple alternate paths around the shortest path. This makes it possible to seamlessly route to the newest shortest path around when the current routing path is disconnected.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.124-130
• /
• 1990

This paper presents a new layout language, HAN-LALA (HANyang LAyout LAnguage), to automate the LSI/VLSI layout design. HAN-LALA is a C extension, which is easy to describe the layout. As HAN-LALA is directly compiled with no preprocessor, it renders easy debugging and short design time. For the technology independent layout design, the design rules and the process technologies are organized into seperate modules. The related objects are grouped and the placement is performed on the groups. Also the various routing modules including a river routing module and the one which can consider the forbidden regions make the layout design error-free without detailed descriptions of the layout.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.165-172
• /
• 2011

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Directed Diffusion is a well known routing protocol. In this paper we adopt the clustering mechanism to improve the efficiency of Directed Diffusion. We introduce C-Directed Diffusion which make clusters, select the CH(Cluster Head) and CHs do the same process as in Directed Diffusion. C-Directed Diffusion is pretty simple and show better performance than Directed Diffusion.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.712-721
• /
• 2002

The active network is a new networking approach to allow new protocols to be developed easily by solving the limitation of the existing protocol development procedure and the long protocol standardization process. So far many research institutes and universities have proposed active node architectures and active packet formats, but still there are some problems needed to be solved. One of them is the active packet format and the routing approach which consider the requirements of various active applications. Therefore, in this paper, we figure cut the requirements of various active applications and design four types of active packet formats that reflect these requirements and propose routing schemes appropriate for these characteristics. Also we propose an active node architecture which reflect these requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5200-5222
• /
• 2017

The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.155-161
• /
• 2015

Efficient energy consumption is a one of the key issues in wireless sensor networks. Clustering-based routing algorithms have been popular solutions for such an issue. Re-clustering is necessary for avoiding early energy drain of cluster head nodes in such routing strategies. The re-clustering process itself, however, is another source of energy consumption. It is suggested in this work to adaptively set the frequency of re-clustering by comparing the energy levels of cluster heads and a threshold value. The algorithm keeps the clusters if all the cluster heads' energy levels are greater than the threshold value. We confirm through simulations that the suggested algorithm shows better energy efficiency than the existing solutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3B
• /
• pp.175-182
• /
• 2006

In this paper, we propose a Localized Adaptive QoS Routing Scheme using POMDP and Exploration Bonus Techniques. Also, this paper shows that CEA technique using expectation values can be simply POMDP problem, because performing dynamic programming to solve a POMDP is highly computationally expensive. And we use Exploration Bonus to search detour path better than current path. For this, we proposed the algorithm(SEMA) to search multiple path. Expecially, we evaluate performances of service success rate and average hop count with $\phi$ and k performance parameters, which is defined as exploration count and intervals. As result, we knew that the larger $\phi$, the better detour path search. And increasing n increased the amount of exploration.

• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.157-164
• /
• 2011

This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.