A weighted routing protocol using grey relational analysis for wireless Ad Hoc networks

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Issues relating to routing protocols are important in wireless ad hoc network research. In this paper we present a weighted ad-hoc routing protocol that exhibit low cost and high efficiency. In our method, important factors including hop count, end-to-end delays, and nodes' residual energy are considered. Grey Relational Analysis is utilized for discovering the importance of these factors and to decide their weighted values. Simulation result shows that the performance of our method is better than traditional wireless ad hoc network routing protocols. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chu, H. C., Hsu, Y. T., & Lai, Y. H. (2008). A weighted routing protocol using grey relational analysis for wireless Ad Hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5060 LNCS, pp. 655–663). https://doi.org/10.1007/978-3-540-69295-9_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free