Performance Comparison of Routing Protocols in Bipartite Wireless Sensor Network
Abstract
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
Keywords
Bipartite graph; Average delay; Energy Consumed; Carried Load
Full Text:
PDFDOI: http://doi.org/10.11591/ijece.v5i6.pp1417-1423
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).