A Novel Energy Efficient Mechanism for Secured Routing of Wireless Sensor Network
Texto
Documentos relacionados
As seen from the simulation results in LEACH R, transmissions to the base station (high energy), takes place only from the R nodes which are selected from
In Sugeno- Mamdani approach, which is less computation intensive, a combined Mamdani and Sugeno fuzzy system is used to determine the edge weight of anchor node and
The network life time of MIN-RC is broken down into a number of rounds, and each round starts with the setup phase, where each node sends its Id, location and current level of
Each sensor collects data from the monitored area (such as temperature, sound, vibration, pressure, motion or pollutants) and then it routes data back to the base
In this paper, we have proposed a new technique to distribute the role of cluster head among some of the wireless sensor nodes based on their residual
Then the routing paths are selected by connecting all the cluster head nodes using the minimum spanning tree with degree constraint that minimizes the energy consumption for
Considering a wireless sensor network where the nodes have limited energy, we propose a novel model Energy ∗ Delay based on Ant Colony Optimization (ACO) algorithm (E&D ANTS)
Low Energy Adaptive Clustering Hierarchy (LEACH) is the first energy efficient routing protocol for hierarchical clustering. It reduces the energy significantly [10]. The