Performance Study of Routing Protocols in Wireless Sensor Network

Le résumé fourni par la source

This work emphasis on analyzing the optimization strategies of routing protocols with respect to a lifetime of sensor nodes in Wireless Sensor Network (WSNs). There are a number of routing methods have been proposed to address energy optimization problem in sensor nodes so we can maximize stability of the network. Clustering and chaining are the well-known WSN's routing method. This paper mainly focuses on the use of optimization of algorithms for protocols resulting in the better outcomes as compared to traditional algorithms. In this paper, we first address energy limitation constraints with respect to maximizing network lifetime using optimization technique. To check the efficiency of different clustering scheme against modeled constraints, we select four cluster-based routing protocols, Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol (SEP), Threshold Sensitive Stable Election protocol (TSEP), Enhance Threshold Sensitive Stable Election Protocol (ETSSEP), Ant Colony Routing (ACR) and a chaining algorithm Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and detailed study of hybrid technique using nature inspired optimization technique Mean Random Particle Swarm Optimization (MRPSO). To validate our mathematical framework, we perform analytical simulations in MATLAB by choosing a number of alive nodes, a number of dead nodes and stability period as performance metrics.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.