• Title/Summary/Keyword: Node energy

Search Result 1,272, Processing Time 0.03 seconds

Efficient routing in multicast mesh by using forwarding nodes and weighted cost function

  • Vyas, Kapila;Khuteta, Ajay;Chaturvedi, Amit
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5928-5947
    • /
    • 2019
  • Multicast Mesh based Mobile Ad-hoc NETworks (MANETs) provide efficient data transmission in energy restraint areas without a fixed infrastructure. In this paper, the authors present an improved version of protocol SLIMMER developed by them earlier, and name it SLIMMER-SN. Most mesh-based protocols suffer from redundancy; however, the proposed protocol controls redundancy through the concept of forwarding nodes. The proposed protocol uses remaining energy of a node to decide its energy efficiency. For measuring stability, a new metric called Stability of Node (SN) has been introduced which depends on transmission range, node density and node velocity. For data transfer, a weighted cost function selects the most energy efficient nodes / most stable nodes or a weighted combination of both. This makes the node selection criteria more dynamic. The protocol works in two steps: (1) calculating SN and (2) using SN value in the weighted cost function for selection of nodes. The study compared the proposed protocol, with other mesh-based protocols PUMA and SLIMMER, based on packet delivery ratio (PDR), throughput, end-to-end delay and average energy consumption under different simulation conditions. Results clearly demonstrate that SLIMMER-SN outperformed both PUMA and SLIMMER.

Research on the Energy Hole Problem Based on Non-uniform Node Distribution for Wireless Sensor Networks

  • Liu, Tang;Peng, Jian;Wang, Xiao-Fen;Yang, Jin;Guo, Bing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2017-2036
    • /
    • 2012
  • Based on the current solutions to the problem of energy hole, this paper proposed a nonuniform node distribution clustering algorithm, NNDC. Firstly, we divide the network into rings, and then have an analysis and calculation on nodes' energy consumption in each ring of the network when clustering algorithm is applied to collect data. We also put forward a scheme of nonuniform node distribution on the basis of the proportion of nodes' energy consumption in each ring, and change nodes' active/hibernating states under density control mechanism when network coverage is guaranteed. Simulation shows NNDC algorithm can satisfyingly balance nodes' energy consumption and effectively avoid the problem of energy hole.

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.278-280
    • /
    • 2012
  • We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

  • PDF

A study on energy harvesting time of Solar Cell battery for Sensor node (센서 노드 배터리 충전을 위한 Solar Cell의 완충시간에 대한 연구)

  • Choi, Young-Suk;Ryu, Jeong-Tak;Kim, Kyung-Ki;Kim, H.C.
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.1
    • /
    • pp.31-36
    • /
    • 2011
  • Ubiquitous network and wireless sensor networks is being applied in various fields. Located at target areas, node of wireless sensor network uses batteries as a power source. Batteries have a limited energy in sensor network applications. Also, before use, the battery must be charged and It is difficult to replace the battery. Therefore, energy harvesting technology is being researched and being developed for long life of sensor node. Especially, sola energy is being extensively researched. because that can have great amounts of energy than other environmental energy in a short time. In this study, we tested battery charging and recharging, operation of sensor node using Solar Cell. Also, monitoring data gathering and voltage Analysis showed energy harvesting time of Sola Cell battery for sensor node and operation of sensor node.

Wireless Sensor Node Energy-harvesting Simulator Using Java Threads (Java Thread를 이용한 무선 센서 노드 에너지 수확 시뮬레이터)

  • Encarnacion, Nico N.;Yang, Hyunho
    • Journal of Internet Computing and Services
    • /
    • v.14 no.2
    • /
    • pp.53-59
    • /
    • 2013
  • Harvesting energy from the environment is essential for many applications to slow down the deterioration of energy in sensor networks. Energy from the environment is an inexhaustible supply which, if properly managed and harvested from the sources, can allow the system to last for a longer period. Many simulators simulate whole sensor networks where the nodes rely on energy harvesting for their source of power. It is important to be able to assume and simulate a node that can harvest energy from different sources of ambient energy. It is also essential to be able to keep track of the energy levels of the node and adjust node activities based on its energy status. This study aims to develop a prototype for a single node simulator that will show the effects of harvesting from different sources of energy. The results of this study can later be extended for more complicated simulations.

Task Scheduling Technique for Energy Efficiency in Wireless Sensor Networks (무선 센서 네트워크 환경에서의 에너지 효율성을 고려한 태스크 스케줄링 기법)

  • Lee Jin-Ho;Choi Hoon;Baek Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.884-891
    • /
    • 2006
  • A wireless sensor node is typically battery operated and energy constrained. Therefore it is critical to design efficient power management technique and scheduling technique. In this paper, we propose an OS-level power management technique for energy saving of wireless sensor node, it is called EA-SENTAS (Energy-Aware Sensor Node TAsk Scheduling). It can decrease the energy consumption of a wireless sensor node to use task scheduling technique that shut down components or use low power mode of each component when not needed. Simulation results show that EA-SENTAS saves energy up to 56 percent to compare with conventional duty cycle.

