Table 1 Comparison of symbols and their specific meanings.
\(F(x)\) | Determining factor of migration |
|---|---|
\(x\) | Service node |
\(\sum {( \cdot )}\) | Weighted average of all elements in a column |
\(y\) | Starting point of migration |
\(T_{d} (x)\) | Delay during the transmission process |
\(S_{c} (x)\) | Size of the server capacity |
\(B_{\max } (x,y)\) | Maximum bandwidth between two service nodes |
\(R_{d} (x)\) | Delay in the return journey between two service nodes |
\(C_{p} (x)\) | Cost price of the server |
\(\beta\) | Return on migration time |
\(n\) | Number of nodes |
\(C_{n}\) | Total amount of migrated data |
\(T\) | Migration cycle |
\(R_{n}\) | Channel transmission rate |
\(t\) | Migration time |
\(C_{n - 1} (t)\) | Amount of data at the current time |
\(v\) | Mobile terminal speed |
\(R_{n} (th)\) | Threshold of the minimum migration rate of the current time point node |
\(\overline{E}\) | Average energy consumption of data migration |
\(E_{t}\) | Energy consumption of the current node |
\(P\) | Transmission power |
\(E_{\min }\) | Minimum migration energy consumption |
\(CH\_Gen\) | Key generation function |
\(\lambda\) | Safety parameter |
\(P_{k}\) | Public key for outputting the chameleon hash |
\(S_{k}\) | Private key of the chameleon hash |
\(CH\_Hash\) | Hash generation function |
\(r\) | A random number |
\(m\) | Any information |
\(h\) | Hash value |
\(p\) | A random value |
\(CH\_Ver\) | Hash collision function |
\(m^{\prime}\) | New information |
\(r^{\prime}\) | A new random number |
\(P_{k} (CH)\) | Public key for the temporary threshold of the chameleon hash function |
\(S_{k} (CH)\) | Private key for the temporary threshold of the chameleon hash function |
\(N_{1}\) | A composite number obtained through an asymmetric encryption algorithm |
\(e\) | A prime number |
\(H_{1}\) | Hash function |
\(d_{1}\) | Threshold value |
\(mP_{k} (ABE)\) | Public key of the BTA-AHEA input |
\(mS_{k} (ABE)\) | Private key of the BTA-AHEA input |
\(p_{1}^{\prime }\), \(p_{2}^{\prime }\),\(p_{3}^{\prime }\) | Subgroups of the composite group |
\(N\) | A composite number |
\(CT\) | Cipher-text |
\(\overline{CT}\) | Set of cipher-text |
\(CT^{\prime}\) | Updated cipher-text |
\(s\) | A random vector |
\(t\) | A random integer |
\(N_{2}\) | A composite number |
\(r\) | A random number |
\(D\) | Set of decryption functions |
\(\overline{{K^{\prime}}}\) | Set of keys |
\(r^{\prime}_{1}\),\(r^{\prime}_{2}\) | The random numbers corresponding to the two threshold values \(d_{1}\) and \(d_{2}\) |
