[图书][B] Stochastic network optimization with application to communication and queueing systems
M Neely - 2022 - books.google.com
This text presents a modern theory of analysis, control, and optimization for dynamic
networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are …
networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are …
On the age of information in a CSMA environment
In this paper, we investigate a network where N links contend for the channel using the well-
known carrier sense multiple access scheme. By leveraging the notion of stochastic hybrid …
known carrier sense multiple access scheme. By leveraging the notion of stochastic hybrid …
Network utility maximization-based congestion control over wireless networks: A survey and potential directives
Since the initial publication of Kelly et al.'s seminal paper on resource allocation in wired
networks, a large number of studies based on the network utility maximization (NUM) …
networks, a large number of studies based on the network utility maximization (NUM) …
Q-CSMA: Queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks
Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access
algorithms can achieve the maximum possible throughput in ad hoc wireless networks …
algorithms can achieve the maximum possible throughput in ad hoc wireless networks …
[HTML][HTML] Future strategic plan analysis for integrating distributed renewable generation to smart grid through wireless sensor network: Malaysia prospect
S Zahurul, N Mariun, IV Grozescu, H Tsuyoshi… - … and Sustainable Energy …, 2016 - Elsevier
Abstract Integration of Distributed Renewable Generation (DRG) to the future Smart Grid
(SG) is one of the important considerations that is highly prioritized in the SG development …
(SG) is one of the important considerations that is highly prioritized in the SG development …
Routing without routes: The backpressure collection protocol
S Moeller, A Sridharan, B Krishnamachari… - Proceedings of the 9th …, 2010 - dl.acm.org
Current data collection protocols for wireless sensor networks are mostly based on quasi-
static minimum-cost routing trees. We consider an alternative, highly-agile approach called …
static minimum-cost routing trees. We consider an alternative, highly-agile approach called …
Markov approximation for combinatorial network optimization
Many important network design problems are fundamentally combinatorial optimization
problems. A large number of such problems, however, cannot readily be tackled by …
problems. A large number of such problems, however, cannot readily be tackled by …
On combining shortest-path and back-pressure routing over multihop wireless networks
Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have
recently received much attention for jointly routing and scheduling over multihop wireless …
recently received much attention for jointly routing and scheduling over multihop wireless …
Does full-duplex double the capacity of wireless networks?
Full-duplex has emerged as a new communication paradigm and is anticipated to double
wireless capacity. Existing studies of full-duplex mainly focused on its PHY layer design …
wireless capacity. Existing studies of full-duplex mainly focused on its PHY layer design …
Network adiabatic theorem: An efficient randomized protocol for contention resolution
The popularity of Aloha-like algorithms for resolution of contention between multiple entities
accessing common resources is due to their extreme simplicity and distributed nature …
accessing common resources is due to their extreme simplicity and distributed nature …