A logarithmic lower bound for time-spread multiple-access (TSMA) protocols.
Stefano BasagniDanilo BruschiPublished in: Wirel. Networks (2000)
Keyphrases
- multiple access
- lower bound
- worst case
- upper bound
- communication systems
- wireless communication
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- optimal solution
- multi user
- regret bounds
- objective function
- np hard
- division multiple access
- wireless networks
- computer simulation
- computer systems
- scheduling problem
- sufficiently accurate