Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Delay Constrained Utility Maximization in Multihop Random Access Networks (1011.5124v1)

Published 23 Nov 2010 in cs.IT, cs.NI, cs.SY, math.IT, and math.OC

Abstract: Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in order to optimize performance of such networks, however proposed algorithms result in large transmission delays. In this paper, we will analyze delay in random access multi-hop networks and solve the delay-constrained utility maximization problem. We define the network utility as a combination of rate utility and energy cost functions and solve the following two problems: 'optimal medium access control with link delay constraint' and, 'optimal congestion and contention control with end-to-end delay constraint'. The optimal tradeoff between delay, rate, and energy is achieved for different values of delay constraint and the scaling factors between rate and energy. Eventually linear and super-linear distributed optimization solutions are proposed for each problem and their performance are compared in terms of convergence and complexity.

Citations (15)

Summary

We haven't generated a summary for this paper yet.