• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.401-405
• /
• 2007

In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.75-76
• /
• 2009

무선 센서 노드는 한정된 자원을 가지기 때문에 에너지 효율성을 높이는 것이 필수적이다. 이를 위해서 통신 메시지를 감소시킬 수 있는 클러스터 기반 라우팅 기법이 연구되었다. 하지만 기존 연구들은 클러스터 헤더가 임의로 선정되기 때문에 헤더 노드의 위치가 편중될 수 있어 비효율적이다. 이를 해결하기 위하여 본 논문에서는 홉(hop) 수 기반의 대표 경로를 생성하여, 분산된 클러스터 헤더를 선정하여 클러스터를 구성하고, 클러스터 헤더간 멀티 홉(multihop)을 구성하는 라우팅 프로토콜을 설계한다. 대표 경로를 통해 클러스터 헤더의 위치 및 영역이 균일하게 분포되도록 선출하고, 싱크 노드의 방향을 인식함으로써 우회하지 않는 효율적인 경로를 구성한다.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.91-105
• /
• 2010

A wireless sensor network communication technique has been broadly studied with continuous advances in ubiquitous computing environment. Especially, because the resource of the sensor node is limited, it is important to reduce the communication energy by using an energy-efficient routing protocol. The existing cluster-based routing protocols have a problem that they cannot select a cluster head efficiently by randomly choosing a head. In addition, because the existing cluster-based routing protocols do not support the large scale of network, they cannot be used for various applications. To solve the above problems, we, in this paper, propose a new cluster-based routing protocol using representative paths. The proposed protocol constructs an efficient cluster with distributed cluster heads by creating representative paths based on hop count. In addition, a new routing protocol supports multi-hop routing for data communication between a cluster member node and a cluster head as well as between cluster heads. Finally, we show that our protocol outperforms LEACH and Multihop-LEACH in terms of reliability and scalability.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.495-504
• /
• 2009

Wireless sensor networks (WSN) consisting of a largenumber of sensors aims to gather data in a variety of environments and is beingused and applied in many different fields. The sensor nodes composing a sensornetwork operate on battery of limited power and as a result, high energyefficiency and long network lifetime are major goals of research in the WSN. Inthis paper we propose a novel cluster-based local multi-hop routing protocolthat enhances the overall energy efficiency and guarantees reliability in thesystem. The proposed protocol minimizes energy consumption for datatransmission among sensor nodes by forming a multi-hop in the cluster.Moreover, through local cluster head rotation scheme, it efficiently manageswaste of energy caused by frequent formation of clusters which was an issue inthe existing methods. Simulation results show that our scheme enhances energyefficiency and ensure longer network time in the sensor network as comparedwith existing schemes such as LEACH, LEACH-C and PEACH.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2533-2540
• /
• 2013

In multihop cellular network environments, the mobility of nodes is a major obstacle to find a reliable routing path between a mobile node (MN) and the access node (AN). Therefore, in this paper, we propose a fast and reliable neighbor discovery protocol that enables the fast and reliable neighbor discovery by considering the node mobility in the multihop cellular network. The proposed neighbor discovery protocol inhibits the transmission of unnecessary control messages to quickly find a suitable neighbor node (NN) and performs a priority-based access control to transmit control messages without collision in the order of NN desirable to be selected. Simulation results show that the proposed neighbor discovery protocol can discover the NNs faster than the conventional scheme and select a more reliable relay node although the number of neighbor nodes increases and the node mobility increases.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1593-1608
• /
• 2009

If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.13-20
• /
• 2005

An ad hoc wireless networks forms temporary network without the aid of fixed networks or centralized administration with a collection of wireless mobile hosts. In this case, it is necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. This paper presents an efficient cluster-based routing protocol scheme for ad hoc networks. The cluster is used for path setup and data delivery. Our cluster-based routing algorithm is designed for the improvement of the load balance. Our simulation results show the improved performance for low mobility networks comparing with the previous works.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.131-137
• /
• 2007

Recently, Ant Colony Optimization (ACO) is emerged as a simple yet powerful optimization algorithm for routing and load-balancing of both wired and wireless networks. However, there are few researches trying to adopt ACO to enhance routing performance in WSN owing to difficulties in applying ACO to WSN because of stagnation effect. In this paper, we propose an energy-efficient path selection algorithm based on ACO for WSN. The algorithm is not by simply applying ACO to routing algorithm but by introducing a mechanism to alleviate the influence of stagnation. By the simulation result, the proposed algorithm shows better performance in data propagation delay and energy efficiency over Directed Diffusion which is one of the outstanding schemes in multi-hop flat routing protocols for WSN. Moreover, we checked that the proposed algorithm is able to mitigate stagnation effect than simple ACO adoption to WSN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.16-23
• /
• 2009

This paper investigates how many optimal routes can be established in terms of a given wireless mesh routing metric. Although many of routing metrics have been devised to precisely derive the wireless link quality in mesh, most (if not all) metrics have not been evaluated their optimality along with routing protocols. We consider stateof-the-art routing metrics and a widely accepted routing protocol in order to observe the optimality of established routes varying the number of source nodes. Also, we propose a unidirectional routing to deal with possible link asymmetry feature in wireless links. Through comparative simulation evaluations, we show that the portion of optimally established routes becomes less as the network traffic load increases, regardless of employed metrics, network topologies, and routing protocols.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.897-904
• /
• 2006

In large-scale MANETs, the performance of MANET routing protocols is degraded significantly. To avoid this, zone-based hierarchical architecture is proposed. In this architecture, single large-scale MANET is divided into multiple small-scale MANETs. In this paper, we propose autoconfiguration-coupled MANET routing protocol to reduce routing overhead of mim user nodes. If MANET routing protocol utilizes the autoconfigured information of each user node, its overhead or procedure can be reduced. Proposed method shows the degradation of routing overhead of user nodes via simulation.