Abstract
Medium Access Control (MAC) policies in which the scheduling time slots are allocated irrespectively of the underline topology are suitable for ad-hoc networks, where nodes can enter, leave or move inside the network at any time. Topology-unaware MAC policies, that allocate slots deterministically or probabilistically have been proposed in the past and evaluated under heavy traffic assumptions. In this paper, the heavy traffic assumption is relaxed and the system throughput achieved by these policies is derived as a function of the traffic load. The presented analysis establishes the conditions and determines the values of the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic policy but it is also close to the maximum achievable, provided that the traffic load and the topology density of the network are known. sub-optimal solutions are also provided. Simulation results for a variety of topologies with different characteristics support the claims and the expectations of the analysis and show the comparative advantage of the Probabilistic Policy over the Deterministic Policy.
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
IEEE 802.11, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications (November 1997); Draft Supplement to Standard IEEE 802.11, IEEE, New York (January 1999)
Karn, P.: MACA- A new channel access method for packet radio. In: ARRL/CRRL Amateur Radio 9th Computer Networking Conference, pp. 134–140 (1990)
Bharghavan, V., Demers, A., Shenker, S., Zhang, L.: MACAW: A Media Access Protocol for Wireless LAN’s. In: Proceedings of ACM SIGCOMM 1994, pp. 212–225 (1994)
Fullmer, C.L., Garcia-Luna-Aceves, J.J.: Floor Acquisition Multiple Access (FAMA) for Packet-Radio Networks. In: Proceedings of ACM SIGCOMM 1995, pp. 262–273 (1995)
Deng, J., Haas, Z.J.: Busy Tone Multiple Access (DBTMA): A New Medium Access Control for Packet Radio Networks. In: IEEE ICUPC 1998, Florence, Italy (October 5-9, 1998)
Ephremides, A., Truong, T.V.: Scheduling Broadcasts in Multihop Radio Networks. IEEE Transactions on Communications 38(4), 456–460 (1990)
Bao, L., Garcia-Luna-Aceves, J.J.: A new approach to channel access scheduling for ad hoc networks. In: ACM Mobicom 2001 (July 2001)
Chlamtac, I., Farago, A.: Making Transmission Schedules Immune to Topology Changes in Multi-Hop Packet Radio Networks. IEEE/ACM Trans. on Networking 2, 23–29 (1994)
Ju, J.-H., Li, V.O.K.: An Optimal Topology-Transparent Scheduling Method in Multihop Packet Radio Networks. IEEE/ACM Trans. on Networking 6, 298–306 (1998)
Oikonomou, K., Stavrakakis, I.: Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-Hoc Networks. IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Quality-of-Service Delivery in Variable Topology Networks (accepted for publication) (to appear 3rd-4th Quarter 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oikonomou, K., Stavrakakis, I. (2004). Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks. In: Solé-Pareta, J., et al. Quality of Service in the Emerging Networking Panorama. WQoSR QofIS ICQT 2004 2004 2004. Lecture Notes in Computer Science, vol 3266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30193-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30193-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23238-4
Online ISBN: 978-3-540-30193-6
eBook Packages: Springer Book Archive