Abstract
Geographic routing protocols are well suited to wireless sensor networks because of their modest resource requirements. A major limiting factor in their implementation is the requirement of location information. The virtual localization algorithm provides the functionality of geographic routing without any knowledge of node locations by constructing a virtual coordinate system. It differs from similar algorithms by improving efficiency – greedy routing performs significantly better over virtual locations than over physical locations. The algorithm was tested and evaluated in a real network environment.
Author supplied keywords
Cite
CITATION STYLE
Grubman, T., Şekercioğlu, Y. A., & Moore, N. (2015). Virtual localization for robust geographic routing in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8629, pp. 179–186). Springer Verlag. https://doi.org/10.1007/978-3-662-46338-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
