Random access in wireless ad hoc networks for throughput maximization

Bo Yang; Gang Feng; Xinping Guan

doi:10.1109/ICARCV.2006.345280

Random access in wireless ad hoc networks for throughput maximization

Bo Yang, Gang Feng, Xinping Guan

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

9 Citations (Scopus)

Abstract

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. © 2006 IEEE.

Original language	English
Title of host publication	9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06
DOIs	https://doi.org/10.1109/ICARCV.2006.345280
Publication status	Published - 2006
Event	9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06 - Singapore, Singapore Duration: 5 Dec 2006 → 8 Dec 2006

Conference

Conference	9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06
Place	Singapore
City	Singapore
Period	5/12/06 → 8/12/06

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Research Keywords

Ad hoc network
Game theory
Mathematical programming
Medium access control (MAC)
Wireless network

Access Output

10.1109/ICARCV.2006.345280

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{7bc6870e013f43e6b59cbd4c850b030d,

title = "Random access in wireless ad hoc networks for throughput maximization",

abstract = "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. {\textcopyright} 2006 IEEE.",

keywords = "Ad hoc network, Game theory, Mathematical programming, Medium access control (MAC), Wireless network",

author = "Bo Yang and Gang Feng and Xinping Guan",

year = "2006",

doi = "10.1109/ICARCV.2006.345280",

language = "English",

isbn = "1424403421",

booktitle = "9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06",

note = "9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06 ; Conference date: 05-12-2006 Through 08-12-2006",

}

Yang, B, Feng, G & Guan, X 2006, Random access in wireless ad hoc networks for throughput maximization. in 9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06., 4150302, 9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06, Singapore, Singapore, 5/12/06. https://doi.org/10.1109/ICARCV.2006.345280

TY - GEN

T1 - Random access in wireless ad hoc networks for throughput maximization

AU - Yang, Bo

AU - Feng, Gang

AU - Guan, Xinping

PY - 2006

Y1 - 2006

N2 - 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. © 2006 IEEE.

AB - 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. © 2006 IEEE.

KW - Ad hoc network

KW - Game theory

KW - Mathematical programming

KW - Medium access control (MAC)

KW - Wireless network

UR - http://www.scopus.com/inward/record.url?scp=34547232500&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34547232500&origin=recordpage

U2 - 10.1109/ICARCV.2006.345280

DO - 10.1109/ICARCV.2006.345280

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1424403421

SN - 9781424403424

BT - 9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06

T2 - 9th International Conference on Control, Automation, Robotics and Vision, 2006, ICARCV '06

Y2 - 5 December 2006 through 8 December 2006

ER -

Random access in wireless ad hoc networks for throughput maximization

Abstract

Conference

UN SDGs

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this