• Title/Summary/Keyword: node lifetime

Search Result 375, Processing Time 0.029 seconds

Power-efficient MAC protocol for energy harvesting wireless sensor networks (에너지하베스팅 무선센서네트워크를 위한 전력효율적인 매체접근제어 프로토콜)

  • Shim, Kyu-Wook;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.580-581
    • /
    • 2018
  • In order to reduce end-to-end delay in EH-WSN (energy harvestin wireless sensor netowk), medium access control protocols using multi-hop routing technique have been studied. In a real environment, there are many situations where it is difficult to harvest enough energy than the energy consumed. Therefore, it is required to design a MAC protocol that allows nodes to reliably relay data without exhausting power in multi-hop transmission. In this paper, we propose a power-efficient MAC protocol that can select the relay node according to the residual power and the energy collection rate to increase network lifetime.

  • PDF

An Energy Efficient Cluster-head Selection Algorithm Using Head Experience Information in Wireless Sensor Networks (무선 센서 네트워크환경에서 헤드 경험정보를 이용한 에너지 효율적인 클러스터 헤드 선정 알고리즘)

  • Kim, Hyung-Jue;Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.3
    • /
    • pp.608-614
    • /
    • 2009
  • In wireless sensor networks, there are hundreds to thousands of small battery powered devices which are called sensors. As sensors have a limited energy resources, there is a need to use it effectively. A clustering based routing protocol forms clusters by distributed algorithm. Member nodes send their data to their cluster heads then cluster heads integrate data and send to sink node. In this paper we propose an energy efficient cluster-head selection algorithm. We have used some factors(a previous cluster head experience, a existence of data to transmit and an information that neighbors have data or not) to select optimum cluster-head and eventually improve network lifetime. Our simulation results show its effectiveness in balancing energy consumption and prolonging the network lifetime compared with LEACH and HEED algorithms.

Dimensioning of linear and hierarchical wireless sensor networks for infrastructure monitoring with enhanced reliability

  • Ali, Salman;Qaisar, Saad Bin;Felemban, Emad A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3034-3055
    • /
    • 2014
  • Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

Cluster Property based Data Transfer for Efficient Energy Consumption in IoT (사물인터넷의 에너지 효율을 위한 클러스터 속성 기반 데이터 교환)

  • Lee, Chungsan;Jeon, Soobin;Jung, Inbum
    • Journal of KIISE
    • /
    • v.44 no.9
    • /
    • pp.966-975
    • /
    • 2017
  • In Internet of Things (IoT), the aim of the nodes (called 'Things') is to exchange information with each other, whereby they gather and share information with each other through self decision-making. Therefore, we cannot apply existing aggregation algorithms of Wireless sensor networks that aim to transmit information to only a sink node or a central server, directly to the IoT environment. In addition, since existing algorithms aggregate information from all sensor nodes, problems can arise including an increasing number of transmissions and increasing transmission delay and energy consumption. In this paper, we propose the clustering and property based data exchange method for energy efficient information sharing. First, the proposed method assigns the properties of each node, including the sensing data and unique resource. The property determines whether the node can respond to the query requested from the other node. Second, a cluster network is constructed considering the location and energy consumption. Finally, the nodes communicate with each other efficiently using the properties. For the performance evaluation, TOSSIM was used to measure the network lifetime and average energy consumption.

A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks (무선 센서 네트워크에서 클러스터 헤드의 멀티 홉 라우팅 트리 구성)

  • Choi, Hyekyeong;Kang, Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.11
    • /
    • pp.763-770
    • /
    • 2014
  • In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

A Rendezvous Node Selection Scheme Considering a Drone's Trajectory for Reliable Data Collection (안정적인 데이터 수집을 위해 드론의 비행경로를 고려한 랑데부 노드 선정 기법)

  • Min, Hong;Jung, Jinman;Kim, Bongjae;Heo, Junyoung
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.2
    • /
    • pp.77-81
    • /
    • 2018
  • Many studies that improve the efficiency of data collection and a network's lifetime by using a mobile sink have been conducted using wireless sensor networks. If a drone is used as a mobile sink, the drone can collect data more efficiently than can existing mobile sinks operating on the ground because the drone can minimize the effects of obstacles and the terrain. In this paper, we propose a rendezvous node selection scheme which considers estimated drone's trajectory and data collection latency of sensor networks for reliable data collection, when a drone whose trajectory is not predetermined works with terrestrial wireless sensor networks. A selected rendezvous node on the ground collects data from the entire network and it sends then collected data to the drone via direct communication. We also verify that the proposed scheme is more reliable than previous schemes without considering the drone's trajectory and data collection latency.

Fixed Partitioning Methods for Extending lifetime of sensor node for Wireless Sensor Networks (WSN환경에서 센서노드의 생명주기 연장을 위한 고정 분할 기법)

  • Han, Chang-Su;Cho, Young-Bok;Woo, Sung-Hee;Lee, Sang-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.942-948
    • /
    • 2016
  • WSN based on wireless sensor nodes, Sensor nodes can not be reassigned and recharged if they once placed. Each sensor node comes into being involved to a communication network with its limited energy. But the existing proposed clustering techniques, being applied to WSN environment with irregular dispersion of sensor nodes, have the network reliability issues which bring about a communication interruption with the local node feature of unbalanced distribution in WSN. Therefore, the communications participation of the sensor nodes in the suggested algorithm is extended by 25% as the sensor field divided in the light of the non-uniformed distribution of sensor nodes and a static or a dynamic clustering algorithm adopted according to its partition of sensor node density in WSN. And the entire network life cycle was extended by 14% to ensure the reliability of the network.

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.

Energy Efficient Clustering Scheme for Mobile Wireless Sensor Network (이동 무선 센서 네트워크에서의 에너지 효율적인 클러스터링 기법)

  • Lee, Eun-Hee;Kim, Hyun-Duk;Choi, Won-Ik;Chae, Jin-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.388-398
    • /
    • 2011
  • In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

KOCED performance evaluation in the wide field of wireless sensor network (무선센서망 내 KOCED 라우팅 프로토콜 광역분야 성능평가)

  • Kim, TaeHyeon;Park, Sea Young;Yun, Dai Yeol;Lee, Jong-Yong;Jung, Kye-Dong
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.2
    • /
    • pp.379-384
    • /
    • 2022
  • In a wireless sensor network, a large number of sensor nodes are deployed in an environment where direct access is difficult. It is difficult to supply power, such as replacing the battery or recharging it. It is very important to use the energy with the sensor node. Therefore, an important consideration to increase the lifetime of the network is to minimize the energy consumption of each sensor node. If the energy of the wireless sensor node is exhausted and discharged, it cannot function as a sensor node. Therefore, it is a method proposed in various protocols to minimize the energy consumption of nodes and maintain the network for a long time. We consider the center point and residual energy of the cluster, and the plot point and K-means (WSN suggests optimal clustering). We want to evaluate the performance of the KOCED protocol. We compare protocols to which the K-means algorithm, one of the latest machine learning methods, is applied, and present performance evaluation factors.