Chang Wu Yu (James)’s Publications

Journal Papers:

 

1.          Rei-Heng Cheng, Tung-Kuang Wu, C. W. Yu, ‘A Highly Topology Adaptable Ad Hoc Routing Protocol with Complementary Preemptive Link Breaking Avoidance and Path Shortening Mechanisms,’ ACM/Springer Wireless Networks (WINET), online, 2009. (PDF file)

2.          C. W. Yu, ‘Computing Subgraph Probability of Random Geometric Graphs with Applications in Quantitative Analysis of Ad Hoc Networks,’ IEEE Journal on Selected Areas in Communications (JSAC): Special Issue on Stochastic Geometry and Random Graphs for Wireless Networks, vol. 27, no. 7, pp. 1056-1065, 2009. (PDF file)

3.          Kun-Ming Yu, C. W. Yu, and Shi-Feng Yan, ’An Ad Hoc Routing Protocol with Multiple Backup Routes,’ Wireless Personal Communications, online, 2009.

4.          C. W. Yu, Tung-Kuang Wu, Rei-Heng Cheng, Kun-Ming Yu, and Shun Chao Chang, ’A Distributed and Cooperative Black Hole Node Detection and Elimination Mechanism for Ad Hoc Networks,’ IEICE Transactions on Communications, vol. E92-B, no.2, pp.483-490, 2009.

5.          C. W. Yu, Kun-Ming Yu, and Shu Ling Lin, ‘Efficient Scheduling Algorithms for Bluetooth Scatternets,’ Wireless Personal Communications, vol. 48, no. 2, pp. 291-309, 2009.

6.          Tung-Kuang Wu, C. W. Yu, Rei-Heng Cheng, and Chia Hu Wu ‘A Highly Reusable Code Assignment Approach with Modified Busy Tone Signaling for CDMA-Based Ad Hoc Networks,’ Wireless Personal Communications, vol. 44, pp. 119-138, 2008.

7.          C. W. Yu, Tung-Kuang Wu, and Rei Heng Cheng, ‘A low overhead dynamic route repairing mechanism for mobile ad hoc networks’ Computer Communications, vol. 30, pp. 1152-1163, 2007. (PDF file)

8.          Hong-Yi Chang and C. W. Yu, ‘Constructing long-lived scatternets in Bluetooth networks’ Journal of Internet Technology, vol. 8, no. 3, pp. 337-343, 2007. (PDF file)

9.          Li-Hsing Yen, C. W. Yu, and Yang-Min Cheng, ‘Expected k-Coverage in Wireless Sensor Networks,’ Ad Hoc Networks, vol. 5, no. 4, pp. 636-650, 2006.(PDF file)

10.      Rei Heng Cheng, C. W. Yu, and Tung-Kunag Wu, ‘A novel approach for fixed channel assignment problem’ Journal of Information Science and Engineering, Vol. 21, No. 1, pp. 39-58, January, 2005. (PDF file)

11.      C. W. Yu, Kun-Ming Yu, Li-Hsing Yen, and Zhi Pin Lee, “An ad hoc routing protocol providing short backup routes,” Chung Hua Journal of Science and Engineering, vol. 3, no. 1, pp. 81-87, 2005. (PDF file)

12.      C. W. Yu, 'On the complexity of the maximum biplanar subgraph problem,' Information Sciences, vol. 1298, pp. 239-250, 2000. (PDF file)

13.      C. W. Yu, G. H. Chen, and T. H. Ma, 'On the complexity of the k chain subgraph cover problem,' Theoretical Computer Science, vol. 205, pp. 85-98, 1998. (PDF file)

14.      C. W. Yu and G. H. Chen, 'An efficient parallel recognition algorithm for bipartite permutation graphs,' IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 3-10, 1996. (PDF file)

15.      C. W. Yu and G. H. Chen, 'Efficient parallel algorithms for doubly convex-bipartite graphs,' Theoretical Computer Science, vol. 147, pp. 249-265, 1995.(PDF file)

16.      C. W. Yu and G. H. Chen, 'A theorem on permutation graphs with applications,' Information Sciences, vol. 77, pp. 179-193, 1994.

17.      C. W. Yu and G. H. Chen, 'Generate all maximal independent sets in permutation graphs,' International Journal of Computer Mathematics, vol. 47, pp. 1-8, 1993.

18.      C. W. Yu and G. H. Chen, 'Parallel algorithms for permutation graphs,' BIT, vol. 33, pp. 413-419, 1993.

19.      C. W. Yu and G. H. Chen, 'The weighted maximum independent set problem in permutation graphs,' BIT, vol. 32, pp. 609-618, 1992.

20.      C. W. Yu and C. Y. Tang, 'Solving the direct domination problem by using the domination relation data structures,' Journal of Computers, vol. 3, no. 3, pp. 1-8, 1991.

 

International Conference Papers:

Lecture Notes in Computer Science or Lecture Notes in Artificial Intelligence Series

 

