Unfortunately, given the restrictions imposed by the COVID-19 pandemic, the Organizing Committee and the Technical Programa Chairs of ALGO 2021 were forced to run the meetings fully online, using a specialised platform. Instructions for authors and attendees on how to participate in the virtual meeting will be provided shortly..

Scope

ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots. The focus is on the design and analysis of algorithms, models of computation, and experimental analysis.
ALGOSENSORS 2021 will be held on 9-10 September 2021 in Lisbon, Portugal. It will be part of ALGO 2021, which also hosts ALGOCLOUD, ATMOS, ESA, IPEC and WAOA.

Important Dates

  • Full Paper Submission(extended): 5 July 2021 (AoE)
  • Notification to authors: 2 August 2021
  • Camera-ready submission: 23 August 2021
  • Conference dates: 9-10 September 2021, in Lisbon, Portugal

Call for Papers

Original research contributions are solicited related to diverse algorithmic aspects of sensor networks, wireless networks as well as distributed robotics, including the theoretical, experimental and application perspectives.

Topics

Topics of interest include, but are not limited to:

  • Ad Hoc Networks
  • Algorithms
  • Autonomous Mobile Robots
  • Communication Protocols
  • Complexity and Computability
  • Computational Models
  • Cryptography, Security and Trust
  • Cyber Physical Systems
  • Data Aggregation and Fusion
  • Deployment
  • Dynamic Networks, Temporal Graphs
  • Energy Management
  • Experimental Analysis
  • Fault Tolerance and Dependability
  • Game Theoretic Aspects
  • Infrastructure Discovery
  • Internet of Things
  • Localization
  • Medium Access Control
  • Mobility and Dynamics
  • Obstacle Avoidance
  • Pattern Formation
  • Performance Evaluation
  • Population Protocols
  • Power Saving Schemes
  • Resource Efficiency
  • RFID Algorithms
  • Routing and Data Propagation
  • Self-stabilization, Self-* Properties
  • Sensor Networks
  • Swarm Computing
  • Systems and Testbeds
  • Time Synchronization
  • Topology Control
  • Tracking
  • Virtual Infrastructures
  • Wireless Networks

COMMITTEES

Chairs

Steering Committee

PROGRAM COMMITTEE

Proceedings

The conference proceedings will be published in the Springer "Lecture Notes in Computer Science" series (publication expected October 2021).

SPECIAL ISSUE

Selected papers will be invited to a special issue of the journal "Theoretical Computer Science", devoted to ALGOSENSORS 2021.

AWARDS

Awards will be given to the best paper and the best student paper. To be eligible for the best student paper award, at least one of the paper authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper. The program committee may decline to make these awards or may split them.

Paper Submission

Papers are to be submitted electronically using the EasyChair server at https://easychair.org/conferences/?conf=algosensors2021. The submissions must contain original results that have not already been published and are not concurrently submitted to a journal or conference with published proceedings. By submitting a paper, the authors acknowledge that in case of acceptance at least one of the authors will register for ALGO/ALGOSENSORS 2021 and present the paper.

Submissions must be in the form of a single pdf file prepared using the LNCS latex templates and style files (available, together with Springer's authors' guidelines, from https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines). Springer's proceedings LaTeX templates are also available on Overleaf (https://www.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj#.WsdHOy5uZpg).

Each submission should consist of the main part of the paper, not exceeding 12 pages (including the title page and excluding the references), plus an optional clearly marked appendix (to be read at the discretion of the program committee). Any figure pertaining to the main part of the paper should be included therein (within the 12 page limit). The first page must include an indication of whether the paper is eligible for the best student paper award.

Accepted papers

          Louis Esperet, Sébastien Julliot and Arnaud de Mesmay.
          Distributed coloring and the local structure of unit-disk graphs

          Konstantinos Georgiou, Sean Leizerovich, Jesse Lucier and Somnath Kundu.
          Evacuating from ell-p Unit Disks in the Wireless Model

          Assaf Rabinowitz and Dror Rawitz.
          Overflow Management with Self-Eliminations

          [best paper + best student paper]
          Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann and Friedhelm Meyer Auf der Heide.
          Gathering a Euclidean Closed Chain of Robots in Linear Time

          Abdullah Almethen, Othon Michail and Igor Potapov.
          Distributed Transformations of Hamiltonian Shapes based on Line Moves

          Quentin Bramas, Anissa Lamani and Sebastien Tixeuil.
          Stand Up Indulgent Gathering

          Thorsten Götte, Christina Kolb, Christian Scheideler and Julian Werthmann.
          Beep And Sleep: Message and Energy Efficient SetCover

          Matthew Connor, Othon Michail and Igor Potapov.
          Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach

          Mikhail Raskin.
          Population protocols with unreliable communication

          Nikos Leonardos, Aris Pagourtzis and Ioannis Papaioannou.
          Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation

Invited Speaker

Bernhard Haeupler

CMU, USA & ETHZ, Switzerland

Bernhard's research interests lie in algorithm design, distributed computing, and (network) coding theory. Recent results include hop-constrained optimization and oblivious routing, beyond-worst case algorithms for distributed optimization, and coding for insertions/deletions and interactive communications. His research was published in over 100 papers at top conferences and journals and won several awards including the ACM-EATCS Doctoral Dissertation Award of Distributed Computing, a George Sprowls Dissertation Award at MIT, and various best (student) paper awards. His research has been funded by multiple prestigious awards including an NSF Career Award, a Sloan Research Fellowship, and an ERC award.