• Title/Summary/Keyword: cluster-based routing protocol

Search Result 158, Processing Time 0.024 seconds

Design Mobility Agent Module for Healthcare Application Service (헬스케어 응용 서비스를 위한 Mobility Agent 모듈 설계)

  • Nam, Jin-Woo;Chung, Yeong-Jee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.2
    • /
    • pp.378-384
    • /
    • 2008
  • The sensor network for the health care application service has the man or movable object as the main sensing object. In order to support inter-node interaction by the movement of such sensing objects, the node's dynamic function modification, dynamic self-configuration and energy efficiency must be considered. In this paper, the Agilla model which supports the dynamic function modification through the agent migration between nodes and LEACH protocol which guarantees the dynamic self-configuration and energy efficiency through the configuration of inter-node hierarchical cluster configuration are analyzed. Based on the results of the analysis, the Mobility Agent Middleware which supports the dynamic function modification between nodes is designed, and LEACH_Mobile protocol which guarantees the node nobility as the weakness of the existing LEACH protocol is suggested. Also, the routing module which supports the LEACH_Mobile protocol is designed and the interface for conjunction with Mobility Agent Middleware is designed. Then, it is definitely increase performance which un mobility node of transfer data rate through LEACH_Mobile protocol of simulation result.

Energy Efficient Improved Routing Protocol based on Cluster for Wireless Sensor Networks (센서 네트워크에서 클러스터 기반 에너지 효율성을 고려한 개선된 라우팅 프로토콜)

  • Park, Yong-Min;Kim, Kyoung-Mok;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.9
    • /
    • pp.1-7
    • /
    • 2008
  • The efficient node energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. Energy efficiency is an important factor of researches that efficient routing algorithm is needed in wireless sensor network. In this research, I consider some methods to utilize more efficiently the limited power resource of wireless sensor networks. The proposed algorithm is the sink first divides the network into several areas with hop counts and data transmission based on cluster ID. The performance of the proposed algorithm has been examined and evaluated with NS-2 simulator in terms of lifetime, amount of data and overhead.

A Cluster Head Selection Algorithm Adopting Sensor Density on Wireless Sensor Networks (무선 센서 네트워크상에서 센서간의 밀도를 고려한 클러스터 헤드 선정 알고리즘)

  • Jung, Eui-Hyun;Lee, Sung-Ho;Park, Yong-Jin;Hwang, Ho-Young;Hur, Moon-Haeng
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.741-748
    • /
    • 2006
  • Due to the continuous development of sensor technology, Wireless Sensor Networks are rapidly growing and are expected to be applied to various applications. One of the most important factors in Wireless Sensor Networks is energy-efficient management of network resources. For this purpose, a lot of researches have been ongoing in the development of energy-efficient routing protocol. In this paper, a cluster head selection algorithm considering node density in addition to the cluster head selection algorithm of LEACH-C is proposed and simulated. This algorithm gives nearly the same computational speed compared to that of LEACH-C and shows improvement of network lifetime about 11% better than LEACH-C. The simulation result shows that consideration of density as well as distance between nodes in cluster head selection can be more energy-efficient than considering only the distance between nodes as LEACH-C in energy usage of Wireless Sensor Networks.

A Solution for Void Grid in Routing Protocol Supporting Mobile Sink on Sensor Network (센서 네트워크에서 모바일 싱크를 지원하는 라우팅 프로토콜의 void grid를 해결하기 위한 방안)

  • Jo, Ji-Eun;Choe, Jong-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.306-309
    • /
    • 2007
  • 센서 네트워크에서 고려해야 하는 중요한 사항중 하나는 제한된 자원을 가진 센서 네트워크에서 주어진 에너지 소모를 최소화 하여서 네트워크 수명을 연장하는 것이다. 그러나 기존에 제안된 프로토콜은 유동성을 지닌 여러 개의 싱크가 존재할 경우에는 비효율 적인 문제가 발생하였으며 그러한 문제를 해결하기 위해서 여러 가지 프로토콜이 제안 되었다. 본 논문에서는 기존에 제안된 그리드 형태를 이용한 클러스터 기반의 라우팅 프로토콜인 CBPER(Cluster-based -Power-Efficient Routing)을 기반으로 이 프로토콜이 가지는 영구적인 그리드 형성시 발생할 수 있는 void grid 문제를 해결하고자 한다.

  • PDF

Research on An Energy Efficient Triangular Shape Routing Protocol based on Clusters (클러스터에 기반한 에너지 효율적 삼각모양 라우팅 프로토콜에 관한 연구)

  • Nurhayati, Nurhayati;Lee, Kyung-Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.115-122
    • /
    • 2011
  • In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