1.          C. W. Yu, ‘Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm,’ to appear in IntErnational Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007). Also appear in Springer-Verlag Lecture Notes in Computer Science, vol. 4614, pp. 362-374, 2007. (PDF file)

2.          C. W. Yu, ‘On the Complexity of the Max-Edge-Coloring Problem with Its Variants,’ to appear in IntErnational Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007). Also appear in Springer-Verlag Lecture Notes in Computer Science, vol. 4614, pp. 362-374, 2007. (PDF file)

3.          C. W. Yu, Tung-Kuang Wu, Rei-Heng Cheng, and Chia Hu Wu ‘A Distributed Code Assignment Algorithm with High Code Reusability for CDMA-based Ad Hoc Networks’ Springer-Verlag Lecture Notes in Computer Science, vol. 4138, pp. 329-340, 2006. Also in Proceedings of the The International Conference on Wireless Algorithms, Systems and Applications (WASA’06). (PDF file)

4.          Rei-Heng Cheng, Tung-Kuang Wu, C. W. Yu,  and Chun-Hung Kuo, ‘An Altitude Based Dynamic Routing Scheme for Ad Hoc Networks’ Springer-Verlag Lecture Notes in Computer Science, vol. 4138, pp. 609-619, 2006. Also in Proceedings of the The International Conference on Wireless Algorithms, Systems and Applications (WASA’06). (PDF file)

5.          C. W. Yu and Cheng Yao Tseng, ‘Formulas and Protocols for Broadcasting in Mobile Ad Hoc Networks’ Springer-Verlag Lecture Notes in Computer Science, vol. 4096, pp. 854-863, 2006. Also in Proceedings of the IFIP international conference on embedded and ubiquitous computing (EUC-06), 2006. (PDF file)

6.          C. W. Yu, Tung-Kuang Wu, Rei Heng Cheng , and Po Tsang Chen , ‘A Low Overhead Ad Hoc Routing Protocol with Route Recovery,’ Springer-Verlag Lecture Notes in Computer Science, vol. 3794, pp. 666-675, 2005. Also appear in International Conference on Mobile Ad-hoc and Sensor Networks (MSN), December 2005.(PDF file)

7.          C. W. Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu Kuo Lian, and Chun-I Chen ‘Irregular Redistribution Scheduling by partitioning Messages,’ Springer-Verlag Lecture Notes in Computer Science, vol. 3740, pp. 295-309, 2005.. Also appear in Tenth Asia-Pacific Computer Systems Architecture Conference (ACSAC 2005). (PDF file)

8.          C. W. Yu and Li-Hsing Yen, ‘Computing subgraph probability of random geometric graphs: Quantitative analyses of wireless ad hoc networks,’ Springer-Verlag Lecture Notes in Computer Science, vol. 3731, pp. 458-472, 2005. Also appear in 25th IFIP WG 6.1 International Conference on Formal Techniques (FORTE) for Networked and Distributed Systems, 2005. (PDF file)

9.          Kun-Ming Yu, Chi-Hsiu Chen, Ching-Hsien Hsu, C. W. Yu, and Chiu Kuo Liang ‘Contention-Free Communication Scheduling for Irregular Data Redistribution in Parallelizing Compilers,’ Springer-Verlag Lecture Notes in Computer Science, vol. 3756, pp. 101-110, 2005. Also appear in The Sixth International Workshop on Advanced Parallel Processing Technologies (APPT 2005).(PDF file)

10.    Ching-Hsien Hsu, Kun-Ming Yu, Chi-Hsiu Chen, C. W. Yu, and Chiu Kuo Lian ‘An Optimal Processor Replacement Scheme for Efficient Communication of Runtime Data Redistribution,’ Springer-Verlag Lecture Notes in Computer Science, vol. 3358, pp. 268-273, 2004. Also appear in The Second International Symposium on Parallel and Distributed Processing and Applications (ISPA’2004). (PDF file)

11.    C. W. Yu, Tung-Kuang Wu, Rei Heng Cheng, and Shun Chao Chang, ‘A Distributed and Cooperative Black Hole Node Detection and Elimination Mechanism for Ad Hoc Networks,’ PAKDD, Lecture Notes in Artificial Intelligence, vol. 4819, pp. 562-573, 2007. (PDF file)

12.      C. W. Yu, Kun-Ming Yu, and Shu Ling Lin, ‘Reducing Inter-Piconet Delay for Large-Scale Bluetooth Scatternets,’ PAKDD, Lecture Notes in Artificial Intelligence, vol. 4819, pp. 538-549, 2007.

 

Other conference papers:

 

1.          C. W. Yu, Shan Shiung Wei, and Bing Jiun Shie, ‘Activating the Hot Spot Problem by Switching Multiple Sinks in Wireless Sensor Networks’ International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2009), to appear.

2.          Rei-Heng Chen, Tung-Kuang Wu, and C. W. Yu, ‘Resolving Pass-Over Problem in Wireless Sensor Networks’, The 6th International Conference on Information Technology and Applications (ICITA 2009), to appear.

