Maximum weight independent sets in an infinite plane with uni- and bidirectional interference models

Article

Abstract

We study the maximum weight independent sets of links between nodes distributed randomly in an infinite plane. Different definitions of the weight of a link are considered, leading to slight variations of what is essentially a spatial reuse problem in wireless multihop networks. A simple interference model is assumed with the interference radius equaling the transmission radius. In addition to unidirectional interference from a transmitter to the receivers of other links, also an RTS/CTS-type bidirectional handshake is considered. We study both the case where the transmission radius is fixed and tunable through power control. With a fixed transmission radius, we derive asymptotic results for the low- and high-density regimes. The main contribution is in the numerical results for the maximum weight, establishing some previously unknown parameters of stochastic geometry. The results are obtained by the Moving Window Algorithm that is able to find the maximum weight independent set in a strip of limited height but unlimited length. By studying the results as a function of the height of the strip, we are able to extrapolate to the infinite plane.

Keywords

Maximum weight independent set Spatial reuse Random geometric graph  Asymptotics Wireless multihop network Capacity 

Notes

Acknowledgements

The work was done in the ABI and AWA projects funded by TEKES, Ericsson, and Nokia Siemens Networks. JN was supported by the Nokia Foundation.

References

  1. 1.
    Baccelli F, Blaszczyszyn B, Muhlethaler P (2006) An aloha protocol for multihop mobile wireless networks. IEEE Trans Inf Theory 52(2):421–436CrossRefMathSciNetGoogle Scholar
  2. 2.
    Catanuto R, Toumpis S, Morabito G (2007) Opti{c,m}al: optical/optimal routing in massively dense wireless networks. In: IEEE INFOCOM. pp. 1010–1018Google Scholar
  3. 3.
    Durvy M, Dousse O, Thiran P (2009) Self-organization properties of CSMA/CA systems and their consequences on fairness. IEEE Trans Inf Theory 55(3):931–943CrossRefMathSciNetGoogle Scholar
  4. 4.
    Durvy M, Thiran P (2006) A packing approach to compare slotted and non-slotted medium access control. In: IEEE INFOCOM. pp. 1–12Google Scholar
  5. 5.
    Fomin FV, Grandoni F, Kratsch D (2009) A measure & conquer approach for the analysis of exact algorithms. J ACM 56(5):1–32CrossRefMathSciNetGoogle Scholar
  6. 6.
    Franceschetti M, Dousse O, Tse DNC, Thiran P (2007) Closing the gap in the capacity of wireless networks via percolation theory. IEEE Trans Inf Theory 53(3):1009–1018CrossRefMathSciNetGoogle Scholar
  7. 7.
    Garey M, Johnson D (1979) Computers and intractability. W. H. Freeman and Company, New York, USAGoogle Scholar
  8. 8.
    Gupta P, Kumar PR (2000) The capacity of wireless networks. IEEE Trans Inf Theory 46(2):388–404MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Hyytiä E, Virtamo J (2007) On traffic load distribution and load balancing in dense wireless multihop networks. In: EURASIP journal on wireless communications and networking, 2007, Article ID 16932. pp. 15Google Scholar
  10. 10.
    Jacquet P. (2004) Geometry of information propagation in massively dense ad hoc networks. In: Proceedings of ACM MobiHoc ’04. pp. 157–162Google Scholar
  11. 11.
    Jung K, Shah D (2007) Low delay scheduling in wireless network. In: IEEE ISIT. pp. 1396–1400Google Scholar
  12. 12.
    Kalantari M, Shayman M (2004) Energy efficient routing in wireless sensor networks. In: Proc. of conference on information sciences and systems, Princeton, USAGoogle Scholar
  13. 13.
    Modiano E, Shah D, Zussman G (2006) Maximizing throughput in wireless networks via gossiping. SIGMETRICS Perform Eval Rev 34(1):27–38CrossRefGoogle Scholar
  14. 14.
    Nousiainen J, Lassila P (2009) Approximating maximum directed flow in a large wireless network. In: IEEE ICC, Dresden, GermanyGoogle Scholar
  15. 15.
    Nousiainen J, Virtamo J, Lassila P (2008) Forwarding capacity of an infinite wireless network. In: Proceedings of ACM MSWiM, Vancouver, CA. pp. 177–184Google Scholar
  16. 16.
    Nousiainen J, Virtamo J, Lassila P (2009) Maximum weight independent sets in an infinite plane. In: ITC21, Paris, FranceGoogle Scholar
  17. 17.
    Takagi H, Kleinrock L (1984) Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans Commun 32(3):246–257CrossRefGoogle Scholar
  18. 18.
    Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans Automat Contr 37(12):1936–1949MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Virtamo JT (1992) A model of reservation systems. IEEE Trans Commun 40(1):109–118CrossRefGoogle Scholar

Copyright information

© Institut Télécom and Springer-Verlag 2010

Authors and Affiliations

  1. 1.Department of Communications and NetworkingAalto UniversityAaltoFinland

Personalised recommendations