Patent ID: 8134946
Filing Date: 2012-03-13
Classification: H04B,H04L,H04W

Abstract:
1. A scheduling method for use with relay-assisted networks, comprising: accessing feedback from mobile stations in a network; arranging users associated with a relay station in a list in accordance with marginal utilities; determining whether the users in the list can be eliminated from feedback overhead by testing conditions for feedback reduction; generating a diversity schedule by employing a weighted graph with relay channels and access channels and performing a matching method; and generating a transmission schedule for channel usage in accordance with channel diversity for mobile users and spatial reuse of relay station channels by incorporating rate feedback and interference for the mobile stations and the relay stations based upon the matching method applied to a new weighted graph which accounts for traffic loads; wherein testing conditions for feedback reduction includes applying at least one of the following conditions: where r i,n acc —rate of user i on access channel n, r j,n acc is a rate of user j on access channel n, r i,m acc is a rate of user i on access channel m, r j,m acc is a rate of user j on access channel m, r i is an average throughput received by user i, r j in an average throughput received by user j and r min rel is a minimum rate available in relay channels; all rates and throughputs are positive with rates being limited by a system defined maximum Rmax, zero in the denominator being avoided by condition being equivalently checked as