3.          C. W. Yu, Chin-Chih Chang and Ju-Hsien Chou, ‘Minimizing the Number of Clusters in IEEE 802.15.4 Wireless Sensor Networks,’ The First International Workshop on Wireless & Mobile Networks (WiMoN-2009), to appear. (PDF file)

4.          Kun-Ming Yu, C. W. Yu, and Zheng-Yi Lin, ‘A Density-Based Algorithm for Redundant Reader Elimination in a RFID Network,’ The 2nd International Conference on Future Generation Communication and Networking (FGCN 2008), to appear,

5.          C. W. Yu, Chun-Hsin Wang, Li Chun Hsu, and Kai Jen Cheng, ‘Coverage Algorithms in GPS-less Wireless Mobile Sensor Networks‘ ACM International Workshop on Sensor, Ad hoc, and Mesh Networks (SAMnet 2008), to appear. (PDF file)

6.          C. W. Yu, Tung-Kuang Wu, Rei-Heng Chen, and Fang-Wei Jin, ‘A Small-World Routing Protocol for Wireless Sensor Networks’ The 4th IEEE International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2008), to appear. (PDF file)

7.          C. W. Yu, Elvis Chen, and Chun-Cheng Fang, ‘Deploying Mobile Nodes to Connect Wireless Sensor Networks Using Novel Algorithms,’ IEEE Proceedings of International Conference on Wireless Algorithms, Systems and Applications (WASA’07), pp. pp. 199-204, Chicago, USA, 2007. (PDF file)

8.          C.-H. Wang, C. W. Yu, C.-K. Liang, K.-M. Yu, W. Ouyang, C.-H. Hsu, and Y.-G. Chen, “Tracers Placement for IP Traceback against DDoS Attacks,” to appear in International Wireless Communications and Mobile Computing Conference, Vancouver, Canada, 2006. (included in ACM Digital Library) (PDF file)

9.          Hong-Yi Chang and C. W. Yu, ‘Constructing long-lived scatternets in bluetooth networks,’ to appear in The 3rd IEEE International Conference on Information Technology and Applications (ICITA'2005), Sydney, Australia, 2005. (PDF file)

10.      L.-H. Yen and C. W. Yu, ‘Link Probability, Network Coverage, and Related Properties of Wireless Ad Hoc Networks’ The 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004, pp.525-527. (PDF file)

11.      C. W. Yu and Rong Qiang Huang, ‘OVSF Code Management Schemes on Ad Hoc Networks’ International Conference on Communications (ICC 2004), pp. 4152-4156, Paris, France, 2004. (PDF file)

12.      C. W. Yu, Li-Hsing Yen, Kun-Ming Yu, and Zhi Pin Lee, ‘An Ad Hoc Routing Protocol Providing Short Backup Routes,’ The Eighth IEEE Internation Conference on Communication Systems, pp.1052-1056, Singapore, 2002. (PDF file)

13.      Kun-Ming V. Yu, Shi-Feng Yand, and C. W. Yu, ‘An Ad Hoc Routing Protocol with Multiple Backup Routes,’ Proceedings of the IASTED International Conference Networks, Parallel and Distributed Processing, and Applications, pp. 75-80, 2002.

14.      R. H. Cheng, C. W. Yu, and T. K. Wu, 'A new approach for fixed channel assignment problem by preserving cosite constraint,' Thirteenth International Conference on Systems Engineering - ICSE 99, Las Vegas, 1999.

15.      C. W. Yu, 'On the complexity of the maximum biplanar subgraph problem,' Proceedings of 1998 International Computer Symposium, Workshop on Algorithms, pp. 97-103, 1998.

16.      C. W. Yu and G. H. Chen, 'Efficient parallel algorithms for doubly convex-bipartite graphs, ' Proceedings of 1992 International Computer Symposium, pp. 293-300, Taichung, Taiwan, ROC.

17.      C. W. Yu and G. H. Chen, 'A theorem on permutation graphs with applications,' Proceeding of 1992 International Computer Symposium, pp. 447-454, Taichung, Taiwan, ROC.

18.      C. W. Yu and G. H. Chen, 'An efficient parallel recognition algorithm for bipartite-permutation graphs,' Proceedings of 1992 International Conference on Parallel and Distributed Systems, pp. 370-377, Hsinchu, Taiwan, ROC.

 

Papers Submitted or under Revision:

 

1.          C. W. Yu, Wen Ouyang, Meng-Ti Liu, and Yu-Wei Chang, ‘Graph Model for OVSF Code Placement’ International Journal of Computer Mathematics (Under major revision).

2.          C. W. Yu, Li-Hsing Yen, Chun-Hsin Wang, and Kai Jen Cheng, ‘Coverage reinforcement using location-unaware wireless mobile sensors,’ submitted to Wireless Communications and Mobile Computing.