Efficient Mobile Sink Location Management Scheme Using Multi-Ring in Solar-Powered Wireless Sensor Networks

  • Kim, Hyeok;Kang, Minjae;Yoon, Ikjune;Noh, Dong Kun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.10
    • /
    • pp.55-62
    • /
    • 2017
  • In this paper, we proposes a multi-ring based mobile sink location scheme for solar-powered wireless sensor network (WSN). The proposed scheme maintains the multi-rings in which nodes keep the current location of sink node. With the help of nodes in multi-rings, each node can locate the sink node efficiently with low-overhead. Moreover, because our scheme utilizes only surplus energy of a node, it can maintain multiple rings without degrading any performance of each node. Experimental results show that the proposed scheme shows much better latency and scalability with lower energy-consumption than the existing single-ring based scheme.

Simulation of ULP Self-Sustaining Sensor Node System (ULP 자기유지 센서노드 시스템의 시뮬레이션)

  • Kim, Yun-Ho;Seong, Yeong-Rak;Oh, Ha-Ryoung;Park, Jun-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1435-1443
    • /
    • 2009
  • In this paper, an energy harvesting sensor network system is modeled and simulated by using the DEVS (Discrete Event System Specification) formalism. The system is composed of a sink (master) node, which is battery or mains powered, and a set of sensor (slave) nodes, each of which harvests ambient energy and converts it into electrical energy. For simulation, (i) the behavior of energy harvesting and storing circuits of the slave node is partitioned into a set of piecewise continuous segments and then each segment is represented as a discrete state; (ii) the interaction among the master node and components of the slave node is investigated preciously; and (iii) the investigated result is modeled and simulated by using the DEVS formalism.

Importance Assessment of Multiple Microgrids Network Based on Modified PageRank Algorithm

  • Yeonwoo LEE
    • Korean Journal of Artificial Intelligence
    • /
    • v.11 no.2
    • /
    • pp.1-6
    • /
    • 2023
  • This paper presents a comprehensive scheme for assessing the importance of multiple microgrids (MGs) network that includes distributed energy resources (DERs), renewable energy systems (RESs), and energy storage system (ESS) facilities. Due to the uncertainty of severe weather, large-scale cascading failures are inevitable in energy networks. making the assessment of the structural vulnerability of the energy network an attractive research theme. This attention has led to the identification of the importance of measuring energy nodes. In multiple MG networks, the energy nodes are regarded as one MG. This paper presents a modified PageRank algorithm to assess the importance of MGs that include multiple DERs and ESS. With the importance rank order list of the multiple MG networks, the core MG (or node) of power production and consumption can be identified. Identifying such an MG is useful in preventing cascading failures by distributing the concentration on the core node, while increasing the effective link connection of the energy flow and energy trade. This scheme can be applied to identify the most profitable MG in the energy trade market so that the deployment operation of the MG connection can be decided to increase the effectiveness of energy usages. By identifying the important MG nodes in the network, it can help improve the resilience and robustness of the power grid system against large-scale cascading failures and other unexpected events. The proposed algorithm can point out which MG node is important in the MGs power grid network and thus, it could prevent the cascading failure by distributing the important MG node's role to other MG nodes.

Design of Stochastic Movement Model Considering Sensor Node Reliability and Energy Efficiency

  • Cho, Do-Hyeoun;Yeol, Yun Dai;Hwang, Chi-Gon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.156-162
    • /
    • 2020
  • Wireless Sensor Network (WSN) field is mainly studied to monitor and characterize large-scale physical environments to track various environmental or physical conditions, such as temperature, pressure, wind speed and humidity. WSN can be used in various applications such as wild surveillance, military target tracking and monitoring, dangerous environmental exploration and natural disaster relief. We design probabilistic mobile models that apply to mobile ad hoc network mobile environments. A probabilistic shift model proposed by dividing the number of moving nodes and the distance of travel into two categories to express node movement characteristics. The proposed model of movement through simulation was compared with the existing random movement model, ensuring that the width and variation rate of the first node node node node (FND) was stable regardless of the node movement rate. In addition, when the proposed mobile model is applied to the routing protocol, the superiority of network life can be verified from measured FND values. We overcame the limitations of the existing random movement model, showing excellent characteristics in terms of energy efficiency and stable in terms of changes in node movement.