Author : Dong Wang

Affiliation : University of the West of Scotland

Country : UK

Category : Computer Science & Information Technology

Volume, Issue, Month, Year : 6, 15, December, 2016

Abstract :

With the development of new networking paradigms and wireless protocols, nodes with different
capabilities are used to form a heterogeneous network. The performance of this kind of
networks is seriously deteriorated because of the bottlenecks inside the network. In addition,
because of the application requirements, different routing schemes are required toward one
particular application. This needs a tool to design protocols to avoid the bottlenecked nodes and
adaptable to application requirement. Polychromatic sets theory has the ability to do so. This
paper demonstrates the applications of polychromatic sets theory in route discovery and
protocols design for heterogeneous networks. From extensive simulations, it shows the nodes
with high priority are selected for routing, which greatly increases the performance of the
network. This demonstrates that a new type of graph theory could be applied to solve problems
of complex networks.