Computer Science – Information Theory
Scientific paper
2010-11-23
Computer Science
Information Theory
22 pages, IET Communications, 2010, Vol 4., Iss 16
Scientific paper
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.
Khalaj Babak H.
Khodaian Amir M.
No associations
LandOfFree
Delay Constrained Utility Maximization in Multihop Random Access Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Delay Constrained Utility Maximization in Multihop Random Access Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delay Constrained Utility Maximization in Multihop Random Access Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-588747