ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Routing and Scheduling in Packet Radio Networks

Madhu, Sekhar M and Sivarajan, Kumar N (2000) Routing and Scheduling in Packet Radio Networks. In: 2000 IEEE International Conference on Personal Wireless Communications, 17-20 December, Hyderabad,India, pp. 335-339.

[img]
Preview
PDF
routing.pdf

Download (420Kb)

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.

Item Type: Conference Paper
Additional Information: Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: Radio network;Scheduling, and graph coloring method;Evacuation
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 27 Feb 2006
Last Modified: 19 Sep 2010 04:23
URI: http://eprints.iisc.ernet.in/id/eprint/5576

Actions (login required)

View Item View Item