This project addresses two of the grand challenges of the next decade: green wireless communication systems and spectrum efficiency, through a collaborative research and education plan utilizing optimization theory, and involving researchers from the U.S. and Finland. This project considers energy efficiency for cognitive radio networks and introduces a novel optimization-based methodology. It builds on existing results to establish a new focus on green cognitive networking. The way in which energy is consumed in cognitive networks provides unique opportunities for exploiting the cognitive process to save energy and for using energy reduction techniques to modify and improve the performance of cognitive networks. A unique feature of this project is the introduction of an optimization-based methodology for establishing and attaining ultimate performance limits. In this project, PIs develop energy performance bounds that yield insights for design of general networks, derive optimal tradeoffs between fundamental performance criteria, use optimization formulations for establishing and achieving ultimate performance limits, and design protocols that are optimal in the presence of temporal cognitive systems evolution. Research results of this work will be widely promulgated through the usual means of publication and dissemination and will have significant impact on energy efficiency of spectrum-efficient wireless systems.

Project Report

The wireless spectrum is a limited national resource. For example, the FCC currently has only 50 MHz left in its inventory, while the most conservative predictions of wireless data traffic estimate a 20x increase in data traffic in the next 5 years. Both the National Broadband Plan and the President’s Memorandum on June 28 entitled "Unleashing the Wireless Revolution" highlight the critical value of spectrum and encourage researchers to seek methods to achieve efficient utilization of this valuable resource. The major goals of the project involved the fundamental understanding of the tradeoffs in cognitive radio networks, focusing on (1) design of economic-aware algorithms using sequential optimization and Markov decision processes that provide incentives for spectrum sharing between primary spectrum owners and secondary (opportunistic) spectrum users and, (2) scheduling and optimization of cooperation in cognitive radio networks. The key theme is the capture of temporal dependencies. They key research outcomes of the project can be summarized as follows. 1. We developed a reserve price auction mechanism for spectrum sharing in cognitive radio networks where the secondary spectrum users (SUs) bid to buy spectrum bands from the primary spectrum owner (PO) who acts as the auctioneer, selling idle spectrum bands to make a profit. Unlike most existing auction mechanisms that assume identical channels, we consider a more general and more realistic case where channels have different qualities. Also, SUs are allowed to express their preferences for each channel separately. That is, each SU submits a vector of bids, one for each channel. In addition, reservation prices that are proportional to channel qualities are imposed by the PO. The proposed auction mechanism results in efficient allocation that maximizes SUs’ valuations subject to reserve price constraints, and it has desired economic properties that we formally prove in the analysis. 2. We developed ADAPTIVE, a dynAmic inDex Auction for sPectrum sharing with TIme-evolving ValuEs that maximizes the social welfare of the SUs. Existing spectrum auctions assume that SUs have static and known values for the channels. However, in many real world settings, SUs do not know the exact value of channel access at first, but they learn it over time. In this work, we study spectrum auctions in a dynamic setting where SUs can change their valuations based on their experiences with the channel. ADAPTIVE is based on multi-armed bandit models where for each user an allocation index is independently calculated in polynomial time. ADAPTIVE has some desired economic properties that are formally proven in the analysis. 3. We characterized the average end-to-end queuing delay and maximum achievable per-node throughput in an opportunistic secondary cognitive radio network co-existing with a primary network where both networks consist of static nodes that use random medium access schemes. We model the secondary network as a two-class priority queuing network and use queuing approximation techniques to obtain closed form expressions for average end-to-end delay of a packet in the secondary network and the maximum achievable throughput of a secondary node. The results are validated against extensive simulations. 4. We considered network-layer scheduling for cooperation in cognitive radio networks whereby secondary users may be allowed to relay primary user’s packets. Under this cooperative scheme, the work investigated whether, and under what conditions, the primary and secondary networks can be stabilized without explicit knowledge of the arrival rates. We develop a relaying and scheduling algorithm using Lyapunov drift techniques that does not require explicit knowledge of primary and secondary packet arrival rates. The algorithm is then shown to stabilize the transmission queues in the network for all secondary packet arrival rates that lie in the interior of a certain region. The significance of these results is that they show that properly designed cooperation may result in a win-win scenario for both primary and secondary users (and not just for the primary user). Three Ph.D. students and one M.S. student were trained on the research topics of this award. One of the students interacted with the research collaborators from Finland and University of Maryland and visited University of Maryland. Two students presented papers at international conferences (ITA'2013 and Allerton 2013). The research results were disseminated through publications and university visits. The project was part of an NSF SAVI program called WiFiUS, between US and Finland, and the PI organized and attended several PI meetings associated with the project, one every year. The PI also organized and participated in tutorials on wireless networks through the organization of three years summer schools. The meetings and summer schools activities are available publicly at www.wifius.org. Dynamic spectrum sharing holds the promise to reduce the costs of wireless Internet access (by increasing competition), improving the capacity and improving the coverage, and thus helping extend network connectivity to rural areas.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Network Systems (CNS)
Type
Standard Grant (Standard)
Application #
1147603
Program Officer
wenjing lou
Project Start
Project End
Budget Start
2011-09-01
Budget End
2014-08-31
Support Year
Fiscal Year
2011
Total Cost
$171,450
Indirect Cost
Name
Rensselaer Polytechnic Institute
Department
Type
DUNS #
City
Troy
State
NY
Country
United States
Zip Code
12180