Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks (bibtex)
by Konstantinos Oikonomou, Ioannis Stavrakakis
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. In case the traffic load and/or the topology density are not known (which is commonly the case in ad-hoc networks), alternative values for the access probability are also derived which, although not the optimal (maximizing the system throughput), they do lead to a system throughput higher than that under the Deterministic Policy. 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.
Reference:
Konstantinos Oikonomou, Ioannis Stavrakakis, "Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks", In Quality of Service in the Emerging Networking Panorama, Springer, pp. 84-93, 2004. ([pdf])
Bibtex Entry:
@inproceedings{oikonomou2004load,
	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. In case the traffic load and/or the topology density are not known (which is commonly the case in ad-hoc networks), alternative values for the access probability are also derived which, although not the optimal (maximizing the system throughput), they do lead to a system throughput higher than that under the Deterministic Policy. 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.},
	Author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
	Booktitle = {Quality of Service in the Emerging Networking Panorama},
	Comment = {<a href="https://pdfs.semanticscholar.org/43aa/2683b375cd5337b8c940ff970c3a10911b03.pdf">[pdf]</a>},
	Keywords = {own, refereed, harmonics},
	Month = {September},
	Pages = {84--93},
	Publisher = {Springer},
	Title = {{{Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks}}},
	Venue = {Barcelona, Spain},
	Year = {2004}}
Powered by bibtexbrowser