Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fei Teng 0002

dblp:74/1809-2 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 87% Cellular and mobile networks · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › cognitive radio
spectrum sharing
0.312017
Sharing of Unlicensed Spectrum by Strategic Operators · IEEE J. Sel. Areas Commun. 2017
Wireless networking › cognitive radio › spectrum sharing
unlicensed spectrum
0.312017
Sharing of Unlicensed Spectrum by Strategic Operators · IEEE J. Sel. Areas Commun. 2017
Cellular and mobile networks › LTE
LTE in unlicensed spectrum
0.112017
Sharing of Unlicensed Spectrum by Strategic Operators · IEEE J. Sel. Areas Commun. 2017

Methods — techniques the papers use, named apart from their topics

repeated game · 0.3game theory · 0.3bayesian equilibrium · 0.3
YearPublicationVenuePosition
2017 Sharing of Unlicensed Spectrum by Strategic Operators
abstract
Facing the challenge of meeting ever-increasing demand for wireless data, the industry is striving to exploit large swaths of unlicensed spectrum, which supports open access. Major standards bodies are currently considering a proposal to retool and deploy long term evolution (LTE) technologies in unlicensed bands. This paper studies the fundamental question of how the unlicensed spectrum can be shared by strategic operators to mitigate suffering from the tragedy of the commons. A class of general utility functions is considered. The spectrum sharing problem is formulated as a repeated game over a sequence of time slots. It is first shown that a simple static sharing scheme allows a given set of operators to reach a subgame perfect Nash equilibrium for mutually beneficial sharing. The question of how many operators will choose to enter the market is also addressed by studying an entry game. A sharing scheme, which allows dynamic spectrum borrowing and lending between operators, is then proposed to address time-varying traffic and proved to achieve perfect Bayesian equilibrium. Numerical results show that the proposed dynamic sharing scheme outperforms static sharing, which in turn achieves much higher revenue than uncoordinated full-spectrum sharing. Implications of the results for the standardization and deployment of LTE in unlicensed bands (LTE-U) are also discussed.
Fei Teng 0002, Dongning Guo, Michael L. Honig
IEEE J. Sel. Areas Commun.1
2012 Bidirectional channel estimation using adaptive pilots
abstract
Two users at the two ends of a bidirectional channel wish to estimate the common state of the channel. The problem is usually treated as two separate one-way channel estimation problems: User 1 sends deterministic pilots to assist user 2 in estimating the channel, and vice versa. This paper questions whether such separation is optimal. In other words, is it beneficial to let a user choose pilots that adapt to what the user has learned about the channel? Two concrete models are studied and it is found that using adaptive pilots often improves the channel estimate. In the special case of a Gaussian channel with colored additive interference, an iterative bidirectional estimation scheme is proposed, which achieves significantly better performance than separate one-way estimation.
Fei Teng 0002, Dongning Guo, Michael L. Honig
ISIT1