This chapter presents a number of different aspects related to a particular kind of large and complex networks: A Wireless Sensor Network (WSN) consists of a large number of nodes that individually have limited computing power and information; their interaction is strictly local, but their task is to build global structures and pursue global objectives. Dealing with WSNs requires a mixture of theory and practice, i.e., a combination of algorithmic foundations with simulations and experiments that has been the subject of our project SwarmNet. In the first part, we describe a number of fundamental algorithmic issues: boundary recognition without node coordinates, clustering, routing, and energy-constrained flows. The second part deals with the simulation of large-scale WSNs; we describe the most important challenges and how they can be tackled with our network simulator Shawn. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Kröller, A., Pfisterer, D., Fekete, S. P., & Fischer, S. (2009). Algorithms and simulation methods for topology-aware sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5515 LNCS, pp. 380–400). https://doi.org/10.1007/978-3-642-02094-0_18
Mendeley helps you to discover research relevant for your work.