Avoiding Selfishness by Effective Routing Using Trust Based Mechanism

Abstract

Communication in wireless sensor networks is through nodes. High quality network needs efficient communication between nodes. Here Order-Optimal Neighbour Discovery Using Feedback protocol is proposed for neighbour discovery .This protocol exploits the feedback from the receiving nodes. After certain transmissions some nodes loose energy and become selfish. The Trust Based Routing Algorithm routes the packets through optimal energy nodes and thus leads to a more efficient high quality network. The trust based routing algorithm is compared with the conventional routing protocols on the basis of mainly five parameters i.e. trust level, throughput , delay, packet delivery ratio and overhead. I. Introduction 1.1 Wireless Networks A wireless network is a computer network that uses a wireless network connection. It uses radio waves just like cell phones, televisions etc .The most important advantage of this network is that it allows the costly procedure of introducing cables to diminish.(10).What differentiates wireless communication from wired communication is the nature of the communication channel.(10) Motion of the transmitter and the receiver, the environment, multipath propagation, and interference render the channel model more complex. 1.2 Neighbour Discovery Communication in wireless network is through the nodes. Data's are transmitted in the form of packets from one node to another node. Usually upon deployment a node does not have knowledge about its specific neighbours. A high quality network means there must be an efficient packet transmission between nodes without any delay. In order to make a wireless network an efficient network, the neighbour nodes must be discovered.(8) Thus, neighbour discovery is the first important step in wireless networks.(7) 1.3 Selfishness