• Title/Summary/Keyword: 에너지 효율 라우팅 기법

Search Result 223, Processing Time 0.034 seconds

Lifetime Maximizing Routing Algorithm for Multi-hop Wireless Networks (다중-홉 무선 네트워크 환경에서 수명 최대화를 위한 라우팅 알고리즘)

  • Lee, Keon-Taek;Han, Seung-Jae;Park, Sun-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.292-300
    • /
    • 2008
  • In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.

An Energy Efficient Hybrid Routing Protocol Based on LEACH and PEGASIS (LEACH와 PEGASIS 기법에 기반한 에너지 효율적 하이브리드 라우팅 규약)

  • Lee, Young-Han;Lee, Hyun-Jun;Lee, Kyung-Oh
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.629-636
    • /
    • 2009
  • Since all sensor nodes in wireless sensor networks work by their own embedded batteries, if a node runs out of its battery, the sensor network can not operate normally. In this situation we should employ the routing protocols which can consume the energy of nodes efficiently. Many protocols for energy efficient routing in sensor networks have been suggested but LEACH and PEGASIS are most well known protocols. However LEACH consumes energy heavily in the head nodes and the head nodes tend to die early and PEGASIS - which is known as a better energy efficient protocol - has a long transfer time from a source node to sink node and the nodes close to the sink node expend energy sharply since it makes a long hop of data forwarding. We proposed a new hybrid protocol of LEACH and PEGASIS, which uses the clustering mechanism of LEACH and the chaining mechanism of PEGASIS and it makes the life time of sensor networks longer than other protocols and we improved the performance 33% and 18% higher than LEACH-C and PEGASIS respectively.

An Efficient Node Life-Time Management of Adaptive Time Interval Clustering Control in Ad-hoc Networks (애드혹 네트워크에서 적응적 시간관리 기법을 이용한 클러스터링 노드 에너지 수명의 효율적인 관리 방법)

  • Oh, Young-Jun;Lee, Knag-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.495-502
    • /
    • 2013
  • In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.

A Multi-Level Routing Protocol Based on Fixed Radio Wave Radius in Wireless Sensor Network (무선센서네트워크에서 전파범위를 기반으로 한 다단계 라우팅 프로토콜)

  • Jin, Shi-Mei;Li, Yong-Zhen;Rhee, Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.630-635
    • /
    • 2008
  • Recently, in order to improve the energy efficiency of WSN(Wireless Sensor Network), widely research have teen carried on. But, up to the present, Majority of methods are based on direct communication between CH(cluster head) and sink node, and based on the assumption that node can regulate signal energy actively according to the distance between nodes. So it's hard to implement those methods. Based on the theory that node has fixed radio wave radius, this paper present a multi leveling routing protocol. According to the simulation of the presented protocol, we have proved the energy saving efficiency and the implementation in real WSN.

An Efficient Clustering Mechanism for WSN (무선 센서 네트워크를 위한 효율적인 클러스터링 기법)

  • Lee, Jinwoo;Mohammad, Baniata;Hong, Jiman
    • Smart Media Journal
    • /
    • v.6 no.4
    • /
    • pp.24-31
    • /
    • 2017
  • In wireless sensor networks, sensor nodes are deployed in a remote, harsh environment. When the power of the sensor node is consumed in such a network, the sensor nodes become useless together with the deterioration of the quality and performance of the sensor network which may save human life. Although many clustering protocols have been proposed to improve the energy consumption and extend the life of the sensor network, most of the previous studies have shown that the overhead of the cluster head is quite large. It is important to design a routing protocol that minimizes the energy consumption of each node and maximizes the network lifetime because of the power limitations of the sensor nodes and the overhead of the cluster heads. Therefore, in this paper, we propose an efficient clustering scheme that reduces the burden of cluster heads, minimizes energy consumption, and uses algorithms that maximize network lifetime. Simulation results show that the proposed clustering scheme improves the energy balance and prolongs the network life when compared with similar techniques.

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

An Efficient Clustering Scheme Considering Distance from a SINK for Wireless Sensor Networks (무선 센서 네트워크에서 싱크와의 거리를 고려한 효율적인 클러스터링 기법)

  • Kang, Tae-Wook;Jung, Il-Gyu;Han, Ki-Jun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.445-447
    • /
    • 2005
  • 무선 센서 네트워크는 제한된 에너지를 가지는 작은 센서 노드들로 구성된다. 한번 배치된 센서 노드들은 유지보수 및 새로운 에너지의 공급이 어렵다. 따라서 각 노드가 가지는 제한된 에너지를 얼마나 효율적으로 사용하느냐가 무선 센서 네트워크의 수명에 큰 영향을 미친다. 본 논문에서는 이러한 에너지 효율성 향상을 위해 연구된 LEACH(Low Energy Adaptive Clustering Hierarchy), LEACH-C(LEACH-Centralized), BCDCP(Base-station Controlled Dynamic Clustering Protocol)와 같은 클러스터링 기반의 계층적 라우팅 프로토콜들을 설명하고 그 문제점을 살펴본다. 그리고 그 문제점들을 해결하기 위한 방법으로 센서 필드의 노드와 싱크와의 거리를 고려한 새로운 클러스터링 기법을 제안한다. 제안하는 클러스터링 기법에서 각 노드는 클러스터를 형성할 때 기존 방식에 비해 적은 역할을 수행함으로써 자신의 에너지를 보존할 수 있다.

  • PDF

An Ad-Hoc Network Routing Scheme based on Mechanism Design Approach (메커니즘 디자인 접근방식에 기반을 둔 애드혹 네트워크 라우팅 기법)

  • Lee, Jin-Hyung;Kim, Sung-Wook
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.3
    • /
    • pp.198-203
    • /
    • 2010
  • In this paper, a new routing protocol is proposed to manage selfish nodes which make a strategic choice to maximize only their own profits. To provide incentives to nodes on the path, VCG mechanism is introduced. Therefore, based on the collaborative actions among nodes, the entire network performance can be improved. With a simulation study, the proposed scheme can approximate an optimized solution while ensuring a well-balanced network performance under widely diverse network environments.

An Energy Efficient Cluster-Based Local Multi-hop Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 클러스터 기반 지역 멀티홉 라우팅 프로토콜)

  • Kim, Kyung-Tae;Youn, Hee-Yong
    • 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.

Sybil Attack Detection with Energy Efficiency in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 시빌 공격 탐지)

  • Heo, Junyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.115-120
    • /
    • 2013
  • There are lots of vulnerability and chance to be attacked in wireless sensor networks, which has many applications. Among those attacks, sybil attack is to generate a lot of false node and to inject false information into networks. When a user uses such false information without recognizing the attack, there might be a disaster. Although authentication method can be used to protect such attack, the method is not a good choice in wireless sensor networks, where sensor nodes have a limited battery and low power. In this paper, we propose a novel method to detect sybil attack with a little extra overhead. The proposed method use the characteristics that there is a weak connection between a group of normal nodes and a group of false nodes. In addition, the method uses energy aware routing based on random routing and adds a little information into the routing. Experimental results show that the proposed method detects false node by more than 90% probability with a little energy overhead.