Introduction to algorithms
Discrete-time battery models for system-level low-power design
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Smart Fabric, or "Wearable Clothing"
ISWC '97 Proceedings of the 1st IEEE International Symposium on Wearable Computers
Electric Suspenders: A Fabric Power Bus and Data Network for Wearable Digital Devices
ISWC '99 Proceedings of the 3rd IEEE International Symposium on Wearable Computers
Modeling, Analysis, and Self-Management of Electronic Textiles
IEEE Transactions on Computers
E-broidery: design and fabrication of textile-based computing
IBM Systems Journal
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 1st ACM SIGMOBILE international workshop on Systems and networking support for healthcare and assisted living environments
An efficient placement and routing technique for fault-tolerant distributed embedded computing
ACM Transactions on Embedded Computing Systems (TECS)
Parallel processing for block ciphers on a fault tolerant networked processor array
International Journal of High Performance Systems Architecture
| Hi-index | 0.00 |
As the scale of electronic devices shrinks, "electronic textiles" (e-textiles) will make possible a wide variety of novel applications which are currently unfeasible. Due to the wearability concerns, low-power techniques are critical for e-textile applications. In this paper, we address the issue of the energy-aware routing for e-textile platforms and propose an efficient algorithm to solve it. The platform we consider consists of dedicated components for e-textiles, including computational modules, dedicated transmission lines and thin-film batteries on fiber substrates. Furthermore, we derive an analytical upper bound for the achievable number of jobs completed over all possible routing strategies. From a practical standpoint, for the Advanced Encryption Standard (AES) cipher, the routing technique we propose achieves about fifty percent of this analytical upper bound. Moreover, compared to the non-energy-aware counterpart, our routing technique increases the number of encryption jobs completed by one order of magnitude.