Teen Based Secure Group Communication Scheme for Wireless Sensor Networks (무선 센서네트워크를 위한 TEEN 기반의 안전한 그룹통신 기법)

  • Seo, Il-Soo
    • Convergence Security Journal
    • /
    • v.9 no.2
    • /
    • pp.71-78
    • /
    • 2009
  • It is very difficult to apply previous security protocols to WSNs(Wireless Sensor Networks) directly because WNSs have resource constrained characteristics such as a low computing ability, power, and a low communication band width. In order to overcome the problem, we proposes a secure group communication scheme applicable to WSNs. The proposed scheme is a combined form of the TEEN(Threshold sensitive Energy Efficient sensor Network protocol) clustering based hierarchical routing protocol and security mechanism, and we assume that WSNs are composed of sensor nodes, cluster headers, and base stations. We use both private key and public key cryptographic algorithms to achieve an enhanced security and an efficient key management. In addition, communications among sensor nodes, cluster headers, and base stations are accomplished by a hierarchical tree architecture to reduce power consumption. Therefore, the proposed scheme in this paper is well suited for WSNs since our design can provide not only a more enhanced security but also a lower power consumption in communications.

  • PDF

A Hierarchical Underwater Acoustic Sensor Network Architecture Utilizing AUVs' Optimal Trajectory Movements (수중 무인기의 최적 궤도 이동을 활용하는 계층적 수중 음향 센서 네트워크 구조)

  • Nguyen, Thi Tham;Yoon, Seokhoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.12
    • /
    • pp.1328-1336
    • /
    • 2012
  • Compared to terrestrial RF communications, underwater acoustic communications have several limitations such as limited bandwidth, high level of fading effects, and a large underwater propagation delay. In this paper, in order to tackle those limitations of underwater communications and to make it possible to form a large underwater monitoring systems, we propose a hierarchical underwater network architecture, which consists of underwater sensors, clusterheads, underwater/surface sink nodes, autonomous underwater vehicles (AUVs). In the proposed architecture, for the maximization of packet delivery ratio and the minimization of underwater sensor's energy consumption, a hybrid routing protocol is used. More specifically, cluster members use Tree based routing to transmit sensing data to clusterheads. AUVs on optimal trajectory movements collect the aggregated data from clusterhead and finally forward the data to the sink node. Also, in order to minimize the maximum travel distance of AUVs, an Integer Linear Programming based algorithm is employed. Performance analysis through simulations shows that the proposed architecture can achieve a higher data delivery ratio and lower energy consumption than existing routing schemes such as gradient based routing and geographical forwarding. Start after striking space key 2 times.

A Low-Power Clustering Algorithm Based on Fixed Radio Wave Radius in Wireless Sensor Networks (무선센서네트워크에서 전파범위기반의 저 전력 클러스터링 알고리즘)

  • Li, Yong-Zhen;Jin, Shi-Mei;Rhee, Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7B
    • /
    • pp.1098-1104
    • /
    • 2010
  • Recently, a variety of research of multi-hop routing protocol have been done to balance the sensor node energy consumption of WSN(wireless sensor network) and to improve the node efficiency for extending the life of the entire network. Especially in multi-hop protocol, a variety of models have been concerned to improve energy efficiency and apply in the reality. In multi-hop protocol, we assumption that energy consumption can be adjusted based on the distance between the sensor nodes. However, according to the physical property of the actual WSN, it's hard to establish this assumption. In this dissertation, we propose low-power sub-cluster protocol to improve the energy efficiency based on the spread of distance. Compared with the previous protocols, this proposed protocol can be effectively used in the wireless sensing networks.

An efficient Clustering Node Life Time management Technique in MANET algorithm (MANET에서 클러스터링 노드의 효율적인 수명 관리 기법)

  • Lee, Jong-Seung;Kim, Yeong-Sam;Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.746-748
    • /
    • 2011
  • MANET(Mobile Ad-hoc Network) is a self-configuration network or wireless multi-hop network based on inference topology. The proposed ATICC(Adaptive Time Interval Clustering Control) algorithm for hierarchical cluster based MANET. The proposed ATICC algorithm is time interval control technique for node management considering the attribute of node and network traffic. ATICC could be made low the network traffic. Also it could be improving the network life time by using timing control method.

  • PDF

A Study on Flooding Attack Detection and Response Technique in MANET (MANET에서 플러딩 공격 탐지 및 대응 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.13 no.4
    • /
    • pp.41-46
    • /
    • 2013
  • Routing protocol using in the existing wire network cannot be used as it is for efficient data transmission in MANET. Because it consists of only mobile nodes, network topology is changing dynamically. Therefore, each mobile node must perform router functions. Variety of routing attack like DoS in MANET is present owing to these characteristic. In this paper, we proposed cooperative-based detection method to improve detection performance of flooding attack which paralyzes network by consuming resource. Accurate attack detection is done as per calculated adaptively threshold value considered the amount of all network traffic and the number of nodes. All the mobile nodes used a table called NHT to perform collaborative detection and apply cluster structure to the center surveillance of traffic.