Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks

Shetiya, Harish and Sharma, Vinod (2006) Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks. In: IEEE Wireless Communications and Networking Conference, APR 03-06, 2006, Las Vegas, NV, pp. 147-152.

PDF Rout.pdf - Published Version Restricted to Registered users only Download (180kB) | Request a copy

Abstract

IEEE 802.16 standards for Wireless Metropolitan Area Networks (WMANs) include a mesh mode of operation for improving the coverage and throughput of the network. In this paper, we consider the problem of routing and centralized scheduling for such networks. We first fix the routing, which reduces the network to a tree. We then present a finite horizon dynamic programming framework. Using it we obtain various scheduling algorithms depending upon the cost function. Next we consider simpler suboptimal algorithms and compare their performances.

Item Type:	Conference Paper
Series.:	IEEE Wireless Communications and Networking Conference
Publisher:	IEEE
Additional Information:	Copyright 2006 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.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	07 Mar 2011 06:38
Last Modified:	07 Mar 2011 06:38
URI:	http://eprints.iisc.ac.in/id/eprint/35921

Actions (login required)

View Item