A New Algorithm for the Euclidean k-Bottleneck Steiner Problem

@inproceedings{Brazil2010ANA,
  title={A New Algorithm for the Euclidean k-Bottleneck Steiner Problem},
  author={Marcus Brazil and Charl J. Ras and Doreen Thomas},
  year={2010}
}
We consider the problem of adding a fixed number of relays to a WSN in order to minimise the length of the longest transmission edge. Since routing subnetworks are often trees we model the problem as a Euclideank-bottleneck Steiner tree problem (k-BSTP). We then propose a new iterative approximation algorithm for the k-BSTP, based on an exact solution to the 1-BSTP, and compare our heuristic (via simulation) to the currently best performing heuristic in the literature, namely the minimum… CONTINUE READING
1 Extracted Citations
16 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 16 references

A multifacility minimax location method for Euclidean distances, Int

  • R. F. Love, G. O. Wesolowsky, S. A. Kraemer
  • J. Prod. Research ,
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…