A column generation method for spatial TDMA scheduling in ad hoc networks

An ad hoc network can be set up by a number of units without the need of any permanent infrastructure. Two units establish a communication link if the channel quality is sufficiently high. As not a ...

[1]  A.-M. Chou,et al.  Slot allocation strategies for TDMA protocols in multihop packet radio networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[2]  J. Gronkvist.  Traffic controlled spatial reuse TDMA in multi-hop radio networks , 1998, Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No.98TH8361).

[3]  Israel Cidon,et al.  Distributed assignment algorithms for multi-hop packet-radio networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[4]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2003, IEEE Trans. Wirel. Commun..

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

[6]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[7]  Craig G. Prohazka.  Decoupling Link Scheduling Constraints in Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[8]  Yoshiyasu Takefuji,et al.  A parallel algorithm for broadcast scheduling problems in packet radio networks , 1993, IEEE Trans. Commun..

[9]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[10]  Israel Cidon,et al.  Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[11]  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).

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

[13]  J. Gronkvist,et al.  A comparison of access methods for multi-hop ad hoc radio networks , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

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

[15]  Imrich Chlamtac,et al.  Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.

[16]  Mostafa Ammar,et al.  Evaluation of slot allocation strategies for TDMA protocols in packet radio networks , 1990, IEEE Conference on Military Communications.

[17]  Thomas G. Robertazzi,et al.  Traffic sensitive algorithms and performance measures for the generation of self-organizing radio network schedules , 1993, IEEE Trans. Commun..

[18]  J. Gronkvist.  Assignment methods for spatial reuse TDMA , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

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

[20]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

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

[22]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..