Ten-Hwang Lai

Affiliations:
  • Ohio State University, Columbus, USA


According to our database1, Ten-Hwang Lai authored at least 116 papers between 1983 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
SgxPectre: Stealing Intel Secrets From SGX Enclaves via Speculative Execution.
IEEE Secur. Priv., 2020

2019
Secure Data Communications in Wireless Networks Using Multi-Path Avoidance Routing.
IEEE Trans. Wirel. Commun., 2019

Data Verification in Integrated RFID Systems.
IEEE Syst. J., 2019

On The Performance Bound of Structured Key-Based RFID Authentication.
Proceedings of the 2019 IEEE International Conference on Pervasive Computing and Communications, 2019

OPERA: Open Remote Attestation for Intel's Secure Enclaves.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
SgxPectre Attacks: Leaking Enclave Secrets via Speculative Execution.
CoRR, 2018

Racing in Hyperspace: Closing Hyper-Threading Side Channels on SGX with Contrived Data Races.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Differentially Private Access Patterns for Searchable Symmetric Encryption.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017
δ-privacy: Bounding Privacy Leaks in Privacy Preserving Data Mining.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2017

2016
Private and Secure Tag Access for Large-Scale RFID Systems.
IEEE Trans. Dependable Secur. Comput., 2016

A Novel Coding Scheme for Secure Communications in Distributed RFID Systems.
IEEE Trans. Computers, 2016

2015
Is one-way barrier coverage achievable using comprehensive sensors?
Comput. Commun., 2015

Multi-path Based Avoidance Routing in Wireless Networks.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2013
Energy-Efficient Intrusion Detection with a Barrier of Probabilistic Sensors: Global and Local.
IEEE Trans. Wirel. Commun., 2013

Trapping Mobile Targets in Wireless Sensor Networks: An Energy-Efficient Perspective.
IEEE Trans. Veh. Technol., 2013

On Evaluating Circuits with Inputs Encrypted by Different Fully Homomorphic Encryption Schemes.
IACR Cryptol. ePrint Arch., 2013

Randomized skip lists-based private authentication for large-scale RFID systems.
Proceedings of the Fourteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2013

Detecting job interference in large distributed multi-agent systems - A formal approach.
Proceedings of the 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013), 2013

2012
Exploiting spatial correlation at the link layer for event-driven sensor networks.
Int. J. Sens. Networks, 2012

Energy-efficient intrusion detection with a barrier of probabilistic sensors.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
One-way barrier coverage with wireless sensors.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Optimal Deployment Patterns for Full Coverage and k -Connectivity (k <= 6) Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2010

Maximizing the Lifetime of a Barrier of Wireless Sensors.
IEEE Trans. Mob. Comput., 2010

Local Barrier Coverage in Wireless Sensor Networks.
IEEE Trans. Mob. Comput., 2010

Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks.
IEEE Trans. Mob. Comput., 2010

2009
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors.
ACM Trans. Sens. Networks, 2009

2008
On the scalability of IEEE 802.11 ad-hoc-mode timing synchronization function.
Wirel. Networks, 2008

On k-coverage in a mostly sleeping sensor network.
Wirel. Networks, 2008

Message-efficient in-network location management in a multisink wireless sensor network.
Int. J. Sens. Networks, 2008

An Optimal Algorithm for the Minimum Disc Cover Problem.
Algorithmica, 2008

Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks.
Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

Complete optimal deployment patterns for full-coverage and k-connectivity (k<=6) wireless sensor networks.
Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

Deploying Four-Connectivity and Full-Coverage Wireless Sensor Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
Barrier coverage with wireless sensors.
Wirel. Networks, 2007

An Accurate and Scalable Clock Synchronization Protocol for IEEE 802.11-Based Multihop Ad Hoc Networks.
IEEE Trans. Parallel Distributed Syst., 2007

Location-Aided Broadcast in Wireless Ad Hoc Networks.
J. Inf. Sci. Eng., 2007

Designing localized algorithms for barrier coverage.
Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

Optimal sleep-wakeup algorithms for barriers of wireless sensors.
Proceedings of the Fourth International Conference on Broadband Communications, 2007

2006
DTGR: Disruption-Tolerant Geographic Routing for Wireless Ad Hoc Networks.
Simul., 2006

Message-Efficient In-Network Location Management in a Multi-sink Wireless Sensor Network.
Proceedings of the IEEE International Conference on Sensor Networks, 2006

Deploying wireless sensors to achieve both coverage and connectivity.
Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

