Demo Data from EDBT 2026 / reviewers in the wild / expert
Chang Su 0008
dblp:07/2757-8
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3
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 · 77% Internet of things and sensor networks · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking
broadcast |
0.1 | 1 | 2007 | Broadcasting in udg radio networks with unknown topology · PODC 2007 |
Wireless networking
radio networks |
0.1 | 1 | 2007 | Broadcasting in udg radio networks with unknown topology · PODC 2007 |
Wireless networking
wireless network protocols |
0.1 | 1 | 2007 | Broadcasting in udg radio networks with unknown topology · PODC 2007 |
Internet of things and sensor networks
wireless sensor network |
0.1 | 1 | 2007 | Broadcasting in udg radio networks with unknown topology · PODC 2007 |
Wireless networking › stochastic geometry
unit disk graphs |
0.0 | 1 | 2007 | Broadcasting in udg radio networks with unknown topology · PODC 2007 |
Methods — techniques the papers use, named apart from their topics
distributed broadcasting algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Broadcasting in UDG radio networks with unknown topology
Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su 0008 |
Distributed Comput. | 6 |
| 2008 | Time efficient k-shot broadcasting in known topology radio networks
Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su 0008 |
Distributed Comput. | 5 |
| 2007 | Broadcasting in udg radio networks with unknown topologyabstractWe consider broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a station hears a message (receives the message correctly) only if exactly one of its neighbors transmits at a given time step. One station of the network, called the source, has a message which has to be disseminated to all other stations. Stations are unaware of the network topology. Two broadcasting models are considered. In the conditional wake up model, the stations other than the source are initially idle and cannot transmit until they hear a message for the first time.In the spontaneous wake up model, all stations are awake (and may transmit messages) from the beginning. Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su 0008 |
PODC | 6 |
| 2007 | Energy and Time Efficient Broadcasting in Known Topology Radio Networks
Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su 0008 |
DISC | 5 |