Abstract
This article presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. The driver application that we present is a medical jacket, which requires an extremely high level of robustness and fault tolerance. The power consumption of such jacket is another key technological constraint. Our proposed interconnection network is a mesh of wires. A jacket made of fabric and wires would be susceptible to accidental damage via tears. By modeling the tears, we evaluate the probability of having failures on every segment of wires in our mesh interconnection network. Then, we study two problems of placement and routing in the sensor networks such that the fault tolerance is maximized while the power consumption is minimized. We develop efficient integer linear programming (ILP) formulations to address these problems and perform both placement and routing, simultaneously. This ensures that the solution is a lower bound for both problems. We evaluate the effectiveness of our proposed techniques on a variety of benchmarks.
- Barrenechea, G., Beferull-Lozano, B., and Vetterli, M. 2004. Lattice sensor networks: Capacity limits, optimal routing and robustness to failures. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN'04). ACM, New York, 186--195. Google Scholar
Digital Library
- Bona, M. 1994. Textile Quality. Texilia, Manchester, UK.Google Scholar
- Burstein, M. and Pelavin, R. 1983. Hierarchical wire routing. IEEE Trans. Comput. Aid. Des. Integr. Circ. Syst. 2, 4, 223--234.Google Scholar
Digital Library
- Caldwell, A. E., Choi, H.-J., Kahng, A. B., Mantik, S., Potkonjak, M., Qu, G., and Wong, J. L. 1999. Effective iterative techniques for fingerprinting design ip. In Proceedings of the 36th ACM/IEEE Conference on Design Automation (DAC'99). ACM, New York, 843--848. Google Scholar
Digital Library
- Chan, T. F., Cong, J., Kong, T., and Shinnerl, J. R. 2000. Multi-level optimization for large-scale circuit placement. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'00). IEEE, Los Alamitos, 171--176. Google Scholar
Digital Library
- Dunlop, A. E. and Kernighan, B. W. 1985. A Procedure for Placement of Standard Cell VLSI Circuits. IEEE Trans. Comput.-Aid. Des. Integr. Circ. 4, 1, 92--98.Google Scholar
Digital Library
- Hall, K. 1970. An r-dimensional quadratic placement algorithm. Manage. Sci. 17, 3, 219--229.Google Scholar
- Kao, J.-C. and Marculescu, R. 2005. Energy-aware routing for e-textile applications. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'05). IEEE Computer Society, Washington, DC, 184--189. Google Scholar
Digital Library
- Karypis, G., Aggarwal, R., Kumar, V., and Shekhar, S. 1997. Multi-level hyper-graph partitioning: Application in vlsi domain. In Proceedings of the 34th Annual Conference on Design Automation (DAC'97). ACM, New York, 526--529. Google Scholar
Digital Library
- Kleinhans, J. M., Sigl, G., Johannes, F. M., and Antreich, K. J. 1991. Gordon: Vlsi Placement by quadratic programming and slicing optimization. IEEE Trans. Comput.-Aid. Des. Integr. Circ. 10, 3, 365.Google Scholar
Digital Library
- Lee, J. 1961. An algorithm for path connection and its application. IEEE Trans. Electron. Comput. EC-10, 3, 346--365.Google Scholar
Cross Ref
- Meoli, D. and May-Plumlee, T. 2002. Interactive electronic textile development: A review of technologies. J. Textile Apparel Tech. Manage. 2, 2, 1--12.Google Scholar
- N. Lek, R. T. and Kang, S. 1992. A new global router using zero-one integer linear programming techniques for sea-of-gates and custom logic arrays. IEEE Trans. Comput.-Aid Des. Integr. Circ. Syst. 11, 12, 1479--1494.Google Scholar
Digital Library
- Ni, L. M. and McKinley, P. K. 1993. A survey of wormhole routing techniques in direct networks. IEEE Comput. 26, 2. Google Scholar
Digital Library
- Primentas, A. 2001. Puncture and tear of woven fabrics. J. Textile Apparel Tech. Manage. 1, 4, 1--8.Google Scholar
- Quinn, N. and Breuer, M. 1979. A force directed component placement procedure for printed circuit boards. IEEE Trans. Circ. Syst. 26, 6, 377--388.Google Scholar
Cross Ref
- Sarrafzadeh, M. and Wong, C. K. 1996. An Introduction to VLSI Physical Design. McGraw- Hill Higher Education, New York. Google Scholar
Digital Library
- Shahookar, K. and Mazumder, P. 1990. A genetic approach to standard cell placement using meta-genetic parameter optimization. IEEE Trans. Comput.-Aid. Des. Integr. Circ. 9, 5, 500--511.Google Scholar
Digital Library
- Sherwani, N. A. 1995. Algorithms for VLSI Physical Design Automation. Kluwer Academic Publishers, Norwell, MA. Google Scholar
Digital Library
- Shragowitz, E. and Keel, S. 1987. A global router based on a multi-commodity flow model. Integr. VLSI J. 5, 1, 3--16. Google Scholar
Digital Library
- Stanley-Marbell, P., Marculescu, D., Marculescu, R., and Khosla, P. K. 2003. Modeling, analysis, and self-management of electronic textiles. IEEE Trans. Comput. 52, 8, 996--1010. Google Scholar
Digital Library
- Sun, W. J. and Sechen, C. 1995. Efficient and effective placement for very large circuits. IEEE Trans. Comput.-Aid. Des. Integr. Circ. 14, 3, 349--359. Google Scholar
Digital Library
- Wang, M., Yang, X., and Sarrafzadehf, M. 2000. Dragon2000: Standard-cell placement tool for large industry circuits. In Proceedings of the International Conference on Computer-Aided Design (ICCASD'00). IEEE Computer Society, Los Alamitos, 260--263. Google Scholar
Digital Library
- Witkowska, B. and Frydrych, I. 2004. A comparative analysis of tear strength methods. Fibres and Textiles in Eastern Europe 12, 2, 42--47.Google Scholar
Index Terms
An efficient placement and routing technique for fault-tolerant distributed embedded computing
Recommendations
Routability-Driven Blockage-Aware Macro Placement
DAC '14: Proceedings of the 51st Annual Design Automation ConferenceWe present a new floorplan representation, called circular-packing trees (CP-trees), for the problem of macro placement. Our CP-trees can flexibly pack movable macros toward corners or pre-placed macros along chip boundaries circularly to optimize macro ...
Seeing the forest and the trees: Steiner wirelength optimization in placemen
ISPD '06: Proceedings of the 2006 international symposium on Physical designWe show how to optimize Steiner-tree Wirelength (StWL) in global and detail placement without a significant runtime penalty, making the use of Half-Perimeter Wirelength unnecessary. Given that StWL correlates with Routed Wirelength (rWL) much better ...
Efficient placement and routing in grid-based networks
SAC '05: Proceedings of the 2005 ACM symposium on Applied computingThis paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of robustness and efficient power optimization techniques. By modeling the ...






Comments