Cross-layer lifetime maximisation in wireless multihop networks with network coding
by Jain-Shing Liu
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 13, No. 3/4, 2013

Abstract: In this paper, we study the problem of maximising network lifetime in wireless multihop networks with network coding. For this aim, we introduce a cross-layer formulation with general Network Utility Maximisation (NUM) that accommodates routing, scheduling and stream control from different layers of network. Specifically, to maximise such a lifetime while satisfying a given traffic demand, we elaborate its objective along with a lifetime fairness constraint and the other relevant constraints across different layers. Consequently, by taking network coding into account, we resolve the optimisation problem with a stochastic primal-dual algorithm that can iteratively update its subgradients to find the saddle points involved with a smoother trajectory, and can globally converge to the optimal solutions asymptotically. In particular, the corresponding distributed algorithms can be resulted to dynamically approach the optimal in a distributed manner. Finally, our numerical results are presented to validate and exhibit the possible benefits that can be gained from the cross-layer optimisation and the corresponding algorithms.

Online publication date: Mon, 29-Jul-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email