2005
Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks.
Mob. Networks Appl., 2005

A Timer-based Protocol for Connected Dominating Set Construction in IEEE 802.11 Multihop Mobile Ad Hoc Networks.
Proceedings of the 2005 IEEE/IPSJ International Symposium on Applications and the Internet (SAINT 2005), 31 January, 2005

A scalable and adaptive clock synchronization protocol for IEEE 802.11-based multihop ad hoc networks.
Proceedings of the IEEE 2nd International Conference on Mobile Adhoc and Sensor Systems, 2005

On the lifetime analysis of always-on wireless sensor network applications.
Proceedings of the IEEE 2nd International Conference on Mobile Adhoc and Sensor Systems, 2005

Defending against search-based physical attacks in sensor networks.
Proceedings of the IEEE 2nd International Conference on Mobile Adhoc and Sensor Systems, 2005

A Compatible and Scalable Clock Synchronization Protocol in IEEE 802.11 Ad Hoc Networks.
Proceedings of the 34th International Conference on Parallel Processing (ICPP 2005), 2005

Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks.
Proceedings of the Networking and Mobile Computing, Third International Conference, 2005

2004
Scheduling in Bluetooth Networks.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Interference-Mitigating MAC Scheduling And SAR Policies For Bluetooth Scatternets.
J. Circuits Syst. Comput., 2004

Analysis and implementation of scalable clock synchronization protocols in IEEE 802.11 ad hoc networks.
Proceedings of the 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004

Message from the Chairs: International Workshop on Ad Hoc and Sensor Networks.
Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004

2003
Reliable MAC layer multicast in IEEE 802.11 wireless networks.
Wirel. Commun. Mob. Comput., 2003

A QOS-Aware Scheduling Algorithm for Bluetooth Scatternets.
Proceedings of the 32nd International Conference on Parallel Processing (ICPP 2003), 2003

