Theory of Computing Systems

, Volume 50, Issue 1, pp 147–157 | Cite as

Maintaining Privacy on a Line

Article

Abstract

Consider a situation where people have to choose among a sequence of n linearly ordered positions to perform some task requiring a certain amount of privacy. Which position should one choose so as to maximize one’s privacy, i.e., minimize the chances that one of your neighboring positions becomes occupied by a later arrival? In this paper, we attempt to answer this question under a variety of models for the behavior of the later arrivals. Our results suggest that for the most part one should probably choose one of the extreme positions (with some interesting exceptions). We also suggest a number of variations on the problem that lead to many open problems.

Keywords

Privacy Line graph Obnoxious facility location problem Unfriendly seating arrangement problem 

References

  1. 1.
    Flajolet, P.: A seating arrangement problem. http://algo.inria.fr/libraries/autocomb/fatmen-html/fatmen1.html
  2. 2.
    Freedman, D., Shepp, L.: An unfriendly seating arrangement problem. SIAM Rev. 4, 150 (1962) CrossRefGoogle Scholar
  3. 3.
    Friedman, H.D., Rothman, D.: Solution to an unfriendly seating arrangement problem. SIAM Rev. 6, 180–182 (1964) CrossRefGoogle Scholar
  4. 4.
    Georgiou, K., Kranakis, E., Krizanc, D.: Random maximal independent sets and the unfriendly theater arrangement problem. Discrete Math. 309, 5120–5129 (2009) MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Hoffman, L.: Computers and privacy: a survey. ACM Comput. Surv. 1, 85–103 (1969) CrossRefGoogle Scholar
  6. 6.
    Kleinrock, L.: Queueing Systems, Volume 1: Theory. Wiley, Hoboken (1975) Google Scholar
  7. 7.
    MacKenzie, J.K.: Sequential filling of a line by intervals placed at random and its application to linear absorption. J. Chem. Phys. 37, 723–728 (1962) CrossRefGoogle Scholar
  8. 8.
    Munroe, R.: Urinal protocol vulnerability. http://blog.xkcd.com/2009/09/02/urinal-protocol-vulnerability/
  9. 9.
    Paola, C.: A survey of obnoxious facility location problems. TR-99-11, University of Pisa, Dept. of Informatics (1999) Google Scholar
  10. 10.
    Ross, S.M.: Stochastic Processes, 2nd edn. Wiley, New York (1996) MATHGoogle Scholar
  11. 11.
    Vogt, R., Nascimento, M.A., Harns, J.: On the tradeoff between user-location privacy and queried-location privacy in wireless sensor networks. In: AdHoc Now 2009, pp. 241–254 (2009) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Department of Mathematics and Computer ScienceWesleyan UniversityMiddletownUSA

Personalised recommendations