Locally-Constructed trees for adhoc routing

Authors:
Ricardo Marcelín-Jiménez
Affiliations:
Electrical Eng. Dept., UAMI, México D.F., México
Venue:
PWC'06 Proceedings of the 11th IFIP TC6 international conference on Personal Wireless Communications
Year:
2006

Citing 8
Cited 0

Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
On k-connectivity for a geometric random graph

Random Structures & Algorithms
Self-stabilization

Self-stabilization
Topology control and routing in ad hoc networks: a survey

ACM SIGACT News
Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
On local algorithms for topology control and routing in ad hoc networks

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Localized algorithms for energy efficient topology in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Localized Delaunay triangulation with application in ad hoc wireless networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a family of self-stabilizing distributed algorithms to built a spanning tree on the underlaying communications graph of an adhoc wireless network. Next, based on this principle, we show how to construct two overlaying trees which are suitable for routing tasks.