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

Ming-Shing Kuo

dblp:133/3603 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1

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 · 51% Wireless networking · 32% Routing and switching · 16%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network
network lifetime
0.212014
Joint Design of Asynchronous Sleep-Wake Scheduling and Opportunistic Routing in Wireless Sensor Networks · IEEE Trans. Computers 2014
Routing and switching
opportunistic routing
0.212014
Joint Design of Asynchronous Sleep-Wake Scheduling and Opportunistic Routing in Wireless Sensor Networks · IEEE Trans. Computers 2014
Internet of things and sensor networks
wireless sensor network
0.212014
Joint Design of Asynchronous Sleep-Wake Scheduling and Opportunistic Routing in Wireless Sensor Networks · IEEE Trans. Computers 2014
Wireless networking › medium access control
MAC protocol
0.212013
The Elimination of Spatial-Temporal Uncertainty in Underwater Sensor Networks · IEEE/ACM Trans. Netw. 2013
Wireless networking › medium access control › TDMA
TDMA scheduling
0.212013
The Elimination of Spatial-Temporal Uncertainty in Underwater Sensor Networks · IEEE/ACM Trans. Netw. 2013
Internet of things and sensor networks
underwater sensor networks
0.212013
The Elimination of Spatial-Temporal Uncertainty in Underwater Sensor Networks · IEEE/ACM Trans. Netw. 2013
Internet of things and sensor networks › energy efficiency
sleep-wake scheduling
0.112014
Joint Design of Asynchronous Sleep-Wake Scheduling and Opportunistic Routing in Wireless Sensor Networks · IEEE Trans. Computers 2014
Wireless networking
medium access control
0.012013
The Elimination of Spatial-Temporal Uncertainty in Underwater Sensor Networks · IEEE/ACM Trans. Netw. 2013

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

vertex coloring · 0.2mixed integer linear programming · 0.2heuristic · 0.2
YearPublicationVenuePosition
2014 Joint Design of Asynchronous Sleep-Wake Scheduling and Opportunistic Routing in Wireless Sensor Networks
abstract
Designing a lifetime-maximization routing in wireless sensor networks poses a great challenge mainly due to unreliable wireless links and limited power supply. Recently, two natural advantages of opportunistic routing, i.e., path diversity and the improvement of transmission reliability, are exploited to develop a lifetime-extended opportunistic routing for wireless sensor networks. Besides, asynchronous sleep-wake scheduling is an effective mechanism to reduce energy consumption by appropriately arranging sensor nodes to sleep. Hence, in this paper, we propose a joint design of asynchronous sleep-wake schedules and opportunistic routing, called ASSORT, to maximize the network lifetime. Simulation results show that ASSORT effectively achieves network lifetime extension compared with other routing schemes.
Chih-Cheng Hsu, Ming-Shing Kuo, Shi-Chen Wang, Cheng-Fu Chou
IEEE Trans. Computers2
2013 The Elimination of Spatial-Temporal Uncertainty in Underwater Sensor Networks
abstract
Since data in underwater sensor networks (UWSNs) is transmitted by acoustic signals, the characteristics of a UWSN are different from those of a terrestrial sensor network. Specifically, due to the high propagation delay of acoustic signals in UWSNs, referred as spatial-temporal uncertainty, current terrestrial MAC schemes do not work well in UWSNs. Hence, we consider spatial-temporal uncertainty in the design of an energy-efficient TDMA-based MAC protocol for UWSNs. We first translate the TDMA-based scheduling problem in UWSNs into a special vertex-coloring problem in the context of a spatial-temporal conflict graph (ST-CG) that describes explicitly the conflict delays among transmission links. With the help of the ST-CG, we propose two novel heuristic approaches: 1) the traffic-based one-step trial approach (TOTA) to solve the coloring problem in a centralized fashion; and for scalability, 2) the distributed traffic-based one-step trial approach (DTOTA) to assign the data schedule for tree-based routing structures in a distributed manner. In addition, a mixed integer linear programming (MILP) model is derived to obtain a theoretical bound for the TDMA-based scheduling problem in UWSNs. Finally, a comprehensive performance study is presented, showing that both TOTA and DTOTA guarantee collision-free transmission. They thus outperform existing MAC schemes such as S-MAC, ECDiG, and T-Lohi in terms of network throughput and energy consumption.
Chih-Cheng Hsu, Ming-Shing Kuo, Cheng-Fu Chou, Kate Ching-Ju Lin
IEEE/ACM Trans. Netw.2