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

Shin-Chih Tu

dblp:15/3518 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

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

Computer networks · 7Systems, architecture and hardware · 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
1 paper
Wireless networking · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › wireless personal area network › bluetooth network
scatternet
0.112006
A Traffic-Aware Scheduling for Bluetooth Scatternets · IEEE Trans. Mob. Comput. 2006
Wireless networking › scheduling › scheduling policy
traffic-aware scheduling
0.112006
A Traffic-Aware Scheduling for Bluetooth Scatternets · IEEE Trans. Mob. Comput. 2006

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

simulation · 0.1
YearPublicationVenuePosition
2010 Scalable continuous object detection and tracking in sensor networks
Shin-Chih Tu, Guey-Yun Chang, Jang-Ping Sheu, Kun-Ying Hsieh
J. Parallel Distributed Comput.1
2008 Location-free topology control protocol in wireless ad hoc networks
Jang-Ping Sheu, Shin-Chih Tu, Chi-Hung Hsu
Comput. Commun.2
2007 Location-Free Topology Control Protocol in Wireless Ad Hoc Networks
abstract
Topology control not only achieves the objective of power saving but also increases the system throughput by increasing the spatial reuse of communication channels. However, there exists a hidden terminal problem due to asymmetric transmission radii among nodes after topology control. In this paper, we propose a distributed protocol that deals with topology control at network layer and hidden terminal problem at MAC layer. Each node in the networks determines its power for data transmission and control packets transmission according to the received beacon messages from its neighbors. The proposed protocol works without location information and uses little control packet overhead to prevent the potential collisions due to the hidden terminals. Simulations show that our protocol significantly decreases total power consumption in the networks and has a better network throughput compared to previous work.
Jang-Ping Sheu, Shin-Chih Tu, Chi-Hung Hsu
WCNC2
2006 A Traffic-Aware Scheduling for Bluetooth Scatternets
abstract
Bluetooth is a low cost, low power, short-range radio technology used for wireless personal area networks (PANS). Bluetooth scatternet is a set of piconets interconnected via bridge devices. Good interpiconet schedulings are necessary for bridge devices to switch among piconets they participate in. This paper proposes an interpiconet scheduling algorithm named "Traffic-Aware Scatternet Scheduling" (TASS), for bridges in Bluetooth scatternets. According to masters' traffic information, TASS can adaptively switch the bridge to high traffic load masters, and increase the usage of the bridge. In addition, TASS can reduce the number of failed "unsniffs" and the overhead of "bridge switch wastes" to further increase overall system performance. Simulation results show that TASS outperforms existing interpiconet scheduling in both network throughput and adaptability for various traffic loads.
Jang-Ping Sheu, Kuei-Ping Shih, Shin-Chih Tu, Chao-Hsun Cheng
IEEE Trans. Mob. Comput.3
2005 A distributed protocol for query execution in sensor networks
abstract
The paper proposes an efficient distributed protocol to find a subset of connected sensor nodes to cover the queried region. Each node determines whether to be a sensing node to sense the queried region according to its priority, which is represented by the remaining power or sensing area within the queried region. The proposed protocol can efficiently construct a subset of connected sensing nodes and respond the query request to the sink node. Simulation results show that the proposed protocol is more efficient and has a lower communication overhead than the existing protocol.
Jang-Ping Sheu, Chia-Hao Yu, Shin-Chih Tu
WCNC3
2003 Obstacle-free geocasting protocol for ad hoc wireless networks
abstract
Mobile ad hoc networks (MANET) comprise mobile hosts in a network bereft of base stations and characterized by a highly dynamic network topology. The MANET environment contains unpredictable obstacles, such as mountains, lakes, buildings, or regions without any hosts, impeding or blocking message relay. This study proposes geocasting protocol for sending short message from a source host to a geocasting region in ad hoc networks. The proposed protocol keeps messages away from unpredictable obstacles and creates a small flooding region. Experimental results show that a source host can send a short message to all hosts located in geographical area with a high success rate and low flooding overhead.
Chih-Yung Chang, Chao-Tsun Chang, Shin-Chih Tu
WCNC3
2003 Obstacle-Free Geocasting Protocols for Single/Multi-Destination Short Message Services in Ad Hoc Networks
Chih-Yung Chang, Chao-Tsun Chang, Shin-Chih Tu
Wirel. Networks3
2002 Active route-maintenance protocol for signal-based communication path in ad hoc networks
Chih-Yung Chang, Shin-Chih Tu
J. Netw. Comput. Appl.2