Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks

@inproceedings{Oikonomou2003ThroughputAO,
  title={Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks},
  author={Konstantinos Oikonomou and Ioannis Stavrakakis},
  booktitle={QofIS},
  year={2003}
}
  • Konstantinos Oikonomou, Ioannis Stavrakakis
  • Published in QofIS 2003
  • Computer Science
  • The existing topology-unaware TDMA-based schemes are suitable for ad-hoc networks and 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES

    Making transmission schedules immune to topology changes in multi-hop packet radio networks

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Dual busy tone multiple access (DBTMA): a new medium access control for packet radio networks

    • Jing Deng, Zygmunt J. Haas
    • Computer Science
    • ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)
    • 1998
    VIEW 1 EXCERPT