Abstract
In this paper we examine the combinatorial requirements of topology-transparent transmission schedules for channel access in mobile ad hoc networks. We formulate the problem as a combinatorial question and observe that its solution is a cover-free family. The mathematical properties of certain cover-free families have been studied extensively. Indeed, we show that both existing constructions for topology-transparent schedules (which correspond to orthogonal arrays) give a cover-free family. However, a specific type of cover-free family – called a Steiner system – supports the largest number of nodes for a given frame length. We then explore the minimum and expected throughput for Steiner systems of small strength, first using the acknowledgement scheme proposed earlier and then using a more realistic model of acknowledgements. We contrast these results with the results for comparable orthogonal arrays, indicating some important trade-offs for topology-transparent access control protocols.
This is a preview of subscription content, log in via an institution to check access.
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
Benveniste, M., Chesson, G., Hoeben, M., Singla, A., Teunissen, H., Wentink, M.: Enhanced Distributed Coordination Function (EDCF) proposed draft text. IEEE working document 802.11-01/131r1 (March 2001)
Chlamtac, I., Faragó, A.: Making Transmission Schedules Immune to Topology Changes in Multi-Hop Packet Radio Networks. IEEE/ACM Transactions on Networking 2(1), 23–29 (1994)
Chlamtac, I., Faragó, A., Zhang, H.: Time-Spread Multiple-Access (TSMA) Protocols for Multihop Mobile Radio Networks. IEEE/ACM Transactions on Networking 5(6), 804–812 (1997)
Colbourn, C.J., Dinitz, J.H. (eds.): The CRC Handbook of Combinatorial Designs. CRC Press, Inc. Boca Raton©(1996)
Colbourn, C.J., Dinitz, J.H., Stinson, D.R.: Applications of Combinatorial Designs to Communications, Cryptography, and Networking. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics. London Mathematical Society, Lecture Note Series, vol. 267, pp. 37–100. ©Cambridge University Press, Cambridge (1999)
Du, D.-Z., Hwang, F.K.: Combinatorial Group Testing and its Applications, 2nd edn. World Scientific Publishing Co. Pte. Ltd., Singapore ©(2000)
D’yachkov, A., Rykov, V., Rashad, A.M.: Superimposed Distance Codes. Problems Control and Information Theory 18, 237–250 (1989)
Erdös, P., Frankl, P., Füredi, Z.: Families of Finite Sets in which no Set is Covered by the Union of r Others. Israel J. Math. 51, 79–89 (1985)
Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays, Theory and Applications. Springer, New York, Inc. ©(1999)
Ju, J.-H., Li, V.O.K.: An Optimal Topology-Transparent Scheduling Method in Multihop Packet Radio Networks. IEEE/ACM Transactions on Networking 6(3), 298–306 (1998)
Maple 8, Waterloo Maple, Inc., http://www.maplesoft.com/main.html
Romdhani, L., Ni, Q., Turletti, T.: AEDCF: Enhanced Service Differentiation for IEEE 802.11 Wireless Ad-Hoc Networks. INRIA Research Report, 4544 (2002)
Ruszinkó, M.: On the Upper Bound of the Size of the r-cover-free Families. Journal of Combinatorial Theory, Series A 66, 302–310 (1994)
Sobrinho, J.L., Krishnakumar, A.S.: Quality-of-Service in Ad Hoc Carrier Sense Multiple Access Wireless Networks. IEEE Journal on Selected Areas in Communications 17(8), 1352–1368 (1999)
Stinson, D.R., Wei, R., Zhu, L.: Some New Bounds for Cover-Free Families. Journal of Combinatorial Theory, Series A 90, 224–234 (2000)
Syrotiuk, V.R., Colbourn, C.J., Ling, A.C.H.: Topology-Transparent Scheduling in MANETs using Orthogonal Arrays. To appear in Proceedings of the DIALMPOMC Joint Workshop on Foundations of Mobile Computing, San Diego, CA, September 19 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colbourn, C.J., Syrotiuk, V.R., Ling, A.C.H. (2003). Steiner Systems for Topology-Transparent Access Control in MANETs. In: Pierre, S., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2003. Lecture Notes in Computer Science, vol 2865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39611-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-39611-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20260-8
Online ISBN: 978-3-540-39611-6
eBook Packages: Springer Book Archive