Abstract – Nowadays, the rates of online networking action have reached tremendous heights. Due to the increased volume of online users and their usage has proceeded to the rapid development of electronic data. So it is difficult to recognize the demanding information from vast text of information. The growing complication of electronic information has forced to present optimization technique. Attracted by the behavior, communication, movements and hunting nature of spider, we initiate a spider hunting technique to find Topic and Sub-Topic of a corpus. The suggested technique could effectively recognize the desired corpus from text data. The Enhanced Spider Hunting technique is evaluated against broadly utilized standard algorithm and the recommended technique has predominant execution compared to other Meta heuristics.

Abstract: Wireless nodes are time varying behavior in its nature, because energy usage of each node is not being constant. Packet transmission among cluster nodes get overloaded, when multi input and multi output is made; multi task is performed cause more energy usage, also selfish node could not transfer the data packet to target node. Selfish node need to hide some important data, and then only transmit normal data’s that tries to misuse those data, so packet delivery rate is reduced. This normal method not identifies selfish nodes in routing path. Proposed Incentive Sorted Path selection Scheme (ISPSS) obtains traffic free packet transmission among wireless sensor nodes, since routing paths are sorted based on distance and energy usage, which path use minimum energy and also minimum distance, that are considered as effective path from sender node to sink node. Selfish node available in cluster they are identified by using progressive stable algorithm. It improves the packet delivery rate, network lifetime, and reduces energy usage and end to end delay