Convex Optimization
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Resource Allocation in Wireless Networks: Theory and Algorithms (Lecture Notes in Computer Science)
Resource Allocation in Wireless Networks: Theory and Algorithms (Lecture Notes in Computer Science)
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs
IEEE/ACM Transactions on Networking (TON)
On function computation via wireless sensor multiple-access channels
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
IEEE Transactions on Wireless Communications
Optimal power control for Rayleigh-faded multiuser systems with outage constraints
IEEE Transactions on Wireless Communications
A power control game based on outage probabilities for multicell wireless data networks
IEEE Transactions on Wireless Communications
Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case
IEEE Transactions on Information Theory
Computation Over Multiple-Access Channels
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). Errors occur due to outages and a success probability function is related to each link, which can be controlled by power and rate allocation. We first derive the expression for the network's capacity region. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into (a) the input rate control problem and (b) the scheduling problem. The NUM problem can be solved in a fully decentralized manner if (b) is solved distributedly. Use of supermodular game theory suggests a price based algorithm that requires minimum information exchange between interfering nodes and converges to a power allocation which satisfies the necessary optimality conditions of (b). Simulations illustrate that the suggested algorithm brings near optimal results.