MURAL - Maynooth University Research Archive Library

    Proportional Fair Coding for Wireless Mesh Networks

    Premkumar, K. and Chen, Xiaomin and Leith, Douglas J. (2011) Proportional Fair Coding for Wireless Mesh Networks. Working Paper. Hamilton Institute. (Unpublished)

    [img] Download (1MB)

    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...

    Add this article to your Mendeley library


    We consider multi–hop wireless networks carrying unicast flows for multiple users. Each flow has a specified delay deadline, and the lossy wireless links are modelled as binary symmetric channels (BSCs). Since transmission time, also called airtime, on the links is shared amongst flows, increasing the airtime for one flow comes at the cost of reducing the airtime available to other flows sharing the same link. We derive the joint allocation of flow airtimes and coding rates that achieves the proportionally fair throughput allocation. This utility optimisation problem is non–convex, and one of the technical contributions of this paper is to show that the proportional fair utility optimisation can nevertheless be decomposed into a sequence of convex optimisation problems. The solution to this sequence of convex problems is the unique solution to the original non–convex optimisation. Surprisingly, this solution can be written in an explicit form that yields considerable insight into the nature of the proportional fair joint airtime/coding rate allocation. To our knowledge, this is the first time that the utility fair joint allocation of airtime/coding rate has been analysed, and also, one of the first times that utility fairness with delay deadlines has been considered.

    Item Type: Monograph (Working Paper)
    Additional Information: Preprint of paper submitted to IEEE/ACM Transactions on Networking (December 2011). This work is supported by Science Foundation Ireland under Grant No. 07/IN.1/I901.
    Keywords: Binary symmetric channels; code rate selection; cross–layer optimisation; optimal packet size; network utility; maximisation, resource allocation, scheduling
    Academic Unit: Faculty of Science and Engineering > Research Institutes > Hamilton Institute
    Item ID: 3631
    Depositing User: Karumbu Premkumar
    Date Deposited: 02 May 2012 15:32
    Publisher: Hamilton Institute
    Funders: Science Foundation Ireland
    Use Licence: This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

    Repository Staff Only(login required)

    View Item Item control page


    Downloads per month over past year

    Origin of downloads