Link scheduling to maximize end- to-end throughput with fairness discipline in TDMA networks

For wireless ad hoc networks using a time division multiple access (TDMA) protocol, we present an algorithm to maximize guaranteed network end-to-end throughput subject to a fairness discipline that allocates equal end-to-end throughput to each demand. The problem of assigning bandwidths to multiple...

Full description

Saved in:
Bibliographic Details
Published inMILCOM 2008 - 2008 IEEE Military Communications Conference pp. 1 - 4
Main Author Hulbert, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2008
Subjects
Access protocols
Bandwidth
Linear programming
Mobile ad hoc networks
Network topology
Safety
Throughput
Time division multiple access
Transmitters
Wireless application protocol
Online AccessGet full text
ISBN9781424426768
1424426766
ISSN2155-7578
DOI10.1109/MILCOM.2008.4753311

Cover

More Information
Summary:For wireless ad hoc networks using a time division multiple access (TDMA) protocol, we present an algorithm to maximize guaranteed network end-to-end throughput subject to a fairness discipline that allocates equal end-to-end throughput to each demand. The problem of assigning bandwidths to multiple flows on each directed link of the network is formulated as a linear programming (LP) problem. The algorithm employs collections of directed links, each maximal with respect to spatial re-use. For an example network, the LP solution is compared with the results of a suboptimal yet more scalable flow allocation scheme.
ISBN:9781424426768
1424426766
ISSN:2155-7578
DOI:10.1109/MILCOM.2008.4753311