Picture of smart phone in human hand

World leading smartphone and mobile technology research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by Strathclyde researchers from the Department of Computer & Information Sciences involved in researching exciting new applications for mobile and smartphone technology. But the transformative application of mobile technologies is also the focus of research within disciplines as diverse as Electronic & Electrical Engineering, Marketing, Human Resource Management and Biomedical Enginering, among others.

Explore Strathclyde's Open Access research on smartphone technology now...

Efficient routing for the extension of lifetime and quality of energy constrained ad hoc networks

Farinetto, C. and Harle, D.A. and Tachtatzis, C. and Zuyev, S. (2005) Efficient routing for the extension of lifetime and quality of energy constrained ad hoc networks. In: 19th International Teletraffic Congress, 2005-08-29 - 2005-09-02.

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

This paper presents two new routing algorithms for maximising the lifetimes of wireless energy-constrained ad-hoc networks. Our approach is based on the homogenisation of energy consumption in the network as opposed to the more traditional approach where the paths are chosen based upon highest energy. Results show the relative merits of the proposed schemes with respect to existing energy-aware protocols and clearly indicated that the two proposed algorithms enable full network connectivity to be maintained for longer. Additionally, the two algorithms mitigate against the effects of inevitable node outages caused by energy exhaustion and offer an improved likelihood of maintaining connectivity when nodes are lost by comparison with other previously proposed algorithms.