• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Maté: A Tiny Virtual Machine for Sensor Networks (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cs.uiuc.edu]
  • [www.cs.uiuc.edu]
  • [www.gissen.nl]
  • [www.cs.berkeley.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.ubc.ca]
  • [www.cs.ubc.ca]
  • [csl.stanford.edu]
  • [www.cs.berkeley.edu]
  • [now.cs.berkeley.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.berkeley.edu]
  • [www-csag.ucsd.edu]
  • [nest.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [people.cs.ubc.ca]
  • [www.cs.cornell.edu]
  • [webs.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [www.lisha.ufsc.br]
  • [www.diku.dk]
  • [www.ece.rutgers.edu]
  • [ssrnet.snu.ac.kr]
  • [people.cs.ubc.ca]
  • [www.eecs.harvard.edu]
  • [www.eecs.harvard.edu]
  • [www.eecs.berkeley.edu]
  • [www.eecs.berkeley.edu]
  • [people.cs.ubc.ca]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Philip Levis , David Culler
Citations:506 - 21 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Levis02maté:a,
    author = {Philip Levis and David Culler},
    title = { Maté: A Tiny Virtual Machine for Sensor Networks},
    year = {2002}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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 repopu-late. 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 in-terface 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 deploy-ment of ad-hoc routing and data aggregation algorithms. Maté's concise, high-level program representation simplifies programming and allows large networks to be frequently re-programmed in an energy-efficient manner; in addition, its safe execution environment suggests a use of virtual ma-chines to provide the user/kernel boundary on motes that have no hardware protection mechanisms.

Keyphrases

sensor network    tiny virtual machine    large network    precious resource    large number    user kernel boundary    hardware protection mechanism    ad-hoc routing    reception capsule    high-level program representation simplifies    significant energy cost    failing node    tiny device    energy cost    energy-efficient manner    small capsule    present mat    data aggregation algorithm    tiny communication-centric virtual machine    safe execution environment    packet sending    high-level in-terface allows complex program    feasible method    novel system problem    virtual ma-chines    limited resource    new program   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University