Efficient information propagation algorithms in smart dust and nanopeer networks

Authors:
Sotiris Nikoletseas;Paul Spirakis
Affiliations:
Department of Computer Engineering and Informatics, University of Patras and Computer Technology Institute (CTI), Greece;Department of Computer Engineering and Informatics, University of Patras and Computer Technology Institute (CTI), Greece
Venue:
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Year:
2004

Citing 10
Cited 0

Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Smart dust protocols for local detection and propagation

Proceedings of the second ACM international workshop on Principles of mobile computing
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Experiences Deploying a Large-Scale Emergent Network

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Distributed communication algorithms for ad hoc mobile networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
NanoPeer Networks and P2P Worlds

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Protocols for data propagation in wireless sensor networks

Wireless communications systems and networks
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.