Welcome to Department of Mathematics

Mail Us

Call Us

Algorithms for Wireless Ad Hoc and Sensor Networks

Code: MA616 | L-T-P-C: 3-0-0-6

Prerequisites: MA252 / MA512 Data Structures and Algorithms or equivalent

Preamble: Thousands of tiny wireless device, equipped with se nsors, are deployed in some area of interest. After activation the sensors form a self-organized network and provide data. Current research is mainly focused on networ ks that are completely unstructured, but are nevertheless able to communicate, despite the low coverage of their antennas. Such systems are called sensor, adhoc, or mesh networks, depending on the point of view and the application. For a few years now, these networks have been the focus of the research of the networking community. The goal of the course is to elaborate the relevant aspects of the field, from theory to practice.

Syllabus: Introduction and overview of Wireless Sensor Networks, Modeling Sensor and Ad Hoc Networks, Media Access Control, Topology Control, Local Infrastructure: local consensus, local leader election, local reliable broadcast; Clock Synchronization, Localization and Positioning, Coverage, Mobility; Routing : topology-based and position-based, Global Infrastructure: spanning trees, clusters, maximal independent sets, Applications: Data aggregation and maintenance, query-processing, environmental sensing, tracking objects.


  1. D. Wagner and R. Wattenhofer, Algorithms for Sensor and Ad Hoc Networks, Springer, 2007.
  2. I. Stojmenovic, Handbook of Sensor Networks: Algorithms and Architectures, Wiley, 2005.
  3. F. Zhao and L. Guibas, Wireless Sensor Networks: An Information Processing Approach, Elsevier, 2005.
  4. K. Sohraby, D. Minoli and T. Znati, Wireless Sensor Networks: Technology, Protocols, and Applications, Wiley, 2010.
  5. J. Schiller, Mobile Communications, 2nd Edn., Pearson, 2006