James Chang Wu Yu

Orcid: 0000-0001-7783-1513

Affiliations:
  • Chung Hua University, Department of Computer Science and Information Engineering, Taiwan


According to our database1, James Chang Wu Yu authored at least 59 papers between 1992 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Collaborative Hybrid Charging Scheduling in Wireless Rechargeable Sensor Networks.
IEEE Trans. Veh. Technol., 2022

A Temporal and Spatial Priority With Global Cost Recharging Scheduling in Wireless Rechargeable Sensor Networks.
Int. J. Grid High Perform. Comput., 2022

2020
A Distance-Based Scheduling Algorithm With a Proactive Bottleneck Removal Mechanism for Wireless Rechargeable Sensor Networks.
IEEE Access, 2020

Efficient Wireless Charging Pad Deployment in Wireless Rechargeable Sensor Networks.
IEEE Access, 2020

2019
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling.
Algorithms, 2019

2018
OPPC: An Optimal Path Planning Charging Scheme Based on Schedulability Evaluation for WRSNs.
ACM Trans. Embed. Comput. Syst., 2018

2017
Non-commutative path planning for tours with diversified attractions.
Proceedings of the Sixth International Conference on Future Generation Communication Technologies, 2017

2016
A group key-policy attribute-based encryption with partial outsourcing decryption in wireless sensor networks.
Secur. Commun. Networks, 2016

MREA: a minimum resource expenditure node capture attack in wireless sensor networks.
Secur. Commun. Networks, 2016

Clustering and splitting charging algorithms for large scaled wireless rechargeable sensor networks.
J. Syst. Softw., 2016

GTCharge: A game theoretical collaborative charging scheme for wireless rechargeable sensor networks.
J. Syst. Softw., 2016

TADP: Enabling temporal and distantial priority scheduling for on-demand charging architecture in wireless rechargeable sensor Networks.
J. Syst. Archit., 2016

2015
Maximizing destructiveness of node capture attack in wireless sensor networks.
J. Supercomput., 2015

Algorithm and Theory for Robust Wireless Sensor Networks 2014.
Int. J. Distributed Sens. Networks, 2015

Protecting location privacy and query privacy: a combined clustering approach.
Concurr. Comput. Pract. Exp., 2015

VCLT: An Accurate Trajectory Tracking Attack Based on Crowdsourcing in VANETs.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

2014
Safe Path Planning Strategy for Bike Net.
Wirel. Pers. Commun., 2014

Advances in multimedia services over emerging wireless networks.
J. Netw. Comput. Appl., 2014

Algorithm and Theory for Robust Wireless Sensor Networks.
Int. J. Distributed Sens. Networks, 2014

Solving station decision problem in bicycle ad hoc networks.
Int. J. Ad Hoc Ubiquitous Comput., 2014

Computing the Probability of Specific Random Sector Graphs with Applications in Wireless Networks with Directional Antennas.
Proceedings of the 2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2014

2013
A Small-World Routing Protocol and the Effect of Pass-Over for Wireless Sensor Networks.
Wirel. Pers. Commun., 2013

2012
Graph model for optimal OVSF code placement strategies.
Int. J. Ad Hoc Ubiquitous Comput., 2012

Station Decision Problem in Bicycle Ad Hoc Networks.
Proceedings of the 9th International Conference on Ubiquitous Intelligence and Computing and 9th International Conference on Autonomic and Trusted Computing, 2012

2011
An Ad Hoc Routing Protocol with Multiple Backup Routes.
Wirel. Pers. Commun., 2011

Target Coverage in Wireless Sensor Networks.
Proceedings of the Seventh International Conference on Mobile Ad-hoc and Sensor Networks, 2011

Optimum Partition for Distant Charging in Wireless Sensor Networks.
Proceedings of the Seventh International Conference on Mobile Ad-hoc and Sensor Networks, 2011

2010
A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms.
Wirel. Networks, 2010

