Article thumbnail
Location of Repository

Routing and Scheduling in Packet Radio Networks

By Madhu Sekhar M and Kumar N. Sivarajan

Abstract

A new approach for channel assignment in packet radio networks is presented. To arrive at this: 1) we show the difficulty with traditional graph coloring method for link scheduling. 2) An algorithm for generating maximal independent sets of links is presented. 3) Importance of combined routing and scheduling is shown and an LP problem is formulated for combined routing and scheduling

Year: 2000
OAI identifier: oai:CiteSeerX.psu:10.1.1.127.6607
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://eprints.iisc.ernet.in/a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.