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

Chen-Hsiang Feng

dblp:18/7972 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2013
—ORCID · none

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

Computer networks · 4 · 3 first-authorHuman-computer interaction and ubiquitous computing · 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
Routing and switching · 65% Internet of things and sensor networks · 22% Wireless networking · 13%

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

TopicWeightPapersLastEvidence papers
Routing and switching
geographic routing
0.112012
Stateless Multicast Protocol for Ad Hoc Networks · IEEE Trans. Mob. Comput. 2012
Routing and switching
multicast routing
0.112012
Stateless Multicast Protocol for Ad Hoc Networks · IEEE Trans. Mob. Comput. 2012
Routing and switching › multicast routing
stateless multicast
0.112012
Stateless Multicast Protocol for Ad Hoc Networks · IEEE Trans. Mob. Comput. 2012
Internet of things and sensor networks › wireless sensor network
wireless sensor network routing
0.112012
Stateless Multicast Protocol for Ad Hoc Networks · IEEE Trans. Mob. Comput. 2012
Wireless networking › mobile ad hoc networks
dynamic topology
0.012012
Stateless Multicast Protocol for Ad Hoc Networks · IEEE Trans. Mob. Comput. 2012
Wireless networking
mobile ad hoc networks
0.012012
Stateless Multicast Protocol for Ad Hoc Networks · IEEE Trans. Mob. Comput. 2012

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

simulation · 0.1OPNET · 0.1
YearPublicationVenuePosition
2013 UPS: Universal Protocol Stack for emerging wireless networks
Chen-Hsiang Feng, Ilker Demirkol, Wendi B. Heinzelman
Ad Hoc Networks1
2012 Stateless Multicast Protocol for Ad Hoc Networks
abstract
Multicast routing protocols typically rely on the a priori creation of a multicast tree (or mesh), which requires the individual nodes to maintain state information. In dynamic networks with bursty traffic, where long periods of silence are expected between the bursts of data, this multicast state maintenance adds a large amount of communication, processing, and memory overhead for no benefit to the application. Thus, we have developed a stateless receiver-based multicast (RBMulticast) protocol that simply uses a list of the multicast members' (e.g., sinks') addresses, embedded in packet headers, to enable receivers to decide the best way to forward the multicast traffic. This protocol, called Receiver-Based Multicast, exploits the knowledge of the geographic locations of the nodes to remove the need for costly state maintenance (e.g., tree/mesh/neighbor table maintenance), making it ideally suited for multicasting in dynamic networks. RBMulticast was implemented in the OPNET simulator and tested using a sensor network implementation. Both simulation and experimental results confirm that RBMulticast provides high success rates and low delay without the burden of state maintenance.
Chen-Hsiang Feng, Yuqun Zhang, Ilker Demirkol, Wendi B. Heinzelman
IEEE Trans. Mob. Comput.1
2010 Energy-Efficient Duty Cycle Assignment for Receiver-Based Convergecast in Wireless Sensor Networks
abstract
Duty cycling is often used to reduce the energy consumption caused by idle listening in Wireless Sensor Networks (WSNs). Most studies on WSN protocols define a common duty cycle value throughout the network to achieve synchronization among the nodes. On the other hand, a few studies propose adaptation of the duty cycle according to uniform traffic conditions, which is beneficial assuming one-to-one traffic patterns that result in evenly distributed packet traffic. In this work, we consider the convergecast communication pattern commonly observed in WSNs. In convergecast communication, the packet traffic observed around the sink node is much higher than the traffic observed far from the sink, i.e., nodes with different distances to the sink node receive and must relay different amounts of traffic. Additionally, we utilize receiver-based protocols, which enable nodes to communicate with no synchronization or neighbor information, and hence do not require all nodes in the network to have the same duty cycle. In this paper, we model the expected energy consumption of nodes utilizing receiver-based protocols as a function of their duty cycle and their distance to the sink node. Using this analysis, we derive a closed-form formula for the duty cycle that minimizes the expected energy consumption at a given distance. Moreover, we propose an adaptation method for the derived distance-based duty cycle, based on local observed traffic. Performance evaluations of the two proposed duty cycle assignment methods show that they greatly improve the energy efficiency without sacrificing packet delivery ratio or delay significantly.
Yuqun Zhang, Chen-Hsiang Feng, Ilker Demirkol, Wendi B. Heinzelman
GLOBECOM2
2009 UPS: Unified Protocol Stack for wireless sensor networks
abstract
In this paper, we propose a complete protocol stack framework called UPS (Unified Protocol Stack) as a solution for incorporating different protocols within WSNs through enabling the co-existence of multiple modules in same stack layer as well as providing unified access to cross-layer data.
Chen-Hsiang Feng, Ilker Demirkol, Wendi B. Heinzelman
MobiQuitous1
2009 RBMulticast: receiver based multicast for wireless sensor networks
abstract
Multicast routing protocols typically rely on the a-priori creation of a multicast tree (or mesh), which requires the individual nodes to maintain state information. In sensor networks where traffic is bursty, with long periods of silence between the bursts of data, this multicast state maintenance adds a large amount of overhead for no benefit to the application. Thus, we have developed a stateless receiver-based multicast protocol that simply uses a list of the multicast members (e.g., sinks), embedded in packet headers, to enable receivers to decide the best way to forward the multicast traffic. This protocol, called RBMulticast (Receiver-Based Multicast), exploits the knowledge of the geographic locations of the nodes to remove the need for costly state maintenance (e.g., tree/mesh/neighbor table maintenance), making it ideally suited for sensor network multicast applications. RBMulticast was implemented in TinyOS and tested using a sensor network implementation as well as TOSSIM simulations. Both simulation and experimental results confirm that RBMulticast provides high success rates without the burden of state maintenance.
Chen-Hsiang Feng, Wendi B. Heinzelman
WCNC1