NSF Org:	CNS Division Of Computer and Network Systems
Recipient:	THE PENNSYLVANIA STATE UNIVERSITY
Initial Amendment Date:	April 1, 2005
Latest Amendment Date:	December 22, 2005
Award Number:	0508114
Award Instrument:	Standard Grant
Program Manager:	Jie Wu CNS  Division Of Computer and Network Systems CSE  Directorate for Computer and Information Science and Engineering
Start Date:	April 1, 2005
End Date:	September 30, 2006 (Estimated)
Total Intended Award Amount:	$0.00
Total Awarded Amount to Date:	$95,018.00
Funds Obligated to Date:	FY 2005 = $95,018.00
History of Investigator:	Thomas La Porta (Principal Investigator) Aylin Yener (Co-Principal Investigator)
Recipient Sponsored Research Office:	Pennsylvania State Univ University Park 201 OLD MAIN UNIVERSITY PARK PA  US  16802-1503 (814)865-1372
Sponsor Congressional District:	15
Primary Place of Performance:	Pennsylvania State Univ University Park 201 OLD MAIN UNIVERSITY PARK PA  US  16802-1503
Primary Place of Performance Congressional District:	15
Unique Entity Identifier (UEI):	NPM2J7MSCF61
Parent UEI:
NSF Program(s):	Networking Technology and Syst
Primary Program Source:	app-0105
Program Reference Code(s):	7363, 7389, 9215, 9237, HPCC
Program Element Code(s):	736300
Award Agency Code:	4900
Fund Agency Code:	4900
Assistance Listing Number(s):	47.070

ABSTRACT

Traditional cellular wireless networks have limited capacity because of the scarcity of available spectrum and inefficient spectrum reuse. To overcome these limitations new regulatory policies are being considered to allow segments of spectrum to be dynamically shared. This project uses dynamically allocated spectrum to form multi-hop relay networks consisting of mobile nodes that forward data to base stations on behalf of each other to increase network capacity. In this work we address two challenges: (1) rapid dynamic network formation and (2) verifying and accounting for which part of the spectrum is used by which nodes. The first problem is important because it is likely that many (tens or hundreds) of nodes may attempt to join a relay network, resulting in high overhead and network formation latency. The second problem is important for motivating users to participate and compensating service providers for sharing spectrum. Algorithms for scheduling and network formation are being designed and evaluated in this work. These algorithms provide low latency and overhead, and include provisions for verifying which nodes participate in the relay network. The presence of base stations is also leveraged to quickly disseminate information to assist in relay network formation.

Please report errors in award information by writing to: awardsearch@nsf.gov.