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 language | English |
---|---|
Pages (from-to) | 1217-1219 |
Number of pages | 3 |
Journal | Electronics Letters |
Volume | 43 |
Issue number | 22 |
DOIs | |
State | Published - 2007 |
Externally published | Yes |