• Title/Summary/Keyword: Cluster Based routing

Search Result 260, Processing Time 0.036 seconds

A Study on Energy Efficiency for Cluster-based Routing Protocol (클러스터 기반 라우팅 프로토콜의 에너지 효율성에 관한 연구)

  • Lee, Won-Seok;Ahn, Tae-Won;Song, ChangYoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.3
    • /
    • pp.163-169
    • /
    • 2016
  • To establish the equitable distribution of total energy load, a representative cluster based routing protocol LEACH selects cluster heads randomly in accordance with the pre-determined probability every round. But because the current energy level of sensor nodes is not considered, if a sensor node which has little residual energy is elected as a cluster head, it can not live to fulfil the role of cluster head which has big energy load. As a result, the first time of death of a node is quickened and the service quality of WSN gets worse. In this regard we propose a new routing method that, by considering the current energy of a cluster head and the distance between cluster heads and a base station, selects the sub cluster head for saving the energy of a cluster head. Simulation results show that the first time of death of a node prolongs, more data arrive at the base station and the service quality of WSN improves.

A Traffic-Aware Cluster Based Routing Protocol for Non-uniformly Distributed Mobile Ad Hoc Networks (불균일 분포 모바일 애드 혹 네트워크에서 집중되는 트래픽을 고려한 효율적인 클러스터 기반 라우팅 프로토콜)

  • Hamm, Yong-Gil;Kim, Yong-Seok
    • The KIPS Transactions:PartC
    • /
    • v.17C no.4
    • /
    • pp.379-384
    • /
    • 2010
  • Mobile nodes in high mobility ad hoc networks might come together in specific areas. In non-uniformly distributed networks, traffic load can be concentrated to intermediate nodes between dense clusters, and networks performance can be degraded. In this paper, we proposed a cluster based routing protocol that heavy traffic nodes adaptively react according to traffic load. The simulation result shows that the proposed protocol reduce packet loss and end-to-end delay.

Cluster Based Routing Protocol Using Fixed Cell in Mobile Ad hoc Networks (MANET) (Mobile Ad Hoc Networks(MANET)에서의 고정셀을 이용한 Cluster Based Routing Protocol)

  • 정종광;김재훈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.583-585
    • /
    • 2002
  • Mobile Ad Hoc Network에서는 무선으로 연결된 호스트들이 쉽게 이동할 수 있으며 미리 설치된 유선망을 이용하는 셀롤러망과 달리 이동 호스트 사이의 통신만으로 이루어진 망이다. Mobile Ad Hoc Network에서는 각각의 노드들의 이동성이 높기 때문에 이 각각의 노드들의 라우팅 경로를 결정하는 것이 중요하다. 이에 따라 Mobile Ad Hoc Network를 위한 많은 라우팅 프로토콜이 제안되었다. 본 논문에서는 기존에 제안된 Cluster Based Routing Protocol(CBRP)극 변형하여 마치 셀롤러망에서의 셀과 같이 고정된 위치를 하나의 셀로 정의하고 그 하나의 셀이 클러스터를 형성하여 라우팅 오버 헤드를 줄일 수 있는 기법을 제안한다.

  • PDF

Cluster-head-selection-algorithm in Wireless Sensor Networks by Considering the Distance (무선 센서네트워크에서 거리를 고려한 클러스터 헤드 선택 알고리즘)

  • Kim, Byung-Joon;Yoo, Sang-Shin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.127-132
    • /
    • 2008
  • Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

  • PDF

A Study on Attack Detection using Hierarchy Architecture in Mobile Ad Hoc Network (MANET에서 계층 구조를 이용한 공격 탐지 기법 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.2
    • /
    • pp.75-82
    • /
    • 2014
  • MANET has various types of attacks. In particular, routing attacks using characteristics of movement of nodes and wireless communication is the most threatening because all nodes which configure network perform a function of router which forwards packets. Therefore, mechanisms that detect routing attacks and defense must be applied. In this paper, we proposed hierarchical structure attack detection techniques in order to improve the detection ability against routing attacks. Black hole detection is performed using PIT for monitoring about control packets within cluster and packet information management on the cluster head. Flooding attack prevention is performed using cooperation-based distributed detection technique by member nodes. For this, member node uses NTT for information management of neighbor nodes and threshold whether attack or not receives from cluster head. The performance of attack detection could be further improved by calculating at regular intervals threshold considering the total traffic within cluster in the cluster head.

Cluster Head Selection Protocol Using Modified Setup Phase (변형된 셋업 단계를 이용한 클러스터 헤드 선출 프로토콜)

  • Kim, Jin-Su;Choi, Seong-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.167-176
    • /
    • 2009
  • Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. So, we propose the modified cluster selection protocol method that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady-state phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.

Avoiding Energy Holes Problem using Load Balancing Approach in Wireless Sensor Network

  • Bhagyalakshmi, Lakshminarayanan;Murugan, Krishanan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1618-1637
    • /
    • 2014
  • Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

An Efficient Multi-Hop Cluster Routing Protocol in Mobile Ad Hoc Network (이동 임시무선망에서의 효율적인 다중 홉 클러스터 라우팅 프로토콜)

  • Kim Si-Gwan
    • 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.

  • PDF

Improved cluster-based routing protocol using cluster header in Mobile ad hoc network (모바일 애드혹 네트워크에서 클러스터 헤드를 이용한 향상된 클러스터 기반 라우팅 프로토콜)

  • Kim, Chang-Jin;Kim, Wu-Woan;Jang, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.241-244
    • /
    • 2012
  • In mobile ad-hoc networks, it should be the most important issue to reduce the power consumption of communications, because the resource of a node is limited in these networks. In existing cluster-based routing protocols, cluster headers participate in almost all communication processes. Therefore the lifetime of the cluster header is shortened and it does not have the effective route. In the proposed cluster-based routing protocol, the cluster header transmits a control packet which gives the route information to member nodes. This makes that the cluster header decreases the number of participating in communications, and that node members do not have to communicate trough the cluster header. This results in extending the lifetime of the cluster header, and having the effective route, data transmission rate and improved stability of routes.

  • PDF

Cluster Label-based ZigBee Mesh Routing Protocol (클러스터 라벨 기반의 지그비 메쉬 라우팅 프로토콜)

  • Lee, Kwang-Koog;Kim, Seong-Hoon;Park, Hong-Seong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1164-1172
    • /
    • 2007
  • To solve scalability problem in the ZigBee Network, this paper presents a new mesh routing protocol for ZigBee, called ZigBee Cluster Label (ZiCL). ZiCL divides the ZigBee network into one or more logical clusters and then assigns a unique Cluster Label to each cluster so that it discovers a route of a destination node based on Cluster Label. When a node collects new Cluster Label information of a destination node according to discovery based on Cluster Label, ZiCL encourages nodes with the same Cluster Label to share the information. Consequen tly, it contributes on reducing numerical potential route discoveries and improving network performances such as routing overhead, end-to-end delay, and packet delivery ratio. Simulation results using NS-2 show ZiCL performs well.