Analysis of topology-unaware TDMA MAC policies for ad-hoc networks under diverse traffic loads

Authors:
Konstantinos Oikonomou;Ioannis Stavrakakis
Affiliations:
University of Athens, Ilissia, Athens, Greece;University of Athens, Ilissia, Athens, Greece
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
Year:
2005

Citing 12
Cited 2

Data networks (2nd ed.)

Data networks (2nd ed.)
Making transmission schedules immune to topology changes in multi-hop packet radio networks

IEEE/ACM Transactions on Networking (TON)
MACAW: a media access protocol for wireless LAN's

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A robust multi-priority topology-independent transmission schedule for packet radio networks

Information Processing Letters
Floor acquisition multiple access (FAMA) for packet-radio networks

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A channel access scheme for large dense packet radio networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks

IEEE/ACM Transactions on Networking (TON)
An optimal topology-transparent scheduling method in multihop packet radio networks

IEEE/ACM Transactions on Networking (TON)
A new approach to channel access scheduling for Ad Hoc networks

Proceedings of the 7th annual international conference on Mobile computing and networking
SEEDEX: a MAC protocol for ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
ADHOC MAC: new MAC architecture for ad hoc networks providing efficient and reliable point-to-point and broadcast services

Wireless Networks
Optimal broadcast scheduling in packet radio networks using mean field annealing

IEEE Journal on Selected Areas in Communications

An adaptive time-spread multiple-access policy for wireless sensor networks

EURASIP Journal on Wireless Communications and Networking
A wireless hybrid contention/TDMA-based MAC for real-time mobile application

Proceedings of the 2008 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ever-changing nature of the ad-hoc networks, makes the design of efficient Medium Access Control (MAC) policies challenging. 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 policies is derived as a function of the traffic load. The presented analysis establishes the conditions and determines the values of 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 achievable, provided that the traffic load and the topology density of the network are known. In case the traffic load and/or the topology density are not known (which is commonly the case in ad-hoc networks), alternative values for the access probability are also derived which, although not the optimal (maximizing the system throughput), they do lead to a system throughput higher than that under the Deterministic Policy. 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.