Virtual Coordinate Backtracking for Void Traversal in Geographic Routing

Simple item page
dc.creatorLiu, Ke
dc.creatorAbu-Ghazaleh, Nael
dc.date2005-11-15
dc.date2006-05-30
dc.date.accessioned2026-07-07T09:28:51Z
dc.date.available2026-07-07T09:28:51Z
dc.descriptionGeographical routing protocols have several desirable features for use in ad hoc and sensor networks but are susceptible to voids and localization errors. Virtual coordinate systems are an alternative solution to geographically based routing protocols that works by overlaying a coordinate system on the sensors relative to well chosen reference points. VC is resilient to localization errors; however, we show that it is vulnerable to different forms of the void problem and have no viable complementary approach to overcome them. Specifically, we show that there are instances when packets reach nodes with no viable next hop nodes in the forwarding set. In addition, it is possible for nodes with the same coordinates to arise at different points in the network in the presence of voids. This paper identifies and analyzes these problems. It also compares several existing routing protocols based on Virtual Coordinate systems. Finally, it presents a new routing algorithm that uses backtracking to overcome voids to achieve high connectivity in the greedy phase, higher overall path quality and more resilience to localization errors. We show these properties using extensive simulation analysis.
dc.identifierhttps://arxiv.org/abs/cs/0511059
dc.identifierhttp://arxiv.org/abs/cs/0511059
dc.identifierAdHocNow 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157577
dc.subjectNetworking and Internet Architecture
dc.titleVirtual Coordinate Backtracking for Void Traversal in Geographic Routing
dc.typetext

Files

Collections

arXiv