Algorithmic Problems in Ad Hoc Networks

  • Christos H. Papadimitriou
Conference paper

DOI: 10.1007/11502593_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3560)
Cite this paper as:
Papadimitriou C.H. (2005) Algorithmic Problems in Ad Hoc Networks. In: Prasanna V.K., Iyengar S.S., Spirakis P.G., Welsh M. (eds) Distributed Computing in Sensor Systems. DCOSS 2005. Lecture Notes in Computer Science, vol 3560. Springer, Berlin, Heidelberg

Abstract

The ad hoc networks research agenda aligns well with the methodology and point of view of theoretical computer science, for a variety of reasons: The resource frugality that permeates the theory of algorithms and copmplexity is a perfect match for the regime of resource scarcity that is prevalent in ad hoc networks, imposed by small, power-limited processors. The potentially large scale makes principled approaches more attractive, and necessitates analysis – occasionally even asymptotic analysis. Also, the interplay of geometry, graph theory, and randomness that is a characteristic of problems arising in ad hoc networks creates many challenging problems amenable to mathematical treatment. And the field’s young age and lack of established paradigms further foment and reward theoretical exploration. This talk will review recent work by the author and collaborators on geographic routing and clock synchronization.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Christos H. Papadimitriou
    • 1
  1. 1.UC Berkeley 

Personalised recommendations