抽象的な

SNAKE SERPENTINE LOCOMOTION ALGORITHM OR HYPERSENSITIVE DATA PACKET TRANSMISSION IN TRUST ARCHITECTURE

Gaurav Kumar and Dr. S. N. Panda

With the advent and promotion of globalization, the speed of data transmission is increased tremendously. The hypersensitive data packets are roaming on the information superhighway at very fast speed and such high performance Value Added Applications are used by most of the organization including corporate sector, defense establishments, banking or personal communications. The matter gets serious when the data packets are concerned with highly confidential and sensitive applications which may include an e-banking transaction or a secret deal in defense. A number of algorithms and paradigms has been developed and implemented to shield and transmit the data packets to the other end. This paper proposes an algorithm named snake serpentine locomotion algorithm for the transmission of data packets in the network channels. This algorithm makes use of the S-Shape circuitous movement or undulatory locomotion adopted by the snakes on the surface. On land, the efficient and rapid serpentine movement is possible if there are irregularities on the ground to enable the snake crawl. Networks are always associated with the security issues this paper relates the irregularity of surface to the sensitivity or security issues of the network channels. Similar kind of algorithms has been devised to solve various combinatorial optimization problems including routing, shortest path, packet transmission, assignments and many more. These algorithms subsist with the names as Ant Colony Optimization, Honey Bee Algorithm, Genetic Algorithms, Simulated Annealing and various others whereby the behavior, activities, movements and survival nature of creatures is analyzed. This paper intends to indicate that the data transmission in trust architecture can be secured using the Snake Serpentine Locomotion Algorithm making a series of curves with multiple angles rather than a known straight path.