Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ren-Shiou Liu

dblp:45/2376 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
2since 2021 · last 2026
0000-0001-5344-5255ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 7 · 5 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Internet of things and sensor networks · 82% Network optimization and economics · 18%
Theoretical computer science
2 papers
Mathematical optimization · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network
data collection
0.112011
Perpetual and fair data collection for environmental energy harvesting sensor networks · IEEE/ACM Trans. Netw. 2011
Internet of things and sensor networks › energy harvesting
energy harvesting sensor networks
0.112011
Perpetual and fair data collection for environmental energy harvesting sensor networks · IEEE/ACM Trans. Netw. 2011
Network optimization and economics › resource allocation › rate allocation
fair rate allocation
0.112011
Perpetual and fair data collection for environmental energy harvesting sensor networks · IEEE/ACM Trans. Netw. 2011
Internet of things and sensor networks
energy management
0.112010
Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks · INFOCOM 2010
Internet of things and sensor networks › wireless sensor network › sensor network management
sensor network resource allocation
0.112010
Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks · INFOCOM 2010
Internet of things and sensor networks › wireless sensor network
wireless rechargeable sensor network
0.112010
Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks · INFOCOM 2010
Mathematical optimization
distributed optimization
0.012010
Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks · INFOCOM 2010

Methods — techniques the papers use, named apart from their topics

lexicographic optimization · 0.2distributed algorithm · 0.2centralized algorithm · 0.2subgradient method · 0.2dual decomposition · 0.2backpressure · 0.2
YearPublicationVenuePosition
2026 A multi-scale attention network for steel surface defect recognition
abstract
In the steel manufacturing industry, the detection and analysis of surface defects are crucial for ensuring high production quality and operational efficiency. Undetected defects can result in increased material wastage, elevated costs, and compromised product reliability. Although deep learning techniques have significantly advanced automated defect detection, their effectiveness often depends on access to large, meticulously labeled datasets and high-performance computing resources–requirements that are not always feasible in practical industrial settings. To address these limitations, this study introduces a lightweight Multi-Scale Attention Network (MSANet) designed to enhance defect detection performance while maintaining computational efficiency. The proposed MSANet architecture effectively captures and emphasizes defect-relevant features at multiple spatial scales. It begins by extracting multi-scale feature maps using SqueezeNet as the backbone. These maps are then refined through a purpose-built attention module that selectively focuses on regions most indicative of defects, enhancing the network’s discriminative capacity. A key innovation of MSANet lies in its feature fusion strategy, which integrates information from multiple scales to form a unified and enriched representation. This fusion not only boosts classification accuracy but also reduces reliance on heavy computational resources, making MSANet particularly suitable for deployment in real-world industrial environments. Experimental evaluations on the NEU surface defect dataset validate the effectiveness of the proposed approach. MSANet achieves an outstanding classification accuracy of 99.72%, significantly outperforming conventional models. Moreover, the network maintains over 92% accuracy even under data-scarce conditions, highlighting its robustness and strong generalization ability across a diverse range of defect types and operational scenarios.
Chin Ju Chen, Ren-Shiou Liu
Soft Comput.2
2022 Reducing download delay for cooperative caching in small cell network
Yu-Ting Wang 0002, Yun-Zhan Cai, Lo-An Chen, Sian-Jhe Lin, Ren-Shiou Liu, Meng-Hsun Tsai
Wirel. Networks5
2020 Robust data collection for energy-harvesting wireless sensor networks
Ren-Shiou Liu, Yen-Chen Chen
Comput. Networks1
2011 Perpetual and fair data collection for environmental energy harvesting sensor networks
abstract
Renewable energy enables sensor networks with the capability to recharge and provide perpetual data services. Due to low recharging rates and the dynamics of renewable energy such as solar and wind power, providing services without interruptions caused by battery runouts is nontrivial. Most environment monitoring applications require data collection from all nodes at a steady rate. The objective of this paper is to design a solution for fair and high throughput data extraction from all nodes in the presence of renewable energy sources. Specifically, we seek to compute the lexicographically maximum data collection rate and routing paths for each node such that no node will ever run out of energy. We propose a centralized algorithm and two distributed algorithms. The centralized algorithm jointly computes the optimal data collection rate for all nodes along with the flows on each link, the first distributed algorithm computes the optimal rate when the routing structure is a given tree, and the second distributed algorithm, although heuristic, jointly computes a routing structure and a high lexicographic rate assignment that is nearly optimum. We prove the optimality for the centralized and the first distributed algorithm, and use real test-bed experiments and extensive simulations to evaluate both of the distributed algorithms.
Ren-Shiou Liu, Kai-Wei Fan, Zizhan Zheng, Prasun Sinha
IEEE/ACM Trans. Netw.1
2010 Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks
abstract
Energy harvesting sensor platforms have opened up a new dimension to the design of network protocols. In order to sustain the network operation, the energy consumption rate cannot be higher than the energy harvesting rate, otherwise, sensor nodes will eventually deplete their batteries. In contrast to traditional network resource allocation problems where the resources are static, the time-varying recharging rate presents a new challenge. In this paper, We first explore the performance of an efficient dual decomposition and subgradient method based algorithm, called QuickFix, for computing the data sampling rate and routes. However, fluctuations in recharging can happen at a faster time-scale than the convergence time of the traditional approach. This leads to battery outage and overflow scenarios, that are both undesirable due to missed samples and lost energy harvesting opportunities respectively. To address such dynamics, a local algorithm, called SnapIt, is designed to adapt the sampling rate with the objective of maintaining the battery at a target level. Our evaluations using the TOSSIM simulator show that QuickFix and SnapIt working in tandem can track the instantaneous optimum network utility while maintaining the battery at a target level. When compared with IFRC, a backpressure-based approach, our solution improves the total data rate by 42% on the average while significantly improving the network utility.
Ren-Shiou Liu, Prasun Sinha, Can Emre Koksal
INFOCOM1
2009 Locally scheduled packet bursting for data collection in wireless sensor networks
Ren-Shiou Liu, Kai-Wei Fan, Prasun Sinha
Ad Hoc Networks1
2008 ClearBurst: Burst Scheduling for Contention-Free Transmission in Sensor Networks
abstract
In wireless sensor networks, the many-to-one data communication pattern induces high collision losses as multiple transmissions cause contention and interference along the paths from sources to the sink. This paper proposes a low-overhead MAC layer solution to address the high contention problem to improve system throughput and reduce energy consumption. Periods of bursty transmissions with reduced contention from neighboring nodes are exploited to efficiently clear up back- logged queues and improve the performance of CSMA. Through analytical modeling we characterize the expected performance improvement and show that it conforms to the simulation results. Using extensive simulations onns-2and experiments on the 49 node sensor network testbed (Kansei) running TinyOS, we evaluate the performance of our solution.
Ren-Shiou Liu, Kai-Wei Fan, Prasun Sinha
WCNC1
2003 HMRSVP: A Hierarchical Mobile RSVP Protocol
Chien-Chao Tseng, Gwo-Chuan Lee, Ren-Shiou Liu, Tsan-Pin Wang
Wirel. Networks3