3 citations · 7 across the 7 of their papers we have counts for
9 papers
Locally-iterative -Coloring in Sublinear (in ) Rounds
Xinyu Fu, Yitong Yin, Chaodong Zheng
Distributed graph coloring is one of the most extensively studied problems in distributed computing. There is a canonical family of distributed graph coloring algorithms known as t…
Robust and Optimal Contention Resolution without Collision Detection
Yonggang Jiang, Chaodong Zheng
We consider the classical contention resolution problem where nodes arrive over time, each with a message to send. In each synchronous slot, each node can send or remain idle. If i…
Tight Trade-off in Contention Resolution without Collision Detection
Haimin Chen, Yonggang Jiang, Chaodong Zheng
In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to sen…
Asynchronous Gossip in Smartphone Peer-to-Peer Networks
Calvin Newport, Alex Weaver, Chaodong Zheng
In this paper, we study gossip algorithms in communication models that describe the peer-to-peer networking functionality included in most standard smartphone operating systems. We…
Broadcasting Competitively against Adaptive Adversary in Multi-channel Radio Networks
Haimin Chen, Chaodong Zheng
Broadcasting in wireless networks is vulnerable to adversarial jamming. To thwart such behavior, \emph{resource competitive analysis} is proposed. In this framework, sending, liste…
Fast and Resource Competitive Broadcast in Multi-channel Radio Networks
Haimin Chen, Chaodong Zheng
Consider a single-hop, multi-channel, synchronous radio network in which a source node needs to disseminate a message to all other nodes. An adversary called Eve, which captu…
Approximate Neighbor Counting in Radio Networks
Calvin Newport, Chaodong Zheng
For many distributed algorithms, neighborhood size is an important parameter. In radio networks, however, obtaining this information can be difficult due to ad hoc deployments and…
Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs
Fabian Kuhn, Chaodong Zheng
Given a graph, a maximal independent set (MIS) is a maximal subset of pairwise non-adjacent vertices. Finding an MIS is a fundamental problem in distributed computing. Although the…
Communication Primitives in Cognitive Radio Networks
Seth Gilbert, Fabian Kuhn, Chaodong Zheng
Cognitive radio networks are a new type of multi-channel wireless network in which different nodes can have access to different sets of channels. By providing multiple channels, th…