We present our experience with Twinkle, the first implementation of network-layer power scheduling with real applications. Twinkle uses dynamically created schedules to schedule network flows in sensor networks. The scheduling allows nodes to turn off their radio when idle, thus saving power. Twinkle supports broadcast and partial flows for flexibility, and integrates time synchronization to enable scheduling to work on real motes. We show that it avoids contention, increases fairness, and that it can achieve power savings of 2-5x for real applications over existing power-management schemes, and over 150x compared with no power management. Finally, we discuss the extensions to the original algorithm needed for real applications.
Title
Twinkle: Network Power Scheduling in Sensor Networks
Published
2005-04-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-05-1409
Type
Text
Extent
14 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
