ACM Home Page
Please provide us with feedback. Feedback
Maté: a tiny virtual machine for sensor networks
Full text PdfPdf (1.22 MB)
Source Architectural Support for Programming Languages and Operating Systems archive
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems table of contents
San Jose, California
SESSION: Emerging systems table of contents
Pages: 85 - 95  
Year of Publication: 2002
ISBN:1-58113-574-2
Also published in ...
Authors
Philip Levis  University of California, Berkeley, California and Intel Corporation, Berkeley, California
David Culler  University of California, Berkeley, California and Intel Corporation, Berkeley, California
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGOPS: ACM Special Interest Group on Operating Systems
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 32,   Downloads (12 Months): 204,   Citation Count: 98
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/605397.605407
What is a DOI?

ABSTRACT

Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopulate. Often there is no feasible method to recharge motes, so energy is a precious resource. Once deployed, a network must be reprogrammable although physically unreachable, and this reprogramming can be a significant energy cost.We present Maté, a tiny communication-centric virtual machine designed for sensor networks. Maté's high-level interface allows complex programs to be very short (under 100 bytes), reducing the energy cost of transmitting new programs. Code is broken up into small capsules of 24 instructions, which can self-replicate through the network. Packet sending and reception capsules enable the deployment of ad-hoc routing and data aggregation algorithms. Maté's concise, high-level program representation simplifies programming and allows large networks to be frequently reprogrammed in an energy-efficient manner; in addition, its safe execution environment suggests a use of virtual machines to provide the user/kernel boundary on motes that have no hardware protection mechanisms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Smart buildings admit their faults. Lab Notes: Research from the College of Engineering, UC Berkeley. http://cos.berkeley.edu/labnotes/1101.smartbuildings.html, 2001.
 
2
Small Times: Big News in Small Tech. http://www.smalltimes.com
3
4
5
6
7
8
9
 
10
Jason Hill and David Culler. A wireless embedded sensor architecture for system-level optimization. Intel Research IRB-TR-02-00N, 2002.
11
 
12
Victor Hsu, Joseph M. Kahn, and Kristofer Pister. Wireless Communications for Smart Dust. Electronics Research Laboratory Technical Memorandum Number M98/2, 1998.
 
13
Chalermek Intanagonwiwat, Deborah Estrin, Ramesh Govindan, and John Heidemann. Impact of Network Density on Data Aggregation in Wireless Sensor Networks. Technical Report 01-750, University of Southern California Computer Science Department, 2001.
14
 
15
Java 2 Platform Micro Edition (J2ME) Technology for Creating Mobile Devices White Paper. http://java.sun.com/j2me/docs/
 
16
Java Card Technology. http://java.sun.com/products/javacard/
17
18
 
19
Philip J. Koopman, Jr. Modern Stack Computer Architecture. In System Design and Network Architecture Conference, 1990.
 
20
 
21
Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong. TAG: A Tiny AGgregation Service for Ad-Hoc Sensor Networks. In submission.
22
 
23
Alan Mainwaring, private communication, 2002.
 
24
Dejan S. Milojicic, Fred Douglas, Yves Paindaveine, Richard Wheeler, and Songnian Zhou. Process Migration. In ACM Computing Surveys, Volume 32, Issue 3, September 2000.
 
25
Charles H. Moore and Geoffrey C. Leach. FORTH - A Language for Interactive Computing. 1970.
26
27
 
28
Charles E. Perkins, Elizabeth M. Belding-Royer, and Samir Das. Ad Hoc On Demand Distance Vector (AODV) Routing. IETF Internet draft, draft-ietf-manet-aodv-09.txt, November 2001 (Work in Progress).
29
 
30
 
31
Robert Szewczyk, private communcation, 2002.
32
33
 
34
David J. Wetherall, John V. Guttag and David L. Tennenhouse. ANTS: A Toolkit for Building and Dynamically Deploying Network Protocols. IEEE OPENARCH '98, 1998.
 
35
Alexander L. Wolf, Dennis Heimbigner, John Knight, Premkumar Devanbu, Michael Gertz, and Antonio Carzaniga. Bend, Don't Break: Using Reconfiguration to Achieve Survivability. Third Information Survivability Workshop, October 2000.

CITED BY  98
Collaborative Colleagues:
Philip Levis: colleagues
David Culler: colleagues