Fault-tolerant spanners for ad hoc networks

Authors:
D. Satyanarayana;S. V. Rao
Affiliations:
School of Electronics and Electrical Engineering, University of Leeds, Leeds, UK;Department of Computer Science and Engineering, Indian Institute of Technology, Guwahati, India
Venue:
International Journal of Network Management
Year:
2012

Citing 21
Cited 0

Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
A distance routing effect algorithm for mobility (DREAM)

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric spanner for routing in mobile networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Beta-skeletons have unbounded dilation

Computational Geometry: Theory and Applications
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
New Results of Fault Tolerant Geometric Spanners

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Online Routing in Triangulations

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the Spanning Ratio of Gabriel Graphs and beta-skeletons

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant geometric spanners

Proceedings of the nineteenth annual symposium on Computational geometry
Geometric Spanners for Wireless Ad Hoc Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Ad-hoc networks beyond unit disk graphs

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
On Quality Of Service Routing in Ad-Hoc Networks

LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation

IEEE Transactions on Parallel and Distributed Systems
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability

Operations Research Letters
Geometric spanners for routing in mobile networks

IEEE Journal on Selected Areas in Communications
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

Spanners for ad hoc networks provide several benefits such as low communication cost and resource consumption. These spanners need to be fault tolerant in resource-constrained ad hoc networks. In this paper, we have proposed three spanners, called fault-tolerant local Delaunay triangulation (FTLDel), fault-tolerant relative neighborhood graph (FTRNG), and fault-tolerant Gabriel graph (FTGG). The fault-tolerant spanners provide reliability to the network by avoiding heavy packet loss and retaining useful geometric properties. The performance of fault-tolerant spanners FTLDel, FTRNG, and FTGG are evaluated using the network simulator ns2.28. Copyright © 2011 John Wiley & Sons, Ltd.