Dynamic delaunay triangulation for wireless ad hoc network

Authors:
Ming Li;XiCheng Lu;Wei Peng
Affiliations:
School of Computer Science, National University of Defense Technology, Hunan, China;School of Computer Science, National University of Defense Technology, Hunan, China;School of Computer Science, National University of Defense Technology, Hunan, China
Venue:
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Year:
2005

Citing 9
Cited 0

Delaunay graphs are almost as good as complete graphs

Discrete & Computational Geometry
Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
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
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 geometric and wireless networks

Handbook of wireless networks and mobile computing
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph

WADS '89 Proceedings of the 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geometric routing protocols benefit from localized Delaunay triangulation, which can guarantee the delivery of packet and bound the length of route. In this paper we propose a localized algorithm to build Delaunay triangulation in wireless ad hoc network. The algorithm considers not only stationary situation but also dynamic situation in which nodes can dynamically join and leave the network. The communication cost of the algorithm is O(nlogn). Therefore, our algorithm is applicable in wireless sensor network, in which nodes dynamically join and leave network. We also prove the correctness of the algorithm.