Location of Repository

Graph colouring for office blocks

By David Allwright, Tim Gould, Jens Gravesen, Robert Leese and Henrik Petersen

Abstract

The increasing prevalence of WLAN (wireless networks) introduces the potential of electronic information leakage from one company's territory in an office block, to others due to the long-ranged nature of such communications. BAE Systems have developed a system ('stealthy wallpaper') which can block a single frequency range from being transmitted through a treated wall or ceiling to the neighbour. The problem posed to the Study Group was to investigate the maximum number of frequencies ensure the building is secure. The Study group found that this upper bound does not exist, so they were asked to find what are "good design-rules" so that an upper limit exists

Topics: None/Other, Aerospace and defence, Information and communication technology
Year: 2006
OAI identifier: oai:generic.eprints.org:66/core70

Suggested articles

Preview

Citations

  1. (1977). A convex partitioning of R3 with applications to Crum’s problem and Knuth’s post-office problem.
  2. (1996). A new proof of the four colour theorem. doi
  3. (1977). Every planar map is four colorable. Part
  4. (1965). Famous Problems of Mathematics. Graylock,
  5. (2004). Graph colouring page – web resource.
  6. (1979). Graph Theory—An Introductory Course.
  7. (1947). On Crum’s Problem. doi
  8. (1905). U¨ber Nachbargebiete im Raume. Monatshefte fu¨r Mathematik und Physik,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.