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.

Dene A. Hedges

dblp:203/9388 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0001-9402-3630ORCID · corroborated

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

Computer networks · 2 · 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
Wireless networking · 39% Routing and switching · 30% Physical-layer communications · 30%

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

TopicWeightPapersLastEvidence papers
Wireless networking › wireless mesh network
multihop wireless network
0.412020
A Continuum Model for Route Optimization in Large-Scale Inhomogeneous Multi-Hop Wireless Networks · IEEE Trans. Commun. 2020
Physical-layer communications › outage probability
outage probability minimization
0.412020
A Continuum Model for Route Optimization in Large-Scale Inhomogeneous Multi-Hop Wireless Networks · IEEE Trans. Commun. 2020
Routing and switching
route optimization
0.412020
A Continuum Model for Route Optimization in Large-Scale Inhomogeneous Multi-Hop Wireless Networks · IEEE Trans. Commun. 2020

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

lagrangian optimization · 0.4calculus of variations · 0.4
YearPublicationVenuePosition
2020 A Continuum Model for Route Optimization in Large-Scale Inhomogeneous Multi-Hop Wireless Networks
abstract
Multi-hop route optimization in large-scale inhomogeneous networks is typically NP-hard, for most problem formulations, requiring the application of heuristics which, despite their relatively low processing complexity, find suboptimal solutions. Where optimal solutions can be determined by Lagrangian based constrained optimization techniques for example, the processing complexity typically scales like O(N3), N being the number of relays employed. Here, we propose an alternative approach to route optimization by considering the limit of infinite relay node density to develop a continuum model, which yields an optimized equivalent continuous relay path. The model is carefully constructed to maintain a constant connection density even though the node density scales without bound. This leads to a formulation for minimizing the end-to-end outage probability that can be solved using methods from the calculus of variations. With the continuum model, we show that the processing complexity scales linearly with the number of points that sample the continuous path, which can be lower than the number of relay nodes in a large scale network. We demonstrate the effectiveness of this new approach and its potential by considering a network subjected to point sources of interference.
Dene A. Hedges, Justin P. Coon, Gaojie Chen 0001
IEEE Trans. Commun.1
2017 Location-based coverage probability for distributed antenna systems in finite-area networks
abstract
The performance of distributed wireless communication systems is dictated by the system boundaries and the interference regimes. In this paper, we present a novel coverage and connectivity analysis of a wireless system within confined domains. Specifically, a system where the receiver connects to the nearest transmitter is analyzed. Using tools from stochastic geometry, we derive general expressions quantifying the dependence of the system performance on the location of the receiver for general geometries, inclusive of circles and rectangles. The developed theory and expressions provide new insights on where additional nodes must be deployed in an existing network in order to maximize a desired quality of service. We further extend the analysis to networks with multiple collaborating transmitters which use maximum ratio transmission (MRT) or joint transmission such as in CoMP and other distributed antenna systems. Our results indicate that while having more collaborating transmitters can improve the performance of the system, artefacts due to the domain geometries cannot be eliminated. We corroborate our analysis through simulations.
Mohammud Z. Bocus, Orestis Georgiou, Justin P. Coon, Dene A. Hedges
ICC4