Review of selected algorithms in the method energy evening algorithm in wireless sensor network
- Resource Type
- Conference
- Authors
- Boniewicz, Miroslaw; Kozlowska, Anna; Zawadzka, Anna; Lukasiak, Zbigniew; Zielinski, Marek
- Source
- 2014 16th International Conference on Transparent Optical Networks (ICTON) Transparent Optical Networks (ICTON), 2014 16th International Conference on. :1-4 Jul, 2014
- Subject
- Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Engineered Materials, Dielectrics and Plasmas
Photonics and Electrooptics
Algorithm design and analysis
Wireless sensor networks
Energy consumption
Routing
Approximation algorithms
Software algorithms
Heuristic algorithms
wireless sensor network
balanced energy consumption
Dijkstra's algorithm
A∗ algorithm
Bellam-Ford algorithm
routing algorithm
- Language
- ISSN
- 2162-7339
2161-2064
In this paper compared the algorithms proposed in the method in wireless sensor network. Energy consumption is very important for self-powered radio nodes. But in some applications energy balancing is more important. Wireless sensor networks used in large areas like farmland or warehouses consist of hundreds of nodes. In classic method routing is directed to short time of transmission or low energy consumption. But unbalanced energy consumption can often cause unpredictable failures because of lack energy in frequently used nodes. Energy balancing prevents this behavior by dynamic bypassing the used nodes. The paper describes examples of algorithms that can be used in the method in wireless sensor network. The goal of this method is the prolongation of the network through a selection of routes data to minimize the scattering of energy in the nodes of the network.