Abstract
QoS routing algorithm is an important issue to research in wireless multimedia sensor networks (WMSNs). The least energy-consumption and real-time routing policies are addressed in the paper. A novel QoS routing algorithm is proposed to optimize QoS parameters based on event-sensitive node set. This algorithm includes three parts. Firstly, graph G of WMSNs is traversed and these nodes whose residual energy is lower than a desired value will be removed from G. Secondly, Dijkstra algorithm with energy consumption as metric parameter is used to compute the least energy paths from each event sensitive node to the sink node. Thirdly, if a path destroys the delay upper bound, the least delay path will be computed to replace the least energy consumption path. Its correctness is also reasoned and proved in theories. At last, two simulation experiments are done to test the proposed algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
