Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Arikan, Some complexity results about packet radio networks, IEEE Transactions on Information Theory Vol. IT-30 (1984) pp. 681–685.
L. Bao and J.J. Garcia-Luna-Aceves, Collision-free topology-dependent channel access scheduling, Proceedings of IEEE MILCOM’ 00 (2000) pp. 507–511.
D.J. Baker and J. Wieselthier, A distributed algorithm for scheduling the activation of links in a self-organizing, mobile, radio networks, Proceedings of IEEE ICC’ 82 (1982) pp. 2F.6.1–2F.6.5.
P. Björklund, P. Värbrand and D. Yuan, Resource optimization of STDMA in ad hoc networks, Ad Hoc Networks (In Press, 2004).
P. Björklund, P. Värbrand and D. Yuan, Resource optimization of spatial TDMA in ad hoc radio networks: A column generation approach, Proceedings of IEEE INFOCOM’ 03 (2003) pp. 818–824.
S. Boztas, A robust multi-priority topology-independent transmission schedule for packet radio networks, Information Processing Letters Vol. 55 (1995) pp. 291–295.
I. Cidon and M. Sidi, Distributed assignment algorithms for multi-hop packet radio networks, IEEE Transactions on Computers Vol. 38 (1989) pp. 1353–1361.
I. Chlamtac and A. Faragó, Making transmission schedules immune to topology changes in multi-hop packet radio networks, IEEE/ACM Transactions on Networking Vol. 2 (1994) pp. 23–29.
I. Chlamtac and A. Lerner, A link allocation protocol for mobile multihop networks, Proceedings of IEEE GLOBECOM’ 85 (1985) pp. 238–242.
I. Chlamtac and A. Lerner, Fair algorithms for maximal link activation in multihop radio networks, IEEE Transactions on Communications Vol. Com-35 (Jul. 1987) pp. 739–746.
I. Chlamtac and S.S. Pinter, Distributed nodes organization algorithm for channel access in a multihop dynamic radio network, IEEE Transactions on Computers Vol. 36 (1987) pp. 728–737.
A.-M. Chou and V.O.K. Li, Fair spatial TDMA channel access protocols for multihop radio networks, Proceedings of IEEE INFOCOM’ 91 (1991) pp. 1064–1073.
A.-M. Chou and V.O.K. Li, Slot allocation strategies for TDMA protocols in multihop packet radio networks, Proceedings of IEEE INFOCOM’ 92 (1992) pp. 710–716.
A. Ephremides and T. Truong, Distributed algorithm for efficient and interference-free broadcasting in radio networks, Proceedings of IEEE INFOCOM’ 88 (1988) pp. 1119–1124.
A. Ephremides and T. Truong, Scheduling broadcasts in multihop radio networks, IEEE Transactions on Communications Vol. 38 (1990) pp. 456–460.
R. Fourer, D.M. Gay and W. Kernighan, AMPL-A Modeling Language for Mathematical Programming, (Boyd & Fraser, Danvers, MA, 1993).
N. Funabiki and Y. Takefuji, A parallel algorithm for broadcast scheduling problems in packet radio networks, IEEE Transactions on Communications Vol. 41 (1993) pp. 828–831.
A.J. Goldsmith and S.B. Wicker, Design challenges for energy-constrained ad hoc wireless networks, IEEE Transactions on Wireless Communications (August 2002) pp. 8–27.
J. Grönkvist, Traffic controlled spatial reuse TDMA in multi-hop radio networks, Proceedings of the 9th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (1998) pp. 1203–1207.
J. Grönkvist, Assignment methods for spatial reuse TDMA, Proceedings of the First Annual Workshop on Mobile and Ad Hoc Networking and Computing (2000) pp. 119–124.
J. Grönkvist, A. Hansson and J. Nilsson, A comparison of access methods for multi-hop ad hoc radio networks, Proceedings of IEEE VTC 2000-spring (2000) pp. 1435–1439.
J. Grönkvist, Assignment Strategies for Spatial Reuse TDMA, (Licentiate thesis, Royal Institute of Technology, Stockholm, Sweden, 2002).
B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Transactions on Information Theory Vol. 34 (1988) pp. 910–917.
S.O. Krumke, M.V. Marathe and S.S. Ravi, Models and approximation algorithms for channel assignment in radio networks, Wireless Networks Vol. 7 (2001) pp. 575–584.
ILOG, Ilog cplex, user’s manual, (Aug. 2000).
R. Liu and E.L. Lloyd, A distributed protocol for adaptive scheduling in ad hoc networks, Proceedings of the IASTED International Conference on Wireless and Optical Communications (WOC 2001) (2001) pp. 43–48.
A. Mehrotra and M.A. Trick, A column generation approach for graph coloring, INFORMS Journal on Computing Vol. 8 (1996) pp. 344–354.
R. Nelson and L. Kleinrock, Spatial TDMA: A collision-free multihop channel access protocol, IEEE Transactions on Communications Vol. 33 (1985) pp. 934–944.
M. Post, P. Sarachik and A. Kershenbaum, A biased greedy algorithm for scheduling multi-hop radio networks, Proceedings of the 19th Annual Conference on Information Sciences and Systems (1985) pp. 564–572.
L.C. Pond and V.O.K. Li, A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks, Proceedings of IEEE MILCOM’ 89 (1989) pp. 70–74.
C.G. Prohazka, Decoupling link scheduling constraints in multihop packet radio networks, IEEE Transactions on Computers Vol. 38 (1989) pp. 455–458.
S. Ramanathan and E.L. Lloyd, Scheduling algorithms for multihop radio networks, IEEE Transactions on Networking Vol. 1 (1993) pp. 166–177.
R. Ramaswami and K.K. Parhi, Distributed scheduling for broadcasts in a radio network, Proceedings of IEEE INFOCOM’ 89 (1989) pp. 497–504.
A. Sen and J.M. Capone, Scheduling in packet radio networks — A new approach, Proceedings of IEEE GLOBECOM’ 99 (1999), pp. 650–654.
A. Sen and M.L. Huson, A new model for scheduling packet radio networks, Proceedings of IEEE INFOCOM’ 96 (1996) pp. 1116–1124.
J. Shor and T.G. Robertazzi, Traffic sensitive algorithms and performance measures for the generation of self-organizing radio network schedules, IEEE Transactions on Communications Vol. 41 (1993) pp. 16–21.
D.S. Stevens and M.H. Ammar, Evaluation of slot allocation strategies for TDMA protocols in packet radio networks, Proceedings of IEEE MILCOM’ 90 (1990) pp. 835–839.
S. Toumpis and A.J. Goldsmith, Capacity regions for wireless ad hoc networks, Proceedings of IEEE ICC’ 02 (2002) pp. 3168–3173.
C.D. Young, USAP multiple access: Dynamic resource allocation for mobile multihop multichannel wireless networking, Proceedings of IEEE MILCOM’ 99 (1999) pp. 271–275.
C.D. Young, USAP multiple access: Transmitter-and receiver-directed dynamic resource allocation for mobile, multihop, multichannel, wireless networking, Proceedings of IEEE MILCOM’ 00 (2000) pp. 549–553.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Värbrand, P., Yuan, D. (2005). Resource Allocation of Spatial Time Division Multiple Access in Multi-hop Radio Networks. In: Cardei, M., Cardei, I., Du, DZ. (eds) Resource Management in Wireless Networking. Network Theory and Applications, vol 16. Springer, Boston, MA. https://doi.org/10.1007/0-387-23808-5_9
Download citation
DOI: https://doi.org/10.1007/0-387-23808-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23807-4
Online ISBN: 978-0-387-23808-1
eBook Packages: EngineeringEngineering (R0)