Trust Based Minimum Spanning Tree Routing Algorithm in WSNs

Wireless sensor networks (WSNs) come under a new domain of networks that are becoming very popular with a huge a large number of military and civilian uses. It comprises a collection of linked small sensor nodes that may exchange information and communicate among themselves and data. Few challenges a designer of WSN networks in any environment faces are the security and energy concerns. Not always do the nodes get to have a constant energy source supply as they could depend on renewable energy in case of its usage in battlefields. Also, security might as well be one factor to notice as day by day hacking attempts seem to become a new normal. This would lead to bring changes in protocols that will observe how the properties of the nodes may differ. This paper deals with the protocol implementation with security enhancements also, implementing a novel routing scheme for effective and reliable transfer of data between the nodes. Here, the secure nodes are allotted followed by Cluster Head (CH) nodes selection. Later, minimum spanning tree algorithm is implemented for routing. The entire algorithm is simulated in MATLAB.