Implementation of Hidden Node Detection Scheme for Self-Organization of Data Packet

The mobile nodes are infrequent movement in nature; therefore, its packet transmission is also infrequent. Packet overload occurred for routing process, and data are lossed by receiver node, since hackers hide the normal routing node. Basically, the hidden node problem is created based on the malicious nodes that are planned to hide the vital relay node in the specific routing path. The packet transmission loss occurred for routing; so, it minimizes the packet delivery ratio and network lifetime. Then, proposed enhanced self-organization of data packet (EAOD) mechanism is planned to aggregate the data packet sequencially from network structure. The hacker node present in routing path is easy to separate from network with trusty nodes. In order to secure the regular characteristics of organizer node from being confirmed as misbehaving node, the hidden node detection technique is designed for abnormal routing node identification. This algorithm checks the neighboring nodes that are hacker node, which hide the trust node in the routing path. And that trust nodes are initially found based on strength value of every node and assign path immediately. It increases network lifetime and minimizes the packet loss rate.