Technical Report
 

Topology-independent transmission scheduling algorithms in multihop packet radio networks

Público Deposited

Contenido Descargable

Descargar PDF
https://ir.library.oregonstate.edu/concern/technical_reports/x059c851q

Descriptions

Attribute NameValues
Creator
Abstract
  • In this paper, based on coding theory concepts, new time scheduling algorithms for multihop packet radio networks are described. Each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j[superscipt th] slot provided the assigned code has a 1 in this j[superscipt th] bit. The proposed algorithms are better than the previously known algorithms in terms of minimum system throughput and/or delay bound. The algorithms also preserve other desired properties, such as topology independence, guaranteed minimum throughput, bounded maximum delay, and fair transmission policy. In the simulation, we measure the average system throughput of transmission scheduling algorithms. The simulation results show that the proposed algorithms outperform the previously known algorithms in terms of mean system throughput.
  • Keywords: multihop packet radio networks, scheduling algorithms
  • Keywords: multihop packet radio networks, scheduling algorithms
Resource Type
Fecha Disponible
Fecha de Emisión
Series
Subject
Declaración de derechos
Funding Statement (additional comments about funding)
  • This work is supported by the NSF grant MIP-9705738
Publisher
Peer Reviewed
Language
Replaces

Relaciones

Parents:

This work has no parents.

Elementos

Miniatura Título Fecha de subida Visibilidad Acciones
file details 2002-9.pdf 2017-07-18 Público Descargar