DISTRIBUTED SCHEDULING IN A TIME-VARYING AD HOC NETWORK
Keywords:
wireless scheduling, ad hoc networks, game theory, energy efficiencyAbstract
This paper studies opportunistic distributed scheduling in an ad hoc wireless network, assuming partial orthogonality among multiple transmitters. The approach is based on game theory. A fair distributed scheduling scheme in a time-correlated channel is defined using a synchronous game for highly orthogonal transmitters and using an asynchronous game based on one-at-a-time transmission otherwise. Distributed game heuristics only require local node level information but still achieve a significant portion (at least 80 % in example cases) of the sum of rates obtained using coalitional uplink proportional fair scheduling for a wide range of orthogonality factors. An asynchronous game based on one-at-a-time transmission performs well relative to PFS for non-orthogonal trans- mitters. In addition to noncooperative game models, a cooperative game model for threshold-based scheduling is studied.
Downloads
References
D. Zheng, W. Ge and J. Zhang (2009), Distributed Opportunistic Scheduling for Ad Hoc Networks
with Random Access: An Optimal Stopping Approach, IEEE Tr. on Information Theory, 55, pp.
-222
H. Zhu, Y. Tang and I. Chlamtac (2008), Unified Collision-Free Coordinated Distributed Scheduling
(CF-CDS) in IEEE 802.16 Mesh Networks, IEEE Tr. on Wireless Communications, 7(10), pp.
-3903
P. Marbach (2007), Distributed Scheduling and Active Queue Management in Wireless Networks,
in proc. IEEE Conference on Computer Communications (Infocom), Anchorage, USA
E. Natsheh, T. C. Wan (2008), Adaptive and fuzzy approaches for nodes affinity management in
wireless ad-hoc networks, Mobile Information Systems 4(4): 273-295
N. Chand, R. C. Joshi, M. Misra (2007), Cooperative caching in mobile ad hoc networks based on
data utility, Mobile Information Systems 3(1): 19-37
J. Suris (2007), Cooperative Game Theory and NonConvex Optimization for Distributed Spectrum
Sensing, Dissertation in Computer Engineering, Virginia Tech, November
E. Altman and Z. Altman (2003), S-modular games and power control in wireless networks, IEEE
Tr. Automatic Control, 48(5), pp. 839-842
K. Kumaran and L. Qian (2006), Uplink Scheduling in CDMA Packet-Data Systems, Wireless
Networks, 12, pp. 33-34
P. Viswanath, D. Tse and R. Laroia (2002), Opportunistic Beamforming using Dumb Antennas,
IEEE Transactions on Information Theory, vol. 48(6)
T. Heikkinen and A. Hottinen (2008), Distributed Scheduling via Pricing with Partial Orthogo-
nality, In Proc. 6th International Conference on Advances in Mobile Computing and Multimedia
(MoMM 2008), Linz, Austria, Nov., pp. 248-253
T. Heikkinen (2004), Distributed Scheduling and Dynamic Pricing in a Communication Network,
Wireless Networks, 10(3), pp. 233 - 244
S. Han, H. Kim and Y. Han (2008), Distributed Utility Maximization using a Resource Pricing
Power Control in Uplink DS-CDMA, IEEE Communication Letters, 12(4), pp. 286-288
M. Osborne and A. Rubinstein (1994), A Course in Game Theory, The MIT Press
M. Andrews (2005), A Survey of Scheduling Theory in Wireless Networks, IMA (Institute for
Mathematics and its Applications) summer workshop on wireless communications
T. Basar and G. Olsder (1995), Dynamic noncooperative game theory, Academic Press
H. Kusher and P. Whiting (2004), Convergence of Proportional Fair Sharing Algorithms under
General Conditions, IEEE Tr. Wireless Communications, 3(4), pp. 1250-1259
T. Heikkinen (2000), On the Quality of Service and Learning in a Wireless Network, in Proc.
Networking 2000 Conference (Springer-Verlag Lecture Notes in Computer Science), Paris, France
T. Heikkinen (1998), On The Allocation of Resources in a Multimedia Network, Proc. 36th Annual
Allerton Conference on Communication, Control and Computing, USA, pp. 673-682
