Algorithms for wireless sensor networks: design, analysis and experimental evaluation

Authors:
Sotiris Nikoletseas
Affiliations:
Department of Computer Engineering and Informatics, University of Patras, and CTI, Greece
Venue:
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Year:
2006

Citing 11
Cited 1

LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
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
On Random Intersection Graphs: The Subgraph Problem

Combinatorics, Probability and Computing
Energy balanced data propagation in wireless sensor networks

Wireless Networks
Large independent sets in general random intersection graphs

Theoretical Computer Science
Algorithmic problems in ad hoc networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

Localization in time and space for wireless sensor networks: An efficient and lightweight algorithm

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficient and robust realization of wireless sensor networks is a challenging technological and algorithmic task, because of the unique characteristics and severe limitations of these devices. This talk presents representative algorithms for important problems in wireless sensor networks, such as data propagation and energy balance. The protocol design uses key algorithmic techniques like randomization and local optimization. Crucial performance properties of the protocols (correctness, fault-tolerance, scalability) and their trade-offs are investigated through both analytic means and large scale simulation. The experimental evaluation of algorithms for such networks is very beneficial, not only towards validating and fine-tuning algorithmic design and analysis, but also because of the ability to study the accurate impact of several important network parameters and technological details.