Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-Hoc Networks (bibtex)
by Konstantinos Oikonomou, Ioannis Stavrakakis
Abstract:
The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configuration. The existing topology-unaware TDMA-based schemes are capable of providing a minimum guaranteed throughput by considering a deterministic policy for the utilization of the assigned scheduling time slots. In an earlier work, a probabilistic policy that utilizes the non-assigned slots according to an access probability, common for all nodes in the network, was proposed. The achievable throughput for a specific transmission under this policy was analyzed. In this work, the system throughput is studied and the conditions under which the system throughput under the probabilistic policy is higher than that under the deterministic policy are established. In addition, the value for the access probability that maximizes the system throughput is determined analytically, as well as simplified lower and upper bounds that depend only on a topology density metric. Since the analysis of the system throughput is shown to be difficult or impossible in the general case an approximation is introduced whose accuracy is investigated. Simulation results show that the approximate analysis successfully determines the range of values for the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic, but it is also close to the maximum.
Reference:
Konstantinos Oikonomou, Ioannis Stavrakakis, "Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-Hoc Networks", In Quality for All, Springer, pp. 172-181, 2003. ([pdf])
Bibtex Entry:
@inproceedings{oikonomou2003throughput,
	Abstract = {The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configuration. The existing topology-unaware TDMA-based schemes are capable of providing a minimum guaranteed throughput by considering a deterministic policy for the utilization of the assigned scheduling time slots. In an earlier work, a probabilistic policy that utilizes the non-assigned slots according to an access probability, common for all nodes in the network, was proposed. The achievable throughput for a specific transmission under this policy was analyzed. In this work, the system throughput is studied and the conditions under which the system throughput under the probabilistic policy is higher than that under the deterministic policy are established. In addition, the value for the access probability that maximizes the system throughput is determined analytically, as well as simplified lower and upper bounds that depend only on a topology density metric. Since the analysis of the system throughput is shown to be difficult or impossible in the general case an approximation is introduced whose accuracy is investigated. Simulation results show that the approximate analysis successfully determines the range of values for the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic, but it is also close to the maximum.},
	Author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
	Booktitle = {Quality for All},
	Comment = {<a href="https://pdfs.semanticscholar.org/a9ce/03bcc4ca41b23edbd86b1a91e50f0a478744.pdf">[pdf]</a>},
	Keywords = {own, refereed, harmonics},
	Month = {October},
	Pages = {172--181},
	Publisher = {Springer},
	Title = {{{Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-Hoc Networks}}},
	Venue = {Stockholm, Sweden},
	Year = {2003}}
Powered by bibtexbrowser