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}
}
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… Expand
Analysis of a probabilistic topology-unaware TDMA MAC policy for ad hoc networks
TLDR
Simulation results demonstrate the comparative advantage of the probabilistic policy over the deterministic policy and 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 policy, but it is also close to the maximum. Expand
Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks
TLDR
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. Expand
Analysis of topology-unaware TDMA MAC policies for ad-hoc networks under diverse traffic loads
TLDR
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. Expand
Power Efficiency Analysis for Topology-Unaware TDMA MAC Policies in Ad-Hoc Networks
TLDR
Simulation results support the claims and the expectations of the aforementioned analysis, and it is shown analytically that when the system throughput is maximized, the power consumed is close to the minimum. Expand
Performance analysis of topology-unaware TDMA MAC schemes for ad hoc networks with topology control
TLDR
The impact of using smart antennas and/or power control for topology control is investigated and the performance of TDMA MAC schemes with common frame, for which the assignment of time slots to a node is not aware of the time slots assigned to the neighbor nodes, is studied. Expand
Performance Analysis of TDMA MAC Schemes for Ad-Hoc Networks with Topology Control
TLDR
Simulation results for a variety of network topologies support the claims and the expectations of the aforementioned analysis and show that the system throughput achieved under topology control can be higher under both policies and especially under the Probabilistic Policy. Expand

References

SHOWING 1-10 OF 12 REFERENCES
A Probabilistic Topology Unaware TDMA Medium Access Control Policy for Ad Hoc Environments
TLDR
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, and 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. Expand
An optimal topology-transparent scheduling method in multihop packet radio networks
TLDR
This paper compares the proposed algorithm for transmission scheduling with that of Chlamtac and Farago's and with the TDMA algorithm, and finds that the algorithm given gives better performance in terms of minimum throughput and minimum and maximum delay times. Expand
Making transmission schedules immune to topology changes in multi-hop packet radio networks
TLDR
A robust scheduling protocol is proposed which is unique in providing a topology transparent solution to scheduled access in multi-hop mobile radio networks and is robust in the presence of mobile nodes. Expand
Power-aware scheduling algoritms for wire-less networks
TLDR
A set of scheduling algorithm that dynamically schedule the transmission channel to mobiles based on both traffic requests and battery power levels of mobiles is proposed and studied, demonstrating that the proposed power-aware scheduling techniques provide low-power mobiles with lower packet dropping probabilities and more efficient use of the mobile radio. Expand
Floor acquisition multiple access (FAMA) for packet-radio networks
TLDR
This analysis shows that using carrier sensing as an integral part of the floor acquisition strategy provides the benefits of MACA in the presence of hidden terminals, and can provide a throughput comparable to, or better than, that of non-persistent CSMA when no hidden terminals exist. Expand
Dual busy tone multiple access (DBTMA): a new medium access control for packet radio networks
  • J. Deng, Z. Haas
  • Computer Science
  • ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)
  • 1998
TLDR
A new MAC protocol, termed dual busy tone multiple access (DBTMA), is proposed, and its performance is evaluated, concluding that the network utilization of DBTMA is about twice as that of RTS/CTS-based schemes. Expand
MACA-a New Channel Access Method for Packet Radio
TLDR
A new scheme, Multiple Access with Collision Avoidance (MACA), that could greatly relieve problems of the existing Carrier Sense Multiple Access method and also be easily extended to provide automatic transmitter power control. Expand
MACAW: A Media Access Protocol for Wireless LAN's
TLDR
This paper studies media access protocols for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center and develops a new protocol, MACAW, which uses an RTS-CTS-DS-DATA-ACK message exchange and includes a significantly different backoff algorithm. Expand
Wireless lan medium access control (mac) and physical layer (phy) specifications
services are specified here by describing the service primitives and parameters that characterize each service. This definition is independent of any particular implementation. In particular, theExpand
Busy Tone Multiple Access (DBTMA): A New Medium Access Control for Packet Radio Networks
  • IEEE ICUPC'98
  • 1998
...
1
2
...