D
Douglas M. Blough
Researcher at Georgia Institute of Technology
Publications - 167
Citations - 4468
Douglas M. Blough is an academic researcher from Georgia Institute of Technology. The author has contributed to research in topics: Wireless network & Scheduling (computing). The author has an hindex of 32, co-authored 158 publications receiving 4282 citations. Previous affiliations of Douglas M. Blough include University of California, Irvine.
Papers
More filters
Journal ArticleDOI
The critical transmitting range for connectivity in sparse wireless ad hoc networks
Paolo Santi,Douglas M. Blough +1 more
TL;DR: The critical transmitting range for connectivity in wireless ad hoc networks is analyzed and insight into how mobility affects connectivity is yielded and useful trade offs between communication capability and energy consumption are revealed.
Proceedings ArticleDOI
Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks
TL;DR: This paper presents a computationally efficient heuristic for computing a feasible schedule under the physical interference model and proves, under uniform random node distribution, an approximation factor for the length of this schedule relative to the shortest schedule possible with physical interference.
Proceedings ArticleDOI
Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks
Douglas M. Blough,Paolo Santi +1 more
TL;DR: This paper investigates the lifetime/density tradeoff under the hypothesis that nodes are distributed uniformly at random in a given region, and that the traffic is evenly distributed across the network and shows that even in this low density scenario, cell-based strategies can significantly extend network lifetime.
Proceedings ArticleDOI
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
TL;DR: In this paper, the authors propose an approach to topology control based on the principle of maintaining the number of neighbors of every node equal to or slightly below a specific value k. The approach enforces symmetry on the resulting communication graph, thereby easing the operation of higher layer protocols.
Journal ArticleDOI
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks
TL;DR: K-NEIGH, a fully distributed, asynchronous, and localized protocol that uses distance estimation, is defined, which guarantees logarithmically bounded physical degree at every node, is the most efficient known protocol, and relies on simpler assumptions than existing protocols.