• DocumentCode
    2906114
  • Title

    Routing and scheduling in packet radio networks

  • Author

    Sekhar, M.M. ; Sivarajan, Kumar N.

  • Author_Institution
    Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    335
  • Lastpage
    339
  • Abstract
    A new approach for channel assignment in packet radio networks is presented. To arrive at this: (1) we show the difficulty with the traditional graph coloring method for link scheduling; (2) an algorithm for generating maximal independent sets of links is presented; (3) the importance of combined routing and scheduling is shown and an LP problem is formulated for combined routing and scheduling
  • Keywords
    channel allocation; linear programming; packet radio networks; scheduling; set theory; telecommunication network routing; LP problem; channel assignment; link scheduling; maximal independent sets; packet radio networks; routing; Intelligent networks; Interference; Packet radio networks; Processor scheduling; Radio broadcasting; Radio network; Radio transmitters; Routing; Scheduling algorithm; Spread spectrum communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Personal Wireless Communications, 2000 IEEE International Conference on
  • Conference_Location
    Hyderabad
  • Print_ISBN
    0-7803-5893-7
  • Type

    conf

  • DOI
    10.1109/ICPWC.2000.905832
  • Filename
    905832
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2906114