Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

This paper addresses distributed scheduling in a self-organizing wireless network, assuming partial orthogonality of multiple transmitters. Previous work suggests that the optimal scheduling scheme depends on the degree of orthogonality of the interfering users. A fair efficient distributed scheduling scheme can be defined using a synchronous game for highly orthogonal transmitters (with orthogonality factor less than 0.5) and using an asynchronous game based on one-at-a-time transmission for orthogonality factors above 0.5. The distributed game heuristic only requires local node level information but still achieves a sum of rates at least 90 % of that obtained using the better of proportional fair scheduling and simultaneous transmission for a wide range of orthogonality factors. Assuming a slowly varying Rayleigh channel, an asynchronous scheduling game based on one-at-a-time transmission achieves the same sum of rates as proportional fair scheduling but only requires local node-level information.

REFERENCES

• 1: E. Altman and Z. Altman, S-modular games and power control in wireless networks, IEEE Tr. Automatic Control, Vol. 48, No. 5, pp. 839--842, May 2003
• 2: S. Han, H. Kim and Y. Han, Distributed Utility Maximization using a Resource Pricing Power Control in Uplink DS-CDMA, IEEE Communication Letters, 12(4): 286--288, 2008
• 3: T. Heikkinen, Distributed scheduling and dynamic pricing in a communication network, Wireless Networks, v.10 n.3, p.233-244, May 2004 [doi>10.1023/B:WINE.0000023858.20849.ab]
• 4: T. Heikkinen, A potential game approach to distributed power control and scheduling, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.50 n.13, p.2295-2311, 15 September 2006 [doi>10.1016/j.comnet.2005.09.010]
• 5: S. Kulkarni and C. Rosenberg, Opportunistic scheduling policies for wireless systems with short term fairness constraints, Proc. GLOBECOM 2003 -- IEEE Global Telecommunications Conference, no. 1, Dec 2003 pp. 533--537
• 6: Krishnan Kumaran , Lijun Qian, Uplink scheduling in CDMA packet-data systems, Wireless Networks, v.12 n.1, p.33-43, February 2006 [doi>10.1007/s11276-006-6148-7]
• 7: C. Saraydar, N. Mandayam, D. Goodman, Pareto efficiency of pricing-based power control in wireless datanetworks, Proc. Wireless Communications and Networking Conference (IEEE WCNC), 1999
• 8: P. Viswanath, D. Tse and R. Laroia, Opportunistic Beamforming using Dumb Antennas, IEEE Transactions on Information Theory, vol. 48(6), June, 2002

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

  E. Data
  E.4 CODING AND INFORMATION THEORY

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling

General Terms:
Algorithms, Theory

Keywords:
game theory, pricing, scheduling, wireless ad hoc network