On the public citation graph

Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks

0 signed · 129 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/ett.4460080106openalex-snapshot
Charging and rate control for elastic traffic
inferredcites →https://doi.org/10.1007/978-0-8176-8216-3openalex-snapshot
The Mathematics of Internet Congestion Control
inferredcites →https://doi.org/10.1007/978-1-349-13908-8_1openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-1-4471-3267-7openalex-snapshot
Markov Chains and Stochastic Stability
inferredcites →https://doi.org/10.1007/s11134-005-1450-0openalex-snapshot
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
inferredcites →https://doi.org/10.1016/s0140-3664(00)00345-5openalex-snapshot
Computer Networks: A Systems Approach
inferredcites →https://doi.org/10.1017/s0269964804182041openalex-snapshot
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
inferredcites →https://doi.org/10.1038/sj.jors.2600523openalex-snapshot
Rate control for communication networks: shadow prices, proportional fairness and stability
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1057/palgrave.jors.2600523openalex-snapshot
Rate control for communication networks: shadow prices, proportional fairness and stability
inferredcites →https://doi.org/10.1109/18.21215openalex-snapshot
Link scheduling in polynomial time
inferredcites →https://doi.org/10.1109/9.182479openalex-snapshot
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
inferredcites →https://doi.org/10.1109/90.811451openalex-snapshot
Optimization flow control. I. Basic algorithm and convergence
inferredcites →https://doi.org/10.1109/90.879352openalex-snapshot
A game theoretic framework for bandwidth allocation and pricing in broadband networks
inferredcites →https://doi.org/10.1109/cdc.2004.1430253openalex-snapshot
Joint rate control and scheduling in multihop wireless networks
inferredcites →https://doi.org/10.1109/cdc.2005.1583011openalex-snapshot
Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing
inferredcites →https://doi.org/10.1109/cdc.2006.377473openalex-snapshot
Randomized Algorithms for Throughput-Optimality and Fairness in Wireless Networks
inferredcites →https://doi.org/10.1109/infcom.1998.665071openalex-snapshot
Linear complexity algorithms for maximum throughput in radio networks and input queued switches
inferredcites →https://doi.org/10.1109/infcom.2003.1208724openalex-snapshot
Dynamic power allocation and routing for time varying wireless networks
inferredcites →https://doi.org/10.1109/infcom.2005.1498453openalex-snapshot
Fairness and optimal stochastic control for heterogeneous networks
inferredcites →https://doi.org/10.1109/infcom.2005.1498459openalex-snapshot
Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control
inferredcites →https://doi.org/10.1109/infcom.2005.1498460openalex-snapshot
The impact of imperfect scheduling on cross-layer rate control in wireless networks
inferredcites →https://doi.org/10.1109/infocom.2006.142openalex-snapshot
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1109/infocom.2006.210openalex-snapshot
Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks
inferredcites →https://doi.org/10.1109/izs.2006.1649087openalex-snapshot
Resource Allocation in Multi-hop Wireless Networks
inferredcites →https://doi.org/10.1109/jsac.2006.879361openalex-snapshot
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
inferredcites →https://doi.org/10.1109/tac.2004.841398openalex-snapshot
The Mathematics of Internet Congestion Control
inferredcites →https://doi.org/10.1109/tit.1984.1056928openalex-snapshot
Some complexity results about packet radio networks (Corresp.)
inferredcites →https://doi.org/10.1109/tit.2007.913537openalex-snapshot
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
inferredcites →https://doi.org/10.1109/tnet.2004.842226openalex-snapshot
Stable scheduling policies for fading wireless channels
inferredcites →https://doi.org/10.1145/1140103.1140283openalex-snapshot
Maximizing throughput in wireless networks via gossiping
inferredcites →https://doi.org/10.1145/1140277.1140283openalex-snapshot
Maximizing throughput in wireless networks via gossiping
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.48550/arxiv.cs/0611064openalex-snapshot
Distributed Link Scheduling with Constant Overhead

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.2481openalex-snapshot
Parallel relay‐assisted three‐phase MIMO space division multiple access transmission for multi‐hop throughput improvement
inferred← citeshttps://doi.org/10.1002/wcm.897openalex-snapshot
Towards utility‐optimal random access without message passing
inferred← citeshttps://doi.org/10.1007/s11134-009-9148-3openalex-snapshot
Coding and control for communication networks
inferred← citeshttps://doi.org/10.1007/s11134-016-9471-4openalex-snapshot
Dynamic scheduling with reconfiguration delays
inferred← citeshttps://doi.org/10.1007/s11276-009-0208-8openalex-snapshot
Control of wireless networks with flow level dynamics under constant time scheduling
inferred← citeshttps://doi.org/10.1007/s11277-014-2033-3openalex-snapshot
Dynamic Control Policy for Delay Guarantees in Multi-hop Wireless Networks
inferred← citeshttps://doi.org/10.1007/s11277-015-3130-7openalex-snapshot
Combined Genetic and Fuzzy Approach for Shortest Path Routing Problem in Ad hoc Networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2016.02.020openalex-snapshot
Maximal throughput scheduling based on the physical interference model using learning automata
inferred← citeshttps://doi.org/10.1016/j.comcom.2016.12.015openalex-snapshot
Imola: A decentralised learning-driven protocol for multi-hop White-Fi
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.10.001openalex-snapshot
Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
inferred← citeshttps://doi.org/10.1016/j.mcm.2010.08.010openalex-snapshot
Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks
inferred← citeshttps://doi.org/10.1016/j.peva.2007.06.019openalex-snapshot
A distributed switch scheduling algorithm
inferred← citeshttps://doi.org/10.1109/acssc.2007.4487344openalex-snapshot
Resource Allocation in Multiple Access Channels
inferred← citeshttps://doi.org/10.1109/aina.2012.71openalex-snapshot
Scheduling and Flow Control for Delay Guarantees in Multi-hop Wireless Networks
inferred← citeshttps://doi.org/10.1109/aina.2012.72openalex-snapshot
Stochastic Optimization for Minimum Outage in Cooperative Ad-hoc Network
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797741openalex-snapshot
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394849openalex-snapshot
Implementing utility-optimal CSMA
inferred← citeshttps://doi.org/10.1109/cdc.2006.377473openalex-snapshot
Randomized Algorithms for Throughput-Optimality and Fairness in Wireless Networks
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558650openalex-snapshot
Appropriate control of wireless networks with flow level dynamics
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558652openalex-snapshot
Imperfect randomized algorithms for the optimal control of wireless networks
inferred← citeshttps://doi.org/10.1109/icc.2008.584openalex-snapshot
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
inferred← citeshttps://doi.org/10.1109/icccn.2011.6005921openalex-snapshot
Power Control for AP-Based Wireless Networks under the SINR Interference Model: Complexity and Efficient Algorithm Development
inferred← citeshttps://doi.org/10.1109/infcom.2007.42openalex-snapshot
On Optimal MAC Scheduling With Physical Interference
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062086openalex-snapshot
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062161openalex-snapshot
Scheduling in Mobile Ad Hoc Networks with Topology and Channel-State Uncertainty
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462026openalex-snapshot
Optimal Control of Wireless Networks with Finite Buffers
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462087openalex-snapshot
An Investigation on the Nature of Wireless Scheduling
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462281openalex-snapshot
Joint Random Access and Power Selection for Maximal Throughput in Wireless Networks
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935164openalex-snapshot
Scheduling in parallel queues with randomly varying connectivity and switchover delay
inferred← citeshttps://doi.org/10.1109/infocom.2008.110openalex-snapshot
Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks
inferred← citeshttps://doi.org/10.1109/infocom.2008.186openalex-snapshot
A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/infocom.2008.96openalex-snapshot
Cluster-Based Back-Pressure Routing Algorithm
inferred← citeshttps://doi.org/10.1109/infocom.2014.6847949openalex-snapshot
Distributed learning for utility maximization over CSMA-based wireless multihop networks
inferred← citeshttps://doi.org/10.1109/ita.2008.4601054openalex-snapshot
Dynamic rate allocation in fading multiple access channels
inferred← citeshttps://doi.org/10.1109/ita.2008.4601070openalex-snapshot
On throughput optimality with delayed network-state information
inferred← citeshttps://doi.org/10.1109/jiot.2021.3068182openalex-snapshot
Throughput Enhancement of Full-Duplex CSMA Networks Using Multiplayer Bandits
inferred← citeshttps://doi.org/10.1109/milcom.2007.4454969openalex-snapshot
On the Scaling Law of Network Coding Gains in Wireless Networks
inferred← citeshttps://doi.org/10.1109/spcom.2010.5560546openalex-snapshot
Past queue length based low-overhead link scheduling in multi-beam wireless mesh networks
inferred← citeshttps://doi.org/10.1109/tac.2012.2190309openalex-snapshot
Scheduling in Mobile Ad Hoc Networks With Topology and Channel-State Uncertainty
inferred← citeshttps://doi.org/10.1109/tac.2013.2240098openalex-snapshot
On the Value of Coordination and Delayed Queue Information in Multicellular Scheduling
inferred← citeshttps://doi.org/10.1109/tcns.2017.2659624openalex-snapshot
Stable Wireless Network Control Under Service Constraints
inferred← citeshttps://doi.org/10.1109/tit.2010.2053902openalex-snapshot
On Resource Allocation in Fading Multiple-Access Channels–An Efficient Approximate Projection Approach
inferred← citeshttps://doi.org/10.1109/tit.2011.2133130openalex-snapshot
Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints
inferred← citeshttps://doi.org/10.1109/tit.2011.2158879openalex-snapshot
On Throughput Optimality With Delayed Network-State Information
inferred← citeshttps://doi.org/10.1109/tit.2012.2203294openalex-snapshot
Dynamic Server Allocation Over Time-Varying Channels With Switchover Delay
inferred← citeshttps://doi.org/10.1109/tmc.2010.90openalex-snapshot
Economy of Spectrum Access in Time Varying Multichannel Networks
inferred← citeshttps://doi.org/10.1109/tmc.2011.33openalex-snapshot
Local Greedy Approximation for Scheduling in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tmc.2011.58openalex-snapshot
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
inferred← citeshttps://doi.org/10.1109/tmc.2012.26openalex-snapshot
On Random Access Scheduling for Multimedia Traffic in Multihop Wireless Networks with Fading Channels
inferred← citeshttps://doi.org/10.1109/tmc.2019.2949291openalex-snapshot
Low-Overhead Wireless Uplink Scheduling for Large-Scale Internet-of-Things
inferred← citeshttps://doi.org/10.1109/tnet.2008.2010857openalex-snapshot
Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2013621openalex-snapshot
Distributed Link Scheduling With Constant Overhead
inferred← citeshttps://doi.org/10.1109/tnet.2009.2021609openalex-snapshot
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2030681openalex-snapshot
Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2035046openalex-snapshot
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2010.2050903openalex-snapshot
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
inferred← citeshttps://doi.org/10.1109/tnet.2010.2094204openalex-snapshot
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2011.2116124openalex-snapshot
Achieving MAC-Layer Fairness in CSMA/CA Networks
inferred← citeshttps://doi.org/10.1109/tnet.2011.2141682openalex-snapshot
Cluster-Based Back-Pressure Routing Algorithm
inferred← citeshttps://doi.org/10.1109/tnet.2011.2176140openalex-snapshot
Optimal Control of Wireless Networks With Finite Buffers
inferred← citeshttps://doi.org/10.1109/tnet.2013.2273100openalex-snapshot
Distributed Link Scheduling Under SINR Model in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2013.2289980openalex-snapshot
Optimization Decomposition for Scheduling and System Configuration in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2013.2292604openalex-snapshot
Scheduling in Networks With Time-Varying Channels and Reconfiguration Delay
inferred← citeshttps://doi.org/10.1109/tnet.2017.2761191openalex-snapshot
On the Possibility of Network Scheduling With Polynomial Complexity and Delay
inferred← citeshttps://doi.org/10.1109/tnet.2019.2891018openalex-snapshot
Energy Efficient and Throughput Optimal CSMA Scheme
inferred← citeshttps://doi.org/10.1109/tpds.2013.202openalex-snapshot
Distributed Throughput Maximization in Wireless Networks Using the Stability Region
inferred← citeshttps://doi.org/10.1109/tvt.2010.2058875openalex-snapshot
Distributed Cross-Layer Optimization for Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/twc.2011.083111.110194openalex-snapshot
On the Performance of Back-Pressure Scheduling Schemes with Logarithmic Weight
inferred← citeshttps://doi.org/10.1109/twc.2015.2446983openalex-snapshot
On the Analysis of Scheduling in Dynamic Duplex Multihop mmWave Cellular Systems
inferred← citeshttps://doi.org/10.1109/twc.2017.2764081openalex-snapshot
Game Theoretic Perspective of Optimal CSMA
inferred← citeshttps://doi.org/10.1109/twc.2019.2959295openalex-snapshot
Optimal Link Scheduling in Millimeter Wave Multi-Hop Networks With MU-MIMO Radios
inferred← citeshttps://doi.org/10.1109/wicom.2009.5301668openalex-snapshot
Cross-Layer Rate Control and Dynamic Scheduling in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/wiopt.2009.5291606openalex-snapshot
Distributed throughput maximization in wireless networks via random power allocation
inferred← citeshttps://doi.org/10.1142/s1793830920500585openalex-snapshot
Distributed link scheduling in wireless networks
inferred← citeshttps://doi.org/10.1145/1254882.1254920openalex-snapshot
Distributed link scheduling with constant overhead
inferred← citeshttps://doi.org/10.1145/1269899.1254920openalex-snapshot
Distributed link scheduling with constant overhead
inferred← citeshttps://doi.org/10.1145/1374618.1374624openalex-snapshot
Complexity in wireless scheduling
inferred← citeshttps://doi.org/10.1145/1374618.1374634openalex-snapshot
A local greedy scheduling scheme with provable performance guarantee
inferred← citeshttps://doi.org/10.1145/1530748.1530757openalex-snapshot
Delay and effective throughput of wireless scheduling in heavy traffic regimes
inferred← citeshttps://doi.org/10.1145/1868521.1868547openalex-snapshot
On the achievable forwarding capacity of an infinite wireless network
inferred← citeshttps://doi.org/10.1155/2013/376028openalex-snapshot
Throughput-Optimal Scheduling for Cooperative Communications in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.15680/ijircce.2015.0302030openalex-snapshot
Scheduling using Optimization Decomposition in Wireless Network with Time Performance Analysis
inferred← citeshttps://doi.org/10.2200/s00270ed1v01y201008cnt006openalex-snapshot
Scheduling and Congestion Control for Wireless and Processing Networks
inferred← citeshttps://doi.org/10.23919/wiopt.2018.8362813openalex-snapshot
Efficient and low-overhead uplink scheduling for large-scale wireless Internet-of-Things
inferred← citeshttps://doi.org/10.4108/icst.broadnets2009.7401openalex-snapshot
Convergence and Tradeoff of Utility-Optimal CSMA
inferred← citeshttps://doi.org/10.4108/icst.wicon2008.4995openalex-snapshot
A fluid-flow model for backlog-based CSMA policies
inferred← citeshttps://doi.org/10.48550/arxiv.1107.1829openalex-snapshot
Medium Access Control for Wireless Networks with Peer-to-Peer State Exchange
inferred← citeshttps://doi.org/10.48550/arxiv.1208.2972openalex-snapshot
Wireless Network Design Under Service Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1712.03063openalex-snapshot
Energy Efficient and Throughput Optimal CSMA Scheme
inferred← citeshttps://doi.org/10.48550/arxiv.1806.08877openalex-snapshot
Technical Report on Optimal Link Scheduling in Millimeter Wave Multi-hop Networks with Space Division Multiple Access and Multiplexing
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611064openalex-snapshot
Distributed Link Scheduling with Constant Overhead
inferred← citeshttps://doi.org/10.5281/zenodo.21596135openalex-snapshot
Scheduling Algorithms for Efficient Sensor for Self- Deployment in Mobile Sensor Networks
inferred← citeshttps://doi.org/10.5555/1554126.1554222openalex-snapshot
A fluid-flow model for backlog-based CSMA policies
inferred← citeshttps://doi.org/10.5555/2414276.2414293openalex-snapshot
Multidirectional forwarding capacity in a massively dense wireless network
inferred← citeshttps://doi.org/10.7939/r3ft1jopenalex-snapshot
On Channel Access Design for Wireless Networks with Multi-Packet Reception
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.