## 3 Proposed Method
### Elliptic Curve Cryptography (ECC)-Based Energy-Efficient Routing Protocol (EERP)
\[x_{3}=\lambda^{2}-x_{1}-x_{2} \tag{5}\]  
\[y_{3}=\lambda*(x_{1}-x_{3})-y_{1} \tag{6}\]  
\(\lambda\) is expressed in Equation (7). \[\lambda= \begin{cases}\frac{b_{2}-b_{1}}{a_{2}-a_{1}},&\phi\
eq\mu\\ \frac{b_{2}^{2}+x}{2b_{1}},&\phi=\mu\end{cases}  \tag{7}\]  
There are two steps in this approach that handle permutation and concatenation processes, separately. Permutation is a method of modifying the number of one or more bits in a particular bit sequence. In the concatenation operation, two parental bit sequences are combined to create equivalent children's bit sequences by switching out certain bits between the sources. While the concatenation procedure is utilized to modify the sequence of the corrupted text or visual information, the permutation procedure is utilized to provide randomized variety in the cipher text. Utilizing these two techniques has the primary advantage of adding moderate amounts of variation to the cipher text; the encryption procedure is shown in Algorithm 1. The bit series is initially separated into 186-bit units, and then each unit is further split into two 93-bit units. The amount of 1s in every byte and for every row of 12 sequential bits in the 2 nd half of the bit string is then determined. Then, we arrange the 88-bit units of 88-bit plaintext into their respective binary format. Because the addition cipher XOR is effective for a similar duration of the keystream, these basic data are XORed with the initial unit of the bit string. Next, every bite of the XORed information is subjected to the permutation procedure. The 7 th- and 8 th-integer bits in the initial byte of the XORed text are modified, for instance, if the second half of the randomized bit sequence's first byte contains seven 1s. The ciphertext is created by further concatenating the permuted plaintext, as illustrated. To create reasonable variety, this concatenation process is iterated until every one of the 11 bits executes it at least 2 times. Utilizing EERP helps each transmission experience the least amount of congestion while using the least energy possible. It may be used for any scattered or crowded collective topology. EERP makes a choice using energy and sensor factors. Decisions about sorting and forwarding in traditional social routing are dependent on node-specific network factors. To determine a node's social weight, a network graph that describes the social connections between each node is required. Usually, the node's known connections to other nodes in the network are used to build a social graph of this form. Assume WN is a representation of the wireless network's nodes. Each sensor node can transmit and receive information when connected to another node. The data are replicated when another node has a higher weight. If the delay between the two statements' transmission and storage timings is equal, the EERP uses a threshold based on queue order to determine if there is a chance that the two data may be duplicated. The length of each document then determines the power balance between those two data. The EERP uses a threshold based on queue order to determine whether there is a possibility that the two data could be duplicates if the difference between the two data's transmission and storage periods is comparable. There is thus a power equilibrium between these two data that is dependent on their presence. With typical network routing techniques, data are repeated to the linked nodes with a higher data value. This may provide the best delivery rates, but due to the high congestion load, nodes with high data weight may suffer from early elimination. We took into account various elements while designing the recommended EERP in contrast with standard social-based sensing routing in a network. The foundation of the EERP calculation is the energy measurement of the data and node. The transmission times of the data copy are represented by these consumption measurements. The power ratio, in this case, is 0 < PR% < 1. As a consequence, it is more difficult to comprehend the current facts.