• Title/Summary/Keyword: node lifetime

Search Result 375, Processing Time 0.025 seconds

Battery Lifetime Estimation Considering Various Power Profiles in Wireless Sensor Node (무선 센서 노드의 전력 소모 형태를 고려한 배터리 수명 계산)

  • Kim, Hyun;Kim, Chang-Soon;Shin, Hyun-Chol
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.12
    • /
    • pp.43-49
    • /
    • 2009
  • We present an efficient estimation method of the battery lifetime considering various power consumption profiles in wireless sensor nodes. The power profiles in single and periodic modes and the current dissipations in different operating modes are taken into account to find the total current consumption. Also, the self-discharge rate of a battery is taken into account to estimate the battery lifetime of a given sensor node. Finally we present a governing equation for finding the battery lifetime. We believe the proposed estimation method of the battery lifetime can be an efficient and effective method for low power design of sensor nodes.

An efficient cluster header election scheme considering distancefrom upper node in zigbee environment (Zigbee 환경에서 Upper Node와의 거리를 고려한 효율적인클러스터 헤더 선출기법)

  • Park, Jong-Il;Lee, Kyoung-Hwa;Shin, Yong-Tae
    • Journal of Sensor Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.369-374
    • /
    • 2010
  • It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely affects on the lifetime of the network. Therefore, recent research is focused on the lifetime extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from Upper Node, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.

An Energy Awareness Congestion Control Scheme in Wireless Sensor Networks

  • Kim, Mi-Kyoung;Park, Jun-Ho;Seong, Dong-Ook;Kwak, Dong-Won;Yoo, Jae-Soo
    • International Journal of Contents
    • /
    • v.7 no.1
    • /
    • pp.8-13
    • /
    • 2011
  • For energy-efficiency in Wireless Sensor Networks (WSNs), when a sensor node detects events, the sensing period for collecting the detailed information is likely to be short. The lifetime of WSNs decreases because communication modules are used excessively on a specific sensor node. To solve this problem, the TARP decentralized network packets to neighbor nodes. It considered the average data transmission rate as well as the data distribution. However, since the existing scheme did not consider the energy consumption of a node in WSNs, its network lifetime is reduced. In this paper, we propose an energy awareness congestion control scheme based on genetic algorithms in WSNs. The proposed scheme considers the remaining amount of energy and the transmission rate on a single node in fitness evaluation. Since the proposed scheme performs an efficient congestion control, it extends the network lifetime. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through performance evaluation. It is shown that the proposed scheme enhances the data fairness and improves the network lifetime by about 27% on average over the existing scheme.

Routing Protocol based on Connectivity Degree and Energy Weight (연결도와 에너지 가중치 기반의 라우팅 프로토콜)

  • Jeong, Yoon-Su
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.1
    • /
    • pp.7-15
    • /
    • 2014
  • In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

  • PDF

Base Station Assisted Optimization of Hierarchical Routing Protocol in Wireless Sensor Network (WSN 에서 베이스스테이션을 이용한 계층적 라우팅 프로토콜 최적화)

  • Kusdaryono, Aries;Lee, Kyoung-Oh
    • Annual Conference of KIPS
    • /
    • 2011.04a
    • /
    • pp.564-567
    • /
    • 2011
  • Preserving energy of sensor node in wireless sensor network is an effort to prolong the lifetime of network. Energy of sensor node is very crucial because battery powered and irreplaceable. Energy conservation of sensor node is an effort to reduce energy consumption in order to preserve resource for network lifetime. It can be achieved through efficient energy usage by reducing consumption of energy or decrease energy usage while achieving a similar outcome. In this paper, we propose optimization of energy efficient base station assisted hierarchical routing protocol in wireless sensor network, named BSAH, which use base station to controlled overhead of sensor node and create clustering to distribute energy dissipation and increase energy efficiency of all sensor node. Main idea of BSAH is based on the concept of BeamStar, which divide sensor node into group by base station uses directional antenna and maximize the computation energy in base station to reduce computational energy in sensor node for conservation of network lifetime. The performance of BSAH compared to PEGASIS and CHIRON based of hierarchical routing protocol. The simulation results show that BSAH achieve 25% and 30% of improvement on network lifetime.

Multi-Collector Control for Workload Balancing in Wireless Sensor and Actuator Networks

  • Han, Yamin;Byun, Heejung
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.16 no.3
    • /
    • pp.113-117
    • /
    • 2021
  • The data gathering delay and the network lifetime are important indicators to measure the service quality of wireless sensor and actuator networks (WSANs). This study proposes a dynamically cluster head (CH) selection strategy and automatic scheduling scheme of collectors for prolonging the network lifetime and shorting data gathering delay in WSAN. First the monitoring region is equally divided into several subregions and each subregion dynamically selects a sensor node as CH. These can balance the energy consumption of sensor node thereby prolonging the network lifetime. Then a task allocation method based on genetic algorithm is proposed to uniformly assign tasks to actuators. Finally the trajectory of each actuator is optimized by ant colony optimization algorithm. Simulations are conducted to evaluate the effectiveness of the proposed method and the results show that the method performs better to extend network lifetime while also reducing data delay.

Static Worst-Case Energy and Lifetime Estimation of Wireless Sensor Networks

  • Liu, Yu;Zhang, Wei;Akkaya, Kemal
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.2
    • /
    • pp.128-152
    • /
    • 2010
  • With the advance of computer and communication technologies, wireless sensor networks (WSNs) are increasingly used in many aspects of our daily life. However, since the battery lifetime of WSN nodes is restricted, the WSN lifetime is also limited. Therefore, it is crucial to determine this limited lifetime in advance for preventing service interruptions in critical applications. This paper proposes a feasible static analysis approach to estimating the worstcase lifetime of a WSN. Assuming known routes with a given sensor network topology and SMAC as the underlying MAC protocol, we statically estimate the lifetime of each sensor node with a fixed initial energy budget. These estimations are then compared with the results obtained through simulation which run with the same energy budget on each node. Experimental results of our research on TinyOS applications indicate that our approach can safely and accurately estimate worst-case lifetime of the WSN. To the best of our knowledge, our work is the first one to estimate the worst-case lifetime of WSNs through a static analysis method.

Routing Protocol for Wireless Sensor Networks Based on Virtual Force Disturbing Mobile Sink Node

  • Yao, Yindi;Xie, Dangyuan;Wang, Chen;Li, Ying;Li, Yangli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1187-1208
    • /
    • 2022
  • One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

Clustering Algorithm to Equalize the Energy Consumption of Neighboring Node on Sink in Wireless Sensor Networks (무선 센서 네트워크에서 싱크노드와 인접한 노드의 균등한 에너지 소모를 위한 클러스터링 알고리즘)

  • Jung, Jin-Wook;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.6
    • /
    • pp.1107-1112
    • /
    • 2008
  • Clustering techniques, which are algorithm to increase the network lifetime in wireless sensor networks, is developed to minimize the energy consumption of nodes. Existing clustering techniques by to increase the network lifetime with equalizing each node's the energy consumption by rotating the role of CH(Cluster Head), but these algorithms did not present the solution that minimizes the energy consumption of neighboring nodes with sink. In this paper, we propose the clustering algorithm that prolongs the network lifetime by not including a part of nodes in POS(Personal Operating Space) of the sink in a cluster and communicating with sink directly to reduce the energy consumption of CH closed to sink.

Energy-balance node-selection algorithm for heterogeneous wireless sensor networks

  • Khan, Imran;Singh, Dhananjay
    • ETRI Journal
    • /
    • v.40 no.5
    • /
    • pp.604-612
    • /
    • 2018
  • To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.