#### Filter Results:

#### Publication Year

2004

2009

#### Publication Type

#### Publication Venue

#### Key Phrases

Learn More

— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk graph model in which nodes are assumed to be connected if, and only if, nodes are within their transmission range. The main contribution of this work is a fully distributed algorithm to… (More)

The Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a given fixed points in the plane, allowing the addition of auxiliary points known as Steiner points. Parallel implementations of local search algorithm are an effective technique to speed up the search for a solution of Steiner tree problem. This technique not… (More)

This paper presented a parallel local search algorithm for the Steiner tree problem. The main contribution of this work is the O(n<sup>2</sup> log<sup>2</sup> n + log n log(n/ log n)) parallel local search algorithm for computing Steiner tree on the Euclidean plane. The algorithm used proximity structures from computational geometry like, Voronoi diagram,… (More)

This paper presents the computational analysis and simulation of the parallel Steiner tree problem on the client- sever model of computation. In particular, this work analyzes the time delays among server and clients, presents an algorithm for an event-driven simulation of Steiner tree problem on server-client model, and examines some consequences of time… (More)

This paper presents the computational analysis of the Steiner tree problem on the Server-Client model of computation. In particular, this work analyzes the time delays among server and clients for the parallel Steiner tree algorithm and examines some consequences of time delays on the execution time by considering constant and variable delays.

This paper presented a fully distributed algorithm to compute a planar subgraph for geo-routing in ad hoc wireless networks. We considered the idealized unit disk graph model in which nodes are assumed to be connected if and only if nodes are within their transmission range. The main contribution of this work is a fully distributed algorithm to extract the… (More)

In this paper, we presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. We considered the idealized unit disk graph model in which nodes are assumed to be connected if and only if nodes are within their transmission range. The main contribution of this work is a fully distributed algorithm to… (More)

In this paper, we discuss the problem of assigning transmitting ranges and establishing connectivity in ad hoc wireless networks from the practical perspective. That is, setup a communication links by introducing extraneous nodes to the network in the emergencies. Furthermore, transmitting ranges of nodes must be assigned in such a way that the energy cost… (More)

This paper presents the computational analysis of the Steiner tree problem on the server-client model of computation. In particular, this work analyzes the time delays among server and clients for the parallel Steiner tree algorithm and examines some consequences of time delays on the execution time by considering constant and variable delays. The paper… (More)