• Title/Summary/Keyword: Energy efficient Routing Protocol

Search Result 248, Processing Time 0.028 seconds

Cluster Based Energy Efficient 2 stages PEGASIS Routing Protocol for Wireless Sensor Network (USN 환경에서의 클러스터 기반 에너지 효율적인 2단계 PEGASIS 라우팅 규약)

  • Lee, Young-Han;Lee, Kyung-Oh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.437-438
    • /
    • 2009
  • 다양한 환경에서 쓰이고 있는 무선 센서 네트워크 기술은 센서 노드들을 이용하여 정보 수집을 하고 있다. 하지만, 무선 센서 네트워크에서의 센서 노드들은 전력을 유선으로 공급받는 것이 아니라, 제한적인 배터리 용량을 사용하기 때문에 효율적인 배터리 관리가 필요하다. 무선 센서네트워크에서는 이러한 센서 노드들의 에너지 효율을 향상시키기 위해서 현재까지 수많은 라우팅 기법들이 제안되어 왔다[1]. 그중에서 보다 에너지 효율적인 기법인 PEGASIS 기법을 이용하여, PEGASIS기법이 가지고 있는 단점과 그 내용을 보완한 방법을 제시하려한다. 제안된 기법은 기존의 클러스터 기반에서 PEGASIS 기법을 이용하는 방법으로 구성하였다. 이로 인해 기존에 제안되었던, LEACH, LEACH-C, PEGASIS와 비교하였을 때, 센서 노드들의 수명이 전체적으로 증가할 것으로 보고 있다.

Energy Efficient Data Transmission Protocol in Wireless Sensor Networks (무선 센서네트워크상의 에너지 효율적인 데이터 전송 프로토콜)

  • Kim, Il Hyu;Cha, Jung Woo;Kim, Chang Hoon;Nam, In Gil;Park, Sang Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.720-723
    • /
    • 2009
  • 기존에 제안된 클러스터 기반의 데이터 전송 프로토콜은 데이터 전송을 위해 헤더 노드가 존재하고 각 헤더노드는 데이터 전송을 위한 경로 정보를 유지해야 하기 때문에 전송할 데이터가 많아지면 저장해야 할 캐시도 증가하게 되고 데이터 전송 시 데이터 공고와 요구의 과정을 거쳐야 된다. 또한 LOAD(6LoWPAN Ad hoc Routing Protocol)에서는 데이터 전송 시 목적지에 대한 경로 정보를 획득 하는 작업과 획득한 경로를 테이블에 보관해야 하는 단점이 있다. 본 논문에서 제안된 데이터 전송 프로토콜은 데이터 전송 요구 시 목적지로 전송하기 위한 경로 정보의 획득이나 유지를 하지 않는다. 또한 노드들이 한번씩 데이터를 전송함으로써 노드의 전체적인 에너지 공평성과 효율성을 증가시키고, 전체 네트워크의 수명을 연장 시킬 수 있다.

A Study on Logical Cooperative Entity-Based Multicast Architecture Supporting Heterogeneous Group Mobility in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크에서 이질적 그룹 이동성을 지원하는 논리적 협업 개체 기반의 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.171-178
    • /
    • 2007
  • In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

A Distributed address allocation scheme based on three-dimensional coordinate for efficient routing in WBAN (WBAN 환경에서 효율적인 라우팅을 위한 3차원 좌표 주소할당 기법의 적용)

  • Lee, Jun-Hyuk
    • Journal of Digital Contents Society
    • /
    • v.15 no.6
    • /
    • pp.663-673
    • /
    • 2014
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

Efficient Context-Aware Scheme for Sensor Network in Ubiquitous Devices

  • Shim, Jong-Ik;Sho, Su-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.12
    • /
    • pp.1778-1786
    • /
    • 2009
  • Many sensor network applications have been developed for smart home, disaster management, and a wide range of other applications. These applications, however, generally assume a fixed base station as well as fixed sensor nodes. Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, sink mobility is one of the most comprehensive trends for information gathering in sensor networks, but the research of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a scheme for context-aware by ubiquitous devices with the sink functionality added through fixed sinks under a previously-built, cluster-based multi-hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously-built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was confirmed that performance increases by average 50% in energy with the number of mobile sinks, and with the number of movements by mobile devices.

  • PDF

