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

Yanli Cai

dblp:26/1702 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 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 networks
2 papers
Internet of things and sensor networks · 95% Wireless sensing and localization · 5%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network
directional sensor networks
0.222009
Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks · IEEE Trans. Computers 2009
Target-Oriented Scheduling in Directional Sensor Networks · INFOCOM 2007
Internet of things and sensor networks › energy efficiency
sensor network lifetime
0.222009
Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks · IEEE Trans. Computers 2009
Target-Oriented Scheduling in Directional Sensor Networks · INFOCOM 2007
Internet of things and sensor networks › wireless sensor network › coverage and connectivity
target coverage
0.222009
Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks · IEEE Trans. Computers 2009
Target-Oriented Scheduling in Directional Sensor Networks · INFOCOM 2007

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

heuristic algorithm · 0.2NP-completeness proof · 0.1simulation · 0.1
YearPublicationVenuePosition
2009 Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks
abstract
Unlike convectional omnidirectional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to the technical constraints or cost considerations. A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover all the targets in a given area. Power conservation is still an important issue in such directional sensor networks. In this paper, we address the multiple directional cover sets (MDCS) problem of organizing the directions of sensors into a group of non-disjoint cover sets to extend the network lifetime. One cover set in which the directions cover all the targets is activated at one time. We prove the MDCS to be NP-complete and propose several algorithms for the MDCS. Simulation results are presented to demonstrate the performance of these algorithms.
Yanli Cai, Wei Lou, Minglu Li 0001, Xiang-Yang Li 0001
IEEE Trans. Computers1
2007 Target-Oriented Scheduling in Directional Sensor Networks
abstract
Unlike convectional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical constraints or cost considerations. A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover all the targets in a given area. Power conservation is still an important issue in such directional sensor networks. In this paper, we address the multiple directional cover sets problem (MDCS) of organizing the directions of sensors into a group of non-disjoint cover sets to extend the network lifetime. One cover set, in which the directions cover all the targets, is activated at one time. We prove the MDCS to be NP-complete and propose three heuristic algorithms for the MDCS. Simulation results are also presented to demonstrate the performance of these algorithms.
Yanli Cai, Wei Lou, Minglu Li 0001
INFOCOM1
2006 An Area-Based Collaborative Sleeping Protocol for Wireless Sensor Networks
Yanli Cai, Minglu Li 0001, Min-You Wu
APWeb1
2005 ACOS: A Precise Energy-Aware Coverage Control Protocol for Wireless Sensor Networks
Yanli Cai, Minglu Li 0001, Wei Shu, Min-You Wu
MSN1