Abstract
This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7% and 17.3% compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.
| Original language | English |
|---|---|
| Title of host publication | GLOBECOM - IEEE Global Telecommunications Conference |
| Pages | 5165-5169 |
| Number of pages | 5 |
| DOIs | |
| State | Published - Dec 1 2008 |
| Event | 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States Duration: Nov 30 2008 → Dec 4 2008 |
Other
| Other | 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 |
|---|---|
| Country | United States |
| City | New Orleans, LA |
| Period | 11/30/08 → 12/4/08 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Network formation games for distributed uplink tree construction in IEEE 802.16J networks. / Saad, Walid; Han, Zhu; Debbah, Mérouane; Hjørungnes, Are.
GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 5165-5169 4698762.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Network formation games for distributed uplink tree construction in IEEE 802.16J networks
AU - Saad, Walid
AU - Han, Zhu
AU - Debbah, Mérouane
AU - Hjørungnes, Are
PY - 2008/12/1
Y1 - 2008/12/1
N2 - This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7% and 17.3% compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.
AB - This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16J network's relay stations (RSs) and their serving base station (MR-BS). We model the problem as a network formation game in which the RSs want to form a directed tree graph to improve their utility, in terms of the packet success rate (PSR), by using multi-hop cooperative transmission while accounting for a link maintenance cost. In this game, the relay stations engage in bilateral negotiations which result in a contractual agreement to form a directed link between each pair. For network dynamics, we propose an algorithm based on the local best responses of the RSs that converges to a local Nash network. Moreover, the proposed dynamics algorithm allows the RSs to autonomously adapt the network topology to changes in the environment due to mobility or to the presence of heterogeneous traffic. Simulation results show how the RSs can self-organize in a tree structure while improving the network's overall PSR up to 19.7% and 17.3% compared, respectively, to the cases where no RSs exist and where the RSs are directly connected to the MR-BS.
UR - http://www.scopus.com/inward/record.url?scp=67249158479&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67249158479&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2008.ECP.987
DO - 10.1109/GLOCOM.2008.ECP.987
M3 - Conference contribution
AN - SCOPUS:67249158479
SN - 9781424423248
SP - 5165
EP - 5169
BT - GLOBECOM - IEEE Global Telecommunications Conference
ER -