अमूर्त

A DETERMINISTIC APPROACH FOR ROUTING THROUGH POLYCHROMATIC SETS IN WIRELESS ADHOC NETWORKS

Mutyala V.S. Rathna Kumari, Thamarai Selvi.V, N.D.Vikram

Graph Theory is one of the basic methodologies opted for analysing computer networks such as Adhoc networks, sensor networks .Conventional Graph theory is not an proper approach for designing the wireless networks because variety of nodes and wireless link may exist. Even the usage of random graph and weighted graph may not properly model the complex wireless networks as they merely stand on a single property. This leads to the introduction of the concept of Poly chromatic sets in modelling complex wireless networks. In this paper we put forward the concept of Poly chromatic set theory which will maintain the properties of each node that support for efficient routing, and the results have proven that it is a perfect tool to determine the nodes in wireless networks.