Chien-Chih Liao

Learn More
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floorplan for any n-node plane triangulation. In comparison with previous floor-planning algorithms in the literature, our solution is not only simpler in the algorithm itself, but also produces(More)
The Set k-Cover problem aims to partition a set of nodes for the maximal number of covers. This problem is crucial for extending the lifetime of wireless sensor networks (WSNs) under the constraint of covering all targets. More specifically, the Set k-Cover problem enables partitioning the set of sensors into several covers over all targets and activating(More)
The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional augmented cube, denoted by AQn, an important variation of the hypercube, possesses several embedding properties that hypercubes and other variations do not possess. The advantages of AQn are(More)
Extending the lifetime is a key issue in wireless sensor networks. An effective way to extend the lifetime is to partition the sensors into several covers and activate the covers one by one. Thus, the more the covers, the longer the lifetime. To find the maximum number of covers has been modeled as the Set K-Cover problem. In this paper we propose using(More)
Lifetime extension is a key issue of WSNs. The WSN lifetime can be extended K times if the number K of disjoint covers are found. Under the energy condition, another consideration is load balancing for covers to sense targets and transmit data to base station since sensors need to consume the energy to do these tasks. The energy consumption of sensors(More)
Lifetime is a key issue in wireless sensor network (WSN) applications. An effective way to extend WSN lifetime is to partition the set of sensors into several covers and activate them alternately. More covers then lead to longer lifetime. Finding the maximum number of covers under full coverage constraint has been formulated as an NP-complete problem-the(More)