Wireless sensor networks (WSNs) contain many sensor nodes which are deployed in the various geographical areas to perform various tasks like monitoring, data aggregation and data processing. For performing all these operations, energy is highly consumed, thus sensor nodes begin to die soon and also creates energy holes in some of the geographical locations. All the sensor nodes are powered by battery, and it is quite difficult to replace the battery, and so energy consumption is prime objective to increase the network lifetime. Clustering and tree-based routing like LEACH, PEDAP, TBC and TREEPSI solves most of the energy consumption problem as it saves energy during a lot of operations in WSNs. In this paper, we propose an optimal tree-based routing protocol (OTBRP) that is efficient in terms of stability period (time period before first node dead) and therefore offers good network lifetime. The parameters like first node dead, half node dead and last node dead are considered for the measurement of network lifetime. In order to evaluate the performance of OTBRP, the comparison is made with the GSTEB and PEGASIS. Simulation results show that there is a gain of approx. 200 and 150% in stability period in comparison with PEGASIS and GSTEB, respectively.
CITATION STYLE
Sohan, R., Mittal, N., Singh, U., & Sohi, B. S. (2018). An optimal tree-based routing protocol using particle swarm optimization. In Advances in Intelligent Systems and Computing (Vol. 652, pp. 117–124). Springer Verlag. https://doi.org/10.1007/978-981-10-6747-1_14
Mendeley helps you to discover research relevant for your work.