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

Runwei Zhang

dblp:140/7283 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

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

Computer networks · 3 · 2 first-author

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 architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 77% Distributed systems · 23%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
wireless sensor network
0.212015
The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping in Wireless Sensor Networks · IEEE J. Sel. Areas Commun. 2015
Energy-efficient computing
energy harvesting
0.212015
The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping in Wireless Sensor Networks · IEEE J. Sel. Areas Commun. 2015
Distributed systems › distributed scheduling
load sharing
0.112015
The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping in Wireless Sensor Networks · IEEE J. Sel. Areas Commun. 2015

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

testbed experiments · 0.4simulation · 0.4
YearPublicationVenuePosition
2015 Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks
abstract
Energy efficiency of wireless sensor networks (WSNs) can be improved by moving base stations (BSs), as this scheme evenly distributes the communication load in the network. However, physically moving the BSs is complicated and costly. In this paper, we propose a new scheme: virtually moving the BSs. We deploy an excessive number of BSs and adaptively re-select a subset of active BSs so as to emulate the physical movement. Beyond achieving high energy-efficiency, this scheme obviates the difficulties associated with physically moving the BSs.
Runwei Zhang, Patrick Thiran, Martin Vetterli
MobiHoc1
2015 The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping in Wireless Sensor Networks
abstract
In wireless sensor networks (WSNs), the base station (BS) is a critical sensor node whose failure causes severe data losses. Deploying multiple fixed BSs improves the robustness, yet requires all BSs to be installed with large batteries and large energy-harvesting devices due to the high energy consumption of BSs. In this paper, we propose a scheme to coordinate the multiple deployed BSs such that the energy supplies required by individual BSs can be substantially reduced. In this scheme, only one BS is selected to be active at a time and the other BSs act as regular sensor nodes. We first present the basic architecture of our system, including how we keep the network running with only one active BS and how we manage the handover of the role of the active BS. Then, we propose an algorithm for adaptively selecting the active BS under the spatial and temporal variations of energy resources. This algorithm is simple to implement but is also asymptotically optimal under mild conditions. Finally, by running simulations and real experiments on an outdoor testbed, we verify that the proposed scheme is energy-efficient, has low communication overhead and reacts rapidly to network changes.
Runwei Zhang, François Ingelrest, Guillermo Barrenetxea, Patrick Thiran, Martin Vetterli
IEEE J. Sel. Areas Commun.1
2015 DASS: Distributed Adaptive Sparse Sensing
abstract
Wireless sensor networks are often designed to perform two tasks: sensing a physical field and transmitting the data to end-users. A crucial design aspect of a WSN is the minimization of the overall energy consumption. Previous researchers aim at optimizing the energy spent for the communication, while mostly ignoring the energy cost of sensing. Recently, it has been shown that considering the sensing energy cost can be beneficial for further improving the overall energy efficiency. More precisely, sparse sensing techniques were proposed to reduce the amount of collected samples and recover the missing data using data statistics. While the majority of these techniques use fixed or random sampling patterns, we propose adaptively learning the signal model from the measurements and using the model to schedule when and where to sample the physical field. The proposed method requires minimal on-board computation, no inter-node communications, and achieves appealing reconstruction performance. With experiments on real-world datasets, we demonstrate significant improvements over both traditional sensing schemes and the state-of-the-art sparse sensing schemes, particularly when the measured data is characterized by a strong intra-sensor (temporal) or inter-sensors (spatial) correlation.
Zichong Chen, Juri Ranieri, Runwei Zhang, Martin Vetterli
IEEE Trans. Wirel. Commun.3