93 research outputs found
On Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric
spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay
subgraph is a planar geometric spanner with stretch factor C_{del\approx
2.42; however, its degree may not be bounded. Our first result is a very
simple linear time algorithm for constructing a subgraph of the Delaunay graph
with stretch factor \rho =1+2\pi(k\cos{\frac{\pi{k)^{-1 and degree bounded by
, for any integer parameter . This result immediately implies an
algorithm for constructing a planar geometric spanner of a Euclidean graph with
stretch factor \rho \cdot C_{del and degree bounded by , for any integer
parameter . Moreover, the resulting spanner contains a Euclidean
Minimum Spanning Tree (EMST) as a subgraph. Our second contribution lies in
developing the structural results necessary to transfer our analysis and
algorithm from Euclidean graphs to unit disk graphs, the usual model for
wireless ad-hoc networks. We obtain a very simple distributed, {\em
strictly-localized algorithm that, given a unit disk graph embedded in the
plane, constructs a geometric spanner with the above stretch factor and degree
bound, and also containing an EMST as a subgraph. The obtained results
dramatically improve the previous results in all aspects, as shown in the
paper
A clustered back-bone for routing in ad-hoc networks
In the recent years, a lot of research work has been undertaken in the area of ad-hoc networks due to the increasing potential of putting them to commercial use in various types of mobile computing devices. Topology control in ad-hoc networks is a widely researched topic; with a number of algorithms being proposed for the construction of a power-efficient topology that optimizes the battery usage of the mobile nodes.
This research proposes a novel technique of partitioning the ad-hoc network into virtually-disjoint clusters. The ultimate aim of forming a routing graph over which power-efficient routing can be implemented in a simple and effective manner is realized by partitioning the network into disjoint clusters and thereafter joining them through gateways to form a connected, planar back-bone which is also a t-spanner of the original Unit Disk Graph (UDG). Some of the previously proposed algorithms require the nodes to construct local variations of the Delaunay Triangulation and undertake several complicated steps for ensuring the planarity of the back-bone graph. The construction of the Delaunay Triangulation is very complex and time-consuming. This work achieves the objective of constructing a routing graph which is a planar spanner, without requiring the expensive construction of the Delaunay Triangulation, thus saving the node power, an important resource in the ad-hoc network. Moreover, the algorithm guarantees that the total number of messages required to be sent by each node is O(n). This makes the topology easily reconfigurable in case of node motion
The localized Delaunay triangulation and ad-hoc routing in heterogeneous environments
Ad-Hoc Wireless routing has become an important area of research in the last few years due to the massive increase in wireless devices. Computational Geometry is relevant in attempts to build stable, low power routing schemes. It is only recently, however, that models have been expanded to consider devices with a non-uniform broadcast range, and few properties are known. In particular, we find, via both theoretical and experimental methods, extremal properties for the Localized Delaunay Triangulation over the Mutual Inclusion Graph. We also provide a distributed, sub-quadratic algorithm for the generation of the structure
FLOC-SPANNER: An O(1) time, locally self-stabilizing algorithm for geometric spanner construction in a wireless sensor network
Geometric spanners are a popular form of topology control in wireless networks because they yield an efficient, reduced interference subgraph for both unicast and broadcast routing.;In this thesis work a distributed algorithm for creation of geometric spanners in a wireless sensor network is presented. Given any connected network, we show that the algorithm terminates in O(1) time, irrespective of network size. Our algorithm uses an underlying clustering algorithm as a foundation for creating spanners, and only relies on the periodic heartbeat messages associated with cluster maintenance for the creation of the spanners. The algorithm is also shown to stabilize locally in the presence of node additions and deletions. The performance of our algorithm is verified using large scale simulations. The average path length ratio for routing along the spanner for large networks is shown to be less than 2.;Geometric Spanners is a well-researched topic. The algorithm presented in this thesis differs from other spanner algorithms in the following ways: 1. It is a distributed locally self-stabilizing algorithm. 2. It does not require location information for its operation. 3. Creates spanner network in constant time irrespective of network size and network density
MAP: Medial Axis Based Geometric Routing in Sensor Networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, the length of the communication paths and the load sharing of the routes. In this paper, we show that a compact and expressive abstraction of network connectivity by the medial axis enables efficient and localized routing. We propose MAP, a Medial Axis based naming and routing Protocol that does not require locations, makes routing decisions locally, and achieves good load balancing. In its preprocessing phase, MAP constructs the medial axis of the sensor field, defined as the set of nodes with at least two closest boundary nodes. The medial axis of the network captures both the complex geometry and non-trivial topology of the sensor field. It can be represented compactly by a graph whose size is comparable with the complexity of the geometric features (e.g., the number of holes). Each node is then given a name related to its position with respect to the medial axis. The routing scheme is derived through local decisions based on the names of the source and destination nodes and guarantees delivery with reasonable and natural routes. We show by both theoretical analysis and simulations that our medial axis based geometric routing scheme is scalable, produces short routes, achieves excellent load balancing, and is very robust to variations in the network model
FLOC-SPANNER: An Time, Locally Self-Stabilizing Algorithm for Geometric Spanner Construction in a Wireless Sensor Network
We present a distributed algorithm for creation of geometric spanners in a wireless sensor network. Given any connected network, we show that the algorithm terminates in time, irrespective of network size. Our algorithm uses an underlying clustering algorithm as a foundation for creating spanners and only relies on the periodic heartbeat messages associated with cluster maintenance for the creation of the spanners. The algorithm is also shown to stabilize locally in the presence of node additions and deletions. The performance of our algorithm is verified using large scale simulations. The average path length ratio for routing along the spanner for large networks is shown to be less than 2
- …