Bo Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bo Yang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Gang Feng
City University of Hong Kong
4 shared publications - Xinping Guan
University of Yanshan
4 shared publications - Chengnian Long
Department of Electrical Engineering, Yanshan University, Qinhuangdao 066004, P. R. China
2 shared publications Yanyan Shen
Department of Mechanical and Biomedical Engineering; City University of Hong Kong; Hong Kong China
2 shared publications- Bin Zhao
Yanshan University
1 shared publication Cailian Chen
Department of Automation, and System Control and Information Processing Key Laboratory of Ministry of Education; Shanghai Jiao Tong University; Shanghai 200240 China
1 shared publication
Latest Publications
- 7 January 2013
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 15 (2) , 322-339
Opportunistic multichannel access with decentralized channel state information
- 7 January 2013
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 15 (2) , 322-339
Opportunistic multichannel access with decentralized channel state information
- 20 November 2008
- Published by Elsevier in Computer Communications
- Vol. 31 (17) , 4089-4097
Distributed power control and random access for spectrum sharing with QoS constraint
- 20 November 2008
- Published by Elsevier in Computer Communications
- Vol. 31 (17) , 4089-4097
Distributed power control and random access for spectrum sharing with QoS constraint
- 18 September 2007
- Published by Springer Nature in Telecommunication Systems
- Vol. 35 (1-2) , 21-42
Adaptive fuzzy sliding mode active queue management algorithms
- 18 September 2007
- Published by Springer Nature in Telecommunication Systems
- Vol. 35 (1-2) , 21-42
Adaptive fuzzy sliding mode active queue management algorithms
- 1 November 2006
- Published by Elsevier in Computer Communications
- Vol. 29 (18) , 3844-3855
Maximum lifetime rate control and random access in multi-hop wireless networks
- 1 November 2006
- Published by Elsevier in Computer Communications
- Vol. 29 (18) , 3844-3855
Maximum lifetime rate control and random access in multi-hop wireless networks
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Random Access in Wireless Ad Hoc Networks for Throughput Maximization
We consider the distributed random access algorithms for wireless ad hoc networks in which each node needs to tune its persistent probability so as to optimize its own the total throughput. First, we present an asynchronous algorithm for updating persistent probabilities and prices to avoid collision using local coordination. By casting this algorithm as a best response in a cooperative game, we characterize its convergence analytically. We further model that each node attempts to maximize a selfish local payoff function. We characterize the Nash equilibrium (NE) of the non-cooperative game and prove the convergence of a best response algorithm to the unique NE. Then we study the energy efficient throughput maximization problem when the wireless nodes are constrained by their battery power. Despite the inherent difficulty of non-separability of the constraint set, we propose a distributed primal-based algorithm. Its convergence is studied numerically
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Random Access in Wireless Ad Hoc Networks for Throughput Maximization
We consider the distributed random access algorithms for wireless ad hoc networks in which each node needs to tune its persistent probability so as to optimize its own the total throughput. First, we present an asynchronous algorithm for updating persistent probabilities and prices to avoid collision using local coordination. By casting this algorithm as a best response in a cooperative game, we characterize its convergence analytically. We further model that each node attempts to maximize a selfish local payoff function. We characterize the Nash equilibrium (NE) of the non-cooperative game and prove the convergence of a best response algorithm to the unique NE. Then we study the energy efficient throughput maximization problem when the wireless nodes are constrained by their battery power. Despite the inherent difficulty of non-separability of the constraint set, we propose a distributed primal-based algorithm. Its convergence is studied numerically