An Efficient Routing Scheme based on Link Quality and Load Balancing for Wireless Sensor Networks (무선 센서 네트워크에서 링크 상태 및 트래픽 분산 정보를 이용한 효과적인 라우팅 방법)

  • Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.11-19
    • /
    • 2010
  • ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

An AODV Re-route Methods for Low-Retransmission in Wireless Sensor Networks (무선센서네트워크에서 저-재전송율을 위한 AODV 경로 재설정 방법)

  • Son, Nam-Rye;Jung, Min-A;Lee, Sung-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9A
    • /
    • pp.844-851
    • /
    • 2010
  • Recently, AODV routing protocol which one of the table driven method for the purpose data transmission between nodes has been broadly used in mobile wireless sensor networks. An existing AODV has a little overhead of routing packets because of keeping the routing table for activity route and re-routes to recovery the routes in route discontinuation. However that has faults in that excesses useless of the network bandwidth to recovery the route and takes a lone time to recovery the route. This paper proposes an efficient route recovery method for AODV based on wireless sensor networks in connection breaks. The proposed method. The propose method controls the number of RREQ message considering the energy's node and distance between nodes to restrict the flooding range of RREQ message while expanding the range of local repair. In test results, the proposed method are compared to existing method, the number of drops decrease 15.43% and the delay time for re-route decrease 0.20sec.

Energy-Efficient Division Protocol for Mobile Sink Groups in Wireless Sensor Network (무선 센서 네트워크에서 이동 싱크 그룹의 분리를 지원하기 위한 라우팅 프로토콜)

  • Jang, Jaeyoung;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.1
    • /
    • pp.1-8
    • /
    • 2017
  • Communications for mobile sink groups such as rescue teams or platoons bring about a new challenging issue for handling mobility in wireless sensor networks. To do this, many studies have been proposed to support mobile sink groups. When closely looking at mobile sink groups, they can be divided into (multiple) small groups according to the property of applications. For example, a platoon can be divided into multiple squads to carry out its mission in the battle field. However, the previous studies cannot efficiently support the division of mobile sink groups because they do not address three challenging issues engendered by the mobile sink group division. The first issue is to select a leader sink for a new small mobile sink group. The efficient data delivery from a source to small mobile sink groups is the second issue. Last, the third issue is to share data between leader sinks of small mobile sink groups. Thus, this paper proposes a routing protocol to efficiently support the division of mobile sink groups by solving the three challenging issues. For the first issue, the proposed protocol selects a leader sink of a new small mobile sink group which provide a minimum summation of the distance between the new leader sink and the previous leader sink and the distance from the new leader sink to all of its member sinks. For the efficient data delivery from a source to small mobile sink groups in the second issue, the proposed protocol determines the path to minimize the data dissemination distance from source to small mobile sink group by calculating with the location information of both the source and the leader sinks. With regard to the third issue, the proposed protocol exploits member sinks located among leader sinks to provide efficient data sharing among leaders sinks by considering the location information of member sinks. Simulation results verified that the proposed protocol is superior to the previous protocol in terms of the energy consumption.

Adaptive Mobile Sink Path Based Energy Efficient Routing Protocol for Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율을 고려한 모바일 sink의 적응적 경로설정 방법)

  • Kim, Hyun-Duk;Yoon, Yeo-Woong;Choi, Won-Ik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.12A
    • /
    • pp.994-1005
    • /
    • 2011
  • In this paper, we propose a novel approach to optimize the movement of mobile sink node, called AMSP(Adaptive Mobile Sink Path) for mobile sensor network environments. Currently available studies usually suffer from unnecessary data transmission resulting from random way point approach. To address the problem, we propose a method which uses the Hilbert curve to create a path. The proposed method guarantees shorten transmission distance between the sink node and each sensor node by assigning orders of the curve according to sensor node density. Furthermore, The schedule of the sink node is informed to all of the sensing nodes so that the Duty Cycle helps the network be more energy efficient. In our experiments, the proposed method outperforms the existing works such as TTDD and CBPER by up to 80% in energy consumption.