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.
This work was partially supported by the IST Programme of the European Union under contact number IST-2005-15964 (AEOLUS) and the Programme PENED of GSRT under contact number 03ED568.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. In the Journal of Computer Networks 38, 393–422 (2002)
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Smart Dust Protocols for Local Detection and Propagation. Distinguished Paper. In: Proc. 2nd ACM Workshop on Principles of Mobile Computing – POMC 2002, Also, accepted in the ACM Mobile Networks (MONET) Journal, Special Issue on Algorithmic Solutions for Wireless, Mobile, Adhoc and Sensor Networks, February 2005, vol. 10(1), pp. 9–16 (2005)
Chatzigiannakis, I., Dimitriou, T., Nikoletseas, S., Spirakis, P.: A Probabilistic Algorithm for Efficient and Robust Data Propagation in Smart Dust Networks. In: Proceedings of the 5th European Wireless Conference on Mobile and Wireless Systems beyond 3G (EW 2004), Also, in the Journal of Ad-Hoc Networks (2004) (2005)
Chatzigiannakis, I., Dimitriou, T., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks. In: Proc. International Conference on Parallel and Distributed Computing – EUPOPAR 2003. Also in the Parallel Processing Letters (PPL) Journal (2004)
Diaz, J., Penrose, M., Petit, J., Serna, M.: Approximation Layout Problems on Random Geometric Graphs. J. of Algorithms 39, 78–116 (2001)
Diaz, J., Petit, J., Serna, M.: A Random Graph Model for Optical Networks of Sensors. J. of IEEE Transactions on Mobile Computing 2(3) (2003)
Euthimiou, H., Nikoletseas, S., Rolim, J.: Energy Balanced Data Propagation in Wireless Sensor Networks. In: Proc. 4th International Workshop on Algorithms for Wireless, Mobile, Ad-Hoc and Sensor Networks (WMAN 2004), IPDPS 2004, Also, in the Journal of Wireless Networks (WINET) (2004) (2005)
Gilbert, E.N.: Random Plane Networks. J. Soc. Ind. Appl. Math 9(4), 533–543 (1961)
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In: Proc. 33rd Hawaii International Conference on System Sciences – HICSS 2000 (2000)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. In: Proc. 6th ACM/IEEE International Conference on Mobile Computing – MOBICOM 2000 (2000)
Karoński, M., Scheinerman, E.R., Singer-Cohen, K.B.: On Random Intersection Graphs: The Subgraph Problem. Combinatorics, Probability and Computing journal 8, 131–159 (1999)
Leone, P., Rolim, J.: Towards a Dynamical Model for Wireless Sensor Networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol. 4240, Springer, Heidelberg (2006)
Leone, P., Nikoletseas, S., Rolim, J.: An Adaptive Blind Algorithm for Energy Balanced Data Propagation. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, Springer, Heidelberg (2005)
Mehlhorn, K., Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Nikoletseas, S., Raptopoulos, C., Spirakis, P.: The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, Springer, Heidelberg (2004)
Papadimitriou, C.: Algorithmic Problems in Ad Hoc Networks. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, Springer, Heidelberg (2005)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Sanwalani, V., Serna, M., Spirakis, P.: Chromatic Number of Random Scaled Sector Graphs. In the Theoretical Computer Science (TCS) Journal (to appear, 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikoletseas, S. (2006). Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_1
Download citation
DOI: https://doi.org/10.1007/11764298_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34597-8
Online ISBN: 978-3-540-34598-5
eBook Packages: Computer ScienceComputer Science (R0)