Topology-independent transmission scheduling algorithms in multihop packet radio networks Public Deposited

http://ir.library.oregonstate.edu/concern/technical_reports/x059c851q

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • 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.
Resource Type
Date Available
Date Issued
Series
Keyword
Subject
Rights Statement
Funding Statement (additional comments about funding)
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-11-28T20:58:40Z (GMT). No. of bitstreams: 1 2002-9.pdf: 86118 bytes, checksum: 18eccd25a7529aa36c2b75e78b736055 (MD5) Previous issue date: 2002-04-17
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-11-28T20:57:25Z No. of bitstreams: 1 2002-9.pdf: 86118 bytes, checksum: 18eccd25a7529aa36c2b75e78b736055 (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-11-28T20:58:40Z (GMT) No. of bitstreams: 1 2002-9.pdf: 86118 bytes, checksum: 18eccd25a7529aa36c2b75e78b736055 (MD5)

Relationships

In Administrative Set:
Last modified: 07/18/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items