Evaluation of Basic Protocols for Optical Smart Dust Networks
In this paper we analyze empirically the performance of several protocols for a random model of sensor networks that communicate through optical links. We provide experimental evidence of the basic parameters and of the performance of the distributed protocols described and analyzed under assymptotic assumptions in  for relatively small random networks (1000 to 15000 sensors).
KeywordsSensor Network Operative Mote Random Model Localization Phase Basic Protocol
Unable to display preview. Download preview PDF.
- I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Smart dust local detection and propagation protocols. In ACM Workshop on Principles of Mobile Computing, Toulouse, 2002.Google Scholar
- J. Díaz, J. Petit, and M. Serna. A random graph model for optical networks of sensors. Technical report, LSI-02-72-R, Universitat Politecnica Catalunya, 2002.Google Scholar
- D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. In ACM/IEEE Int. Conf. on Mobile Computing and Networking, pages 263–270, Seattle, 1999.Google Scholar
- J. Kahn, Katz, R. H., and K. Pister. Mobile networking for smart dust. In ACM/IEEE Int. Conf. on Mobile Computing and Networking, pages 176–189, Seattle, 1999.Google Scholar
- Smart dust project. http://www.robotics.eecs.berkeley.edu/~pister/SmartDust.
- S. N. Simic and S. Sastry. Distributed localization in wireless ad hoc networks. Technical report, Dept. Electrical Engineering and Computer Science, University of California at Berkeley, 2001.Google Scholar
- B. Warneke, B. Liebowitz, K. S. J. Pister, and E. Cayirci. Smart dust: communicating with a cubic-millimiter computer. IEEE Computer, January:2–9, 2001.Google Scholar