Retransmission aware congestion control and distributed power allocation in MANETs

Anastasios Giovanidis; Sławomir  Stanczak

5th International Workshop on Resource Allocation, Cooperation and Competition in Wireless Networks

Research Article

Retransmission aware congestion control and distributed power allocation in MANETs

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/WIOPT.2009.5291588,
    author={Anastasios Giovanidis and Sławomir  Stanczak},
    title={Retransmission aware congestion control and distributed power allocation in MANETs},
    proceedings={5th International Workshop on Resource Allocation, Cooperation and Competition in Wireless Networks},
    publisher={IEEE},
    proceedings_a={RAWNET / WNC3},
    year={2009},
    month={10},
    keywords={Automatic repeat request  Distributed control  Error correction  Game theory  Mobile ad hoc networks  Protocols  Stability  Telecommunication congestion control  Telecommunication control  Utility programs},
    doi={10.1109/WIOPT.2009.5291588}
}

Anastasios Giovanidis
Sławomir Stanczak
Year: 2009
Retransmission aware congestion control and distributed power allocation in MANETs
RAWNET / WNC3
IEEE
DOI: 10.1109/WIOPT.2009.5291588

Anastasios Giovanidis¹^,*, Sławomir Stanczak¹^,*

1: Fraunhofer Institute for Telecommunications, Heinrich Hertz Institute, MCI Einsteinufer 37, 10587 Berlin, Germany.

*Contact email: giovanidis@hhi.de, stanczak@hhi.de

Abstract

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.

Keywords: Automatic repeat request Distributed control Error correction Game theory Mobile ad hoc networks Protocols Stability Telecommunication congestion control Telecommunication control Utility programs

Published: 2009-10-23
Publisher: IEEE

: http://dx.doi.org/10.1109/WIOPT.2009.5291588