Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Dynamic Node Scheduling for Elimination Overlapping Sensing in Sensor Networks with Dense Distribution
verfasst von : Kyungjun Kim, Jaemin Son, Hoseung Lee, Kijun Han, Wonyeul Lee
Erschienen in: Advanced Web and Network Technologies, and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.