Abstract—Mathematical models play a pivotal role in understanding and designing advanced low-power wireless systems. However, the distributed and uncoordinated operation of traditional multi-hop low-power wireless protocols greatly complicates their accurate modeling. This is mainly because

I first thank my thesis advisors Thiemo Voigt and Adam Dunkels for being my excellent advisors, and also for being the great colleagues you still are. Thiemo and Adam have complemented each other superbly, giving me feedback, perspectives, insights, and having made every single new venture truly

This Dissertation is brought to you for free and open access by Washington University Open Scholarship. It has been accepted for inclusion in All Theses and Dissertations (ETDs) by an authorized administrator of Washington University Open Scholarship. For more information, please contact

This Open Access Dissertation is brought to you for free and open access by the Dissertations and Theses at ScholarWorks@UMass Amherst. It has

Building a more sustainable sensor network via protocol innovation

Traditionally, link quality estimation (LQE) has been viewed as an a priori step in sensor network routing protocols because it filters out unreliable links before data transmission. Recent results, however, show that protocols can perform well without a priori LQE. Because getting rid of LQE seems

degrading the primary systems. Yet in practice, monitoring the spectrum resources, detecting available resources for opportunistic communication, and transmit-ting over the resources are hard tasks. This thesis addresses the tasks of monitoring, de-

Despite being a core networking primitive, collection protocols today often suffer from poor reliability (e.g., 70%) in practice, and heavily used protocols have never been evaluated in terms of communication efficiency. Using detailed experimental studies, we describe three challenges that cause

of messages. Unfortunately, in most real-world settings, public key infrastructures (PKI) are uncommon and distributing a secret in a public space is difficult. Thus, it is a challenge to exchange authentic public keys in a scalable, secure, and easy to use fashion. In this paper, we propose GAnGS, a protocol

I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present the work on various conferences, for which I thank him. I would also like to thank Prof. Dr. Roger Wattenhofer, responsible for the Koreferat of this work. Also, Prof. Dr. Oscar Nierstrasz who was willing to be the co-examinator of this work deserves many thanks. Many thanks go to my colleagues of the RVS group and of the IAM for our various interesting discussions about all kinds of topics and for making the institute a very pleasant and friendly place to work at. Special thanks go to David Steiner, Marc Steinemann, Matthias Scheidegger, Florian Baumgartner, Ruy De Oliveira, and Attila Weyland. There are many students who worked with me and helped a lot in developing and implementing. Among them I especially thankful to Thomas Bernoulli,