Performance Comparison of Routing Protocols in Bipartite Wireless Sensor Network

Devashish Gosain, Itu Snigdh


This paper evaluates and ranks the suitability of routing algorithms for bipartite wireless sensor network topology. The network considered in this paper, consists of an irregular combination of fixed and mobile nodes, which leads to construction of a bipartite graph among them. A wireless sensor network is usually constrained by the energy limitations and processing capabilities. We therefore, consider the important metrics for analysis namely, carried load, energy consumption and the average delay incurred. We present the possibilities of employing the routing algorithms subject to the quality of service required by the wireless sensor networks applications


Bipartite graph; Average delay; Energy Consumed; Carried Load

Full Text:


Total views : 98 times

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

ISSN 2088-8708, e-ISSN 2722-2578