A Geometric approach to routing in Ad-Hoc Networks
|
Abstract:
The basic problem we address is that of route determination in a network where the nodes are mobile and each node can transfer data only to those nodes within a xed geometric radius centered at the node. Since the link structure in this scenario described depends exclusively on the geometric location of the nodes, data structures for maintaining geometric features in moving points become a strong candidate for solving the problem. In this report, we investigate the use of a Kinetic Data Structure (KDS for short) to maintain an approximate minimum spanning tree. We use a continuous, increasing function of the Euclidean Distance as the link cost. The resulting graph closely approximates the connectivity graph of an Ad-Hoc network. We also compare our routing strategy with the shortest path based techniques. For the sake of completeness we give a brief introduction to KDS as well. 1
Citations
| 215 | A data structure for dynamic trees – Sleator, Tarjan - 1983 |
| 137 | Data structures for on-line updating of minimum spanning trees, with applications – Frederickson - 1985 |
| 136 | Data structures and algorithms 3: Multi-dimensional searching and computational geometry – Mehlhorn - 1984 |
| 44 | Proximity problems on moving points – Basch, Guibas, et al. - 1997 |
| 17 | Kinetic data structures – Basch - 1999 |
