Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/14842
Title: Quality of service in TDMA MANETs using prioritised tiem slot assignment
Authors: NYAMBO, Benny 
JANSSENS, Gerrit 
LAMOTTE, Wim 
Issue Date: 2012
Publisher: Eurosis-ETI
Source: Janousek, Vladimir; Kvetonova, Sarka (Ed.). Proceedings of the Industrial Simulation Conference 2012, p. 217-222
Abstract: Mobile ad hoc networks find use in a wide variety of areas, which include defense-based applications, commercial applications and sensor networks. The increase in multimedia applications creates the need for a wireless network to provide Quality of Servcie (QoS) guarantees to provide effective communication of real-time traffic. MANETs have limited wireless resources and a time-varying topology, which makes it difficult to provide QoS in Time Division Multiple Access (TDMA)-based networks. In TDMA each user is allocated a time slot within each time frame. Therefore a scheduling algorithms is required to schedule traffic by optimally allocating time slots in TDMA. The TDMA scheduling algorithm is an optimisation problem on a directed graph (the MANET). This research applies the Dining Philosopher's Problem (DP)to the time slot assignment in TDMA-based MANETs. The DP-model of the MANET is represented as a Petri net. A variant of that assignment problem is developed in which priorities within nodes are provided such that nodes with multimedia traffic will have higher priority. The doorway concept is used to handle starvation, required to solve the Prioritised Dining Philosophers' (PDP) problem. The pseudo-code of the algorithm describes in detail how it finds the solution.
Keywords: Mobile ad haoc networks; Quality of Service; Time Division Multiple Access
Document URI: http://hdl.handle.net/1942/14842
ISBN: 978-90-77381-71-7
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Show full item record

Page view(s)

12
checked on May 19, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.