Daniela Tulone

CSAIL MIT

32 Vassar Street
Cambridge, MA 02139, USA

tulone AT csail DOT mit DOT edu

Hi!
after six enjoyable years spent in New York City, first at the Computer Science Department of New York University, then at AT&T Labs, and lastly at Bell-Labs as member of the Secure System Research Department, in 2002 I moved back to Italy... and to school as well! From 1/2003 to 12/2005 I was a Ph.D. student at the Computer Science Department at the University of Pisa and at CSAIL MIT, as a shared student. The title of my Ph.D. thesis is “Mechanisms for energy conservation in wireless sensor networks”. Currently I am working as a Post-Doc at CSAIL MIT.

My research interests focus mainly on the design of algorithms and fault-tolerant protocols for wired and wireless sensor networks. I am particularly interested in enhancing the efficiency and scalability of distributed protocols via trade-offs between data accuracy and efficiency, and using randomized and statistical techniques and quorum systems. I find fascinating the interaction between theory and applications, the desire of blending theory and practice drove me to Computer Science after my MS in Mathematics.  I also find fascinating the interaction among different research areas, and feel that having worked as a software engineer for a few years was a useful experience for me to get a grip with the real world, and to find out what I like best! :-)

In my Ph.D. thesis I addressed the problem of reducing energy consumption in wireless sensor networks, and proposed a suit of techniques and strategies to design energy-efficient protocols, which include time series forecasting, the redesign of quorum systems and their metrics, and the interaction between sensor properties and protocol design. I applied these techniques to solve problems such as time synchronization, data collection and diffusion, and the problem of ensuring strong data guarantees in highly mobile networks. Previous (but not remote) interests include the design of intrusion-tolerant protocols for very large distributed systems, randomized strategies, weaker data consistency models, and security. Other interests, but rather remote, are automated theorem proving and complexity.

Last revised May 2006.