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
Approximating layout problems on random geometric graphs
Journal of Algorithms
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
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
A Random Graph Model for Optical Networks of Sensors
IEEE Transactions on Mobile Computing
NanoPeer Networks and P2P Worlds
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Energy balanced data propagation in wireless sensor networks
Wireless Networks
Algorithmic problems in ad hoc networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
A Model of an Amorphous Computer and Its Communication Protocol
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Computability in Amorphous Structures
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
Algorithmic Aspects of Wireless Sensor Networks
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An operational semantics for a calculus for wireless systems
Theoretical Computer Science
Hi-index | 0.00 |
Recent rapid developments in micro-electro-mechanical systems (MEMS), wireless communications and digital electronics have already led to the development of tiny, low-power, low-cost sensor devices. Such devices integrate sensing, limited data processing and restricted communication capabilities. Each sensor device individually might have small utility, however the effective distributed co-ordination of large numbers of such devices can lead to the efficient accomplishment of large sensing tasks. Large numbers of sensors can be deployed in areas of interest (such as inaccessible terrains or disaster places) and use self-organization and collaborative methods to form an ad-hoc network. We note however that the efficient and robust realization of such large, highly-dynamic, complex, non-conventional networking environments is a challenging technological and algorithmic task, because of the unique characteristics and severe limitations of these devices. This talk will present and discuss several important aspects of the design, deployment and operation of sensor networks. In particular, we provide a brief description of the technical specifications of state-of-the-art sensor, a discussion of possible models used to abstract such networks, a discussion of some key algorithmic design techniques (like randomization, adaptation and hybrid schemes), a presentation of representative protocols for sensor networks, for important problems including data propagation, collision avoidance and energy balance and an evaluation of crucial performance properties (correctness, efficiency, fault-tolerance) of these protocols, both with analytic and simulation means.