Abstract
To efficiently address the routing problem in ad hoc networks, we introduce a new utility metric, maximum expected social welfare, and integrate the cost and stability of nodes in a unified model to evaluate the optimality of routes. The expected social welfare is defined in terms of expected benefit (of the routing source) minus the expected costs incurred by forwarding nodes. Based on this new metric, we design an optimal and efficient algorithm, and implement the algorithm in both centralized (optimal) and distributed (near-optimal) manners. We also look at several extensions in improving benefit, all optimal routes, incentive compatible routing, and applications of this new model.
Chapter PDF
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, J. (2008). A Utility-Based Routing Scheme in Ad Hoc Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)