# PINE: Post-Quantum Based Incentive Technique for Non-Cooperating Nodes in Internet of Everything
## 3 Proposed Approach--PINE Protocol
### Protocol Design
#### 3.3.1 Initialization Phase  
* Before establishing data communication, the \(S\) node transmits its IP address \(ip\_addr_{S}\), MAC address \(mac\_addr_{S}\), and latitude-longitude \(Location_{S_{\textit{CNS}}}\) information to node \(R\) and in turn requests \(R\)'s IP address \(ip\_addr_{R}\), MAC address \(mac\_addr_{R}\), and latitude-longitude \(Location_{R_{\textit{CNS}}}\) information. Node \(R\) maintains \(Info_{S}\) transmitted by \(S\) and generates a response for node \(S\). After successfully receiving the response, \(S\) maintains  
Figure 3: The protocol initially stabilizes the network for proper decision-making in upcoming sessions. **(1)** Node \(S\) chooses the next hop by considering energy status and distance. **(2)** Packet forwarding and returning of \(ACK\) packet along the bi-directional route. **(3)**\(S\) generates incentives for all relay nodes based on \(NetInfo\) obtained from direct and overheard nodes. **(4)** The \(F_{1}\) node is chosen as the next hop, as its energy residue is more than the peer nodes of \(S\). **(5)** Optimal route selection to reach node \(R\) via \(F_{3}\). **(6)**\(S\) generates incentives for all the relay nodes after receiving the \(ACK\)/\(NACK\) packet via the same route. \(Info_{R}\) transmitted by node \(R\) to keep track and proceed with message exchange among the connected nodes. * During the session time until \(Time_{T}\), node \(S\) identifies a set of neighbour nodes \(\{Neighbour_{S}\}\) in a distance range \((Distance)\) to proceed with communication. Node \(S\) requests \(EnergyStatus_{\{Neighbour_{S}\}}\) and \(Location_{\{Neighbour_{S}\}}\) from all \(\{Neighbour_{S}\}\) nodes with the aim of learning their energy status and concluding whether such nodes can fulfil the service by acting as forwarding nodes. To this end purpose, node \(S\) collects the energy status \(\{Neighbour_{S}\}\) along with the current distance (calculated using \(Location_{\{Neighbour_{S}\}}\)) to greedily nominate the next-hop \(F_{j}\) from the set of \(\{Neighbour_{S}\}\), i.e., \(F_{j}\in\{Neighbour_{S}\}\), considering the high-energy and low-distance nodes, then transmits the lattice LWE encrypted-text \(Enc_{R}\)[58]. * Further, the selected \(F_{j}\) node nominates the next-hop \(F_{j+1}\) from the set of \(\{Neighbour_{F_{j}}\}\) or \(F_{j+1}\in\{Neighbour_{F_{j}}\}\) based on the same rules by which node \(S\) selected and nominated \(F_{j}\), using a greedy nomination by considering the low-distance and high-energy, i.e., the \(F_{j}\) requests for \(Location_{\{Neighbour_{F_{j}}\}}\) and \(EnergyStatus_{\{Neighbour_{F_{j}}\}}\). * As it is assumed that all \(\{Neighbour_{F_{j}}\}\) (known as neighbour-relay(s) to \(F_{j}\)) overhear the information about \(F_{j}\), any node in the set of \(\{Neighbour_{F_{j}}\}\) overhears the network activities and constructs the \(NetInfo_{F_{j}}\) profile with respect to relay containing attributes \(F_{j}\), namely, \(Node-id_{F_{j}}\), \(EnergyStatus_{F_{j}}\), \(PacketForwardCount_{F_{j}}\), \(PacketDropCount_{F_{j}}\), and \(Timestamp_{F_{j}}\). After \(Enc_{R}\) reaches node \(R\), the receiver \(R\) generates and transmits \(ACK/NACK\) via the same bi-directional route towards node \(S\). * Any node employing the \(PINE\) protocol calculates the energy consumption [20] or \(EnergyStatus\) by negating Equation (1) and/or (2) from the total energy. Moreover, the total energy of a node depends on its energy holding capacity and device efficiency in terms of resource management. * In the next step, node \(S\) requests the direct and overheard \(NetInfo\) from the neighbours and distant neighbours to compute the incentives by considering \(PacketForwardCount\), \(PacketDropCount\), and \(EnergyStatus\) for the respective relay and neighbour-relay nodes utilizing Equation (3) and the updated \(InTab\) after a certain time \(Time_{Threshold}\) to make decisions for the subsequent communication cycles.