2005 | OriginalPaper | Buchkapitel
Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks
verfasst von : Sotiris Nikoletseas, Paul Spirakis
Erschienen in: Global Computing
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
Wireless sensor networks are comprised of a vast number of ultra-small, fully autonomous computing, communication and sensing devices, with very restricted energy and computing capabilities, that co-operate to accomplish a large sensing task. The efficient and robust realization of such large, highly-dynamic and complex networking environments is a challenging algorithmic and technological task.
In this work we present and discuss two protocols for efficient and robust data propagation in wireless sensor networks: LTP (a “local target” optimization protocol) and PFR (a multi-path probabilistic forwarding protocol). Furthermore, we present the NanoPeers architecture paradigm, a peer-to-peer network of lightweight devices, lacking all or most of the capabilities of their computer-world counterparts. We identify the problems arising when applying current routing and searching methods to this nano-world, and present some initial solutions, using a case study of a sensor network instance; Smart Dust.