Efficient and Scalable IEEE 802.11 Ad-Hoc-Mode Timing Synchronization Function.
Proceedings of the 17th International Conference on Advanced Information Networking and Applications (AINA'03), 2003

2002
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks.
IEEE Trans. Parallel Distributed Syst., 2002

Location aided broadcast in wireless ad hoc network systems.
Proceedings of the 2002 IEEE Wireless Communications and Networking Conference Record, 2002

On the scalability of IEEE 802.11 ad hoc networks.
Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

A Self-Routing Topology for Bluetooth Scatternets.
Proceedings of the International Symposium on Parallel Architectures, 2002

Reliable MAC Layer Multicast in IEEE 802.11 Wireless Networks.
Proceedings of the 31st International Conference on Parallel Processing (ICPP 2002), 2002

Computing optimal local cover set for broadcast in ad hoc networks.
Proceedings of the IEEE International Conference on Communications, 2002

Interference-aware MAC scheduling and SAR policies for Bluetooth scatternets.
Proceedings of the Global Telecommunications Conference, 2002

2001
Dynamic Carrier Allocation Strategies for Mobile Cellular Networks.
J. Parallel Distributed Comput., 2001

Efficient resource allocation in self-healing multiprotocol label switching mesh networks.
Proceedings of the Global Telecommunications Conference, 2001

Location aided broadcast in wireless ad hoc networks.
Proceedings of the Global Telecommunications Conference, 2001

2000
GPS-Based Message Broadcasting for Inter-Vehicle Communication.
Proceedings of the 2000 International Conference on Parallel Processing, 2000

Call Admission Control vs. Bandwidth Reservation: Reducing Handoff Call Dropping Rate and Providing Bandwidth Efficiency in Mobile Networks.
Proceedings of the 2000 International Conference on Parallel Processing, 2000

Bandwidth Management Providing Guaranteed Call Dropping Rates for Multimedia Mobile Networks.
Proceedings of the 2000 IEEE International Conference on Multimedia and Expo, 2000

A Relaxed Mutual Exclusion Problem with Application to Channel Allocation in Mobile Cellular Networks.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

An Efficient Approach to Support QoS and Bandwidth Efficiency in High Speed Mobile Networks.
Proceedings of the 2000 IEEE International Conference on Communications: Global Convergence Through Communications, 2000

1999
Sorting on Reconfigurable Meshes: An Irregular Decomposition Approach.
VLSI Design, 1999

Considerations on preestablished tree rerouting handoff protocols for wireless ATM PCN.
Comput. Networks, 1999

COS-based inter-switch handoffs in wireless ATM: pitfalls and solutions.
Proceedings of the 1999 IEEE Wireless Communications and Networking Conference, 1999

1998
Isochronous bandwidth utilization improvement in distributed queue dual bus-based personal communication networks.
Comput. Commun., 1998

An efficient media access control protocol for delay sensitive bursty data in broadband wireless networks.
Proceedings of the 9th IEEE International Symposium on Personal, 1998

1997
An Efficient Protocol for Call Setyp and Path Migration in IEEE 802.6 Based Personal Communication Networks.
IEEE Trans. Computers, 1997

Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem.
Discret. Appl. Math., 1997

An Efficient Priority-Based Dynamic Channel Allocation Strategy for Mobile Cellular Networks.
Proceedings of the Proceedings IEEE INFOCOM '97, 1997

Efficient Distributed Deadlock Detection and Resolution using Probes, Tokens, and Barriers.
Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

Distributed Dynamic Carrier Allocation in Mobile Cellular Networks: Search vs. Update.
Proceedings of the 17th International Conference on Distributed Computing Systems, 1997

1996
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels.
IEEE Trans. Parallel Distributed Syst., 1996

Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes.
IEEE Trans. Parallel Distributed Syst., 1996

On the Embedding of a Class of Regular Graphs in a Faulty Hypercube.
J. Parallel Distributed Comput., 1996

An Efficient Protocol for Call Setup and Path Migration in IEEE 802.6 Based Personal Communication Networks.
Proceedings of the 1996 International Conference on Network Protocols, 1996

1995
An (N-1)-Resilient Algorithm for Distributed Termination Detection.
IEEE Trans. Parallel Distributed Syst., 1995

Triangulation on Reconfigurable Meshes: A Natural Decomposition Approach.
J. Parallel Distributed Comput., 1995

Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs.
J. Algorithms, 1995

Mobile real-time communications in FDDI networks.
Proceedings of the 1995 International Conference on Network Protocols, 1995

1994
ob Scheduling is More Important than Processor Allocation for Hypercube Computers.
IEEE Trans. Parallel Distributed Syst., 1994

Matrix Representation of Graph Embedding in a Hypercube.
J. Parallel Distributed Comput., 1994

1993
The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs.
Inf. Process. Lett., 1993

Ring Embedding in an Injured Hypercube.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992
Constructing Parallel Paths Betweesn Two Subcubes.
IEEE Trans. Computers, 1992

A More Efficient Message-Optimal Algorithm for Distributed Termination Detection.
Proceedings of the 6th International Parallel Processing Symposium, 1992

Compacting Free Buddy Subcubes in a Hypercube.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

Hot-Spot Based Compostion Algorithm.
Proceedings of the Eighth International Conference on Data Engineering, 1992

1991
Placement of the Processors of a Hypercube.
IEEE Trans. Computers, 1991

A Note on "Generalized Hypercube and Hyperbus Structures for a Computer Network".
IEEE Trans. Computers, 1991

Scheduling Independent Jobs on Partitionable Hypercubes.
J. Parallel Distributed Comput., 1991

The Complexity of Congestion-1 Embedding in a Hypercube.
J. Algorithms, 1991

Processor allocation vs. job scheduling on hypercube computers.
Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS 1991), 1991

1990
Mapping Pyramid Algorithms into Hypercubes.
J. Parallel Distributed Comput., 1990

1989
Virtual Subcubes and Job Migration in a Hypercube.
Proceedings of the International Conference on Parallel Processing, 1989

1988
Preemptive Scheduling of Independent Jobs on a Hypercube.
Inf. Process. Lett., 1988

Scheduling Independent Jobs on Hypercubes.
Proceedings of the STACS 88, 1988

1987
On the Routability of a Convex Grid.
J. Algorithms, 1987

On Distributed Snapshots.
Inf. Process. Lett., 1987

1986
Termination Detection for Dynamically Distributed Systems with Non-first-in-first-out Communication.
J. Parallel Distributed Comput., 1986

A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions.
Inf. Process. Lett., 1986

A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985
Performance of Parallel Branch-and Bound Algorithms.
IEEE Trans. Computers, 1985

On the complexity of a family of generalized matching problems.
Discret. Appl. Math., 1985

1984
Deadlock detection in communicating finite state machines.
SIGACT News, 1984

Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness.
SIAM J. Comput., 1984

Anomalies in Parallel Branch-and-Bound Algorithms.
Commun. ACM, 1984

1983
Nearly On-Line Scheduling of Multiprocessor Systems with Memories.
J. Algorithms, 1983


  Loading...