# PINE: Post-Quantum Based Incentive Technique for Non-Cooperating Nodes in Internet of Everything
## 2 Literature Survey
[41] utilizing NTRUencrypt security and was applied to an in-vehicle microcontroller. The approach used by the authors focused on comparing existing session key negotiations algorithms, namely, RSA and ECDH, in order to analyze performance and efficiency considering key generation time, key negotiation time, and memory occupation. However, this approach lacks lattice-based geo-encryption and is insufficient to address selfish nodes and blackhole attacks. **B. Selfish node mitigation and Incentive mechanism:** One of the challenging aspects of demonstrating an end-to-end bi-directional IoE relay network, apart from addressing lattice-based post-quantum geo-encryption, is the detection and mitigation of selfish nodes. There have been many surveys explaining the significance of monitoring the network and isolating selfish nodes. It is crucial to introduce countermeasures against misbehaving nodes and selfishness with the aim of verifying the correctness and integrity of network operations [42]. In multi-hop communication, establishing cooperation and coordination among the self-operated nodes is a challenging task. In such a network, smart nodes are typically operated by utilizing confined resources, namely, energy, processing, storage, and bandwidth for message forwarding. Smart nodes may refrain from cooperating, especially in a mobile environment, becoming liable for degraded network performance and leading to disruption of data gathering and information exchange rates, unbalanced work distribution, and rising end-to-end delay [19]. Misbehaving node solutions are broadly categorized as preventive-based and detection-based techniques. Of these, incentive-based solutions are classified into three different types, namely, reputation-, credit-, and barter-based methods [19; 43; 44]. Furthermore, there are three different types of selfish node-based attacks in MANETs [19; 45; 46; 47], which are mentioned below:  
* Type-I: The selfish nodes send regular control data packets during the route discovery and maintenance stages, but do not participate as relay nodes in forwarding the data packets. Such nodes are regarded as extremely hazardous to the overall routing operations. These nodes first participate in route discovery, then subsequently repudiate the provision of relay services for others. Packet drops and end-to-end delay are greatly escalated in such scenarios. It is feasible that selfish nodes might not adopt non-cooperative feedback for all nodes, and instead aim only at a particular set of nodes. One of the most important reasons for this is social approval or disapproval. * Type-II: The selfish nodes do not engage in data transmission for other nodes, either during the route discovery or route maintenance stages. These nodes exclusively utilize their energy to power their own data processing and transmission. Routing protocols often do not take such nodes into account. This class of selfish nodes might not receive or transmit any route information. These nodes have the potential to significantly deteriorate data transmission traffic and network connectivity. * Type-III: These nodes modify their amount of cooperation based on their resource levels. At first, these nodes behave as regular nodes. As time passes, the nodes begin to decline to cooperate with others due to a decrease in their resource levels. It is feasible that nodes in a smart ecosystem will associate their remaining energy levels with their selfishness levels. These nodes are just as hazardous as _Type-I_ selfish nodes. The nodes help in route discovery to establish a network topology, then they subsequently disrupt the data flow by discarding the data packets. Because of these nodes, the routing protocol must restart the route discovery process or choose another alternate path for data transfer. Thus, it can be assumed that Type-III selfish attacks should be addressed to maintain the network stability. [PERSON] et al.