Yingqun Yu

According to our database1, Yingqun Yu authored at least 18 papers between 2004 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Enhanced interference whitening for co-channel interference suppression.
Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013

2008
Cross-Layer Congestion and Contention Control for Wireless Ad Hoc Networks.
IEEE Trans. Wirel. Commun., 2008

Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access.
IEEE Trans. Wirel. Commun., 2008

2007
Information-Bearing Noncoherently Modulated Pilots for MIMO Training.
IEEE Trans. Inf. Theory, 2007

High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm.
IEEE Trans. Inf. Theory, 2007

Achieving Wireline Random Access Throughput in Wireless Networking Via User Cooperation.
IEEE Trans. Inf. Theory, 2007

A Robust High-Throughput Tree Algorithm Using Successive Interference Cancellation.
IEEE Trans. Commun., 2007

Joint Congestion Control and OFDMA Scheduling for Hybrid Wireline-Wireless Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Channel-Adaptive Optimal OFDMA Scheduling.
Proceedings of the 41st Annual Conference on Information Sciences and Systems, 2007

2006
Opportunistic medium access for wireless networking adapted to decentralized CSI.
IEEE Trans. Wirel. Commun., 2006

On the instability of slotted aloha with capture.
IEEE Trans. Wirel. Commun., 2006

Combining random backoff with a cross-layer tree algorithm for random access in IEEE 802.16.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Joint Low Density Parity-Check Coding and Linear Precoding for Rayleigh Fading Channels.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

A Deadlock-Free High-Throughput Tree Algorithm for Random Access over Fading Channels.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005
SICTA: a 0.693 contention tree algorithm using successive interference cancellation.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Increasing the throughput of spread-Aloha protocols via long PN spreading codes.
Proceedings of IEEE International Conference on Communications, 2005

Cooperative random access with long PN spreading codes.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2004
Opportunistic access in slotted ALOHA adapted to decentralized CSI.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004


  Loading...