Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks

@inproceedings{Oikonomou2004LoadAO,
  title={Load Analysis of Topology-Unaware TDMA MAC Policies for Ad Hoc Networks},
  author={Konstantinos Oikonomou and Ioannis Stavrakakis},
  booktitle={QofIS},
  year={2004}
}
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… 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
Joint Topology-Transparent Scheduling and QoS Routing in Ad Hoc Networks
TLDR
This paper proposes a QoS routing protocol for a mixture of QoS and BE flows and designs methods for bandwidth estimation and allocation to provide QoS support without knowledge of slot status information, and estimates and allocates nonassigned eligible bandwidth for best effort (BE) flows. Expand
Throughput Analysis of an Aloha-Based MAC Policy for Ad Hoc Networks
TLDR
An adaptive probabilistic policy for medium access control in ad hoc networks, inspired by the Aloha paradigm, is proposed and analyzed and simulation results show that this policy is capable of achieving higher system throughput when compared to other policies that have been proposed forAd hoc networks. Expand
Performance evaluation of a new MAC scheme for ad hoc networks
TLDR
This paper proposes a new scheduling MAC scheme, in the scheme, the TDMA frame consists of N time slots, and each node is assigned one transmission slot different from those of other nodes in each frame. Expand
Energy considerations for topology-unaware TDMA MAC protocols
TLDR
It turns out that the per frame power consumption is lower for the less throughput-efficient protocol, suggesting that energy savings are achieved at the expense of throughput, and it is observed that when the system throughput is maximized, the power consumed is close to the minimum. Expand
Ad Hoc Networks with Topology-Transparent Scheduling Schemes: Scaling Laws and Capacity/Delay Tradeoffs
  • D. Miorandi, H. Tan, M. Zorzi
  • Computer Science
  • 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks
  • 2006
TLDR
This paper focuses on Time-Spread Multiple Access protocols, which are able to offer, in a distributed fashion, a deterministic upper bound on the access delay, and analysis is based on some asymptotic properties of geometric random graphs. Expand
A Framework for Topology-Transparent Scheduling in Wireless Networks
TLDR
An adaptive topology-transparent algorithm is developed, which can always give an optimal solution under a set of the system design parameters. Expand
A New Channel Accessing Scheme for Multi-Hop Networks
TLDR
A new scheduling channel accessing control method for mobile multi- hop networks that allows a node to utilize the slots pre-assigned to the other nodes dynamically with a range of values for accessing probability and evaluates the performances of the method with the other scheduling schemes proposed by Chalmtac, Ju and Oikonomou in view of system throughput. Expand
Topology-transparent schedule with reservation and carrier sense for multihop ad hoc networks
TLDR
This work proposes a topology-transparent schedule with reservation and carrier sense based on slotted architecture in which each slot is divided into reservation phase and data phase and derives the optimal parameter for the best performance. Expand
Title Performance Improvement of Topology-Transparent BroadcastScheduling in Mobile Ad Hoc Networks
Broadcasting is a key function in mobile ad hoc networks. Topology-dependent scheduling algorithms depend on the detailed network connectivity information and cannot adapt to dynamic topologicalExpand
...
1
2
...

References

SHOWING 1-10 OF 21 REFERENCES
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
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
Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks
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 ofExpand
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
A new approach to channel access scheduling for Ad Hoc networks
Three types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows each node to electExpand
Spatial TDMA: A Collision-Free Multihop Channel Access Protocol
TLDR
A broadcast channel access protocol called spatial TDMA is defined, which is designed specifically to operate in a multihop packet radio environment where the location of the nodes of the network is assumed to be fixed. Expand
ADHOC MAC: New MAC Architecture for Ad Hoc Networks Providing Efficient and Reliable Point-to-Point and Broadcast Services
TLDR
The paper presents the mechanisms that compose the new MAC: the basic RR-ALOHA protocol, an efficient broadcast service and the reservation of point-to-point channels that exploit parallel transmissions. Expand
SEEDEX: a MAC protocol for ad hoc networks
TLDR
A new protocol for media access control in ad hoc networks that seeks to avoid collisions without making explicit reservations for each and every packet by employing a random schedule which is driven by a pseudo-random number generator. Expand
Optimal Broadcast Scheduling in Packet Radio Networks Using Mean Field Annealing
TLDR
An efficient broadcast scheduling algorithm based on mean field annealing (MFA) neural networks to schedule the stations' transmissions in a frame consisting of certain number of time slots is presented. Expand
...
1
2
3
...