Bounding the locality of distributed routing algorithms

Authors:
Prosenjit Bose;Paz Carmi;Stephane Durocher
Affiliations:
Carleton University, Ottawa, ON, Canada;Ben-Gurion University of the Negev, Beer-Sheva, Israel;University of Manitoba, Winnipeg, MAN, Canada
Venue:
Proceedings of the 28th ACM symposium on Principles of distributed computing
Year:
2009

Citing 6
Cited 0

Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Ad-hoc networks beyond unit disk graphs

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Route discovery with constant memory in oriented planar geometric networks

Networks
On ad hoc routing with guaranteed delivery

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local routing on tori

ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Position-based routing in ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine bounds on the locality of routing. A local routing algorithm makes a sequence of distributed forwarding decisions, each of which is made using only local information. Specifically, in addition to knowing the node for which a message is destined, an intermediate node might also know a) the subgraph corresponding to all network nodes within k hops of itself, for some value of k, b) the node from which the message originated, and c) which of its neighbours last forwarded the message. Our objective is to determine which of these parameters are necessary and/or sufficient to permit local routing as k varies on a network modelled by a connected undirected graph. In particular, we establish tight bounds on k for the feasibility of deterministic k-local routing for various combinations of these parameters, as well as corresponding bounds on dilation (the worst-case ratio of actual route length to shortest path length).