Landmarks Selection Algorithm for Virtual Coordinates Routing

Authors:
Sergey Baskakov
Affiliations:
Information Systems and Telecommunications Department, Bauman Moscow State Technical University, Moscow,
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 5
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks

RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Efficient Hop ID based Routing for Sparse Ad Hoc Networks

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Scalable logical coordinates framework for routing in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Beacon vector routing: scalable point-to-point routing in wireless sensornets

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a distributed, self-organized landmarks selection algorithm which ensures different patterns of landmarks spread throughout deployment area of a wireless sensor network. The algorithm is highly scalable through decentralized implementation with low time and memory complexity. The proposed technique represents an optimal complexity algorithm for virtual coordinates routing protocols in large-scale wireless sensor networks, and our simulations show that it improves significantly virtual coordinates routing protocols performance, preserving simplicity and high scalability of this routing method.