A Probabilistic Topology Unaware TDMA Medium Access Control Policy for Ad Hoc Environments (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. Chlamtac and Farago have proposed a topology unaware TDMA-based scheme, suitable for ad-hoc networks, while Ju and Li have proposed an enhanced version that maximizes the minimum guaranteed throughput. Both approaches consider a deterministic policy for the utilization of the assigned scheduling time slots. In this work it is shown that this deterministic policy fails to utilize non-assigned slots that would result in collision-free transmissions even under heavy traffic conditions. A simple probabilistic policy is proposed, capable of utilizing the non-assigned slots according to an access probability, fixed for all users in the network. An analytical study establishes the conditions under which the probability of success for a specific transmission under the probabilistic policy, is higher than that under the deterministic. The dependence of both policies on the topology density is shown and a simple topology density metric is introduced as well. Simulation results show that there exists a suitable range of values for the access probability for which the probabilistic policy outperforms the deterministic and show how this range is affected by the variations of the topology density.
Reference:
Konstantinos Oikonomou, Ioannis Stavrakakis, "A Probabilistic Topology Unaware TDMA Medium Access Control Policy for Ad Hoc Environments", In Personal Wireless Communications, pp. 291-305, 2003.
Bibtex Entry:
@inproceedings{oikonomou2003probabilistic,
	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. Chlamtac and Farago have proposed a topology unaware TDMA-based scheme, suitable for ad-hoc networks, while Ju and Li have proposed an enhanced version that maximizes the minimum guaranteed throughput. Both approaches consider a deterministic policy for the utilization of the assigned scheduling time slots. In this work it is shown that this deterministic policy fails to utilize non-assigned slots that would result in collision-free transmissions even under heavy traffic conditions. A simple probabilistic policy is proposed, capable of utilizing the non-assigned slots according to an access probability, fixed for all users in the network. An analytical study establishes the conditions under which the probability of success for a specific transmission under the probabilistic policy, is higher than that under the deterministic. The dependence of both policies on the topology density is shown and a simple topology density metric is introduced as well. Simulation results show that there exists a suitable range of values for the access probability for which the probabilistic policy outperforms the deterministic and show how this range is affected by the variations of the topology density.},
	Author = {Oikonomou, Konstantinos and Stavrakakis, Ioannis},
	Booktitle = {Personal Wireless Communications},
	Doi = {10.1007/978-3-540-39867-7_30},
	Isbn = {978-3-540-39867-7},
	Keywords = {own, refereed, harmonics},
	Month = {September},
	Organization = {Springer},
	Pages = {291--305},
	Title = {{{A Probabilistic Topology Unaware TDMA Medium Access Control Policy for Ad Hoc Environments}}},
	Venue = {Venice, Italy},
	Year = {2003},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-540-39867-7_30}}
Powered by bibtexbrowser