## 5 Analysis of HWMP Security Protocols
### Secure Hybrid Wireless Mesh Protocol (SHWMP)
#### 5.2.1 A Secure Scheme for Reactive Routing  
Let us assume a network topology scenario with a source MP S that can reach destination MP D in three hops. Here, we define the number of hops as the number of links on a path. There are two arbitrarily connected intermediate nodes \(I_{1}\) and \(I_{2}\) that may be reached after the 1 st and 2 nd broadcasting, respectively. Subsequently, the message reaches the destination MP D.  
SHWMP runs a secure routing scheme on the network scenario as follows:  
\[\mathrm{S}\!\rightarrow\!\mathrm{*}\!:\!\mathrm{MAC}_{\mathrm{GTK}}\mathrm{ root}(\mathrm{S})\{\{\mathrm{v}_{\mathrm{i}},\mathrm{authpath}(\mathrm{v}_{\mathrm{i}}),...\}\},\{ \mathrm{PREQ}-\mathrm{MF}\}_{\mathrm{GTK}} \tag{1}\]  
\begin{table}
\begin{tabular}{c|c|c|c|c|c|c|c} \hline \multirow{2}{*}{**Frame**} & \multirow{2}{*}{**Field**} & **Authentication** & **Encryption* & **Authentication** & **Anti-** & **Root** & **Forgery** \\  & & **and integrity** & **(Point-to-point)** & **(Point-to-end)** & **and integrity** & **replay** & **Permission** & **Detection** \\  & & & **(Point-to-point)** & **(End-to-end)** & **scheme** & **Level** & **Method** \\ \hline \multirow{3}{*}{PREQ} & HDR & Yes & - & - & & - & - \\ \cline{2-8}  & MF & Yes & Yes & - & & - & No \\ \cline{2-8}  & NMF & Yes & Yes & No & No & No & - \\ \hline \multirow{3}{*}{RANN} & HDR & Yes & - & - & & - & - \\ \cline{2-8}  & MF & Yes & Yes & - & - & No \\ \cline{2-8}  & NMF & Yes & Yes & No & No & - \\ \hline \multirow{3}{*}{PERR} & HDR & Yes & - & - & - & - \\ \cline{2-8}  & MF & Yes & Yes & - & - & - \\ \cline{2-8}  & NMF & Yes & Yes & No & - & - \\ \hline \multirow{3}{*}{PREP} & HDR & Yes & - & - & - & - \\ \cline{2-8}  & MF & Yes & Yes & - & - & No \\ \cline{1-1} \cline{2-8}  & NMF & Yes & Yes & No & - & - \\ \hline \end{tabular}
* indicates optional requirements.  
\end{table}
Table 10: Security services provided by CCMP and BIP.  
\[\mathrm{I_{1}}\rightarrow*:\mathrm{MAC_{GTK}root(I_{1}),\{\mathrm{v_{i},authpath(v_{i}),...\}\},\{\mathrm{PREQ-MF}\}_{\mathrm{GTK}} \tag{2}\]  
\[\mathrm{I_{2}}\rightarrow*:\mathrm{MAC_{GTK}root(I_{2}),\{\mathrm{v_{i},authpath(v_{i}),...\}\},\{\mathrm{PREQ-MF}\}_{\mathrm{GTK}} \tag{3}\]  
\[\mathrm{D\to I_{2}:\mathrm{MAC_{PTK}^{D,I_{2}}root(D),\{\mathrm{v_{i},authpath(v_{i}),...\}\},\{\mathrm{PREP-MF}\}_{\mathrm{PTK}}^{D,I_{2}}} \tag{4}\]  
\[\mathrm{I_{2}}\rightarrow\mathrm{I_{1}:\mathrm{MAC_{PTK}^{I_{2},I_{1}}root(I_{ 2}),\{\mathrm{v_{i},authpath(v_{i}),...\}\},\{\mathrm{PREP-MF}\}_{\mathrm{PTK}}^ {I_{2},I_{2}}} \tag{5}\]  
\[\mathrm{I_{1}}\rightarrow\mathrm{S:MAC_{PTK}^{I_{1},S}root(I_{1}),\{\mathrm{v_{i},authpath(v_{i}),...\}\},\{\mathrm{PREP-MF}\}_{\mathrm{PTK}}^{I_{1},S}} \tag{6}\]  
Note that PREQ - MF and PREP - MF represent the routing information elements of the PREQ and PREP frames without the MFs, respectively. \(\{\mathrm{v_{i},authpath(v_{i}),...\}\}\) denotes the set of MFs \(\mathrm{v_{i}}\) and the values required to authenticate the set over the Merkel tree. MAC\({}_{\mathrm{k}}\)root(X) represents the _MAC_ of the Merkel tree's root created by node S using a shared key k on the MFs of its routing protocol message. \(\{\mathrm{M}\}_{\mathrm{k}}\) denotes a cipher-text message M encrypted with a symmetric key k. \(\{\mathrm{M}\}_{\mathrm{k}}^{\mathrm{A,B}}\) denotes a cipher-text message M encrypted with a symmetric key k shared between entity A and B.