Routing with minimum frame length schedules in wireless mesh networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages

  Friderikos, Vasilis ^a   Papadaki, Katerina ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FRAME LENGTH; JOINT SCHEDULING; MIXED INTEGER LINEAR PROGRAM; NP-COMPLETE PROBLEMS; PRUNING ALGORITHMS; ROUTING PATHS; ROUTING PROBLEMS; ROUTING SCHEMES; SCHEDULING DECISIONS; SCHEDULING INFORMATION; SHORTEST PATH; SPANNING TREES; SUB-OPTIMAL SOLUTIONS; TRANSMITTED POWER; WIRELESS MESH NETWORKS;

INTEGER PROGRAMMING; ITERATIVE METHODS; LINEAR PROGRAMMING; LOCAL AREA NETWORKS; NETWORK ROUTING; NUCLEAR PROPULSION; SCHEDULING; SPACECRAFT; TREES (MATHEMATICS); WIRELESS LOCAL AREA NETWORKS (WLAN); WIRELESS TELECOMMUNICATION SYSTEMS;

ROUTING ALGORITHMS;

EID: 50249126530     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOMW.2007.4437801     Document Type: Conference Paper

References (17)

1. R. Nelson and L. Kleinrock, Spatial-TDMA: A collision-free multihop channel access protocol IEEE Transactions on Communications, vol. 33, no. 9, pp. 934-944, September 1985
2. B. Hajek, G. Sasaki, Link scheduling in polynomial time, IEEE Transactions on Information Theory, vol. 34, pp. 910-917, 1988
3. C. G. Prohazka, Decoupling link scheduling constraints in multihop packet radio networks, IEEE Transactions on Computers, March 1989
4. A.M. Chou, V. O. Li, Slot allocation strategies for TDMA protocols in multihop packet radio networks, IEEE INFOCOM '92, 1992
5. Arash Behzad, Izhak Rubin, On the Performance of Graph-based Scheduling Algorithms for Packet Radio Networks, IEEE GLOBECOM, San Francisco, CA, December 2003
6. S. Even, O. Goldreich, S. Moran, P. Tong, On the NP-completeness of certain network testing problems, Networks, vol. 14, pages 1-24, 1984
7. L. Tassiulas, A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, vol. 37, no. 12, pp. 1936-1948, December 1992
8. A. Das, R. Marks, P. Arabshahi, A. Gray, Power Controlled Minimum Frame Lenght Sheduling in TDMA Wireless Networks with Sectored Antennas, IEEE INFOCOM'05, Miami, March, 2005
9. Geert Heijenk, Fei Liu, Interference-based routing in multi-hop wireless infrastructures, Computer Communications, vol. 29, pp. 2693-2701, 2006
10. Gronkvist J. Traffic controlled spatial reuse TDMA in multi-hop radio networks. PIMRC 1998; 1203-07.
11. Papadaki, K., and Friderikos, V.: 'Approximate dynamic programming for link scheduling in wireless mesh networks', Computers & Operations Research, 2007, doi:10.1016/j.cor.2007.02.010 .
12. Peter Varbrand Patrik Bjorklund and Di Yuan, Resource optimization of Spatial TDMA in ad hoc radio networks: A column generation approach,IEEE INFOCOM03, San Francisco, March 2003
13. R. L. Cruz, A. V. Santhanam. Optimal routing, link scheduling and power control in multihop wireless, networks, IEEE INFOCOM03, San Francisco, March 2003
14. T. V. Koushik Kar, Murali Kodialam, Leandros Tassiulas, Routing for network capacity maximization in energy-constrained ad-hoc networks, IEEE INFOCOM03, San Francisco, March 2003
15. M. Kodialam, T. Nandagopal, Characterizing Achievable Rates in Multi-hop Wireless MEsh Networks With Orthogonal Channels, IEEE/ACM Transactions on Networking, vol. 13, no. 4, August 2005
16. H. Takagi, L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Transactions on Communications, vol. 32, no. 3, pp. 246-257, March 1984
17. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, Journal of the ACM, vol. 30, pp. 118-132, 1983