Abstract
Conference Title: 2014 Conference on IT in Business, Industry and Government (CSIBIG) Conference Start Date: 2014, March 8 Conference End Date: 2014, March 9 Conference Location: Indore, India The routing algorithm is one of key researches of interconnection networks and wireless sensor networks (WSN) design. WSNs are application specific, hence lots of attention has been given to routing protocol. Since the life time of sensor nodes depend on available power, therefore in order to prolong the age of sensor nodes, it is necessary to design efficient routing protocols. The routing protocols designed for Sensor Networks are being divided into three main categories depending on the approaches used. They are Data Centric, Hierarchical and location based. This paper has been concentrated on the performance analysis of the two most prominent data centric protocols, Directed Diffusion and SPIN routing protocol. The performance analysis are examined using NS-2 which is the main network simulator, NAM (Network Animator), TCL (Tool Command Language), AWK (post processing script) and were compared in terms of performance parameters like End-to-End Delay, Throughput, Control Overhead and Packet Delivery Ratio (PDR). The research work demonstrated here is established by results based on performance analysis of DDIFF and SPIN routing protocol. It has been discovered that under all four parameter considering static as well as mobile environment, DDIFF performs better than SPIN routing protocol.