RGWSN: Presenting a genetic-based routing algorithm to reduce energy consumption in wireless sensor network

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

This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications.. The

We broadly classify these security schemes for sensor networks into static and dynamic keying based on whether the administrative keys (those used to establish communication

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

This phase discusses about the Conjugative sleep scheduling scheme in order to efficiently compute routing for the localized energy levels in wireless sensor networks.

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)

In this paper, we focus on building one aspect of service quality based routing model as delay called MRHD which can route packets towards the destination

The proposed work aims at discovering an efficient energy aware routing scheme in MANETs that not only uses the node energy effectively but also finds the best route