Optimal Scheduling for Link Assignment in Traffic-Sensitive STDMA Wireless Ad-Hoc Networks

In this paper, we consider the resource optimization problem to maximize the network throughput by efficiently using the network capacity, where multi-hop functionality and spatial TDMA access scheme are used. The objective is to find the minimum frame length with given traffic distributions and corresponding routing information. Because of the complex structure of the underlying mathematical problem, previous work and analysis become intractable for networks of realistic sizes.We address the problem through mathematical programming approach, develop the linear integer formulation optimizing the network throughput, and then show the similarity between the original problem and the graph edge coloring problem through the conflict graph concept. We propose a column generation solution approach and make several enhancements in order to fasten its convergence. Numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes.

[1]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[2]  Andrea J. Goldsmith,et al.  Design challenges for energy-constrained ad hoc wireless networks , 2002, IEEE Wirel. Commun..

[3]  Lin Xiao,et al.  Cross-layer optimization of wireless networks using nonlinear column generation , 2006, IEEE Transactions on Wireless Communications.

[4]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[5]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[6]  Di Yuan,et al.  Resource optimization of spatial TDMA in ad hoc radio networks: a column generation approach , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

[8]  Juha Leino,et al.  Applications of Game Theory in Ad Hoc Networks , 2003 .

[9]  Jimmi Grönkvist.  Assignment strategies for spatial reuse TDMA , 2002 .

[10]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[11]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[12]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[13]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[14]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).