Dynamic node scheduling for elimination overlapping sensing in sensor networks with dense distribution

One of the main challenges in wireless sensor networks is to maximize network life time and to minimize power consumption. We propose an energy efficient mechanism for selecting active node which involved in sensing operation in a given dense field. Unlike traditional approaches, this architecture can obtained the complete self-organization of nodes as well as the connectivity of the network. This mechanism can reduce the communication cost by decreasing the number of sensing nodes in highly dense area. Our results show that the dynamic scheduling mechanism of our proposed scheme allows them to outperform existing mechanisms over a variety of scenarios. Our simulation results show that our mechanism reduces the number of transmitted packets in dense sensing area.