Chih-Wei Yi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Chih-Wei Yi has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Chao-Min Su
Department of Computer Science, National Chiao Tung University, Hsinchu City 30010, Taiwan
2 shared publications- Myung-Sup Kim
Department of Computer and Information Science, Korea University, Sejong 30019, Republic of Korea
2 shared publications - Peng-Jun Wan
Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA
2 shared publications Chen-Wei Huang
Department of Computer Science, National Chiao Tung University, Hsinchu City 30010, Taiwan
1 shared publication- Chien Chen
NCTU, Hsinchu, Taiwan
1 shared publication - Chuan-Kai Yang
Department of Information Management, National Taiwan University of Science and Technology, Taipei, ROC
1 shared publication
Latest Publications
- 21 August 2018
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 27 (2) , 541-549
Managing a World of Things: A Report on APNOMS2017
- 21 August 2018
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 27 (2) , 541-549
Managing a World of Things: A Report on APNOMS2017
- 11 February 2016
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 24 (3) , 754-763
Managing a Very Connected World: A Report on APNOMS2015
- 11 February 2016
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 24 (3) , 754-763
Managing a Very Connected World: A Report on APNOMS2015
- 26 March 2010
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 53 (10) , 1621-1631
The Critical Grid Size and Transmission Radius for Local-Minimum-Free Grid Routing in Wireless Ad Hoc and Sensor Networks
In grid routing, the plane is tessellated into equal-sized square cells. Two cells are called neighbor cells if they share a common edge, and two nodes are called routing neighbors if they are in neighbor cells and within each other's transmission range. If communication parties are in the same cell, packets can be transmitted directly; otherwise, packets are forwarded to routing neighbors that are in cells closer to destination cells. As a greedy strategy, grid routing suffers the existence of local minima at which no neighbor nodes exist for relaying packets. To guarantee deliverability, in this paper, we investigate two vital parameters of grid routing, called the grid size and the transmission radius. Assume that nodes are represented by a Poisson point process with rate n over a unit-area square, and let l denote the grid size and r the transmission radius. First, we show that if for some constant β and r = √5l, then β = 1 is the threshold for deliverability. In other words, there almost surely do not exist local minima if β > 1 and there almost surely exist local minima if β < 1. Next, for any given β > 1, we give sufficient and necessary conditions to determine the critical transmission radius (CTR) for deliverability. Then, we show that as β ≅ 1.092, the CTR is the minimum over all β > 1. Simulation results are given to validate this theoretical work.
- 26 March 2010
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 53 (10) , 1621-1631
The Critical Grid Size and Transmission Radius for Local-Minimum-Free Grid Routing in Wireless Ad Hoc and Sensor Networks
In grid routing, the plane is tessellated into equal-sized square cells. Two cells are called neighbor cells if they share a common edge, and two nodes are called routing neighbors if they are in neighbor cells and within each other's transmission range. If communication parties are in the same cell, packets can be transmitted directly; otherwise, packets are forwarded to routing neighbors that are in cells closer to destination cells. As a greedy strategy, grid routing suffers the existence of local minima at which no neighbor nodes exist for relaying packets. To guarantee deliverability, in this paper, we investigate two vital parameters of grid routing, called the grid size and the transmission radius. Assume that nodes are represented by a Poisson point process with rate n over a unit-area square, and let l denote the grid size and r the transmission radius. First, we show that if for some constant β and r = √5l, then β = 1 is the threshold for deliverability. In other words, there almost surely do not exist local minima if β > 1 and there almost surely exist local minima if β < 1. Next, for any given β > 1, we give sufficient and necessary conditions to determine the critical transmission radius (CTR) for deliverability. Then, we show that as β ≅ 1.092, the CTR is the minimum over all β > 1. Simulation results are given to validate this theoretical work.
- 5 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 9 (2) , 614-623
Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally constructed by using only one hop information if the transmission radius is set no less than the largest edge length of the RNG. The largest RNG edge length is called the critical transmission radius for the RNG. In this paper, we consider the RNG over a Poisson point process with mean density ¿ in a unit-area disk. Let ß0 = ¿(1/(2/3 - ¿(3)/2¿)) ¿ 1.6. We show that the largest RNG edge length is asymptotically almost surely at most ß ¿(1n n/¿n) for any fixed ß > ß0 and at least ß ¿(1n n/¿n) for any fixed ß < ß0. This implies that the threshold width of the critical transmission radius is o (¿(1n n/n)). In addition, we also prove that for any constant ¿, the expected number of RNG edges whose lengths are not less than ß0 ¿(1n n+¿)/¿n is asymptotically equal to ß02/2 e-¿.
- 5 February 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 9 (2) , 614-623
Sharp thresholds for relative neighborhood graphs in wireless Ad Hoc networks
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally constructed by using only one hop information if the transmission radius is set no less than the largest edge length of the RNG. The largest RNG edge length is called the critical transmission radius for the RNG. In this paper, we consider the RNG over a Poisson point process with mean density ¿ in a unit-area disk. Let ß0 = ¿(1/(2/3 - ¿(3)/2¿)) ¿ 1.6. We show that the largest RNG edge length is asymptotically almost surely at most ß ¿(1n n/¿n) for any fixed ß > ß0 and at least ß ¿(1n n/¿n) for any fixed ß < ß0. This implies that the threshold width of the critical transmission radius is o (¿(1n n/n)). In addition, we also prove that for any constant ¿, the expected number of RNG edges whose lengths are not less than ß0 ¿(1n n+¿)/¿n is asymptotically equal to ß02/2 e-¿.
- 10 November 2007
- Published by Springer Nature in Algorithmica
- Vol. 50 (1) , 58-71
An Optimal Algorithm for the Minimum Disc Cover Problem
- 10 November 2007
- Published by Springer Nature in Algorithmica
- Vol. 50 (1) , 58-71
An Optimal Algorithm for the Minimum Disc Cover Problem
- 16 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 15 (2) , 334-345
Maximizing Lifetime of Sensor Surveillance Systems
This paper addresses the maximal lifetime scheduling problem in sensor surveillance systems. Given a set of sensors and targets in an area, a sensor can watch only one target at a time, our task is to schedule sensors to watch targets and forward the sensed data to the base station, such that the lifetime of the surveillance system is maximized, where the lifetime is the duration that all targets are watched and all active sensors are connected to the base station. We propose an optimal solution to find the target-watching schedule for sensors that achieves the maximal lifetime. Our solution consists of three steps: 1) computing the maximal lifetime of the surveillance system and a workload matrix by using the linear programming technique; 2) decomposing the workload matrix into a sequence of schedule matrices that can achieve the maximal lifetime; and 3) determining the sensor surveillance trees based on the above obtained schedule matrices, which specify the active sensors and the routes to pass sensed data to the base station. This is the first time in the literature that the problem of maximizing lifetime of sensor surveillance systems has been formulated and the optimal solution has been found
- 16 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 15 (2) , 334-345
Maximizing Lifetime of Sensor Surveillance Systems
This paper addresses the maximal lifetime scheduling problem in sensor surveillance systems. Given a set of sensors and targets in an area, a sensor can watch only one target at a time, our task is to schedule sensors to watch targets and forward the sensed data to the base station, such that the lifetime of the surveillance system is maximized, where the lifetime is the duration that all targets are watched and all active sensors are connected to the base station. We propose an optimal solution to find the target-watching schedule for sensors that achieves the maximal lifetime. Our solution consists of three steps: 1) computing the maximal lifetime of the surveillance system and a workload matrix by using the linear programming technique; 2) decomposing the workload matrix into a sequence of schedule matrices that can achieve the maximal lifetime; and 3) determining the sensor surveillance trees based on the above obtained schedule matrices, which specify the active sensors and the routes to pass sensed data to the base station. This is the first time in the literature that the problem of maximizing lifetime of sensor surveillance systems has been formulated and the optimal solution has been found