6533b7d7fe1ef96bd1269015

RESEARCH PRODUCT

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

Ilenia TinnirelloRomina BadalamentiLaura Giarre

subject

resource allocation; multi hop neworksSettore ING-INF/03 - TelecomunicazioniComputer sciencebusiness.industryDistributed computingMulti-frequency time division multiple accessComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSTime division multiple accessresource allocationComputer Science Applications1707 Computer Vision and Pattern Recognitionmulti hop neworksHop (networking)Carrier-sense multiple accessScheduling (computing)resource allocation multi hop neworksComputer Networks and CommunicationSettore ING-INF/04 - AutomaticaControl and Systems EngineeringChannel access methodbusinessInformation SystemsComputer network

description

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.

yearjournalcountryeditionlanguage
2014-06-01
10.1109/med.2014.6961514https://hdl.handle.net/11380/1123558