Optimal Resource Allocation in Multi-Hop Networks: Contention vs. Scheduling

Research output: Contribution to conferenceOtherpeer-review

Abstract

CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) is actually the most used method in ad-hoc networks for transmitting on a contending medium, even if it shows poor performance in presence of hidden nodes. To increase performance, we propose an algorithm that combines CSMA and TDMA (Time Division Multiple Access) approaches. The adopted solution consists of grouping contending nodes in non-interfering subsets and granting a different numbers of time slots to different groups, while using the CSMA to manage medium access among nodes belonging to the same subset. An optimization procedure to assign the time slots to each subset of nodes and to find an equilibrium between contention and scheduling is presented
Original languageEnglish
Pages1055-1060
Number of pages6
Publication statusPublished - 2014

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Networks and Communications
  • Computer Science Applications
  • Information Systems

Fingerprint

Dive into the research topics of 'Optimal Resource Allocation in Multi-Hop Networks: Contention vs. Scheduling'. Together they form a unique fingerprint.

Cite this