Relational Approach Towards Feasibility Performance for Routing Algorithms in Wireless Sensor Network

Abstract

This paper presents an investigation into feasibility performance gains for routing protocols. Routing protocols are crucial for WSN activity because sensors are not capable to realise individually overall system tasks. Because of that, sensors need to have more or less tightly integrated cooperation, based on information exchange, between them. We propose relational approach, based on set theory, which considers three relations: subordination, tolerance and collision. Using these relations we perform initial organization, but there is no necessity to perform any reorganization during a network lifetime. The obtained results show that providing relatively high collision intensity quotient, nodes can avoid selectively malfunctioned nodes. On the other side, decreasing subordination intensity quotient inhibits error dissemination process.