Scott C.-H. Huang

Learn More
Minimum-latency aggregation schedule (MLAS) in synchronous multihop wireless networks seeks a shortest schedule for data aggregation subject to the interference constraint. In this paper, we study MLAS under the protocol interference model in which each node has a unit communication radius and an interference radius ρ ≥ 1. All known aggregation(More)
Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of least latency [1] has a latency bound of (Delta - 1)<i>R</i>, where Delta is the maximum degree and R is the network radius. Since both Delta and <i>R</i> could be of the same(More)
Broadcast is a fundamental operation in wireless networks and naive flooding is not practical because it cannot deal with interference. Scheduling is a good way to avoid interference, but previous studies on broadcast scheduling algorithms all assume highly theoretical models such as the unit disk graph model. In this work, we re-investigate this problem(More)
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on the construction of a maximal independent set. The relation between the sizemis(G) of a maximum independent set and the size cds(G) of a minimum connected(More)
A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimum-Latency Broadcast Scheduling (MLBS) in wireless ad hoc networks represented by unit-disk graphs. This problem is NP-hard. A trivial lower bound on the minimum broadcast latency is(More)
2 Physical Layer 3 2.1 Attacks in the Physical Layer . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1.1 Device Tampering . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1.2 Eavesdropping . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1.3 Jamming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Countermeasures in the(More)
We studied the minimum-latency gossiping (all-to-all broadcast) problem in multi-hop wireless networks defined as follows. Each node in the network is initially given a message and the objective is to design a minimum-latency schedule such that each node distributes its message to all other nodes. We considered the unit-size message model, in which(More)