Reed-Solomon and hermitian code-based scheduling protocols for wireless ad hoc networks

Authors:
Carlos H. Rentel;Thomas Kunz
Affiliations:
Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada;Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada
Venue:
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Year:
2005

Citing 6
Cited 2

Making transmission schedules immune to topology changes in multi-hop packet radio networks

IEEE/ACM Transactions on Networking (TON)
Error control systems for digital communication and storage

Error control systems for digital communication and storage
An optimal topology-transparent scheduling method in multihop packet radio networks

IEEE/ACM Transactions on Networking (TON)
Codes and algebraic curves

Codes and algebraic curves
Topology-transparent scheduling for MANETs using orthogonal arrays

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Algebraic-geometry codes

IEEE Transactions on Information Theory

MAC coding for QoS guarantees in multi-hop mobile wireless networks

Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Variable weight sequences for adaptive scheduled access in MANETs

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or detect errors in the information carried over a noisy channel. In this paper we study the particular cases in which the Reed-Solomon and Hermitian code constructions are used. It is found that Hermitian codes outperform Reed-Solomon codes in minimum throughput guarantee and delay metrics when the number of nodes is in the order of thousands. The relative minimum distance of the code used to schedule the transmissions is identified as an important property that can be used to identify codes that can enable scheduling patterns with better minimum performance guarantees. Furthermore, the terminology of error control coding is used to present a more general and constructive framework for the study of code-based scheduling protocols.