Abstract
We propose least critical lifetime routing (LCLR) for improving the lifetime of battery operated 802.11 wireless mesh networks. Our protocol uses a novel expected lifetime metric to identify the critical node in a path and adjusts the amount of traffic over that path accordingly. We also adopt a simple route congestion measure to further fine tune the amount of traffic sent over a given path. More importantly, LCLR also takes interference and congestion into account. Moreover, we use a simple path available bandwidth estimation approach, which is integrated into the routing process. We evaluate the performance of LCLR by using NS2 simulations and compare it to that of ad hoc on-demand distance vector (AODV), minimum total energy routing and the optimal solution to the maximum lifetime routing problem. Our results obtained for different network topologies suggest that LCLR performs close to the optimum.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Ad Hoc and Ubiquitous Computing
Disclaimer: 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.