How to make more width table to fit on whole page

Question

I want to place this table on entire page. How can do it:

\newlength\origheight
\setlength\origheight{\textheight}

\begin{landscape}

    \begin{table}
        \scalebox{0.7}{
        \begin{tabularx}{\origheight}{@{} >{\bfseries}l *{7}{L} @{}} 

            \toprule
            Protocol name & \textbf{QT} & \textbf{OQTT} & \textbf{STT} 
            & \textbf{BS} & \textbf{CT} & \textbf{QwT} & \textbf{CwT} \\ 
            \midrule

            Protocol feature
            & They use random multi-access way to identify tags. In case of collision, the tags will be asked to send data later with a random time relay.
            & They identify the total number of tags in the interrogation zone. The reader controls every step of the protocol, using commands or queries to split colliding tags into subsets, and further repeatedly split those subsets until identifies all the tags.
            & They are mixture of Aloha and Tree-based protocols. They use two methods. The first is using randomized divisions in Tree-based algorithms, and another is using tree strategies after a collision in Aloha algorithms.
            & It involves transmitting a serial number from the reader to all the tags. Only tags which have equal or lower ID value than the received serial number will respond on request.
            & It is an improvement of QT which uses Bit tracking technology in order to find which bits collided and also where they are.
            & It applies a dynamic bit window to QT. All the tags compare their ID value with the query received and transmit a certain bit amount managed by the reader.
            & It applies the dynamic bit window to CT and adopts two techniques: bit tracking and the bit window.
            \\ \addlinespace
            Disadvantages
            & The reader sends a query and tags, whose ID prefix match that query, respond their full ID.
            & Very complex protocol, uses three technologies. The preprocessing increases the energy consumption of the protocol, especially in dense tag environments.
            & On every collision, the full tag response, apart from the initial query bits, is wasted.
            & The reader restart the reading process after a tag is identified.
            & It wastes a high number of tag bits on every collision, which increases the energy consumed by the reader during the process.
            & When the calculated ws is high, the reader command needs a high number of bits to represent it. That leads to a wastage of the reader bits.
            & Increase the number of reader bits
            \\ \addlinespace
            RTF/TTF 
            & RTF & RTF & RTF & RTF & RTF & RTF & RTF 
            \\
            Efficiency
            & 34.6\% & 61.4\% & 58\% & & 35\% & 80\% & 61\% 
            \\
            System cost 
            & Very low & Very expensive & Expensive & Medium & Low & Medium & Medium
            \\
            Complexity 
            & Very simple & Very high & High & Medium & Simple & Medium & Medium 
            \\
            \bottomrule 
        \end{tabularx}
    }
        \caption{A comparison of tree-based protocols}
        \label{tab:ComparationThree}
    \end{table}
    \end{landscape}

Please look that this table is just on half page. Maybe need to put more words in every row?

Answer 1

The following answer "works", but only because I chose the "fill in the blanks" by providing guesses to fill information gaps left wide-open by the OP. E.g., we don't really know how wide and tall the text block is, and we don't know which font is in use. No warranties whatsoever. Buyer beware.

The main changes relative to the OP's code fragment are

• assumed width of all margins: 2.5cm

• assumed font: Computer Modern Roman

• relative font: \small (for a 10% linear reduction in font size relative to \normalsize)

• less inter-column space: 3pt (default is 6pt)

• made first column a bit less wide, allocated the saved amount equally to the 7 data columns.

\documentclass[12pt]{article}
\usepackage[a4paper,margin=2.5cm]{geometry} 
\usepackage{pdflscape,booktabs,tabularx,ragged2e}
\newcolumntype{L}{>{\RaggedRight\arraybackslash}X} 
\newlength\mylen
\settowidth\mylen{{\small\textbf{Protocol name}}} % width of 1st col.
\newcolumntype{P}{>{\bfseries\RaggedRight}p{\mylen}}
\usepackage[skip=0.333\baselineskip]{caption}
\begin{document}

%% Save original value of \textheight parameter:
\newlength\origheight
\setlength\origheight{\textheight}

\begin{landscape}
\begin{table}

\frenchspacing % no extra space after "."
\small
\setlength\tabcolsep{3pt} % default: 6pt

\begin{tabularx}{\origheight}{@{} P *{7}{L} @{}} 
\toprule
Protocol name & \textbf{QT} & \textbf{OQTT} & \textbf{STT} 
& \textbf{BS} & \textbf{CT} & \textbf{QwT} & \textbf{CwT} \\ 
\midrule

Protocol feature
& They use random multi-access way to identify tags. In case of collision, the tags will be asked to send data later with a random time relay.
& They identify the total number of tags in the interrogation zone. The reader controls every step of the protocol, using commands or queries to split colliding tags into subsets, and further repeatedly split those subsets until identifies all the tags.
& They are mixture of Aloha and Tree-based protocols. They use two methods. The first is using randomized divisions in Tree-based algorithms, and another is using tree strategies after a collision in Aloha algorithms.
& It involves transmitting a serial number from the reader to all the tags. Only tags which have equal or lower ID value than the received serial number will respond on request.
& It is an improvement of QT which uses Bit tracking technology in order to find which bits collided and also where they are.
& It applies a dynamic bit window to~QT. All the tags compare their ID value with the query received and transmit a certain bit amount managed by the reader.
& It applies the dynamic bit window to~CT and adopts two techniques: bit tracking and the bit window.
\\ \addlinespace
Disadvantages
& The reader sends a query and tags, whose ID prefix match that query, respond their full~ID.
& Very complex protocol, uses three technologies. The preprocessing increases the energy consumption of the protocol, especially in dense tag environments.
& On every collision, the full tag response, apart from the initial query bits, is wasted.
& The reader restart the reading process after a tag is identified.
& It wastes a high number of tag bits on every collision, which increases the energy consumed by the reader during the process.
& When the calculated ws is high, the reader command needs a high number of bits to represent it. That leads to a wastage of the reader bits.
& Increase the number of reader bits
\\ \addlinespace
RTF/TTF 
& RTF & RTF & RTF & RTF & RTF & RTF & RTF 
\\
Efficiency
& 34.6\% & 61.4\% & 58\% & & 35\% & 80\% & 61\% 
\\
System cost 
& Very low & Very expensive & Expensive & Medium & Low & Medium & Medium
\\
Complexity 
& Very simple & Very high & High & Medium & Simple & Medium & Medium 
\\
\bottomrule 
\end{tabularx}
\caption{A comparison of tree-based protocols}
\label{tab:ComparationThree}
\end{table}
\end{landscape}
\end{document}