Network utility maximisation scheduling in mesh networks

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

An optimal scheduling algorithm to maximise network utility is presented in a mesh network operating in a time-division fashion. The proposed scheduling algorithm consists of the shortest path search and the binary search.

Original languageEnglish
Pages (from-to)1217-1219
Number of pages3
JournalElectronics Letters
Volume43
Issue number22
DOIs
StatePublished - 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'Network utility maximisation scheduling in mesh networks'. Together they form a unique fingerprint.

Cite this