CALE: A Context-Aware Living Environment Based on Zigbee Sensor Network.
Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010

2009
Efficient Scheduling Algorithms for Bluetooth Scatternets.
Wirel. Pers. Commun., 2009

Computing Subgraph Probability of Random Geometric Graphs with Applications in Quantitative Analysis of Ad Hoc Networks.
IEEE J. Sel. Areas Commun., 2009

A Distributed and Cooperative Algorithm for the Detection and Elimination of Multiple Black Hole Nodes in Ad Hoc Networks.
IEICE Trans. Commun., 2009

Activating the Hot Spot Problem by Switching Multiple Sinks in Wireless Sensor Networks.
Proceedings of the MSN 2009, 2009

2008
A Highly Reusable Code Assignment Approach with Modified Busy Tone Signaling for CDMA-Based Ad Hoc Networks.
Wirel. Pers. Commun., 2008

Coverage algorithms in GPS-less wireless mobile sensor networks.
Proceedings of the 5th International Conference on Mobile Technology, 2008

A Density-Based Algorithm for Redundant Reader Elimination in a RFID Network.
Proceedings of the Second International Conference on Future Generation Communication and Networking, 2008

2007
A low overhead dynamic route repairing mechanism for mobile ad hoc networks.
Comput. Commun., 2007

Reducing Inter-piconet Delay for Large-Scale Bluetooth Scatternets.
Proceedings of the Emerging Technologies in Knowledge Discovery and Data Mining, 2007

A Distributed and Cooperative Black Hole Node Detection and Elimination Mechanism for Ad Hoc Networks.
Proceedings of the Emerging Technologies in Knowledge Discovery and Data Mining, 2007

Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm.
Proceedings of the Combinatorics, 2007

On the Complexity of the Max-Edge-Coloring Problem with Its Variants.
Proceedings of the Combinatorics, 2007

2006
Expected <i>k</i>-coverage in wireless sensor networks.
Ad Hoc Networks, 2006

A Distributed Code Assignment Algorithm with High Code Reusability for CDMA-Based Ad Hoc Networks.
Proceedings of the Wireless Algorithms, 2006

An Altitude Based Dynamic Routing Scheme for Ad Hoc Networks.
Proceedings of the Wireless Algorithms, 2006

Tracers placement for IP traceback against DDoS attacks.
Proceedings of the International Conference on Wireless Communications and Mobile Computing, 2006

Formulas and Protocols for Broadcasting in Mobile Ad Hoc Networks.
Proceedings of the Embedded and Ubiquitous Computing, International Conference, 2006

2005
A Novel Approach to the Fixed Channel Assignment Problem.
J. Inf. Sci. Eng., 2005

A Low Overhead Ad Hoc Routing Protocol with Route Recovery.
Proceedings of the Mobile Ad-hoc and Sensor Networks, First International Conference, 2005

Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

Irregular Redistribution Scheduling by Partitioning Messages.
Proceedings of the Advances in Computer Systems Architecture, 10th Asia-Pacific Conference, 2005

2004
Optimal Processor Mapping Scheme for Efficient Communication of Data Realignment.
Proceedings of the Parallel and Distributed Processing and Applications, 2004

OVSF code management schemes on ad hoc networks.
Proceedings of IEEE International Conference on Communications, 2004

2000
On the complexity of the maximum biplanar subgraph problem.
Inf. Sci., 2000

1998
On the Complexity of the <i>k</i>-Chain Subgraph Cover Problem.
Theor. Comput. Sci., 1998

1996
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs.
IEEE Trans. Parallel Distributed Syst., 1996

1995
Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs.
Theor. Comput. Sci., 1995

1994
A Theeorem on Permutation Graphs with Applications.
Inf. Sci., 1994

1993
Parallel Algorithms for Permutation Graphs.
BIT, 1993

1992
The Weighted Maximum Independent Set Problem in Permutation Graphs.
BIT, 1992


  Loading...